1 /********************* */
2 /*! \file theory_engine.h
4 ** Top contributors (to current version):
5 ** Dejan Jovanovic, Morgan Deters, Andrew Reynolds
6 ** This file is part of the CVC4 project.
7 ** Copyright (c) 2009-2019 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/decision_manager.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/uf/equality_engine.h"
47 #include "theory/valuation.h"
48 #include "util/hash.h"
49 #include "util/resource_manager.h"
50 #include "util/statistics_registry.h"
51 #include "util/unsafe_interrupt_exception.h"
55 class ResourceManager
;
56 class LemmaProofRecipe
;
59 * A pair of a theory and a node. This is used to mark the flow of
60 * propagations between theories.
62 struct NodeTheoryPair
{
64 theory::TheoryId d_theory
;
66 NodeTheoryPair(TNode n
, theory::TheoryId t
, size_t ts
= 0)
67 : d_node(n
), d_theory(t
), d_timestamp(ts
)
70 NodeTheoryPair() : d_theory(theory::THEORY_LAST
), d_timestamp() {}
71 // Comparison doesn't take into account the timestamp
72 bool operator == (const NodeTheoryPair
& pair
) const {
73 return d_node
== pair
.d_node
&& d_theory
== pair
.d_theory
;
75 };/* struct NodeTheoryPair */
77 struct NodeTheoryPairHashFunction
{
78 NodeHashFunction hashFunction
;
79 // Hash doesn't take into account the timestamp
80 size_t operator()(const NodeTheoryPair
& pair
) const {
81 uint64_t hash
= fnv1a::fnv1a_64(NodeHashFunction()(pair
.d_node
));
82 return static_cast<size_t>(fnv1a::fnv1a_64(pair
.d_theory
, hash
));
84 };/* struct NodeTheoryPairHashFunction */
87 /* Forward declarations */
90 class TheoryEngineModelBuilder
;
94 }/* CVC4::theory::eq namespace */
96 namespace quantifiers
{
100 class EntailmentCheckParameters
;
101 class EntailmentCheckSideEffects
;
102 }/* CVC4::theory namespace */
104 class RemoveTermFormulas
;
107 * This is essentially an abstraction for a collection of theories. A
108 * TheoryEngine provides services to a PropEngine, making various
109 * T-solvers look like a single unit to the propositional part of
114 /** Shared terms database can use the internals notify the theories */
115 friend class SharedTermsDatabase
;
116 friend class theory::quantifiers::TermDb
;
118 /** Associated PropEngine engine */
119 prop::PropEngine
* d_propEngine
;
122 context::Context
* d_context
;
124 /** Our user context */
125 context::UserContext
* d_userContext
;
128 * A table of from theory IDs to theory pointers. Never use this table
129 * directly, use theoryOf() instead.
131 theory::Theory
* d_theoryTable
[theory::THEORY_LAST
];
134 * A collection of theories that are "active" for the current run.
135 * This set is provided by the user (as a logic string, say, in SMT-LIBv2
136 * format input), or else by default it's all-inclusive. This is important
137 * because we can optimize for single-theory runs (no sharing), can reduce
138 * the cost of walking the DAG on registration, etc.
140 const LogicInfo
& d_logicInfo
;
143 * The database of shared terms.
145 SharedTermsDatabase d_sharedTerms
;
148 * Master equality engine, to share with theories.
150 theory::eq::EqualityEngine
* d_masterEqualityEngine
;
152 /** notify class for master equality engine */
153 class NotifyClass
: public theory::eq::EqualityEngineNotify
{
156 NotifyClass(TheoryEngine
& te
): d_te(te
) {}
157 bool eqNotifyTriggerEquality(TNode equality
, bool value
) override
161 bool eqNotifyTriggerPredicate(TNode predicate
, bool value
) override
165 bool eqNotifyTriggerTermEquality(theory::TheoryId tag
,
172 void eqNotifyConstantTermMerge(TNode t1
, TNode t2
) override
{}
173 void eqNotifyNewClass(TNode t
) override
{ d_te
.eqNotifyNewClass(t
); }
174 void eqNotifyPreMerge(TNode t1
, TNode t2
) override
177 void eqNotifyPostMerge(TNode t1
, TNode t2
) override
180 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
) override
183 };/* class TheoryEngine::NotifyClass */
184 NotifyClass d_masterEENotify
;
187 * notification methods
189 void eqNotifyNewClass(TNode t
);
190 void eqNotifyPreMerge(TNode t1
, TNode t2
);
191 void eqNotifyPostMerge(TNode t1
, TNode t2
);
192 void eqNotifyDisequal(TNode t1
, TNode t2
, TNode reason
);
195 * The quantifiers engine
197 theory::QuantifiersEngine
* d_quantEngine
;
199 * The decision manager
201 std::unique_ptr
<theory::DecisionManager
> d_decManager
;
204 * Default model object
206 theory::TheoryModel
* d_curr_model
;
207 bool d_aloc_curr_model
;
209 * Model builder object
211 theory::TheoryEngineModelBuilder
* d_curr_model_builder
;
212 bool d_aloc_curr_model_builder
;
213 /** are we in eager model building mode? (see setEagerModelBuilding). */
214 bool d_eager_model_building
;
216 typedef std::unordered_map
<Node
, Node
, NodeHashFunction
> NodeMap
;
217 typedef std::unordered_map
<TNode
, Node
, TNodeHashFunction
> TNodeMap
;
220 * Cache for theory-preprocessing of assertions
225 * Used for "missed-t-propagations" dumping mode only. A set of all
226 * theory-propagable literals.
228 context::CDList
<TNode
> d_possiblePropagations
;
231 * Used for "missed-t-propagations" dumping mode only. A
232 * context-dependent set of those theory-propagable literals that
233 * have been propagated.
235 context::CDHashSet
<Node
, NodeHashFunction
> d_hasPropagated
;
239 * Statistics for a particular theory.
243 static std::string
mkName(std::string prefix
,
244 theory::TheoryId theory
,
245 std::string suffix
) {
246 std::stringstream ss
;
247 ss
<< prefix
<< theory
<< suffix
;
252 IntStat conflicts
, propagations
, lemmas
, requirePhase
, restartDemands
;
254 Statistics(theory::TheoryId theory
);
256 };/* class TheoryEngine::Statistics */
259 * An output channel for Theory that passes messages
260 * back to a TheoryEngine.
262 class EngineOutputChannel
: public theory::OutputChannel
{
263 friend class TheoryEngine
;
266 * The theory engine we're communicating with.
268 TheoryEngine
* d_engine
;
271 * The statistics of the theory interractions.
273 Statistics d_statistics
;
275 /** The theory owning this channel. */
276 theory::TheoryId d_theory
;
279 EngineOutputChannel(TheoryEngine
* engine
, theory::TheoryId theory
)
280 : d_engine(engine
), d_statistics(theory
), d_theory(theory
) {}
282 void safePoint(ResourceManager::Resource r
) override
285 if (d_engine
->d_interrupted
) {
286 throw theory::Interrupted();
290 void conflict(TNode conflictNode
,
291 std::unique_ptr
<Proof
> pf
= nullptr) override
;
292 bool propagate(TNode literal
) override
;
294 theory::LemmaStatus
lemma(TNode lemma
, ProofRule rule
,
295 bool removable
= false, bool preprocess
= false,
296 bool sendAtoms
= false) override
;
298 theory::LemmaStatus
splitLemma(TNode lemma
,
299 bool removable
= false) override
;
301 void demandRestart() override
{
302 NodeManager
* curr
= NodeManager::currentNM();
303 Node restartVar
= curr
->mkSkolem(
304 "restartVar", curr
->booleanType(),
305 "A boolean variable asserted to be true to force a restart");
306 Trace("theory::restart")
307 << "EngineOutputChannel<" << d_theory
<< ">::restart(" << restartVar
309 ++d_statistics
.restartDemands
;
310 lemma(restartVar
, RULE_INVALID
, true);
313 void requirePhase(TNode n
, bool phase
) override
{
314 Debug("theory") << "EngineOutputChannel::requirePhase(" << n
<< ", "
315 << phase
<< ")" << std::endl
;
316 ++d_statistics
.requirePhase
;
317 d_engine
->d_propEngine
->requirePhase(n
, phase
);
320 void setIncomplete() override
{
321 Trace("theory") << "TheoryEngine::setIncomplete()" << std::endl
;
322 d_engine
->setIncomplete(d_theory
);
325 void spendResource(ResourceManager::Resource r
) override
327 d_engine
->spendResource(r
);
330 void handleUserAttribute(const char* attr
, theory::Theory
* t
) override
{
331 d_engine
->handleUserAttribute(attr
, t
);
336 * A helper function for registering lemma recipes with the proof engine
338 void registerLemmaRecipe(Node lemma
, Node originalLemma
, bool preprocess
,
339 theory::TheoryId theoryId
);
340 }; /* class TheoryEngine::EngineOutputChannel */
343 * Output channels for individual theories.
345 EngineOutputChannel
* d_theoryOut
[theory::THEORY_LAST
];
348 * Are we in conflict.
350 context::CDO
<bool> d_inConflict
;
353 * Are we in "SAT mode"? In this state, the user can query for the model.
354 * This corresponds to the state in Figure 4.1, page 52 of the SMT-LIB
355 * standard, version 2.6.
360 * Called by the theories to notify of a conflict.
362 void conflict(TNode conflict
, theory::TheoryId theoryId
);
365 * Debugging flag to ensure that shutdown() is called before the
371 * True if a theory has notified us of incompleteness (at this
372 * context level or below).
374 context::CDO
<bool> d_incomplete
;
377 * Called by the theories to notify that the current branch is incomplete.
379 void setIncomplete(theory::TheoryId theory
) {
385 * Mapping of propagations from recievers to senders.
387 typedef context::CDHashMap
<NodeTheoryPair
, NodeTheoryPair
, NodeTheoryPairHashFunction
> PropagationMap
;
388 PropagationMap d_propagationMap
;
391 * Timestamp of propagations
393 context::CDO
<size_t> d_propagationMapTimestamp
;
396 * Literals that are propagated by the theory. Note that these are TNodes.
397 * The theory can only propagate nodes that have an assigned literal in the
398 * SAT solver and are hence referenced in the SAT solver.
400 context::CDList
<TNode
> d_propagatedLiterals
;
403 * The index of the next literal to be propagated by a theory.
405 context::CDO
<unsigned> d_propagatedLiteralsIndex
;
408 * Called by the output channel to propagate literals and facts
409 * @return false if immediate conflict
411 bool propagate(TNode literal
, theory::TheoryId theory
);
414 * Internal method to call the propagation routines and collect the
415 * propagated literals.
417 void propagate(theory::Theory::Effort effort
);
420 * A variable to mark if we added any lemmas.
425 * A variable to mark if the OutputChannel was "used" by any theory
426 * since the start of the last check. If it has been, we require
427 * a FULL_EFFORT check before exiting and reporting SAT.
429 * See the documentation for the needCheck() function, below.
431 bool d_outputChannelUsed
;
433 /** Atom requests from lemmas */
434 AtomRequests d_atomRequests
;
437 * Adds a new lemma, returning its status.
438 * @param node the lemma
439 * @param negated should the lemma be asserted negated
440 * @param removable can the lemma be remove (restrictions apply)
441 * @param needAtoms if not THEORY_LAST, then
443 theory::LemmaStatus
lemma(TNode node
,
448 theory::TheoryId atomsTo
);
450 /** Enusre that the given atoms are send to the given theory */
451 void ensureLemmaAtoms(const std::vector
<TNode
>& atoms
, theory::TheoryId theory
);
453 RemoveTermFormulas
& d_tform_remover
;
455 /** sort inference module */
456 SortInference d_sortInfer
;
458 /** Time spent in theory combination */
459 TimerStat d_combineTheoriesTime
;
464 /** Whether we were just interrupted (or not) */
466 ResourceManager
* d_resourceManager
;
469 /** Constructs a theory engine */
470 TheoryEngine(context::Context
* context
,
471 context::UserContext
* userContext
,
472 RemoveTermFormulas
& iteRemover
,
473 const LogicInfo
& logic
);
475 /** Destroys a theory engine */
480 /** "Spend" a resource during a search or preprocessing.*/
481 void spendResource(ResourceManager::Resource r
);
484 * Adds a theory. Only one theory per TheoryId can be present, so if
485 * there is another theory it will be deleted.
487 template <class TheoryClass
>
488 inline void addTheory(theory::TheoryId theoryId
)
490 Assert(d_theoryTable
[theoryId
] == NULL
&& d_theoryOut
[theoryId
] == NULL
);
491 d_theoryOut
[theoryId
] = new EngineOutputChannel(this, theoryId
);
492 d_theoryTable
[theoryId
] = new TheoryClass(d_context
,
494 *d_theoryOut
[theoryId
],
495 theory::Valuation(this),
499 inline void setPropEngine(prop::PropEngine
* propEngine
) {
500 Assert(d_propEngine
== NULL
);
501 d_propEngine
= propEngine
;
504 /** Called when all initialization of options/logic is done */
508 * Get a pointer to the underlying propositional engine.
510 inline prop::PropEngine
* getPropEngine() const {
515 * Get a pointer to the underlying sat context.
517 inline context::Context
* getSatContext() const {
522 * Get a pointer to the underlying user context.
524 inline context::Context
* getUserContext() const {
525 return d_userContext
;
529 * Get a pointer to the underlying quantifiers engine.
531 theory::QuantifiersEngine
* getQuantifiersEngine() const {
532 return d_quantEngine
;
535 * Get a pointer to the underlying decision manager.
537 theory::DecisionManager
* getDecisionManager() const
539 return d_decManager
.get();
544 * Helper for preprocess
546 Node
ppTheoryRewrite(TNode term
);
549 * Queue of nodes for pre-registration.
551 std::queue
<TNode
> d_preregisterQueue
;
554 * Boolean flag denoting we are in pre-registration.
556 bool d_inPreregister
;
559 * Did the theories get any new facts since the last time we called
562 context::CDO
<bool> d_factsAsserted
;
565 * Map from equality atoms to theories that would like to be notified about them.
570 * Assert the formula to the given theory.
571 * @param assertion the assertion to send (not necesserily normalized)
572 * @param original the assertion as it was sent in from the propagating theory
573 * @param toTheoryId the theory to assert to
574 * @param fromTheoryId the theory that sent it
576 void assertToTheory(TNode assertion
, TNode originalAssertion
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
579 * Marks a theory propagation from a theory to a theory where a
580 * theory could be the THEORY_SAT_SOLVER for literals coming from
581 * or being propagated to the SAT solver. If the receiving theory
582 * already recieved the literal, the method returns false, otherwise
585 * @param assertion the normalized assertion being sent
586 * @param originalAssertion the actual assertion that was sent
587 * @param toTheoryId the theory that is on the receiving end
588 * @param fromTheoryId the theory that sent the assertino
589 * @return true if a new assertion, false if theory already got it
591 bool markPropagation(TNode assertion
, TNode originalAssertions
, theory::TheoryId toTheoryId
, theory::TheoryId fromTheoryId
);
594 * Computes the explanation by travarsing the propagation graph and
595 * asking relevant theories to explain the propagations. Initially
596 * the explanation vector should contain only the element (node, theory)
597 * where the node is the one to be explained, and the theory is the
598 * theory that sent the literal. The lemmaProofRecipe will contain a list
599 * of the explanation steps required to produce the original node.
601 void getExplanation(std::vector
<NodeTheoryPair
>& explanationVector
, LemmaProofRecipe
* lemmaProofRecipe
);
606 * Signal the start of a new round of assertion preprocessing
608 void preprocessStart();
611 * Runs theory specific preprocessing on the non-Boolean parts of
612 * the formula. This is only called on input assertions, after ITEs
615 Node
preprocess(TNode node
);
617 /** Notify (preprocessed) assertions. */
618 void notifyPreprocessedAssertions(const std::vector
<Node
>& assertions
);
620 /** Return whether or not we are incomplete (in the current context). */
621 inline bool isIncomplete() const { return d_incomplete
; }
624 * Returns true if we need another round of checking. If this
625 * returns true, check(FULL_EFFORT) _must_ be called by the
626 * propositional layer before reporting SAT.
628 * This is especially necessary for incomplete theories that lazily
629 * output some lemmas on FULL_EFFORT check (e.g. quantifier reasoning
630 * outputing quantifier instantiations). In such a case, a lemma can
631 * be asserted that is simplified away (perhaps it's already true).
632 * However, we must maintain the invariant that, if a theory uses the
633 * OutputChannel, it implicitly requests that another check(FULL_EFFORT)
634 * be performed before exit, even if no new facts are on its fact queue,
635 * as it might decide to further instantiate some lemmas, precluding
638 inline bool needCheck() const {
639 return d_outputChannelUsed
|| d_lemmasAdded
;
643 * This is called at shutdown time by the SmtEngine, just before
644 * destruction. It is important because there are destruction
645 * ordering issues between PropEngine and Theory.
650 * Solve the given literal with a theory that owns it.
652 theory::Theory::PPAssertStatus
solve(TNode literal
,
653 theory::SubstitutionMap
& substitutionOut
);
656 * Preregister a Theory atom with the responsible theory (or
659 void preRegister(TNode preprocessed
);
662 * Assert the formula to the appropriate theory.
663 * @param node the assertion
665 void assertFact(TNode node
);
668 * Check all (currently-active) theories for conflicts.
669 * @param effort the effort level to use
671 void check(theory::Theory::Effort effort
);
674 * Run the combination framework.
676 void combineTheories();
679 * Calls ppStaticLearn() on all theories, accumulating their
680 * combined contributions in the "learned" builder.
682 void ppStaticLearn(TNode in
, NodeBuilder
<>& learned
);
685 * Calls presolve() on all theories and returns true
686 * if one of the theories discovers a conflict.
691 * Calls postsolve() on all theories.
696 * Calls notifyRestart() on all active theories.
698 void notifyRestart();
700 void getPropagatedLiterals(std::vector
<TNode
>& literals
) {
701 for (; d_propagatedLiteralsIndex
< d_propagatedLiterals
.size(); d_propagatedLiteralsIndex
= d_propagatedLiteralsIndex
+ 1) {
702 Debug("getPropagatedLiterals") << "TheoryEngine::getPropagatedLiterals: propagating: " << d_propagatedLiterals
[d_propagatedLiteralsIndex
] << std::endl
;
703 literals
.push_back(d_propagatedLiterals
[d_propagatedLiteralsIndex
]);
708 * Returns the next decision request, or null if none exist. The next
709 * decision request is a literal that this theory engine prefers the SAT
710 * solver to make as its next decision. Decision requests are managed by
711 * the decision manager d_decManager.
713 Node
getNextDecisionRequest();
715 bool properConflict(TNode conflict
) const;
716 bool properPropagation(TNode lit
) const;
717 bool properExplanation(TNode node
, TNode expl
) const;
720 * Returns an explanation of the node propagated to the SAT solver.
722 Node
getExplanation(TNode node
);
725 * Returns an explanation of the node propagated to the SAT solver and the theory
726 * that propagated it.
728 Node
getExplanationAndRecipe(TNode node
, LemmaProofRecipe
* proofRecipe
);
733 bool collectModelInfo(theory::TheoryModel
* m
);
734 /** post process model */
735 void postProcessModel( theory::TheoryModel
* m
);
738 * Get the pointer to the model object used by this theory engine.
740 theory::TheoryModel
* getModel();
742 * Get the current model for the current set of assertions. This method
743 * should only be called immediately after a satisfiable or unknown
744 * response to a check-sat call, and only if produceModels is true.
746 * If the model is not already built, this will cause this theory engine
747 * to build the model.
749 * If the model is not available (for instance, if the last call to check-sat
750 * was interrupted), then this returns the null pointer.
752 theory::TheoryModel
* getBuiltModel();
753 /** set eager model building
755 * If this method is called, then this TheoryEngine will henceforth build
756 * its model immediately after every satisfiability check that results
757 * in a satisfiable or unknown result. The motivation for this mode is to
758 * accomodate API users that get the model object from the TheoryEngine,
759 * where we want to ensure that this model is always valid.
760 * TODO (#2648): revisit this.
762 void setEagerModelBuilding() { d_eager_model_building
= true; }
764 /** get synth solutions
766 * This method returns true if there is a synthesis solution available. This
767 * is the case if the last call to check satisfiability originated in a
768 * check-synth call, and the synthesis solver successfully found a solution
769 * for all active synthesis conjectures.
771 * This method adds entries to sol_map that map functions-to-synthesize with
772 * their solutions, for all active conjectures. This should be called
773 * immediately after the solver answers unsat for sygus input.
775 * For details on what is added to sol_map, see
776 * SynthConjecture::getSynthSolutions.
778 bool getSynthSolutions(std::map
<Node
, std::map
<Node
, Node
> >& sol_map
);
781 * Get the model builder
783 theory::TheoryEngineModelBuilder
* getModelBuilder() { return d_curr_model_builder
; }
786 * Get the theory associated to a given Node.
788 * @returns the theory, or NULL if the TNode is
791 inline theory::Theory
* theoryOf(TNode node
) const {
792 return d_theoryTable
[theory::Theory::theoryOf(node
)];
796 * Get the theory associated to a the given theory id.
798 * @returns the theory
800 inline theory::Theory
* theoryOf(theory::TheoryId theoryId
) const {
801 Assert(theoryId
< theory::THEORY_LAST
);
802 return d_theoryTable
[theoryId
];
805 inline bool isTheoryEnabled(theory::TheoryId theoryId
) const {
806 return d_logicInfo
.isTheoryEnabled(theoryId
);
808 /** get the logic info used by this theory engine */
809 const LogicInfo
& getLogicInfo() const;
811 * Returns the equality status of the two terms, from the theory
812 * that owns the domain type. The types of a and b must be the same.
814 theory::EqualityStatus
getEqualityStatus(TNode a
, TNode b
);
817 * Returns the value that a theory that owns the type of var currently
818 * has (or null if none);
820 Node
getModelValue(TNode var
);
823 * Takes a literal and returns an equivalent literal that is guaranteed to be a SAT literal
825 Node
ensureLiteral(TNode n
);
828 * Print all instantiations made by the quantifiers module.
830 void printInstantiations( std::ostream
& out
);
833 * Print solution for synthesis conjectures found by ce_guided_instantiation module
835 void printSynthSolution( std::ostream
& out
);
838 * Get list of quantified formulas that were instantiated
840 void getInstantiatedQuantifiedFormulas( std::vector
< Node
>& qs
);
843 * Get instantiation methods
844 * first inputs forall x.q[x] and returns ( q[a], ..., q[z] )
845 * second inputs forall x.q[x] and returns ( a, ..., z )
846 * third and fourth return mappings e.g. forall x.q1[x] -> ( q1[a]...q1[z] ) , ... , forall x.qn[x] -> ( qn[a]...qn[z] )
848 void getInstantiations( Node q
, std::vector
< Node
>& insts
);
849 void getInstantiationTermVectors( Node q
, std::vector
< std::vector
< Node
> >& tvecs
);
850 void getInstantiations( std::map
< Node
, std::vector
< Node
> >& insts
);
851 void getInstantiationTermVectors( std::map
< Node
, std::vector
< std::vector
< Node
> > >& insts
);
854 * Get instantiated conjunction, returns q[t1] ^ ... ^ q[tn] where t1...tn are current set of instantiations for q.
855 * Can be used for quantifier elimination when satisfiable and q[t1] ^ ... ^ q[tn] |= q
857 Node
getInstantiatedConjunction( Node q
);
860 * Forwards an entailment check according to the given theoryOfMode.
861 * See theory.h for documentation on entailmentCheck().
863 std::pair
<bool, Node
> entailmentCheck(
864 options::TheoryOfMode mode
,
866 const theory::EntailmentCheckParameters
* params
= NULL
,
867 theory::EntailmentCheckSideEffects
* out
= NULL
);
870 /** Default visitor for pre-registration */
871 PreRegisterVisitor d_preRegistrationVisitor
;
873 /** Visitor for collecting shared terms */
874 SharedTermsVisitor d_sharedTermsVisitor
;
876 /** Dump the assertions to the dump */
877 void dumpAssertions(const char* tag
);
879 /** For preprocessing pass lifting bit-vectors of size 1 to booleans */
881 void staticInitializeBVOptions(const std::vector
<Node
>& assertions
);
883 Node
ppSimpITE(TNode assertion
);
884 /** Returns false if an assertion simplified to false. */
885 bool donePPSimpITE(std::vector
<Node
>& assertions
);
887 SharedTermsDatabase
* getSharedTermsDatabase() { return &d_sharedTerms
; }
889 theory::eq::EqualityEngine
* getMasterEqualityEngine() { return d_masterEqualityEngine
; }
891 RemoveTermFormulas
* getTermFormulaRemover() { return &d_tform_remover
; }
893 SortInference
* getSortInference() { return &d_sortInfer
; }
895 /** Prints the assertions to the debug stream */
896 void printAssertions(const char* tag
);
898 /** Theory alternative is in use. */
899 bool useTheoryAlternative(const std::string
& name
);
901 /** Enables using a theory alternative by name. */
902 void enableTheoryAlternative(const std::string
& name
);
905 std::set
< std::string
> d_theoryAlternatives
;
907 std::map
< std::string
, std::vector
< theory::Theory
* > > d_attr_handle
;
910 /** Set user attribute.
912 * This function is called when an attribute is set by a user. In SMT-LIBv2
913 * this is done via the syntax (! n :attr)
915 void setUserAttribute(const std::string
& attr
,
917 const std::vector
<Node
>& node_values
,
918 const std::string
& str_value
);
920 /** Handle user attribute.
922 * Associates theory t with the attribute attr. Theory t will be
923 * notified whenever an attribute of name attr is set.
925 void handleUserAttribute(const char* attr
, theory::Theory
* t
);
928 * Check that the theory assertions are satisfied in the model.
929 * This function is called from the smt engine's checkModel routine.
931 void checkTheoryAssertionsWithModel(bool hardFailure
);
934 IntStat d_arithSubstitutionsAdded
;
936 };/* class TheoryEngine */
938 }/* CVC4 namespace */
940 #endif /* CVC4__THEORY_ENGINE_H */