@@ -256,9 +256,6 @@ namespace sls {
256
256
num_t eps (1 );
257
257
if (!is_int (x) && abs (rh - lh) <= eps)
258
258
eps = abs (rh - lh) / num_t (2 );
259
- // verbose_stream() << a << " " << b << " " << c << "\n";
260
- // verbose_stream() << (-b - root) << " " << (2 * a) << " " << ll << " " << lh << "\n";
261
- // verbose_stream() << (-b + root) << " " << (2 * a) << " " << rl << " " << rh << "\n";
262
259
SASSERT (ll <= lh && ll + 1 >= lh);
263
260
SASSERT (rl <= rh && rl + 1 >= rh);
264
261
SASSERT (!is_square || ll != lh || a * ll * ll + b * ll + c == 0 );
@@ -571,8 +568,6 @@ namespace sls {
571
568
template <typename num_t >
572
569
bool arith_base<num_t >::repair(sat::literal lit) {
573
570
574
- // verbose_stream() << "repair " << lit << " " << (ctx.is_unit(lit)?"unit":"") << " " << mk_bounded_pp(ctx.atom(lit.var()), m) << "\n";
575
- // verbose_stream() << *atom(lit.var()) << "\n";
576
571
m_last_literal = lit;
577
572
if (find_nl_moves (lit))
578
573
return true ;
@@ -673,8 +668,6 @@ namespace sls {
673
668
return false ;
674
669
}
675
670
676
- // IF_VERBOSE(0, display(verbose_stream(), v) << " := " << new_value << "\n");
677
-
678
671
679
672
680
673
#if 0
@@ -690,7 +683,6 @@ namespace sls {
690
683
SASSERT (ctx.is_true (lit));
691
684
ineq.m_args_value += coeff * (new_value - old_value);
692
685
num_t dtt_new = dtt (old_sign, ineq);
693
- // verbose_stream() << "dtt " << lit << " " << ineq << " " << dtt_new << "\n";
694
686
if (dtt_new != 0 )
695
687
ctx.flip (bv);
696
688
SASSERT (dtt (sign (bv), ineq) == 0 );
@@ -800,7 +792,6 @@ namespace sls {
800
792
SASSERT (ctx.is_true (lit));
801
793
ineq.m_args_value += coeff * (new_value - old_value);
802
794
num_t dtt_new = dtt (old_sign, ineq);
803
- // verbose_stream() << "dtt " << lit << " " << ineq << " " << dtt_new << "\n";
804
795
if (dtt_new != 0 )
805
796
ctx.flip (bv);
806
797
SASSERT (dtt (sign (bv), ineq) == 0 );
@@ -1006,7 +997,6 @@ namespace sls {
1006
997
typename arith_base<num_t >::var_t arith_base<num_t >::mk_var(expr* e) {
1007
998
var_t v = m_expr2var.get (e->get_id (), UINT_MAX);
1008
999
if (v == UINT_MAX) {
1009
- // verbose_stream() << "mk-var " << mk_bounded_pp(e, m) << "\n";
1010
1000
v = m_vars.size ();
1011
1001
m_expr2var.setx (e->get_id (), v, UINT_MAX);
1012
1002
m_vars.push_back (var_info (e, a.is_int (e) ? var_sort::INT : var_sort::REAL));
@@ -1245,7 +1235,6 @@ namespace sls {
1245
1235
return false ;
1246
1236
flet<bool > _tabu (m_use_tabu, false );
1247
1237
TRACE (" sls" , tout << " repair def " << mk_bounded_pp (vi.m_expr , m) << " \n " );
1248
- // verbose_stream() << "repair down " << mk_bounded_pp(e, m) << "\n";
1249
1238
switch (vi.m_op ) {
1250
1239
case arith_op_kind::LAST_ARITH_OP:
1251
1240
break ;
@@ -1522,11 +1511,8 @@ namespace sls {
1522
1511
if (old_value == sum)
1523
1512
return true ;
1524
1513
1525
- // display(verbose_stream() << "repair add v" << v << " ", ad) << " " << old_value << " sum " << sum << "\n";
1526
1514
1527
1515
m_updates.reset ();
1528
- // display(verbose_stream(), v) << " ";
1529
- // verbose_stream() << mk_bounded_pp(m_vars[v].m_expr, m) << " := " << old_value << " " << sum << "\n";
1530
1516
1531
1517
for (auto const & [coeff, w] : coeffs) {
1532
1518
auto delta = divide (w, sum - old_value, coeff);
@@ -1590,8 +1576,6 @@ namespace sls {
1590
1576
}
1591
1577
}
1592
1578
1593
- // verbose_stream() << "repair product v" << v << "\n";
1594
-
1595
1579
if (apply_update ())
1596
1580
return eval_is_correct (v);
1597
1581
@@ -1957,7 +1941,6 @@ namespace sls {
1957
1941
}
1958
1942
else
1959
1943
new_value = val;
1960
- //verbose_stream() << v << " " << vi.m_value << " -> " << new_value << "\n";
1961
1944
vi.m_value = new_value;
1962
1945
}
1963
1946
else {
@@ -2308,7 +2291,6 @@ namespace sls {
2308
2291
num_t val = i.m_coeff ;
2309
2292
for (auto const & [c, v] : i.m_args )
2310
2293
val += c * value (v);
2311
- // verbose_stream() << "invariant " << i << "\n";
2312
2294
if (val != i.m_args_value )
2313
2295
verbose_stream () << i << " \n " ;
2314
2296
SASSERT (val == i.m_args_value );
0 commit comments