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

bv bounds tactic for Nuno

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-02-13 00:13:16 +00:00
parent e484fc365d
commit d7186eede8
2 changed files with 32 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
src/tactic/bv/bv_bounds_tactic.cpp
View file

@ -48,26 +48,28 @@ class bv_bounds_simplifier : public ctx_simplify_tactic::simplifier {
if (m_bv.is_bv_ule(t, t1, t2)) {
sign = false;
if (m_bv.is_numeral(t1, n, sz)) {
lo = false;
b = t2;
lo = true;
b = t2;
return true;
}
else if (m_bv.is_numeral(t2, n, sz)) {
lo = true;
b = t1;
lo = false;
b = t1;
return true;
}
}
else if (m_bv.is_bv_sle(t, t1, t2)) {
sign = true;
if (m_bv.is_numeral(t2, n, sz)) {
lo = true;
b = t1;
n = m_bv.norm(n, sz, true);
lo = false;
b = t1;
return true;
}
else if (m_bv.is_numeral(t1, n, sz)) {
lo = false;
b = t2;
n = m_bv.norm(n, sz, true);
lo = true;
b = t2;
return true;
}
}
@ -84,7 +86,24 @@ public:
expr* t1;
rational n;
if (is_bound(t, t1, lo, s, n)) {
bound(lo, s).insert(t1, n);
if (sign) {
// !(n <= t1) <=> t1 <= n - 1
// !(t1 <= n) <=> t1 >= n + 1
if (lo) {
n -= rational::one();
}
else {
n += rational::one();
}
// check overflow conditions:
rational n1 = m_bv.norm(n, m_bv.get_bv_size(t1), s);
if (n1 == n) {
bound(!lo, s).insert(t1, n);
}
}
else {
bound(lo, s).insert(t1, n);
}
}
}

4
src/tactic/bv/bv_bounds_tactic.h
View file

@ -21,4 +21,8 @@ Author:
tactic * mk_bv_bounds_tactic(ast_manager & m, params_ref const & p = params_ref());
/*
ADD_TACTIC("propagate-bv-bounds", "propagate bit-vector bounds by simplifying implied or contradictory bounds.", "mk_bv_bounds_tactic(m, p)")
*/
#endif