1 /********************* */
2 /*! \file theory_engine.h
4 ** Top contributors (to current version):
5 ** Dejan Jovanovic, Andrew Reynolds, Morgan Deters
6 ** This file is part of the CVC4 project.
7 ** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
8 ** in the top-level source directory) and their institutional affiliations.
9 ** All rights reserved. See the file COPYING in the top-level source
10 ** directory for licensing information.\endverbatim
12 ** \brief The theory engine
17 #include "cvc4_private.h"
19 #ifndef CVC4__THEORY_ENGINE_H
20 #define CVC4__THEORY_ENGINE_H
25 #include <unordered_map>
29 #include "base/check.h"
30 #include "context/cdhashset.h"
31 #include "expr/node.h"
32 #include "options/options.h"
33 #include "options/smt_options.h"
34 #include "options/theory_options.h"
35 #include "prop/prop_engine.h"
36 #include "smt/command.h"
37 #include "theory/atom_requests.h"
38 #include "theory/engine_output_channel.h"
39 #include "theory/interrupted.h"
40 #include "theory/rewriter.h"
41 #include "theory/shared_terms_database.h"
42 #include "theory/sort_inference.h"
43 #include "theory/substitutions.h"
44 #include "theory/term_registration_visitor.h"
45 #include "theory/theory.h"
46 #include "theory/theory_preprocessor.h"
47 #include "theory/uf/equality_engine.h"
48 #include "theory/valuation.h"
49 #include "util/hash.h"
50 #include "util/resource_manager.h"
51 #include "util/statistics_registry.h"
52 #include "util/unsafe_interrupt_exception.h"
56 class ResourceManager
;
57 class LemmaProofRecipe
;
60 * A pair of a theory and a node. This is used to mark the flow of
61 * propagations between theories.
63 struct NodeTheoryPair
{
65 theory::TheoryId d_theory
;
67 NodeTheoryPair(TNode n
, theory::TheoryId t
, size_t ts
= 0)
68 : d_node(n
), d_theory(t
), d_timestamp(ts
)
71 NodeTheoryPair() : d_theory(theory::THEORY_LAST
), d_timestamp() {}
72 // Comparison doesn't take into account the timestamp
73 bool operator == (const NodeTheoryPair
& pair
) const {
74 return d_node
== pair
.d_node
&& d_theory
== pair
.d_theory
;
76 };/* struct NodeTheoryPair */
78 struct NodeTheoryPairHashFunction
{
79 NodeHashFunction hashFunction
;
80 // Hash doesn't take into account the timestamp
81 size_t operator()(const NodeTheoryPair
& pair
) const {
82 uint64_t hash
= fnv1a::fnv1a_64(NodeHashFunction()(pair
.d_node
));
83 return static_cast<size_t>(fnv1a::fnv1a_64(pair
.d_theory
, hash
));
85 };/* struct NodeTheoryPairHashFunction */
88 /* Forward declarations */
91 class TheoryEngineModelBuilder
;
92 class EqEngineManagerDistributed
;
94 class DecisionManager
;
95 class RelevanceManager
;
99 }/* CVC4::theory::eq namespace */
101 namespace quantifiers
{
105 class EntailmentCheckParameters
;
106 class EntailmentCheckSideEffects
;
107 }/* CVC4::theory namespace */
109 class RemoveTermFormulas
;
112 * This is essentially an abstraction for a collection of theories. A
113 * TheoryEngine provides services to a PropEngine, making various
114 * T-solvers look like a single unit to the propositional part of
119 /** Shared terms database can use the internals notify the theories */
120 friend class SharedTermsDatabase
;
121 friend class theory::quantifiers::TermDb
;
122 friend class theory::EngineOutputChannel
;
124 /** Associated PropEngine engine */
125 prop::PropEngine
* d_propEngine
;
128 context::Context
* d_context
;
130 /** Our user context */
131 context::UserContext
* d_userContext
;
134 * A table of from theory IDs to theory pointers. Never use this table
135 * directly, use theoryOf() instead.
137 theory::Theory
* d_theoryTable
[theory::THEORY_LAST
];
140 * A collection of theories that are "active" for the current run.
141 * This set is provided by the user (as a logic string, say, in SMT-LIBv2
142 * format input), or else by default it's all-inclusive. This is important
143 * because we can optimize for single-theory runs (no sharing), can reduce
144 * the cost of walking the DAG on registration, etc.
146 const LogicInfo
& d_logicInfo
;
149 * The database of shared terms.
151 SharedTermsDatabase d_sharedTerms
;
154 * The distributed equality manager. This class is responsible for
155 * configuring the theories of this class for handling equalties
156 * in a "distributed" fashion, i.e. each theory maintains a unique
157 * instance of an equality engine. These equality engines are memory
158 * managed by this class.
160 std::unique_ptr
<theory::EqEngineManagerDistributed
> d_eeDistributed
;
163 * The quantifiers engine
165 theory::QuantifiersEngine
* d_quantEngine
;
167 * The decision manager
169 std::unique_ptr
<theory::DecisionManager
> d_decManager
;
170 /** The relevance manager */
171 std::unique_ptr
<theory::RelevanceManager
> d_relManager
;
174 * Default model object
176 theory::TheoryModel
* d_curr_model
;
177 bool d_aloc_curr_model
;
179 * Model builder object
181 theory::TheoryEngineModelBuilder
* d_curr_model_builder
;
182 bool d_aloc_curr_model_builder
;
183 /** are we in eager model building mode? (see setEagerModelBuilding). */
184 bool d_eager_model_building
;
186 typedef std::unordered_map
<Node
, Node
, NodeHashFunction
> NodeMap
;
187 typedef std::unordered_map
<TNode
, Node
, TNodeHashFunction
> TNodeMap
;
190 * Used for "missed-t-propagations" dumping mode only. A set of all
191 * theory-propagable literals.
193 context::CDList
<TNode
> d_possiblePropagations
;
196 * Used for "missed-t-propagations" dumping mode only. A
197 * context-dependent set of those theory-propagable literals that
198 * have been propagated.
200 context::CDHashSet
<Node
, NodeHashFunction
> d_hasPropagated
;
203 * Output channels for individual theories.
205 theory::EngineOutputChannel
* d_theoryOut
[theory::THEORY_LAST
];
208 * Are we in conflict.
210 context::CDO
<bool> d_inConflict
;
213 * Are we in "SAT mode"? In this state, the user can query for the model.
214 * This corresponds to the state in Figure 4.1, page 52 of the SMT-LIB
215 * standard, version 2.6.
220 * Called by the theories to notify of a conflict.
222 void conflict(TNode conflict
, theory::TheoryId theoryId
);
225 * Debugging flag to ensure that shutdown() is called before the
231 * True if a theory has notified us of incompleteness (at this
232 * context level or below).
234 context::CDO
<bool> d_incomplete
;
237 * Called by the theories to notify that the current branch is incomplete.
239 void setIncomplete(theory::TheoryId theory
) {
245 * Mapping of propagations from recievers to senders.
247 typedef context::CDHashMap
<NodeTheoryPair
, NodeTheoryPair
, NodeTheoryPairHashFunction
> PropagationMap
;
248 PropagationMap d_propagationMap
;
251 * Timestamp of propagations
253 context::CDO
<size_t> d_propagationMapTimestamp
;
256 * Literals that are propagated by the theory. Note that these are TNodes.
257 * The theory can only propagate nodes that have an assigned literal in the
258 * SAT solver and are hence referenced in the SAT solver.
260 context::CDList
<TNode
> d_propagatedLiterals
;
263 * The index of the next literal to be propagated by a theory.
265 context::CDO
<unsigned> d_propagatedLiteralsIndex
;
268 * Called by the output channel to propagate literals and facts
269 * @return false if immediate conflict
271 bool propagate(TNode literal
, theory::TheoryId theory
);
274 * Internal method to call the propagation routines and collect the
275 * propagated literals.
277 void propagate(theory::Theory::Effort effort
);
280 * A variable to mark if we added any lemmas.
285 * A variable to mark if the OutputChannel was "used" by any theory
286 * since the start of the last check. If it has been, we require
287 * a FULL_EFFORT check before exiting and reporting SAT.
289 * See the documentation for the needCheck() function, below.
291 bool d_outputChannelUsed
;
293 /** Atom requests from lemmas */
294 AtomRequests d_atomRequests
;
297 * Adds a new lemma, returning its status.
298 * @param node the lemma
299 * @param negated should the lemma be asserted negated
300 * @param p the properties of the lemma.
302 theory::LemmaStatus
lemma(TNode node
,
305 theory::LemmaProperty p
,
306 theory::TheoryId atomsTo
);
308 /** Enusre that the given atoms are send to the given theory */
309 void ensureLemmaAtoms(const std::vector
<TNode
>& atoms
, theory::TheoryId theory
);
311 /** sort inference module */
312 SortInference d_sortInfer
;
314 /** The theory preprocessor */
315 theory::TheoryPreprocessor d_tpp
;
317 /** Time spent in theory combination */
318 TimerStat d_combineTheoriesTime
;
323 /** Whether we were just interrupted (or not) */
325 ResourceManager
* d_resourceManager
;
328 /** Constructs a theory engine */
329 TheoryEngine(context::Context
* context
,
330 context::UserContext
* userContext
,
332 RemoveTermFormulas
& iteRemover
,
333 const LogicInfo
& logic
);
335 /** Destroys a theory engine */
340 /** "Spend" a resource during a search or preprocessing.*/
341 void spendResource(ResourceManager::Resource r
);
344 * Adds a theory. Only one theory per TheoryId can be present, so if
345 * there is another theory it will be deleted.
347 template <class TheoryClass
>
348 inline void addTheory(theory::TheoryId theoryId
)
350 Assert(d_theoryTable
[theoryId
] == NULL
&& d_theoryOut
[theoryId
] == NULL
);
351 d_theoryOut
[theoryId
] = new theory::EngineOutputChannel(this, theoryId
);
352 d_theoryTable
[theoryId
] = new TheoryClass(d_context
,
354 *d_theoryOut
[theoryId
],
355 theory::Valuation(this),
358 theory::Rewriter::registerTheoryRewriter(
359 theoryId
, d_theoryTable
[theoryId
]->getTheoryRewriter());
362 void setPropEngine(prop::PropEngine
* propEngine
)
364 d_propEngine
= propEngine
;
368 * Called when all initialization of options/logic is done, after theory
369 * objects have been created.
371 * This initializes the quantifiers engine, the "official" equality engines
372 * of each theory as required, and the model and model builder utilities.
377 * Get a pointer to the underlying propositional engine.
379 inline prop::PropEngine
* getPropEngine() const {
384 * Get a pointer to the underlying sat context.
386 inline context::Context
* getSatContext() const {
391 * Get a pointer to the underlying user context.
393 inline context::Context
* getUserContext() const {
394 return d_userContext
;
398 * Get a pointer to the underlying quantifiers engine.
400 theory::QuantifiersEngine
* getQuantifiersEngine() const {
401 return d_quantEngine
;
404 * Get a pointer to the underlying decision manager.
406 theory::DecisionManager
* getDecisionManager() const
408 return d_decManager
.get();
413 * Queue of nodes for pre-registration.
415 std::queue
<TNode
> d_preregisterQueue
;
418 * Boolean flag denoting we are in pre-registration.
420 bool d_inPreregister
;
423 * Did the theories get any new facts since the last time we called
426 context::CDO
<bool> d_factsAsserted
;
429 * Map from equality atoms to theories that would like to be notified about them.
434 * Assert the formula to the given theory.
435 * @param assertion the assertion to send (not necesserily normalized)
436 * @param original the assertion as it was sent in from the propagating theory
437 * @param toTheoryId the theory to assert to
438 * @param fromTheoryId the theory that sent it
440 void assertToTheory(TNode assertion
, TNode originalAssertion
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
443 * Marks a theory propagation from a theory to a theory where a
444 * theory could be the THEORY_SAT_SOLVER for literals coming from
445 * or being propagated to the SAT solver. If the receiving theory
446 * already recieved the literal, the method returns false, otherwise
449 * @param assertion the normalized assertion being sent
450 * @param originalAssertion the actual assertion that was sent
451 * @param toTheoryId the theory that is on the receiving end
452 * @param fromTheoryId the theory that sent the assertion
453 * @return true if a new assertion, false if theory already got it
455 bool markPropagation(TNode assertion
, TNode originalAssertions
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
458 * Computes the explanation by travarsing the propagation graph and
459 * asking relevant theories to explain the propagations. Initially
460 * the explanation vector should contain only the element (node, theory)
461 * where the node is the one to be explained, and the theory is the
462 * theory that sent the literal. The lemmaProofRecipe will contain a list
463 * of the explanation steps required to produce the original node.
465 void getExplanation(std::vector
<NodeTheoryPair
>& explanationVector
, LemmaProofRecipe
* lemmaProofRecipe
);
470 * Signal the start of a new round of assertion preprocessing
472 void preprocessStart();
475 * Runs theory specific preprocessing on the non-Boolean parts of
476 * the formula. This is only called on input assertions, after ITEs
479 Node
preprocess(TNode node
);
481 /** Notify (preprocessed) assertions. */
482 void notifyPreprocessedAssertions(const std::vector
<Node
>& assertions
);
484 /** Return whether or not we are incomplete (in the current context). */
485 inline bool isIncomplete() const { return d_incomplete
; }
488 * Returns true if we need another round of checking. If this
489 * returns true, check(FULL_EFFORT) _must_ be called by the
490 * propositional layer before reporting SAT.
492 * This is especially necessary for incomplete theories that lazily
493 * output some lemmas on FULL_EFFORT check (e.g. quantifier reasoning
494 * outputing quantifier instantiations). In such a case, a lemma can
495 * be asserted that is simplified away (perhaps it's already true).
496 * However, we must maintain the invariant that, if a theory uses the
497 * OutputChannel, it implicitly requests that another check(FULL_EFFORT)
498 * be performed before exit, even if no new facts are on its fact queue,
499 * as it might decide to further instantiate some lemmas, precluding
502 inline bool needCheck() const {
503 return d_outputChannelUsed
|| d_lemmasAdded
;
506 * Is the literal lit (possibly) critical for satisfying the input formula in
507 * the current context? This call is applicable only during collectModelInfo
508 * or during LAST_CALL effort.
510 bool isRelevant(Node lit
) const;
513 * This is called at shutdown time by the SmtEngine, just before
514 * destruction. It is important because there are destruction
515 * ordering issues between PropEngine and Theory.
520 * Solve the given literal with a theory that owns it.
522 theory::Theory::PPAssertStatus
solve(TNode literal
,
523 theory::SubstitutionMap
& substitutionOut
);
526 * Preregister a Theory atom with the responsible theory (or
529 void preRegister(TNode preprocessed
);
532 * Assert the formula to the appropriate theory.
533 * @param node the assertion
535 void assertFact(TNode node
);
538 * Check all (currently-active) theories for conflicts.
539 * @param effort the effort level to use
541 void check(theory::Theory::Effort effort
);
544 * Run the combination framework.
546 void combineTheories();
549 * Calls ppStaticLearn() on all theories, accumulating their
550 * combined contributions in the "learned" builder.
552 void ppStaticLearn(TNode in
, NodeBuilder
<>& learned
);
555 * Calls presolve() on all theories and returns true
556 * if one of the theories discovers a conflict.
561 * Calls postsolve() on all theories.
566 * Calls notifyRestart() on all active theories.
568 void notifyRestart();
570 void getPropagatedLiterals(std::vector
<TNode
>& literals
) {
571 for (; d_propagatedLiteralsIndex
< d_propagatedLiterals
.size(); d_propagatedLiteralsIndex
= d_propagatedLiteralsIndex
+ 1) {
572 Debug("getPropagatedLiterals") << "TheoryEngine::getPropagatedLiterals: propagating: " << d_propagatedLiterals
[d_propagatedLiteralsIndex
] << std::endl
;
573 literals
.push_back(d_propagatedLiterals
[d_propagatedLiteralsIndex
]);
578 * Returns the next decision request, or null if none exist. The next
579 * decision request is a literal that this theory engine prefers the SAT
580 * solver to make as its next decision. Decision requests are managed by
581 * the decision manager d_decManager.
583 Node
getNextDecisionRequest();
585 bool properConflict(TNode conflict
) const;
586 bool properPropagation(TNode lit
) const;
587 bool properExplanation(TNode node
, TNode expl
) const;
590 * Returns an explanation of the node propagated to the SAT solver.
592 Node
getExplanation(TNode node
);
595 * Returns an explanation of the node propagated to the SAT solver and the theory
596 * that propagated it.
598 Node
getExplanationAndRecipe(TNode node
, LemmaProofRecipe
* proofRecipe
);
603 bool collectModelInfo(theory::TheoryModel
* m
);
604 /** post process model */
605 void postProcessModel( theory::TheoryModel
* m
);
608 * Get the pointer to the model object used by this theory engine.
610 theory::TheoryModel
* getModel();
612 * Get the current model for the current set of assertions. This method
613 * should only be called immediately after a satisfiable or unknown
614 * response to a check-sat call, and only if produceModels is true.
616 * If the model is not already built, this will cause this theory engine
617 * to build the model.
619 * If the model is not available (for instance, if the last call to check-sat
620 * was interrupted), then this returns the null pointer.
622 theory::TheoryModel
* getBuiltModel();
623 /** set eager model building
625 * If this method is called, then this TheoryEngine will henceforth build
626 * its model immediately after every satisfiability check that results
627 * in a satisfiable or unknown result. The motivation for this mode is to
628 * accomodate API users that get the model object from the TheoryEngine,
629 * where we want to ensure that this model is always valid.
630 * TODO (#2648): revisit this.
632 void setEagerModelBuilding() { d_eager_model_building
= true; }
634 /** get synth solutions
636 * This method returns true if there is a synthesis solution available. This
637 * is the case if the last call to check satisfiability originated in a
638 * check-synth call, and the synthesis solver successfully found a solution
639 * for all active synthesis conjectures.
641 * This method adds entries to sol_map that map functions-to-synthesize with
642 * their solutions, for all active conjectures. This should be called
643 * immediately after the solver answers unsat for sygus input.
645 * For details on what is added to sol_map, see
646 * SynthConjecture::getSynthSolutions.
648 bool getSynthSolutions(std::map
<Node
, std::map
<Node
, Node
> >& sol_map
);
651 * Get the model builder
653 theory::TheoryEngineModelBuilder
* getModelBuilder() { return d_curr_model_builder
; }
656 * Get the theory associated to a given Node.
658 * @returns the theory, or NULL if the TNode is
661 inline theory::Theory
* theoryOf(TNode node
) const {
662 return d_theoryTable
[theory::Theory::theoryOf(node
)];
666 * Get the theory associated to a the given theory id.
668 * @returns the theory
670 inline theory::Theory
* theoryOf(theory::TheoryId theoryId
) const {
671 Assert(theoryId
< theory::THEORY_LAST
);
672 return d_theoryTable
[theoryId
];
675 inline bool isTheoryEnabled(theory::TheoryId theoryId
) const {
676 return d_logicInfo
.isTheoryEnabled(theoryId
);
678 /** get the logic info used by this theory engine */
679 const LogicInfo
& getLogicInfo() const;
681 * Returns the equality status of the two terms, from the theory
682 * that owns the domain type. The types of a and b must be the same.
684 theory::EqualityStatus
getEqualityStatus(TNode a
, TNode b
);
687 * Returns the value that a theory that owns the type of var currently
688 * has (or null if none);
690 Node
getModelValue(TNode var
);
693 * Takes a literal and returns an equivalent literal that is guaranteed to be a SAT literal
695 Node
ensureLiteral(TNode n
);
698 * Print all instantiations made by the quantifiers module.
700 void printInstantiations( std::ostream
& out
);
703 * Print solution for synthesis conjectures found by ce_guided_instantiation module
705 void printSynthSolution( std::ostream
& out
);
708 * Get list of quantified formulas that were instantiated
710 void getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
);
713 * Get instantiation methods
714 * first inputs forall x.q[x] and returns ( q[a], ..., q[z] )
715 * second inputs forall x.q[x] and returns ( a, ..., z )
716 * third and fourth return mappings e.g. forall x.q1[x] -> ( q1[a]...q1[z] ) , ... , forall x.qn[x] -> ( qn[a]...qn[z] )
718 void getInstantiations( Node q
, std::vector
< Node
>& insts
);
719 void getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
);
720 void getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
);
721 void getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
);
724 * Get instantiated conjunction, returns q[t1] ^ ... ^ q[tn] where t1...tn are current set of instantiations for q.
725 * Can be used for quantifier elimination when satisfiable and q[t1] ^ ... ^ q[tn] |= q
727 Node
getInstantiatedConjunction( Node q
);
730 * Forwards an entailment check according to the given theoryOfMode.
731 * See theory.h for documentation on entailmentCheck().
733 std::pair
<bool, Node
> entailmentCheck(options::TheoryOfMode mode
, TNode lit
);
736 /** Default visitor for pre-registration */
737 PreRegisterVisitor d_preRegistrationVisitor
;
739 /** Visitor for collecting shared terms */
740 SharedTermsVisitor d_sharedTermsVisitor
;
742 /** Dump the assertions to the dump */
743 void dumpAssertions(const char* tag
);
745 /** For preprocessing pass lifting bit-vectors of size 1 to booleans */
748 SharedTermsDatabase
* getSharedTermsDatabase();
750 SortInference
* getSortInference() { return &d_sortInfer
; }
752 /** Prints the assertions to the debug stream */
753 void printAssertions(const char* tag
);
757 std::map
< std::string
, std::vector
< theory::Theory
* > > d_attr_handle
;
760 /** Set user attribute.
762 * This function is called when an attribute is set by a user. In SMT-LIBv2
763 * this is done via the syntax (! n :attr)
765 void setUserAttribute(const std::string
& attr
,
767 const std::vector
<Node
>& node_values
,
768 const std::string
& str_value
);
770 /** Handle user attribute.
772 * Associates theory t with the attribute attr. Theory t will be
773 * notified whenever an attribute of name attr is set.
775 void handleUserAttribute(const char* attr
, theory::Theory
* t
);
778 * Check that the theory assertions are satisfied in the model.
779 * This function is called from the smt engine's checkModel routine.
781 void checkTheoryAssertionsWithModel(bool hardFailure
);
784 IntStat d_arithSubstitutionsAdded
;
786 };/* class TheoryEngine */
788 }/* CVC4 namespace */
790 #endif /* CVC4__THEORY_ENGINE_H */