3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-15 05:18:44 +00:00
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2020-04-01 18:18:44 -07:00
parent 2ac8d3461e
commit b686bb61fe
2 changed files with 7 additions and 2 deletions

View file

@ -15,6 +15,7 @@ Author:
--*/
#include "ast/ast_util.h"
#include "smt/tactic/unit_subsumption_tactic.h"
#include "smt/smt_context.h"
@ -92,7 +93,8 @@ struct unit_subsumption_tactic : public tactic {
m_context.push();
for (unsigned j = 0; j < m_clause_count; ++j) {
if (i == j) {
m_context.assert_expr(m.mk_not(m_clauses.get(j)));
expr_ref fml(mk_not(m, m_clauses.get(j)), m);
m_context.assert_expr(fml);
}
else if (!m_is_deleted.get(j)) {
m_context.assert_expr(m_clauses.get(j));

View file

@ -737,6 +737,7 @@ namespace smt {
*/
template<typename Ext>
void theory_utvpi<Ext>::enforce_parity() {
SASSERT(m_graph.is_feasible());
unsigned_vector todo;
unsigned sz = get_num_vars();
for (unsigned i = 0; i < sz; ++i) {
@ -774,6 +775,7 @@ namespace smt {
}
display(tout);
);
SASSERT(m_graph.is_feasible());
for (auto v : zero_v) {
m_graph.inc_assignment(v, numeral(-1));
@ -782,8 +784,8 @@ namespace smt {
todo.push_back(k);
}
}
TRACE("utvpi", display(tout););
}
SASSERT(m_graph.is_feasible());
DEBUG_CODE(
for (unsigned i = 0; i < sz; ++i) {
enode* e = get_enode(i);
@ -792,6 +794,7 @@ namespace smt {
UNREACHABLE();
}
});
SASSERT(m_graph.is_feasible());
}