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
|
/********************* */
/*! \file partial_model.h
** \verbatim
** Original author: taking
** Major contributors: none
** Minor contributors (to current version): mdeters
** This file is part of the CVC4 prototype.
** Copyright (c) 2009, 2010, 2011 The Analysis of Computer Systems Group (ACSys)
** Courant Institute of Mathematical Sciences
** New York University
** 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 "context/context.h"
#include "context/cdvector.h"
#include "theory/arith/arith_utilities.h"
#include "theory/arith/delta_rational.h"
#include "expr/attribute.h"
#include "expr/node.h"
#include <deque>
#ifndef __CVC4__THEORY__ARITH__PARTIAL_MODEL_H
#define __CVC4__THEORY__ARITH__PARTIAL_MODEL_H
namespace CVC4 {
namespace theory {
namespace arith {
class ArithPartialModel {
private:
unsigned d_mapSize;
//Maps from ArithVar -> T
std::vector<bool> d_hasHadABound;
std::vector<bool> d_hasSafeAssignment;
std::vector<DeltaRational> d_assignment;
std::vector<DeltaRational> d_safeAssignment;
context::CDVector<DeltaRational> d_upperBound;
context::CDVector<DeltaRational> d_lowerBound;
context::CDVector<Node> d_upperConstraint;
context::CDVector<Node> d_lowerConstraint;
bool d_deltaIsSafe;
Rational d_delta;
/**
* List contains all of the variables that have an unsafe assignment.
*/
typedef std::vector<ArithVar> HistoryList;
HistoryList d_history;
public:
ArithPartialModel(context::Context* c):
d_mapSize(0),
d_hasHadABound(),
d_hasSafeAssignment(),
d_assignment(),
d_safeAssignment(),
d_upperBound(c, true),
d_lowerBound(c, true),
d_upperConstraint(c,true),
d_lowerConstraint(c,true),
d_deltaIsSafe(false),
d_delta(-1,1),
d_history()
{ }
void setLowerConstraint(ArithVar x, TNode constraint);
void setUpperConstraint(ArithVar x, TNode constraint);
TNode getLowerConstraint(ArithVar x);
TNode getUpperConstraint(ArithVar x);
/* Initializes a variable to a safe value.*/
void initialize(ArithVar x, const DeltaRational& r);
/* Gets the last assignment to a variable that is known to be consistent. */
const DeltaRational& getSafeAssignment(ArithVar x) const;
const DeltaRational& getAssignment(ArithVar x, bool safe) const;
/* Reverts all variable assignments to their safe values. */
void revertAssignmentChanges();
/* Commits all variables assignments as safe.*/
void commitAssignmentChanges();
void setUpperBound(ArithVar x, const DeltaRational& r);
void setLowerBound(ArithVar x, const DeltaRational& r);
/* Sets an unsafe variable assignment */
void setAssignment(ArithVar x, const DeltaRational& r);
void setAssignment(ArithVar x, const DeltaRational& safe, const DeltaRational& r);
/** Must know that the bound exists before calling this! */
const DeltaRational& getUpperBound(ArithVar x);
const DeltaRational& getLowerBound(ArithVar x);
const DeltaRational& getAssignment(ArithVar x) const;
/**
* x >= l
* ? c < l
*/
bool belowLowerBound(ArithVar x, const DeltaRational& c, bool strict);
/**
* x <= u
* ? c > u
*/
bool aboveUpperBound(ArithVar x, const DeltaRational& c, bool strict);
bool equalsLowerBound(ArithVar x, const DeltaRational& c);
bool equalsUpperBound(ArithVar x, const DeltaRational& c);
/**
* x <= u
* ? c < u
*/
bool strictlyBelowUpperBound(ArithVar x, const DeltaRational& c);
/**
* x <= u
* ? c < u
*/
bool strictlyAboveLowerBound(ArithVar x, const DeltaRational& c);
bool strictlyBelowUpperBound(ArithVar x);
bool strictlyAboveLowerBound(ArithVar x);
bool assignmentIsConsistent(ArithVar x);
void printModel(ArithVar x);
/** returns true iff x has both a lower and upper bound. */
bool hasEitherBound(ArithVar x);
inline bool hasLowerBound(ArithVar x){
return !d_lowerConstraint[x].isNull();
}
inline bool hasUpperBound(ArithVar x){
return !d_upperConstraint[x].isNull();
}
bool hasEverHadABound(ArithVar var){
return d_hasHadABound[var];
}
const Rational& getDelta(){
if(!d_deltaIsSafe){
computeDelta();
}
return d_delta;
}
private:
void computeDelta();
void deltaIsSmallerThan(const DeltaRational& l, const DeltaRational& u);
/**
* This function implements the mostly identical:
* revertAssignmentChanges() and commitAssignmentChanges().
*/
void clearSafeAssignments(bool revert);
bool equalSizes();
bool inMaps(ArithVar x) const{
return 0 <= x && x < d_mapSize;
}
};/* class ArithPartialModel */
}/* CVC4::theory::arith namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
#endif /* __CVC4__THEORY__ARITH__PARTIAL_MODEL_H */
|
