mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-24 01:25:31 +00:00
Code Activity

shuffle checks for enable_edge around fix #4159

Browse source
This commit is contained in:
Nikolaj Bjorner 2020-04-28 19:51:34 -07:00
parent 71e9bf1053
commit a11dc5d3b5
4 changed files with 9 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

1
src/smt/CMakeLists.txt
View file

@ -34,6 +34,7 @@ z3_add_component(smt
smt_farkas_util.cpp
smt_for_each_relevant_expr.cpp
smt_implied_equalities.cpp
smt_induction.cpp
smt_internalizer.cpp
smt_justification.cpp
smt_kernel.cpp

17
src/smt/theory_utvpi_def.h
View file

@ -510,7 +510,7 @@ namespace smt {
template<typename Ext>
void theory_utvpi<Ext>::propagate() {
bool consistent = true;
bool consistent = is_consistent() && !get_context().inconsistent();
while (consistent && can_propagate()) {
unsigned idx = m_asserted_atoms[m_asserted_qhead];
m_asserted_qhead++;
@ -520,13 +520,9 @@ namespace smt {
template<typename Ext>
bool theory_utvpi<Ext>::propagate_atom(atom const& a) {
context& ctx = get_context();
TRACE("utvpi", a.display(*this, tout); tout << "\n";);
if (ctx.inconsistent()) {
return false;
}
TRACE("utvpi", a.display(*this, tout); tout << "\n";);
int edge_id = a.get_asserted_edge();
if (!enable_edge(edge_id) || !is_consistent()) {
if (!enable_edge(edge_id)) {
m_graph.traverse_neg_cycle2(m_params.m_arith_stronger_lemmas, m_nc_functor);
set_conflict();
return false;
@ -698,10 +694,9 @@ namespace smt {
template<typename Ext>
bool theory_utvpi<Ext>::enable_edge(edge_id id) {
return
(id == null_edge_id) ||
(m_graph.enable_edge(id) && m_graph.enable_edge(id+1)) ||
m_non_utvpi_exprs;
return
(id == null_edge_id) ||
(m_graph.enable_edge(id) && m_graph.enable_edge(id + 1));
}
template<typename Ext>