mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-12 12:08:18 +00:00
Code Activity

relax out of range restrictions to handle large intervals

Browse source
This commit is contained in:
Nikolaj Bjorner 2025-01-26 11:24:26 -08:00
parent 4f2272dbb2
commit 55fc57b5c7
2 changed files with 89 additions and 18 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

85
src/ast/sls/sls_arith_base.cpp
View file

@ -444,7 +444,7 @@ namespace sls {
auto old_value = value(v); auto old_value = value(v);
auto new_value = old_value + delta; auto new_value = old_value + delta;
if (!vi.in_range(new_value)) { if (!vi.in_range(new_value)) {
TRACE("arith", tout << "out of range: v" << v << " " << old_value << " " << delta << " " << new_value << "\n";); TRACE("arith", display(tout, v) << "out of range: v" << v << " " << old_value << " " << delta << " " << new_value << "\n";);
return false; return false;
} }
@ -746,10 +746,14 @@ namespace sls {
auto old_value = vi.value(); auto old_value = vi.value();
if (old_value == new_value) if (old_value == new_value)
return true; return true;
if (!vi.in_range(new_value)) if (!vi.in_range(new_value)) {
TRACE("arith", display(tout << "out of range " << new_value << ": ", v) << "\n"; );
return false; return false;
if (!in_bounds(v, new_value) && in_bounds(v, old_value)) }
if (!in_bounds(v, new_value) && in_bounds(v, old_value)) {
TRACE("arith", tout << "out of bounds: v" << v << " " << old_value << " " << new_value << "\n";);
return false; return false;
}
// check for overflow // check for overflow
try { try {
@ -1873,22 +1877,64 @@ namespace sls {
template<typename num_t> template<typename num_t>
bool arith_base<num_t>::repair_idiv(op_def const& od) { bool arith_base<num_t>::repair_idiv(op_def const& od) {
auto val = value(od.m_var);
auto v1 = value(od.m_arg1); auto v1 = value(od.m_arg1);
auto v2 = value(od.m_arg2); auto v2 = value(od.m_arg2);
IF_VERBOSE(0, verbose_stream() << "TODO repair div"); if (v2 == 0 && val == 0)
return true;
if (v2 != 0 && val == div(v1, v2))
return true;
if (repair_div_idiv(od, val, v1, v2))
return true;
IF_VERBOSE(1, verbose_stream() << "revert repair-down " << val << " = " << v1 << " div " << v2 << "\n");
// bail // bail
return update(od.m_var, v2 == 0 ? num_t(0) : div(v1, v2)); return update(od.m_var, v2 == 0 ? num_t(0) : div(v1, v2));
} }
template<typename num_t> template<typename num_t>
bool arith_base<num_t>::repair_div(op_def const& od) { bool arith_base<num_t>::repair_div(op_def const& od) {
auto val = value(od.m_var);
auto v1 = value(od.m_arg1); auto v1 = value(od.m_arg1);
auto v2 = value(od.m_arg2); auto v2 = value(od.m_arg2);
IF_VERBOSE(0, verbose_stream() << "TODO repair /"); if (v2 == 0 && val == 0)
return true;
if (v2 != 0 && val == v1 / v2)
return true;
if (repair_div_idiv(od, val, v1, v2))
return true;
IF_VERBOSE(1, verbose_stream() << "revert repair-down " << val << " = " << v1 << "/" << v2 << "\n");
// bail // bail
return update(od.m_var, v2 == 0 ? num_t(0) : v1 / v2); return update(od.m_var, v2 == 0 ? num_t(0) : v1 / v2);
} }
template<typename num_t>
bool arith_base<num_t>::repair_div_idiv(op_def const& od, num_t const& val, num_t const& v1, num_t const& v2) {
if (val == 1) {
if (v2 != 0 && ctx.rand(2) == 0)
return update(od.m_arg1, v2);
if (v1 != 0 && ctx.rand(2) == 0)
return update(od.m_arg2, v1);
}
if (val == 0) {
SASSERT(v2 != 0);
if (ctx.rand(2) == 0)
return update(od.m_arg1, num_t(0));
if (ctx.rand(2) == 0)
return update(od.m_arg2, num_t(0));
}
if (val == -1) {
if (v2 != 0 && ctx.rand(2) == 0)
return update(od.m_arg1, -v2);
if (v1 != 0 && ctx.rand(2) == 0)
return update(od.m_arg2, -v1);
}
return false;
}
template<typename num_t> template<typename num_t>
double arith_base<num_t>::compute_score(var_t x, num_t const& delta) { double arith_base<num_t>::compute_score(var_t x, num_t const& delta) {
int result = 0; int result = 0;
@ -2245,6 +2291,8 @@ namespace sls {
bool r = update(w, n); bool r = update(w, n);
if (!r) { if (!r) {
TRACE("arith", tout << "set value failed " << mk_pp(e, m) << " := " << mk_pp(v, m) << "\n";
display(tout, w) << " := " << value(w) << "\n";);
IF_VERBOSE(3, IF_VERBOSE(3,
verbose_stream() << "set value failed " << mk_pp(e, m) << " := " << mk_pp(v, m) << "\n"; verbose_stream() << "set value failed " << mk_pp(e, m) << " := " << mk_pp(v, m) << "\n";
display(verbose_stream(), w) << " := " << value(w) << "\n"); display(verbose_stream(), w) << " := " << value(w) << "\n");
@ -2368,15 +2416,20 @@ namespace sls {
return out; return out;
} }
template<>
bool arith_base<rational>::var_info::is_big_num() const { return true; }
template<typename num_t> template<typename num_t>
std::ostream& arith_base<num_t>::display(std::ostream& out, var_t v) const { bool arith_base<num_t>::var_info::is_big_num() const { return false; }
auto const& vi = m_vars[v];
auto const& lo = vi.m_lo; template<typename num_t>
auto const& hi = vi.m_hi; std::ostream& arith_base<num_t>::var_info::display_range(std::ostream& out) const {
out << "v" << v << " := " << vi.value() << " "; auto const& lo = m_lo;
auto const& hi = m_hi;
if (lo || hi) { if (lo || hi) {
if (lo) if (lo)
out << (lo->is_strict ? "(": "[") << lo->value; out << (lo->is_strict ? "(" : "[") << lo->value;
else else
out << "("; out << "(";
out << " "; out << " ";
@ -2386,6 +2439,14 @@ namespace sls {
out << ")"; out << ")";
out << " "; out << " ";
} }
return out;
}
template<typename num_t>
std::ostream& arith_base<num_t>::display(std::ostream& out, var_t v) const {
auto const& vi = m_vars[v];
out << "v" << v << " := " << vi.value() << " ";
vi.display_range(out);
out << mk_bounded_pp(vi.m_expr, m) << " "; out << mk_bounded_pp(vi.m_expr, m) << " ";
if (is_add(v)) if (is_add(v))
display(out << "add: ", get_add(v)) << " "; display(out << "add: ", get_add(v)) << " ";

22
src/ast/sls/sls_arith_base.h
View file

@ -127,20 +127,27 @@ namespace sls {
num_t const& best_value() const { return m_best_value; } num_t const& best_value() const { return m_best_value; }
void set_best_value(num_t const& v) { m_best_value = v; } void set_best_value(num_t const& v) { m_best_value = v; }
bool is_big_num() const;
bool in_range(num_t const& n) { bool in_range(num_t const& n) {
if (-m_range < n && n < m_range) if (-m_range < n && n < m_range)
return true; return true;
bool result = false; bool result = false;
#if 0
if (m_lo && m_lo->value > n)
return false;
if (m_hi && m_hi->value < n)
return false;
#endif
if (m_lo) if (m_lo)
result = n < m_lo->value + m_range; result = n < m_lo->value + m_range;
if (!result && m_hi) if (!result && m_hi)
result = n > m_hi->value - m_range; result = n > m_hi->value - m_range;
#if 0 if (!result && m_lo && m_hi)
if (!result) result = m_hi->value - m_lo->value > 2 * m_range;
out_of_range(); if (!result && is_big_num() && !m_lo && !m_hi)
else result = true;
++m_num_in_range;
#endif
return result; return result;
} }
unsigned m_tabu_pos = 0, m_tabu_neg = 0; unsigned m_tabu_pos = 0, m_tabu_neg = 0;
@ -166,6 +173,8 @@ namespace sls {
m_num_out_of_range = 0; m_num_out_of_range = 0;
m_num_in_range = 0; m_num_in_range = 0;
} }
std::ostream& display_range(std::ostream& out) const;
}; };
struct mul_def { struct mul_def {
@ -232,6 +241,7 @@ namespace sls {
bool repair_mod(op_def const& od); bool repair_mod(op_def const& od);
bool repair_idiv(op_def const& od); bool repair_idiv(op_def const& od);
bool repair_div(op_def const& od); bool repair_div(op_def const& od);
bool repair_div_idiv(op_def const& od, num_t const& val, num_t const& v1, num_t const& v2);
bool repair_rem(op_def const& od); bool repair_rem(op_def const& od);
bool repair_power(op_def const& od); bool repair_power(op_def const& od);
bool repair_abs(op_def const& od); bool repair_abs(op_def const& od);