mirror of
https://github.com/Z3Prover/z3
synced 2025-04-07 09:55:19 +00:00
112 lines
3 KiB
C++
112 lines
3 KiB
C++
/*++
|
|
Copyright (c) 2014 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
card2bv_tactic.cpp
|
|
|
|
Abstract:
|
|
|
|
Tactic for converting Pseudo-Boolean constraints to BV
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2014-03-20
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#include"tactical.h"
|
|
#include"cooperate.h"
|
|
#include"ast_smt2_pp.h"
|
|
#include"card2bv_tactic.h"
|
|
#include"pb2bv_rewriter.h"
|
|
#include"ast_util.h"
|
|
#include"ast_pp.h"
|
|
#include"filter_model_converter.h"
|
|
|
|
class card2bv_tactic : public tactic {
|
|
ast_manager & m;
|
|
params_ref m_params;
|
|
|
|
public:
|
|
|
|
card2bv_tactic(ast_manager & m, params_ref const & p):
|
|
m(m),
|
|
m_params(p) {
|
|
}
|
|
|
|
virtual tactic * translate(ast_manager & m) {
|
|
return alloc(card2bv_tactic, m, m_params);
|
|
}
|
|
|
|
virtual ~card2bv_tactic() {
|
|
}
|
|
|
|
virtual void updt_params(params_ref const & p) {
|
|
m_params = p;
|
|
}
|
|
|
|
virtual void collect_param_descrs(param_descrs & r) {
|
|
}
|
|
|
|
|
|
virtual void operator()(goal_ref const & g,
|
|
goal_ref_buffer & result,
|
|
model_converter_ref & mc,
|
|
proof_converter_ref & pc,
|
|
expr_dependency_ref & core) {
|
|
TRACE("card2bv-before", g->display(tout););
|
|
SASSERT(g->is_well_sorted());
|
|
mc = 0; pc = 0; core = 0; result.reset();
|
|
tactic_report report("card2bv", *g);
|
|
th_rewriter rw1(m, m_params);
|
|
pb2bv_rewriter rw2(m, m_params);
|
|
|
|
if (g->inconsistent()) {
|
|
result.push_back(g.get());
|
|
return;
|
|
}
|
|
|
|
expr_ref new_f1(m), new_f2(m);
|
|
proof_ref new_pr1(m), new_pr2(m);
|
|
for (unsigned idx = 0; !g->inconsistent() && idx < g->size(); idx++) {
|
|
rw1(g->form(idx), new_f1, new_pr1);
|
|
TRACE("card2bv", tout << "Rewriting " << mk_ismt2_pp(new_f1.get(), m) << std::endl;);
|
|
rw2(new_f1, new_f2, new_pr2);
|
|
if (m.proofs_enabled()) {
|
|
new_pr1 = m.mk_modus_ponens(g->pr(idx), new_pr1);
|
|
new_pr1 = m.mk_modus_ponens(new_pr1, new_pr2);
|
|
}
|
|
g->update(idx, new_f2, new_pr1, g->dep(idx));
|
|
}
|
|
expr_ref_vector fmls(m);
|
|
rw2.flush_side_constraints(fmls);
|
|
for (unsigned i = 0; !g->inconsistent() && i < fmls.size(); ++i) {
|
|
g->assert_expr(fmls[i].get());
|
|
}
|
|
|
|
func_decl_ref_vector const& fns = rw2.fresh_constants();
|
|
if (!fns.empty()) {
|
|
filter_model_converter* filter = alloc(filter_model_converter, m);
|
|
for (unsigned i = 0; i < fns.size(); ++i) {
|
|
filter->insert(fns[i]);
|
|
}
|
|
mc = filter;
|
|
}
|
|
|
|
g->inc_depth();
|
|
result.push_back(g.get());
|
|
TRACE("card2bv", g->display(tout););
|
|
SASSERT(g->is_well_sorted());
|
|
}
|
|
|
|
virtual void cleanup() {
|
|
}
|
|
};
|
|
|
|
tactic * mk_card2bv_tactic(ast_manager & m, params_ref const & p) {
|
|
return clean(alloc(card2bv_tactic, m, p));
|
|
}
|
|
|