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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Andres Noetzli, Gereon Kremer
*
* 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.
* ****************************************************************************
*
* Implementation of utilities for initializing subsolvers (copies of
* SmtEngine) during solving.
*/
#include "theory/smt_engine_subsolver.h"
#include "smt/smt_engine.h"
#include "smt/smt_engine_scope.h"
#include "theory/rewriter.h"
namespace cvc5 {
namespace theory {
// optimization: try to rewrite to constant
Result quickCheck(Node& query)
{
query = theory::Rewriter::rewrite(query);
if (query.isConst())
{
if (!query.getConst<bool>())
{
return Result(Result::UNSAT);
}
else
{
return Result(Result::SAT);
}
}
return Result(Result::SAT_UNKNOWN, Result::REQUIRES_FULL_CHECK);
}
void initializeSubsolver(std::unique_ptr<SmtEngine>& smte,
Options* opts,
bool needsTimeout,
unsigned long timeout)
{
NodeManager* nm = NodeManager::currentNM();
SmtEngine* smtCurr = smt::currentSmtEngine();
if (opts == nullptr)
{
// must copy the options
opts = &smtCurr->getOptions();
}
smte.reset(new SmtEngine(nm, opts));
smte->setIsInternalSubsolver();
smte->setLogic(smtCurr->getLogicInfo());
// set the options
if (needsTimeout)
{
smte->setTimeLimit(timeout);
}
}
Result checkWithSubsolver(std::unique_ptr<SmtEngine>& smte,
Node query,
Options* opts,
bool needsTimeout,
unsigned long timeout)
{
Assert(query.getType().isBoolean());
Result r = quickCheck(query);
if (!r.isUnknown())
{
return r;
}
initializeSubsolver(smte, opts, needsTimeout, timeout);
smte->assertFormula(query);
return smte->checkSat();
}
Result checkWithSubsolver(Node query,
Options* opts,
bool needsTimeout,
unsigned long timeout)
{
std::vector<Node> vars;
std::vector<Node> modelVals;
return checkWithSubsolver(
query, vars, modelVals, opts, needsTimeout, timeout);
}
Result checkWithSubsolver(Node query,
const std::vector<Node>& vars,
std::vector<Node>& modelVals,
Options* opts,
bool needsTimeout,
unsigned long timeout)
{
Assert(query.getType().isBoolean());
Assert(modelVals.empty());
// ensure clear
modelVals.clear();
Result r = quickCheck(query);
if (!r.isUnknown())
{
if (r.asSatisfiabilityResult().isSat() == Result::SAT)
{
// default model
for (const Node& v : vars)
{
modelVals.push_back(v.getType().mkGroundTerm());
}
}
return r;
}
std::unique_ptr<SmtEngine> smte;
initializeSubsolver(smte, opts, needsTimeout, timeout);
smte->assertFormula(query);
r = smte->checkSat();
if (r.asSatisfiabilityResult().isSat() == Result::SAT)
{
for (const Node& v : vars)
{
Node val = smte->getValue(v);
modelVals.push_back(val);
}
}
return r;
}
} // namespace theory
} // namespace cvc5
|
