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
|
/********************* */
/*! \file bv_subtheory_eq.cpp
** \verbatim
** Original author: lianah
** Major contributors: dejan
** Minor contributors (to current version): none
** 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 Algebraic solver.
**
** Algebraic solver.
**/
#include "theory/bv/bv_subtheory_eq.h"
#include "theory/bv/theory_bv.h"
#include "theory/bv/theory_bv_utils.h"
using namespace std;
using namespace CVC4;
using namespace CVC4::context;
using namespace CVC4::theory;
using namespace CVC4::theory::bv;
using namespace CVC4::theory::bv::utils;
EqualitySolver::EqualitySolver(context::Context* c, TheoryBV* bv)
: SubtheorySolver(c, bv),
d_notify(bv),
d_equalityEngine(d_notify, c, "theory::bv::TheoryBV")
{
if (d_useEqualityEngine) {
// The kinds we are treating as function application in congruence
d_equalityEngine.addFunctionKind(kind::BITVECTOR_CONCAT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_AND);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_OR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_XOR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_NOT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_NAND);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_NOR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_XNOR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_COMP);
d_equalityEngine.addFunctionKind(kind::BITVECTOR_MULT);
d_equalityEngine.addFunctionKind(kind::BITVECTOR_PLUS);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SUB);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_NEG);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_UDIV);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_UREM);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SDIV);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SREM);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SMOD);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SHL);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_LSHR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_ASHR);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_ULT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_ULE);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_UGT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_UGE);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SLT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SLE);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SGT);
// d_equalityEngine.addFunctionKind(kind::BITVECTOR_SGE);
}
}
void EqualitySolver::preRegister(TNode node) {
if (!d_useEqualityEngine)
return;
if (node.getKind() == kind::EQUAL) {
d_equalityEngine.addTriggerEquality(node);
} else {
d_equalityEngine.addTerm(node);
}
}
void EqualitySolver::explain(TNode literal, std::vector<TNode>& assumptions) {
bool polarity = literal.getKind() != kind::NOT;
TNode atom = polarity ? literal : literal[0];
if (atom.getKind() == kind::EQUAL) {
d_equalityEngine.explainEquality(atom[0], atom[1], polarity, assumptions);
} else {
d_equalityEngine.explainPredicate(atom, polarity, assumptions);
}
}
bool EqualitySolver::addAssertions(const std::vector<TNode>& assertions, Theory::Effort e) {
BVDebug("bitvector::equality") << "EqualitySolver::addAssertions \n";
Assert (!d_bv->inConflict());
for (unsigned i = 0; i < assertions.size(); ++i) {
TNode fact = assertions[i];
// Notify the equality engine
if (d_useEqualityEngine && !d_bv->inConflict() && !d_bv->propagatedBy(fact, TheoryBV::TheoryBV::SUB_EQUALITY) ) {
bool negated = fact.getKind() == kind::NOT;
TNode predicate = negated ? fact[0] : fact;
if (predicate.getKind() == kind::EQUAL) {
if (negated) {
// dis-equality
d_equalityEngine.assertEquality(predicate, false, fact);
} else {
// equality
d_equalityEngine.assertEquality(predicate, true, fact);
}
} else {
// Adding predicate if the congruence over it is turned on
if (d_equalityEngine.isFunctionKind(predicate.getKind())) {
d_equalityEngine.assertPredicate(predicate, !negated, fact);
}
}
}
// checking for a conflict
if (d_bv->inConflict()) {
return false;
}
}
return true;
}
bool EqualitySolver::NotifyClass::eqNotifyTriggerEquality(TNode equality, bool value) {
BVDebug("bitvector::equality") << "NotifyClass::eqNotifyTriggerEquality(" << equality << ", " << (value ? "true" : "false" )<< ")" << std::endl;
if (value) {
return d_bv->storePropagation(equality, TheoryBV::SUB_EQUALITY);
} else {
return d_bv->storePropagation(equality.notNode(), TheoryBV::SUB_EQUALITY);
}
}
bool EqualitySolver::NotifyClass::eqNotifyTriggerPredicate(TNode predicate, bool value) {
BVDebug("bitvector::equality") << "NotifyClass::eqNotifyTriggerPredicate(" << predicate << ", " << (value ? "true" : "false" )<< ")" << std::endl;
if (value) {
return d_bv->storePropagation(predicate, TheoryBV::SUB_EQUALITY);
} else {
return d_bv->storePropagation(predicate.notNode(), TheoryBV::SUB_EQUALITY);
}
}
bool EqualitySolver::NotifyClass::eqNotifyTriggerTermEquality(TheoryId tag, TNode t1, TNode t2, bool value) {
Debug("bitvector::equality") << "NotifyClass::eqNotifyTriggerTermMerge(" << t1 << ", " << t2 << std::endl;
if (value) {
return d_bv->storePropagation(t1.eqNode(t2), TheoryBV::SUB_EQUALITY);
} else {
return d_bv->storePropagation(t1.eqNode(t2).notNode(), TheoryBV::SUB_EQUALITY);
}
}
bool EqualitySolver::NotifyClass::eqNotifyConstantTermMerge(TNode t1, TNode t2) {
Debug("bitvector::equality") << "NotifyClass::eqNotifyConstantTermMerge(" << t1 << ", " << t2 << std::endl;
if (Theory::theoryOf(t1) == THEORY_BOOL) {
return d_bv->storePropagation(t1.iffNode(t2), TheoryBV::SUB_EQUALITY);
}
return d_bv->storePropagation(t1.eqNode(t2), TheoryBV::SUB_EQUALITY);
}
|
