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
|
/********************* */
/*! \file callbacks.cpp
** \verbatim
** Top contributors (to current version):
** Tim King, Morgan Deters, Paul Meng
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 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 [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "theory/arith/callbacks.h"
#include "theory/arith/theory_arith_private.h"
namespace CVC4 {
namespace theory {
namespace arith {
SetupLiteralCallBack::SetupLiteralCallBack(TheoryArithPrivate& ta)
: d_arith(ta)
{}
void SetupLiteralCallBack::operator()(TNode lit){
TNode atom = (lit.getKind() == kind::NOT) ? lit[0] : lit;
if(!d_arith.isSetup(atom)){
d_arith.setupAtom(atom);
}
}
DeltaComputeCallback::DeltaComputeCallback(const TheoryArithPrivate& ta)
: d_ta(ta)
{}
Rational DeltaComputeCallback::operator()() const{
return d_ta.deltaValueForTotalOrder();
}
TempVarMalloc::TempVarMalloc(TheoryArithPrivate& ta)
: d_ta(ta)
{}
ArithVar TempVarMalloc::request(){
Node skolem = mkRealSkolem("tmpVar");
return d_ta.requestArithVar(skolem, false, true);
}
void TempVarMalloc::release(ArithVar v){
d_ta.releaseArithVar(v);
}
BasicVarModelUpdateCallBack::BasicVarModelUpdateCallBack(TheoryArithPrivate& ta)
: d_ta(ta)
{}
void BasicVarModelUpdateCallBack::operator()(ArithVar x){
d_ta.signal(x);
}
RaiseConflict::RaiseConflict(TheoryArithPrivate& ta)
: d_ta(ta)
{}
void RaiseConflict::raiseConflict(ConstraintCP c) const{
Assert(c->inConflict());
d_ta.raiseConflict(c);
}
FarkasConflictBuilder::FarkasConflictBuilder()
: d_farkas()
, d_constraints()
, d_consequent(NullConstraint)
, d_consequentSet(false)
{
reset();
}
bool FarkasConflictBuilder::underConstruction() const{
return d_consequent != NullConstraint;
}
bool FarkasConflictBuilder::consequentIsSet() const{
return d_consequentSet;
}
void FarkasConflictBuilder::reset(){
d_consequent = NullConstraint;
d_constraints.clear();
d_consequentSet = false;
PROOF(d_farkas.clear());
Assert(!underConstruction());
}
/* Adds a constraint to the constraint under construction. */
void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc){
Assert(!PROOF_ON() ||
(!underConstruction() && d_constraints.empty() && d_farkas.empty()) ||
(underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
Assert(PROOF_ON() || d_farkas.empty());
Assert(c->isTrue());
if(d_consequent == NullConstraint){
d_consequent = c;
} else {
d_constraints.push_back(c);
}
PROOF(d_farkas.push_back(fc););
Assert(!PROOF_ON() || d_constraints.size() + 1 == d_farkas.size());
Assert(PROOF_ON() || d_farkas.empty());
}
void FarkasConflictBuilder::addConstraint(ConstraintCP c, const Rational& fc, const Rational& mult){
Assert(!mult.isZero());
if(PROOF_ON() && !mult.isOne()){
Rational prod = fc * mult;
addConstraint(c, prod);
}else{
addConstraint(c, fc);
}
}
void FarkasConflictBuilder::makeLastConsequent(){
Assert(!d_consequentSet);
Assert(underConstruction());
if(d_constraints.empty()){
// no-op
d_consequentSet = true;
} else {
Assert(d_consequent != NullConstraint);
ConstraintCP last = d_constraints.back();
d_constraints.back() = d_consequent;
d_consequent = last;
PROOF( std::swap( d_farkas.front(), d_farkas.back() ) );
d_consequentSet = true;
}
Assert(! d_consequent->negationHasProof() );
Assert(d_consequentSet);
}
/* Turns the vector under construction into a conflict */
ConstraintCP FarkasConflictBuilder::commitConflict(){
Assert(underConstruction());
Assert(!d_constraints.empty());
Assert(!PROOF_ON() ||
(!underConstruction() && d_constraints.empty() && d_farkas.empty()) ||
(underConstruction() && d_constraints.size() + 1 == d_farkas.size()));
Assert(PROOF_ON() || d_farkas.empty());
Assert(d_consequentSet);
ConstraintP not_c = d_consequent->getNegation();
RationalVectorCP coeffs = NULLPROOF(&d_farkas);
not_c->impliedByFarkas(d_constraints, coeffs, true );
reset();
Assert(!underConstruction());
Assert( not_c->inConflict() );
Assert(!d_consequentSet);
return not_c;
}
RaiseEqualityEngineConflict::RaiseEqualityEngineConflict(TheoryArithPrivate& ta)
: d_ta(ta)
{}
/* If you are not an equality engine, don't use this! */
void RaiseEqualityEngineConflict::raiseEEConflict(Node n) const{
d_ta.raiseBlackBoxConflict(n);
}
BoundCountingLookup::BoundCountingLookup(TheoryArithPrivate& ta)
: d_ta(ta)
{}
const BoundsInfo& BoundCountingLookup::boundsInfo(ArithVar basic) const{
return d_ta.boundsInfo(basic);
}
BoundCounts BoundCountingLookup::atBounds(ArithVar basic) const{
return boundsInfo(basic).atBounds();
}
BoundCounts BoundCountingLookup::hasBounds(ArithVar basic) const {
return boundsInfo(basic).hasBounds();
}
}/* CVC4::theory::arith namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
