mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-20 04:43:39 +00:00
Code Activity

merge

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2019-05-16 20:18:29 +03:00
parent 3e53b6f2db
commit f411b3b201
2 changed files with 1 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

5
src/smt/smt_internalizer.cpp
View file

@ -535,13 +535,9 @@ namespace smt {
} }
void context::internalize_lambda(quantifier * q) { void context::internalize_lambda(quantifier * q) {
#if 0
UNREACHABLE();
#else
TRACE("internalize_quantifier", tout << mk_pp(q, m_manager) << "\n";); TRACE("internalize_quantifier", tout << mk_pp(q, m_manager) << "\n";);
SASSERT(is_lambda(q)); SASSERT(is_lambda(q));
app_ref lam_name(m_manager.mk_fresh_const("lambda", m_manager.get_sort(q)), m_manager); app_ref lam_name(m_manager.mk_fresh_const("lambda", m_manager.get_sort(q)), m_manager);
enode * e = mk_enode(lam_name, true, false, false);
app_ref eq(m_manager), lam_app(m_manager); app_ref eq(m_manager), lam_app(m_manager);
expr_ref_vector vars(m_manager); expr_ref_vector vars(m_manager);
vars.push_back(lam_name); vars.push_back(lam_name);
@ -558,7 +554,6 @@ namespace smt {
internalize_quantifier(fa, true); internalize_quantifier(fa, true);
if (!e_internalized(lam_name)) internalize_uninterpreted(lam_name); if (!e_internalized(lam_name)) internalize_uninterpreted(lam_name);
m_app2enode.setx(q->get_id(), get_enode(lam_name), nullptr); m_app2enode.setx(q->get_id(), get_enode(lam_name), nullptr);
#endif
} }
/** /**

2
src/smt/theory_special_relations.cpp
View file

@ -727,7 +727,7 @@ namespace smt {
for (unsigned j = 0; j < edges.size(); ++j) { for (unsigned j = 0; j < edges.size(); ++j) {
edge_id e1 = edges[j]; edge_id e1 = edges[j];
if (!g.is_enabled(e1)) continue; if (!g.is_enabled(e1)) continue;
SASSERT (i == g.get_target(e1)); SASSERT ((int)i == g.get_target(e1));
dl_var src1 = g.get_source(e1); dl_var src1 = g.get_source(e1);
for (unsigned k = j + 1; k < edges.size(); ++k) { for (unsigned k = j + 1; k < edges.size(); ++k) {
edge_id e2 = edges[k]; edge_id e2 = edges[k];