mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-18 20:03:38 +00:00
Code Activity

tracking use of assumptions in tactics

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-03-09 21:33:08 -08:00
parent 71fff8ffa2
commit 3d7eb12117
5 changed files with 76 additions and 84 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/solver/combined_solver.cpp
View file

@ -194,7 +194,7 @@ public:
m_use_solver1_results = false; m_use_solver1_results = false;
if (get_num_assumptions() != 0 || if (get_num_assumptions() != 0 ||
num_assumptions > 0 || // assumptions were provided num_assumptions > 0 || // assumptions were provided
m_ignore_solver1) { m_ignore_solver1) {
// must use incremental solver // must use incremental solver
switch_inc_mode(); switch_inc_mode();

24
src/solver/solver_na2as.cpp
View file

@ -23,12 +23,11 @@ Notes:
#include"ast_smt2_pp.h" #include"ast_smt2_pp.h"
solver_na2as::solver_na2as(ast_manager & m): solver_na2as::solver_na2as(ast_manager & m):
m_manager(m) { m(m),
m_assumptions(m) {
} }
solver_na2as::~solver_na2as() { solver_na2as::~solver_na2as() {}
restore_assumptions(0);
}
void solver_na2as::assert_expr(expr * t, expr * a) { void solver_na2as::assert_expr(expr * t, expr * a) {
if (a == 0) { if (a == 0) {
@ -36,20 +35,19 @@ void solver_na2as::assert_expr(expr * t, expr * a) {
} }
else { else {
SASSERT(is_uninterp_const(a)); SASSERT(is_uninterp_const(a));
SASSERT(m_manager.is_bool(a)); SASSERT(m.is_bool(a));
TRACE("solver_na2as", tout << "asserting\n" << mk_ismt2_pp(t, m_manager) << "\n" << mk_ismt2_pp(a, m_manager) << "\n";); TRACE("solver_na2as", tout << "asserting\n" << mk_ismt2_pp(t, m) << "\n" << mk_ismt2_pp(a, m) << "\n";);
m_manager.inc_ref(a);
m_assumptions.push_back(a); m_assumptions.push_back(a);
expr_ref new_t(m_manager); expr_ref new_t(m);
new_t = m_manager.mk_implies(a, t); new_t = m.mk_implies(a, t);
assert_expr(new_t); assert_expr(new_t);
} }
} }
struct append_assumptions { struct append_assumptions {
ptr_vector<expr> & m_assumptions; expr_ref_vector & m_assumptions;
unsigned m_old_sz; unsigned m_old_sz;
append_assumptions(ptr_vector<expr> & _m_assumptions, append_assumptions(expr_ref_vector & _m_assumptions,
unsigned num_assumptions, unsigned num_assumptions,
expr * const * assumptions): expr * const * assumptions):
m_assumptions(_m_assumptions) { m_assumptions(_m_assumptions) {
@ -82,10 +80,6 @@ void solver_na2as::pop(unsigned n) {
} }
void solver_na2as::restore_assumptions(unsigned old_sz) { void solver_na2as::restore_assumptions(unsigned old_sz) {
// SASSERT(old_sz == 0);
for (unsigned i = old_sz; i < m_assumptions.size(); i++) {
m_manager.dec_ref(m_assumptions[i]);
}
m_assumptions.shrink(old_sz); m_assumptions.shrink(old_sz);
} }

4
src/solver/solver_na2as.h
View file

@ -25,8 +25,8 @@ Notes:
#include"solver.h" #include"solver.h"
class solver_na2as : public solver { class solver_na2as : public solver {
ast_manager & m_manager; ast_manager & m;
ptr_vector<expr> m_assumptions; expr_ref_vector m_assumptions;
unsigned_vector m_scopes; unsigned_vector m_scopes;
void restore_assumptions(unsigned old_sz); void restore_assumptions(unsigned old_sz);
public: public:

60
src/tactic/core/propagate_values_tactic.cpp
View file

@ -26,7 +26,7 @@ Revision History:
class propagate_values_tactic : public tactic { class propagate_values_tactic : public tactic {
struct imp { struct imp {
ast_manager & m_manager; ast_manager & m;
th_rewriter m_r; th_rewriter m_r;
scoped_ptr<expr_substitution> m_subst; scoped_ptr<expr_substitution> m_subst;
goal * m_goal; goal * m_goal;
@ -36,13 +36,15 @@ class propagate_values_tactic : public tactic {
bool m_modified; bool m_modified;
imp(ast_manager & m, params_ref const & p): imp(ast_manager & m, params_ref const & p):
m_manager(m), m(m),
m_r(m, p), m_r(m, p),
m_goal(0), m_goal(0),
m_occs(m, true /* track atoms */) { m_occs(m, true /* track atoms */) {
updt_params_core(p); updt_params_core(p);
} }
~imp() { }
void updt_params_core(params_ref const & p) { void updt_params_core(params_ref const & p) {
m_max_rounds = p.get_uint("max_rounds", 4); m_max_rounds = p.get_uint("max_rounds", 4);
} }
@ -52,31 +54,27 @@ class propagate_values_tactic : public tactic {
updt_params_core(p); updt_params_core(p);
} }
ast_manager & m() const { return m_manager; }
bool is_shared(expr * t) { bool is_shared(expr * t) {
return m_occs.is_shared(t); return m_occs.is_shared(t);
} }
bool is_shared_neg(expr * t, expr * & atom) { bool is_shared_neg(expr * t, expr * & atom) {
if (!m().is_not(t)) if (!m.is_not(t, atom))
return false; return false;
atom = to_app(t)->get_arg(0);
return is_shared(atom); return is_shared(atom);
} }
bool is_shared_eq(expr * t, expr * & lhs, expr * & value) { bool is_shared_eq(expr * t, expr * & lhs, expr * & value) {
if (!m().is_eq(t)) expr* arg1, *arg2;
if (!m.is_eq(t, arg1, arg2))
return false; return false;
expr * arg1 = to_app(t)->get_arg(0); if (m.is_value(arg1) && is_shared(arg2)) {
expr * arg2 = to_app(t)->get_arg(1);
if (m().is_value(arg1) && is_shared(arg2)) {
lhs = arg2; lhs = arg2;
value = arg1; value = arg1;
return true; return true;
} }
if (m().is_value(arg2) && is_shared(arg1)) { if (m.is_value(arg2) && is_shared(arg1)) {
lhs = arg1; lhs = arg1;
value = arg2; value = arg2;
return true; return true;
@ -87,15 +85,15 @@ class propagate_values_tactic : public tactic {
void push_result(expr * new_curr, proof * new_pr) { void push_result(expr * new_curr, proof * new_pr) {
if (m_goal->proofs_enabled()) { if (m_goal->proofs_enabled()) {
proof * pr = m_goal->pr(m_idx); proof * pr = m_goal->pr(m_idx);
new_pr = m().mk_modus_ponens(pr, new_pr); new_pr = m.mk_modus_ponens(pr, new_pr);
} }
expr_dependency_ref new_d(m()); expr_dependency_ref new_d(m);
if (m_goal->unsat_core_enabled()) { if (m_goal->unsat_core_enabled()) {
new_d = m_goal->dep(m_idx); new_d = m_goal->dep(m_idx);
expr_dependency * used_d = m_r.get_used_dependencies(); expr_dependency * used_d = m_r.get_used_dependencies();
if (used_d != 0) { if (used_d != 0) {
new_d = m().mk_join(new_d, used_d); new_d = m.mk_join(new_d, used_d);
m_r.reset_used_dependencies(); m_r.reset_used_dependencies();
} }
} }
@ -103,34 +101,34 @@ class propagate_values_tactic : public tactic {
m_goal->update(m_idx, new_curr, new_pr, new_d); m_goal->update(m_idx, new_curr, new_pr, new_d);
if (is_shared(new_curr)) { if (is_shared(new_curr)) {
m_subst->insert(new_curr, m().mk_true(), m().mk_iff_true(new_pr), new_d); m_subst->insert(new_curr, m.mk_true(), m.mk_iff_true(new_pr), new_d);
} }
expr * atom; expr * atom;
if (is_shared_neg(new_curr, atom)) { if (is_shared_neg(new_curr, atom)) {
m_subst->insert(atom, m().mk_false(), m().mk_iff_false(new_pr), new_d); m_subst->insert(atom, m.mk_false(), m.mk_iff_false(new_pr), new_d);
} }
expr * lhs, * value; expr * lhs, * value;
if (is_shared_eq(new_curr, lhs, value)) { if (is_shared_eq(new_curr, lhs, value)) {
TRACE("shallow_context_simplifier_bug", tout << "found eq:\n" << mk_ismt2_pp(new_curr, m()) << "\n";); TRACE("shallow_context_simplifier_bug", tout << "found eq:\n" << mk_ismt2_pp(new_curr, m) << "\n";);
m_subst->insert(lhs, value, new_pr, new_d); m_subst->insert(lhs, value, new_pr, new_d);
} }
} }
void process_current() { void process_current() {
expr * curr = m_goal->form(m_idx); expr * curr = m_goal->form(m_idx);
expr_ref new_curr(m()); expr_ref new_curr(m);
proof_ref new_pr(m()); proof_ref new_pr(m);
if (!m_subst->empty()) { if (!m_subst->empty()) {
m_r(curr, new_curr, new_pr); m_r(curr, new_curr, new_pr);
} }
else { else {
new_curr = curr; new_curr = curr;
if (m().proofs_enabled()) if (m.proofs_enabled())
new_pr = m().mk_reflexivity(curr); new_pr = m.mk_reflexivity(curr);
} }
TRACE("shallow_context_simplifier_bug", tout << mk_ismt2_pp(curr, m()) << "\n---->\n" << mk_ismt2_pp(new_curr, m()) << "\n";); TRACE("shallow_context_simplifier_bug", tout << mk_ismt2_pp(curr, m) << "\n---->\n" << mk_ismt2_pp(new_curr, m) << "\n";);
push_result(new_curr, new_pr); push_result(new_curr, new_pr);
if (new_curr != curr) if (new_curr != curr)
@ -148,25 +146,26 @@ class propagate_values_tactic : public tactic {
m_goal = g.get(); m_goal = g.get();
bool forward = true; bool forward = true;
expr_ref new_curr(m()); expr_ref new_curr(m);
proof_ref new_pr(m()); proof_ref new_pr(m);
unsigned size = m_goal->size(); unsigned size = m_goal->size();
m_idx = 0; m_idx = 0;
m_modified = false; m_modified = false;
unsigned round = 0; unsigned round = 0;
if (m_goal->inconsistent()) if (m_goal->inconsistent())
goto end; goto end;
if (m_max_rounds == 0) if (m_max_rounds == 0)
goto end; goto end;
m_subst = alloc(expr_substitution, m(), g->unsat_core_enabled(), g->proofs_enabled()); m_subst = alloc(expr_substitution, m, g->unsat_core_enabled(), g->proofs_enabled());
m_r.set_substitution(m_subst.get()); m_r.set_substitution(m_subst.get());
m_occs(*m_goal); m_occs(*m_goal);
while (true) { while (true) {
TRACE("propagate_values", tout << "while(true) loop\n"; m_goal->display(tout);); TRACE("propagate_values", tout << "while(true) loop\n"; m_goal->display_with_dependencies(tout););
if (forward) { if (forward) {
for (; m_idx < size; m_idx++) { for (; m_idx < size; m_idx++) {
process_current(); process_current();
@ -255,15 +254,14 @@ public:
} }
virtual void cleanup() { virtual void cleanup() {
ast_manager & m = m_imp->m(); ast_manager & m = m_imp->m;
imp * d = alloc(imp, m, m_params); dealloc(m_imp);
std::swap(d, m_imp); m_imp = alloc(imp, m, m_params);
dealloc(d);
} }
}; };
tactic * mk_propagate_values_tactic(ast_manager & m, params_ref const & p) { tactic * mk_propagate_values_tactic(ast_manager & m, params_ref const & p) {
return clean(alloc(propagate_values_tactic, m, p)); return alloc(propagate_values_tactic, m, p);
} }