1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
/********************* */
/*! \file assertions.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Andres Noetzli, Haniel Barbosa
** This file is part of the CVC4 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.\endverbatim
**
** \brief The module for storing assertions for an SMT engine.
**/
#include "smt/assertions.h"
#include <sstream>
#include "expr/node_algorithm.h"
#include "options/base_options.h"
#include "options/expr_options.h"
#include "options/language.h"
#include "options/smt_options.h"
#include "proof/proof_manager.h"
#include "smt/abstract_values.h"
#include "smt/smt_engine.h"
using namespace cvc5::theory;
using namespace cvc5::kind;
namespace cvc5 {
namespace smt {
Assertions::Assertions(context::UserContext* u, AbstractValues& absv)
: d_userContext(u),
d_absValues(absv),
d_assertionList(nullptr),
d_globalNegation(false),
d_assertions()
{
}
Assertions::~Assertions()
{
if (d_assertionList != nullptr)
{
d_assertionList->deleteSelf();
}
}
void Assertions::finishInit()
{
// [MGD 10/20/2011] keep around in incremental mode, due to a
// cleanup ordering issue and Nodes/TNodes. If SAT is popped
// first, some user-context-dependent TNodes might still exist
// with rc == 0.
if (options::produceAssertions() || options::incrementalSolving())
{
// In the case of incremental solving, we appear to need these to
// ensure the relevant Nodes remain live.
d_assertionList = new (true) AssertionList(d_userContext);
d_globalDefineFunRecLemmas.reset(new std::vector<Node>());
}
}
void Assertions::clearCurrent()
{
d_assertions.clear();
d_assertions.getIteSkolemMap().clear();
}
void Assertions::initializeCheckSat(const std::vector<Node>& assumptions,
bool inUnsatCore,
bool isEntailmentCheck)
{
NodeManager* nm = NodeManager::currentNM();
// reset global negation
d_globalNegation = false;
// clear the assumptions
d_assumptions.clear();
if (isEntailmentCheck)
{
size_t size = assumptions.size();
if (size > 1)
{
/* Assume: not (BIGAND assumptions) */
d_assumptions.push_back(nm->mkNode(AND, assumptions).notNode());
}
else if (size == 1)
{
/* Assume: not expr */
d_assumptions.push_back(assumptions[0].notNode());
}
}
else
{
/* Assume: BIGAND assumptions */
d_assumptions = assumptions;
}
Result r(Result::SAT_UNKNOWN, Result::UNKNOWN_REASON);
for (const Node& e : d_assumptions)
{
// Substitute out any abstract values in ex.
Node n = d_absValues.substituteAbstractValues(e);
// Ensure expr is type-checked at this point.
ensureBoolean(n);
addFormula(n, inUnsatCore, true, true, false);
}
if (d_globalDefineFunRecLemmas != nullptr)
{
// Global definitions are asserted at check-sat-time because we have to
// make sure that they are always present (they are essentially level
// zero assertions)
for (const Node& lemma : *d_globalDefineFunRecLemmas)
{
addFormula(lemma, false, true, false, false);
}
}
}
void Assertions::assertFormula(const Node& n, bool inUnsatCore)
{
ensureBoolean(n);
bool maybeHasFv = language::isInputLangSygus(options::inputLanguage());
addFormula(n, inUnsatCore, true, false, maybeHasFv);
}
std::vector<Node>& Assertions::getAssumptions() { return d_assumptions; }
bool Assertions::isGlobalNegated() const { return d_globalNegation; }
void Assertions::flipGlobalNegated() { d_globalNegation = !d_globalNegation; }
preprocessing::AssertionPipeline& Assertions::getAssertionPipeline()
{
return d_assertions;
}
context::CDList<Node>* Assertions::getAssertionList()
{
return d_assertionList;
}
void Assertions::addFormula(
TNode n, bool inUnsatCore, bool inInput, bool isAssumption, bool maybeHasFv)
{
// add to assertion list if it exists
if (d_assertionList != nullptr)
{
d_assertionList->push_back(n);
}
if (n.isConst() && n.getConst<bool>())
{
// true, nothing to do
return;
}
Trace("smt") << "SmtEnginePrivate::addFormula(" << n
<< "), inUnsatCore = " << inUnsatCore
<< ", inInput = " << inInput
<< ", isAssumption = " << isAssumption << std::endl;
// Ensure that it does not contain free variables
if (maybeHasFv)
{
if (expr::hasFreeVar(n))
{
std::stringstream se;
se << "Cannot process assertion with free variable.";
if (language::isInputLangSygus(options::inputLanguage()))
{
// Common misuse of SyGuS is to use top-level assert instead of
// constraint when defining the synthesis conjecture.
se << " Perhaps you meant `constraint` instead of `assert`?";
}
throw ModalException(se.str().c_str());
}
}
// Give it to the old proof manager
if (options::unsatCores() && !isProofEnabled())
{
if (inInput)
{ // n is an input assertion
if (inUnsatCore || options::unsatCores() || options::dumpUnsatCores()
|| options::checkUnsatCores())
{
ProofManager::currentPM()->addCoreAssertion(n);
}
}
else
{
// n is the result of an unknown preprocessing step, add it to dependency
// map to null
ProofManager::currentPM()->addDependence(n, Node::null());
}
}
// Add the normalized formula to the queue
d_assertions.push_back(n, isAssumption, true);
}
void Assertions::addDefineFunRecDefinition(Node n, bool global)
{
n = d_absValues.substituteAbstractValues(n);
if (d_assertionList != nullptr)
{
d_assertionList->push_back(n);
}
if (global && d_globalDefineFunRecLemmas != nullptr)
{
// Global definitions are asserted at check-sat-time because we have to
// make sure that they are always present
Assert(!language::isInputLangSygus(options::inputLanguage()));
d_globalDefineFunRecLemmas->emplace_back(n);
}
else
{
bool maybeHasFv = language::isInputLangSygus(options::inputLanguage());
addFormula(n, false, true, false, maybeHasFv);
}
}
void Assertions::ensureBoolean(const Node& n)
{
TypeNode type = n.getType(options::typeChecking());
if (!type.isBoolean())
{
std::stringstream ss;
ss << "Expected Boolean type\n"
<< "The assertion : " << n << "\n"
<< "Its type : " << type;
throw TypeCheckingExceptionPrivate(n, ss.str());
}
}
void Assertions::setProofGenerator(smt::PreprocessProofGenerator* pppg)
{
d_assertions.setProofGenerator(pppg);
}
bool Assertions::isProofEnabled() const
{
return d_assertions.isProofEnabled();
}
} // namespace smt
} // namespace cvc5
|
