Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/prop/theory_proxy.cpp	Lines:	98	104	94.2 %
Date:	2021-08-01	Branches:	136	324	42.0 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds, Haniel Barbosa, Dejan Jovanovic
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * [[ Add one-line brief description here ]]
 *
 * [[ Add lengthier description here ]]
 * \todo document this file
 */
#include "prop/theory_proxy.h"

#include "context/context.h"
#include "decision/decision_engine.h"
#include "options/decision_options.h"
#include "options/smt_options.h"
#include "prop/cnf_stream.h"
#include "prop/prop_engine.h"
#include "prop/skolem_def_manager.h"
#include "smt/smt_statistics_registry.h"
#include "theory/rewriter.h"
#include "theory/theory_engine.h"
#include "util/statistics_stats.h"

namespace cvc5 {
namespace prop {

TheoryProxy::TheoryProxy(PropEngine* propEngine,
                         TheoryEngine* theoryEngine,
                         decision::DecisionEngine* decisionEngine,
                         SkolemDefManager* skdm,
                         context::Context* context,
                         context::UserContext* userContext,
                         ProofNodeManager* pnm)
    : d_propEngine(propEngine),
      d_cnfStream(nullptr),
      d_decisionEngine(decisionEngine),
      d_theoryEngine(theoryEngine),
      d_queue(context),
      d_tpp(*theoryEngine, userContext, pnm),
      d_skdm(skdm)
{
}

TheoryProxy::~TheoryProxy() {
  /* nothing to do for now */
}

void TheoryProxy::finishInit(CnfStream* cnfStream) { d_cnfStream = cnfStream; }

void TheoryProxy::notifyAssertion(Node a, TNode skolem)
{
  if (skolem.isNull())
  {
    d_decisionEngine->addAssertion(a);
  }
  else
  {
    d_skdm->notifySkolemDefinition(skolem, a);
    d_decisionEngine->addSkolemDefinition(a, skolem);
  }
}

void TheoryProxy::variableNotify(SatVariable var) {
  d_theoryEngine->preRegister(getNode(SatLiteral(var)));
}

void TheoryProxy::theoryCheck(theory::Theory::Effort effort) {
  while (!d_queue.empty()) {
    TNode assertion = d_queue.front();
    d_queue.pop();
    d_theoryEngine->assertFact(assertion);
    d_decisionEngine->notifyAsserted(assertion);
  }
  d_theoryEngine->check(effort);
}

void TheoryProxy::theoryPropagate(std::vector<SatLiteral>& output) {
  // Get the propagated literals
  std::vector<TNode> outputNodes;
  d_theoryEngine->getPropagatedLiterals(outputNodes);
  for (unsigned i = 0, i_end = outputNodes.size(); i < i_end; ++ i) {
    Debug("prop-explain") << "theoryPropagate() => " << outputNodes[i] << std::endl;
    output.push_back(d_cnfStream->getLiteral(outputNodes[i]));
  }
}

void TheoryProxy::explainPropagation(SatLiteral l, SatClause& explanation) {
  TNode lNode = d_cnfStream->getNode(l);
  Debug("prop-explain") << "explainPropagation(" << lNode << ")" << std::endl;

  TrustNode tte = d_theoryEngine->getExplanation(lNode);
  Node theoryExplanation = tte.getNode();
  if (options::produceProofs()
      && options::unsatCoresMode() != options::UnsatCoresMode::ASSUMPTIONS)
  {
    Assert(options::unsatCoresMode() != options::UnsatCoresMode::FULL_PROOF
           || tte.getGenerator());
    d_propEngine->getProofCnfStream()->convertPropagation(tte);
  }
  Debug("prop-explain") << "explainPropagation() => " << theoryExplanation
                        << std::endl;
  explanation.push_back(l);
  if (theoryExplanation.getKind() == kind::AND)
  {
    for (const Node& n : theoryExplanation)
    {
      explanation.push_back(~d_cnfStream->getLiteral(n));
    }
  }
  else
  {
    explanation.push_back(~d_cnfStream->getLiteral(theoryExplanation));
  }
  if (Trace.isOn("sat-proof"))
  {
    std::stringstream ss;
    ss << "TheoryProxy::explainPropagation: clause for lit is ";
    for (unsigned i = 0, size = explanation.size(); i < size; ++i)
    {
      ss << explanation[i] << " [" << d_cnfStream->getNode(explanation[i])
         << "] ";
    }
    Trace("sat-proof") << ss.str() << "\n";
  }
}

void TheoryProxy::enqueueTheoryLiteral(const SatLiteral& l) {
  Node literalNode = d_cnfStream->getNode(l);
  Debug("prop") << "enqueueing theory literal " << l << " " << literalNode << std::endl;
  Assert(!literalNode.isNull());
  d_queue.push(literalNode);
}

SatLiteral TheoryProxy::getNextTheoryDecisionRequest() {
  TNode n = d_theoryEngine->getNextDecisionRequest();
  return n.isNull() ? undefSatLiteral : d_cnfStream->getLiteral(n);
}

SatLiteral TheoryProxy::getNextDecisionEngineRequest(bool &stopSearch) {
  Assert(d_decisionEngine != NULL);
  Assert(stopSearch != true);
  SatLiteral ret = d_decisionEngine->getNext(stopSearch);
  if(stopSearch) {
    Trace("decision") << "  ***  Decision Engine stopped search *** " << std::endl;
  }
  return ret;
}

bool TheoryProxy::theoryNeedCheck() const {
  return d_theoryEngine->needCheck();
}

TNode TheoryProxy::getNode(SatLiteral lit) {
  return d_cnfStream->getNode(lit);
}

void TheoryProxy::notifyRestart() {
  d_propEngine->spendResource(Resource::RestartStep);
  d_theoryEngine->notifyRestart();
}

void TheoryProxy::spendResource(Resource r)
{
  d_theoryEngine->spendResource(r);
}

bool TheoryProxy::isDecisionRelevant(SatVariable var) { return true; }

bool TheoryProxy::isDecisionEngineDone() {
  return d_decisionEngine->isDone();
}

SatValue TheoryProxy::getDecisionPolarity(SatVariable var) {
  return SAT_VALUE_UNKNOWN;
}

CnfStream* TheoryProxy::getCnfStream() { return d_cnfStream; }

TrustNode TheoryProxy::preprocessLemma(TrustNode trn,
                                       std::vector<TrustNode>& newLemmas,
                                       std::vector<Node>& newSkolems)
{
  return d_tpp.preprocessLemma(trn, newLemmas, newSkolems);
}

TrustNode TheoryProxy::preprocess(TNode node,
                                  std::vector<TrustNode>& newLemmas,
                                  std::vector<Node>& newSkolems)
{
  return d_tpp.preprocess(node, newLemmas, newSkolems);
}

TrustNode TheoryProxy::removeItes(TNode node,
                                  std::vector<TrustNode>& newLemmas,
                                  std::vector<Node>& newSkolems)
{
  RemoveTermFormulas& rtf = d_tpp.getRemoveTermFormulas();
  return rtf.run(node, newLemmas, newSkolems, true);
}

void TheoryProxy::getSkolems(TNode node,
                             std::vector<Node>& skAsserts,
                             std::vector<Node>& sks)
{
  std::unordered_set<Node> skolems;
  d_skdm->getSkolems(node, skolems);
  for (const Node& k : skolems)
  {
    sks.push_back(k);
    skAsserts.push_back(d_skdm->getDefinitionForSkolem(k));
  }
}

void TheoryProxy::preRegister(Node n) { d_theoryEngine->preRegister(n); }

}  // namespace prop
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds, Haniel Barbosa, Dejan Jovanovic
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 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.
11		* ****************************************************************************
12		*
13		* [[ Add one-line brief description here ]]
14		*
15		* [[ Add lengthier description here ]]
16		* \todo document this file
17		*/
18		#include "prop/theory_proxy.h"
19
20		#include "context/context.h"
21		#include "decision/decision_engine.h"
22		#include "options/decision_options.h"
23		#include "options/smt_options.h"
24		#include "prop/cnf_stream.h"
25		#include "prop/prop_engine.h"
26		#include "prop/skolem_def_manager.h"
27		#include "smt/smt_statistics_registry.h"
28		#include "theory/rewriter.h"
29		#include "theory/theory_engine.h"
30		#include "util/statistics_stats.h"
31
32		namespace cvc5 {
33		namespace prop {
34
35	9905	TheoryProxy::TheoryProxy(PropEngine* propEngine,
36		TheoryEngine* theoryEngine,
37		decision::DecisionEngine* decisionEngine,
38		SkolemDefManager* skdm,
39		context::Context* context,
40		context::UserContext* userContext,
41	9905	ProofNodeManager* pnm)
42		: d_propEngine(propEngine),
43		d_cnfStream(nullptr),
44		d_decisionEngine(decisionEngine),
45		d_theoryEngine(theoryEngine),
46		d_queue(context),
47		d_tpp(*theoryEngine, userContext, pnm),
48	9905	d_skdm(skdm)
49		{
50	9905	}
51
52	19810	TheoryProxy::~TheoryProxy() {
53		/* nothing to do for now */
54	19810	}
55
56	9905	void TheoryProxy::finishInit(CnfStream* cnfStream) { d_cnfStream = cnfStream; }
57
58	465456	void TheoryProxy::notifyAssertion(Node a, TNode skolem)
59		{
60	465456	if (skolem.isNull())
61		{
62	435563	d_decisionEngine->addAssertion(a);
63		}
64		else
65		{
66	29893	d_skdm->notifySkolemDefinition(skolem, a);
67	29893	d_decisionEngine->addSkolemDefinition(a, skolem);
68		}
69	465456	}
70
71	445414	void TheoryProxy::variableNotify(SatVariable var) {
72	445414	d_theoryEngine->preRegister(getNode(SatLiteral(var)));
73	445414	}
74
75	16198524	void TheoryProxy::theoryCheck(theory::Theory::Effort effort) {
76	28373279	while (!d_queue.empty()) {
77	24349510	TNode assertion = d_queue.front();
78	12174755	d_queue.pop();
79	12174755	d_theoryEngine->assertFact(assertion);
80	12174755	d_decisionEngine->notifyAsserted(assertion);
81		}
82	4023769	d_theoryEngine->check(effort);
83	4023755	}
84
85	4023755	void TheoryProxy::theoryPropagate(std::vector<SatLiteral>& output) {
86		// Get the propagated literals
87	8047510	std::vector<TNode> outputNodes;
88	4023755	d_theoryEngine->getPropagatedLiterals(outputNodes);
89	10277490	for (unsigned i = 0, i_end = outputNodes.size(); i < i_end; ++ i) {
90	6253735	Debug("prop-explain") << "theoryPropagate() => " << outputNodes[i] << std::endl;
91	6253735	output.push_back(d_cnfStream->getLiteral(outputNodes[i]));
92		}
93	4023755	}
94
95	109585	void TheoryProxy::explainPropagation(SatLiteral l, SatClause& explanation) {
96	219170	TNode lNode = d_cnfStream->getNode(l);
97	109585	Debug("prop-explain") << "explainPropagation(" << lNode << ")" << std::endl;
98
99	219170	TrustNode tte = d_theoryEngine->getExplanation(lNode);
100	219170	Node theoryExplanation = tte.getNode();
101	219170	if (options::produceProofs()
102	109585	&& options::unsatCoresMode() != options::UnsatCoresMode::ASSUMPTIONS)
103		{
104	18100	Assert(options::unsatCoresMode() != options::UnsatCoresMode::FULL_PROOF
105		\|\| tte.getGenerator());
106	18100	d_propEngine->getProofCnfStream()->convertPropagation(tte);
107		}
108	219170	Debug("prop-explain") << "explainPropagation() => " << theoryExplanation
109	109585	<< std::endl;
110	109585	explanation.push_back(l);
111	109585	if (theoryExplanation.getKind() == kind::AND)
112		{
113	883795	for (const Node& n : theoryExplanation)
114		{
115	779334	explanation.push_back(~d_cnfStream->getLiteral(n));
116		}
117		}
118		else
119		{
120	5124	explanation.push_back(~d_cnfStream->getLiteral(theoryExplanation));
121		}
122	109585	if (Trace.isOn("sat-proof"))
123		{
124		std::stringstream ss;
125		ss << "TheoryProxy::explainPropagation: clause for lit is ";
126		for (unsigned i = 0, size = explanation.size(); i < size; ++i)
127		{
128		ss << explanation[i] << " [" << d_cnfStream->getNode(explanation[i])
129		<< "] ";
130		}
131		Trace("sat-proof") << ss.str() << "\n";
132		}
133	109585	}
134
135	18175688	void TheoryProxy::enqueueTheoryLiteral(const SatLiteral& l) {
136	36351376	Node literalNode = d_cnfStream->getNode(l);
137	18175688	Debug("prop") << "enqueueing theory literal " << l << " " << literalNode << std::endl;
138	18175688	Assert(!literalNode.isNull());
139	18175688	d_queue.push(literalNode);
140	18175688	}
141
142	2735248	SatLiteral TheoryProxy::getNextTheoryDecisionRequest() {
143	5470494	TNode n = d_theoryEngine->getNextDecisionRequest();
144	5470492	return n.isNull() ? undefSatLiteral : d_cnfStream->getLiteral(n);
145		}
146
147	2675669	SatLiteral TheoryProxy::getNextDecisionEngineRequest(bool &stopSearch) {
148	2675669	Assert(d_decisionEngine != NULL);
149	2675669	Assert(stopSearch != true);
150	2675669	SatLiteral ret = d_decisionEngine->getNext(stopSearch);
151	2675669	if(stopSearch) {
152	50060	Trace("decision") << " * Decision Engine stopped search * " << std::endl;
153		}
154	2675669	return ret;
155		}
156
157	21485	bool TheoryProxy::theoryNeedCheck() const {
158	21485	return d_theoryEngine->needCheck();
159		}
160
161	445414	TNode TheoryProxy::getNode(SatLiteral lit) {
162	445414	return d_cnfStream->getNode(lit);
163		}
164
165	2836	void TheoryProxy::notifyRestart() {
166	2836	d_propEngine->spendResource(Resource::RestartStep);
167	2836	d_theoryEngine->notifyRestart();
168	2836	}
169
170	3319375	void TheoryProxy::spendResource(Resource r)
171		{
172	3319375	d_theoryEngine->spendResource(r);
173	3319375	}
174
175	4628539	bool TheoryProxy::isDecisionRelevant(SatVariable var) { return true; }
176
177	63958	bool TheoryProxy::isDecisionEngineDone() {
178	63958	return d_decisionEngine->isDone();
179		}
180
181	1428740	SatValue TheoryProxy::getDecisionPolarity(SatVariable var) {
182	1428740	return SAT_VALUE_UNKNOWN;
183		}
184
185	1248	CnfStream* TheoryProxy::getCnfStream() { return d_cnfStream; }
186
187	444732	TrustNode TheoryProxy::preprocessLemma(TrustNode trn,
188		std::vector<TrustNode>& newLemmas,
189		std::vector<Node>& newSkolems)
190		{
191	444732	return d_tpp.preprocessLemma(trn, newLemmas, newSkolems);
192		}
193
194	303241	TrustNode TheoryProxy::preprocess(TNode node,
195		std::vector<TrustNode>& newLemmas,
196		std::vector<Node>& newSkolems)
197		{
198	303241	return d_tpp.preprocess(node, newLemmas, newSkolems);
199		}
200
201	4	TrustNode TheoryProxy::removeItes(TNode node,
202		std::vector<TrustNode>& newLemmas,
203		std::vector<Node>& newSkolems)
204		{
205	4	RemoveTermFormulas& rtf = d_tpp.getRemoveTermFormulas();
206	4	return rtf.run(node, newLemmas, newSkolems, true);
207		}
208
209	2734	void TheoryProxy::getSkolems(TNode node,
210		std::vector<Node>& skAsserts,
211		std::vector<Node>& sks)
212		{
213	5468	std::unordered_set<Node> skolems;
214	2734	d_skdm->getSkolems(node, skolems);
215	5142	for (const Node& k : skolems)
216		{
217	2408	sks.push_back(k);
218	2408	skAsserts.push_back(d_skdm->getDefinitionForSkolem(k));
219		}
220	2734	}
221
222	619862	void TheoryProxy::preRegister(Node n) { d_theoryEngine->preRegister(n); }
223
224		} // namespace prop
225	29280	} // namespace cvc5