mirror of
https://github.com/Z3Prover/z3
synced 2025-07-18 02:16:40 +00:00
add sr
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner
parent
deb48bffe1
commit
876aa01167
7 changed files with 1413 additions and 16 deletions
198
src/smt/theory_special_relations.h
Normal file
198
src/smt/theory_special_relations.h
Normal file
|
|
@ -0,0 +1,198 @@
|
|||
/*++
|
||||
Copyright (c) 2015 Microsoft Corporation
|
||||
|
||||
Module Name:
|
||||
|
||||
theory_special_relations.h
|
||||
|
||||
Abstract:
|
||||
|
||||
Special Relations theory plugin.
|
||||
|
||||
Author:
|
||||
|
||||
Nikolaj Bjorner (nbjorner) 2015-9-16
|
||||
|
||||
Notes:
|
||||
|
||||
--*/
|
||||
|
||||
#include "ast/special_relations_decl_plugin.h"
|
||||
#include "smt/smt_theory.h"
|
||||
#include "smt/theory_diff_logic.h"
|
||||
#include "util/union_find.h"
|
||||
#include "solver/solver.h"
|
||||
|
||||
#ifndef THEORY_SPECIAL_RELATIONS_H_
|
||||
#define THEORY_SPECIAL_RELATIONS_H_
|
||||
|
||||
namespace smt {
|
||||
class theory_special_relations : public theory {
|
||||
|
||||
|
||||
struct relation;
|
||||
|
||||
class atom {
|
||||
bool_var m_bvar;
|
||||
relation& m_relation;
|
||||
bool m_phase;
|
||||
theory_var m_v1;
|
||||
theory_var m_v2;
|
||||
edge_id m_pos;
|
||||
edge_id m_neg;
|
||||
public:
|
||||
atom(bool_var b, relation& r, theory_var v1, theory_var v2):
|
||||
m_bvar(b),
|
||||
m_relation(r),
|
||||
m_phase(true),
|
||||
m_v1(v1),
|
||||
m_v2(v2)
|
||||
{
|
||||
r.ensure_var(v1);
|
||||
r.ensure_var(v2);
|
||||
literal_vector ls;
|
||||
ls.push_back(literal(b, false));
|
||||
m_pos = r.m_graph.add_edge(v1, v2, s_integer(1), ls); // v2 <= v1
|
||||
ls[0] = literal(b, true);
|
||||
m_neg = r.m_graph.add_edge(v2, v1, s_integer(-2), ls); // v1 <= v2 - 1
|
||||
}
|
||||
bool_var var() const { return m_bvar;}
|
||||
relation& get_relation() const { return m_relation; }
|
||||
bool phase() { return m_phase; }
|
||||
void set_phase(bool b) { m_phase = b; }
|
||||
theory_var v1() { return m_v1; }
|
||||
theory_var v2() { return m_v2; }
|
||||
literal explanation() { return literal(m_bvar, !m_phase); }
|
||||
bool enable() {
|
||||
edge_id edge = m_phase?m_pos:m_neg;
|
||||
return m_relation.m_graph.enable_edge(edge);
|
||||
}
|
||||
};
|
||||
typedef ptr_vector<atom> atoms;
|
||||
|
||||
struct scope {
|
||||
unsigned m_asserted_atoms_lim;
|
||||
unsigned m_asserted_qhead_old;
|
||||
};
|
||||
|
||||
struct int_ext : public sidl_ext {
|
||||
typedef literal_vector explanation;
|
||||
};
|
||||
typedef dl_graph<int_ext> graph;
|
||||
|
||||
typedef union_find<union_find_default_ctx> union_find_t;
|
||||
|
||||
struct relation {
|
||||
sr_property m_property;
|
||||
func_decl* m_decl;
|
||||
atoms m_asserted_atoms; // set of asserted atoms
|
||||
unsigned m_asserted_qhead;
|
||||
svector<scope> m_scopes;
|
||||
graph m_graph;
|
||||
union_find_default_ctx m_ufctx;
|
||||
union_find_t m_uf;
|
||||
literal_vector m_explanation;
|
||||
|
||||
relation(sr_property p, func_decl* d): m_property(p), m_decl(d), m_asserted_qhead(0), m_uf(m_ufctx) {}
|
||||
|
||||
func_decl* decl() { return m_decl; }
|
||||
void push();
|
||||
void pop(unsigned num_scopes);
|
||||
void ensure_var(theory_var v);
|
||||
bool new_eq_eh(literal l, theory_var v1, theory_var v2);
|
||||
void operator()(literal_vector const & ex) {
|
||||
m_explanation.append(ex);
|
||||
}
|
||||
void new_edge(dl_var src, dl_var dst, unsigned num_edges, edge_id const* edges) {}
|
||||
};
|
||||
|
||||
|
||||
|
||||
|
||||
typedef u_map<atom*> bool_var2atom;
|
||||
|
||||
special_relations_util m_util;
|
||||
arith_util m_autil;
|
||||
|
||||
atoms m_atoms;
|
||||
unsigned_vector m_atoms_lim;
|
||||
obj_map<func_decl, relation*> m_relations;
|
||||
bool_var2atom m_bool_var2atom;
|
||||
|
||||
scoped_ptr<solver> m_nested_solver;
|
||||
struct atom_hash {
|
||||
size_t operator()(atom a) const {
|
||||
return std::hash<int>()(a.v1()) ^ std::hash<int>()(a.v2()) ^ std::hash<bool>()(a.phase());
|
||||
}
|
||||
};
|
||||
u_map<expr*> expr_cache;
|
||||
u_map<atom*> atom_cache;
|
||||
sort* m_int_sort;
|
||||
|
||||
void del_atoms(unsigned old_size);
|
||||
lbool final_check(relation& r);
|
||||
lbool final_check_po(relation& r);
|
||||
lbool final_check_lo(relation& r);
|
||||
lbool final_check_plo(relation& r);
|
||||
lbool final_check_to(relation& r);
|
||||
lbool propagate(relation& r);
|
||||
lbool enable(atom& a);
|
||||
bool extract_equalities(relation& r);
|
||||
void set_neg_cycle_conflict(relation& r);
|
||||
void set_conflict(relation& r);
|
||||
lbool propagate_plo(atom& a);
|
||||
lbool propagate_po(atom& a); //ASHU: added to modify po solving
|
||||
theory_var mk_var(expr* e);
|
||||
void count_children(graph const& g, unsigned_vector& num_children);
|
||||
void ensure_strict(graph& g);
|
||||
void ensure_tree(graph& g);
|
||||
void assign_interval(graph const& g, unsigned_vector const& num_children, unsigned_vector& lo, unsigned_vector& hi);
|
||||
expr_ref mk_inj(relation& r, model_generator& m);
|
||||
expr_ref mk_class(relation& r, model_generator& m);
|
||||
expr_ref mk_interval(relation& r, model_generator& mg, unsigned_vector & lo, unsigned_vector& hi);
|
||||
void init_model_lo(relation& r, model_generator& m);
|
||||
void init_model_to(relation& r, model_generator& m);
|
||||
void init_model_po(relation& r, model_generator& m);
|
||||
void init_model_plo(relation& r, model_generator& m);
|
||||
bool is_neighbour_edge(graph const& g, edge_id id) const;
|
||||
bool is_strict_neighbour_edge(graph const& g, edge_id id) const;
|
||||
bool disconnected(graph const& g, dl_var u, dl_var v) const;
|
||||
|
||||
public:
|
||||
theory_special_relations(ast_manager& m);
|
||||
virtual ~theory_special_relations();
|
||||
|
||||
virtual theory * mk_fresh(context * new_ctx);
|
||||
virtual bool internalize_atom(app * atom, bool gate_ctx);
|
||||
virtual bool internalize_term(app * term) { UNREACHABLE(); return false; }
|
||||
virtual void new_eq_eh(theory_var v1, theory_var v2);
|
||||
virtual void new_diseq_eh(theory_var v1, theory_var v2) {}
|
||||
virtual bool use_diseqs() const { return false; }
|
||||
virtual bool build_models() const { return true; }
|
||||
virtual final_check_status final_check_eh();
|
||||
virtual void reset_eh();
|
||||
virtual void assign_eh(bool_var v, bool is_true);
|
||||
virtual void init_search_eh() {}
|
||||
virtual void push_scope_eh();
|
||||
virtual void pop_scope_eh(unsigned num_scopes);
|
||||
virtual void restart_eh() {}
|
||||
virtual void collect_statistics(::statistics & st) const;
|
||||
virtual model_value_proc * mk_value(enode * n, model_generator & mg);
|
||||
virtual void init_model(model_generator & m);
|
||||
virtual bool can_propagate() { return false; }
|
||||
virtual void propagate() {}
|
||||
virtual void display(std::ostream & out) const;
|
||||
|
||||
literal mk_literal(expr* _e);
|
||||
enode* ensure_enode(expr* e);
|
||||
theory_var mk_var(enode* n);
|
||||
|
||||
//BEGIN: ASHU
|
||||
void collect_asserted_po_atoms( vector< std::pair<bool_var,bool> >& atoms) const;
|
||||
void display_atom( std::ostream & out, atom& a) const;
|
||||
void display_atom( atom& a) const;
|
||||
//END: ASHU
|
||||
};
|
||||
}
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue