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
|
/********************* */
/*! \file bv_eager_solver.cpp
** \verbatim
** Top contributors (to current version):
** Mathias Preiner, Liana Hadarean, Tim King
** 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 Eager bit-blasting solver.
**
** Eager bit-blasting solver.
**/
#include "theory/bv/bv_eager_solver.h"
#include "options/bv_options.h"
#include "options/smt_options.h"
#include "theory/bv/bitblast/aig_bitblaster.h"
#include "theory/bv/bitblast/eager_bitblaster.h"
using namespace std;
namespace CVC4 {
namespace theory {
namespace bv {
EagerBitblastSolver::EagerBitblastSolver(context::Context* c, BVSolverLazy* bv)
: d_assertionSet(c),
d_assumptionSet(c),
d_context(c),
d_bitblaster(),
d_aigBitblaster(),
d_useAig(options::bitvectorAig()),
d_bv(bv)
{
}
EagerBitblastSolver::~EagerBitblastSolver() {}
void EagerBitblastSolver::turnOffAig() {
Assert(d_aigBitblaster == nullptr && d_bitblaster == nullptr);
d_useAig = false;
}
void EagerBitblastSolver::initialize() {
Assert(!isInitialized());
if (d_useAig) {
#ifdef CVC4_USE_ABC
d_aigBitblaster.reset(new AigBitblaster());
#else
Unreachable();
#endif
} else {
d_bitblaster.reset(new EagerBitblaster(d_bv, d_context));
}
}
bool EagerBitblastSolver::isInitialized() {
const bool init = d_aigBitblaster != nullptr || d_bitblaster != nullptr;
Assert(!init || !d_useAig || d_aigBitblaster);
Assert(!init || d_useAig || d_bitblaster);
return init;
}
void EagerBitblastSolver::assertFormula(TNode formula) {
d_bv->spendResource(ResourceManager::Resource::BvEagerAssertStep);
Assert(isInitialized());
Debug("bitvector-eager") << "EagerBitblastSolver::assertFormula " << formula
<< "\n";
if (options::incrementalSolving() && d_context->getLevel() > 1)
{
d_assumptionSet.insert(formula);
}
d_assertionSet.insert(formula);
// ensures all atoms are bit-blasted and converted to AIG
if (d_useAig) {
#ifdef CVC4_USE_ABC
d_aigBitblaster->bbFormula(formula);
#else
Unreachable();
#endif
}
else
{
d_bitblaster->bbFormula(formula);
}
}
bool EagerBitblastSolver::checkSat() {
Assert(isInitialized());
if (d_assertionSet.empty()) {
return true;
}
if (d_useAig) {
#ifdef CVC4_USE_ABC
const std::vector<Node> assertions = {d_assertionSet.key_begin(),
d_assertionSet.key_end()};
Assert(!assertions.empty());
Node query = utils::mkAnd(assertions);
return d_aigBitblaster->solve(query);
#else
Unreachable();
#endif
}
if (options::incrementalSolving())
{
const std::vector<Node> assumptions = {d_assumptionSet.key_begin(),
d_assumptionSet.key_end()};
return d_bitblaster->solve(assumptions);
}
return d_bitblaster->solve();
}
bool EagerBitblastSolver::collectModelInfo(TheoryModel* m, bool fullModel)
{
AlwaysAssert(!d_useAig && d_bitblaster);
return d_bitblaster->collectModelInfo(m, fullModel);
}
} // namespace bv
} // namespace theory
} // namespace CVC4
|
