#include "structs.h"
#include "orderresolver.h"
#include "integerencoding.h"
-#include <stdlib.h>
+#include "qsort.h"
+#include "preprocess.h"
+#include "serializer.h"
+#include "deserializer.h"
+#include "encodinggraph.h"
CSolver::CSolver() :
boolTrue(BooleanEdge(new BooleanConst(true))),
SetIteratorBooleanEdge *it = getConstraints();
while (it->hasNext()) {
BooleanEdge b = it->next();
- copy->addConstraint(b->clone(copy, &map));
+ copy->addConstraint(cloneEdge(copy, &map, b));
}
delete it;
return copy;
}
+void CSolver::serialize() {
+ model_print("serializing ...\n");
+ {
+ Serializer serializer("dump");
+ SetIteratorBooleanEdge *it = getConstraints();
+ while (it->hasNext()) {
+ BooleanEdge b = it->next();
+ serializeBooleanEdge(&serializer, b);
+ }
+ delete it;
+ }
+ model_print("deserializing ...\n");
+ {
+ Deserializer deserializer("dump");
+ deserializer.deserialize();
+ }
+
+}
+
Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
Set *set = new Set(type, elements, numelements);
allSets.push(set);
return set;
}
+VarType CSolver::getSetVarType(Set *set){
+ return set->getType();
+}
+
Element *CSolver::createRangeVar(VarType type, uint64_t lowrange, uint64_t highrange) {
Set *s = createRangeSet(type, lowrange, highrange);
return getElementVar(s);
return element;
}
+void CSolver::finalizeMutableSet(MutableSet* set){
+ set->finalize();
+}
+
Element *CSolver::getElementVar(Set *set) {
Element *element = new ElementSet(set);
allElements.push(element);
return element;
}
+Set* CSolver::getElementRange (Element* element){
+ return element->getRange();
+}
+
+
Element *CSolver::getElementConst(VarType type, uint64_t value) {
uint64_t array[] = {value};
Set *set = new Set(type, array, 1);
- Element *element = new ElementConst(value, type, set);
+ Element *element = new ElementConst(value, set);
Element *e = elemMap.get(element);
if (e == NULL) {
allSets.push(set);
Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
Element *e = elemMap.get(element);
if (e == NULL) {
+ element->updateParents();
allElements.push(element);
elemMap.put(element, element);
return element;
}
BooleanEdge CSolver::applyPredicate(Predicate *predicate, Element **inputs, uint numInputs) {
- return applyPredicateTable(predicate, inputs, numInputs, NULL);
+ return applyPredicateTable(predicate, inputs, numInputs, BooleanEdge(NULL));
}
BooleanEdge CSolver::applyPredicateTable(Predicate *predicate, Element **inputs, uint numInputs, BooleanEdge undefinedStatus) {
BooleanPredicate *boolean = new BooleanPredicate(predicate, inputs, numInputs, undefinedStatus);
Boolean *b = boolMap.get(boolean);
if (b == NULL) {
+ boolean->updateParents();
boolMap.put(boolean, boolean);
allBooleans.push(boolean);
return BooleanEdge(boolean);
}
bool CSolver::isTrue(BooleanEdge b) {
- return b.isNegated()?b->isFalse():b->isTrue();
+ return b.isNegated()?b->isFalse():b->isTrue();
}
bool CSolver::isFalse(BooleanEdge b) {
- return b.isNegated()?b->isTrue():b->isFalse();
+ return b.isNegated()?b->isTrue():b->isFalse();
}
BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge arg1, BooleanEdge arg2) {
return 1;
}
+BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) {
+ BooleanEdge newarray[asize];
+ memcpy(newarray, array, asize * sizeof(BooleanEdge));
+ for(uint i=0; i < asize; i++) {
+ BooleanEdge b=newarray[i];
+ if (b->type == LOGICOP) {
+ if (((BooleanLogic *) b.getBoolean())->replaced) {
+ newarray[i] = doRewrite(newarray[i]);
+ i--;//Check again
+ }
+ }
+ }
+ return applyLogicalOperation(op, newarray, asize);
+}
+
BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
BooleanEdge newarray[asize];
switch (op) {
case SATC_IFF: {
for (uint i = 0; i < 2; i++) {
if (array[i]->type == BOOLCONST) {
- if (array[i]->isTrue()) {
+ if (isTrue(array[i])) { // It can be undefined
return array[1 - i];
- } else {
+ } else if(isFalse(array[i])) {
newarray[0] = array[1 - i];
return applyLogicalOperation(SATC_NOT, newarray, 1);
}
+ } else if (array[i]->type == LOGICOP) {
+ BooleanLogic *b =(BooleanLogic *)array[i].getBoolean();
+ if (b->replaced) {
+ return rewriteLogicalOperation(op, array, asize);
+ }
}
}
break;
uint newindex = 0;
for (uint i = 0; i < asize; i++) {
BooleanEdge b = array[i];
+ if (b->type == LOGICOP) {
+ if (((BooleanLogic *)b.getBoolean())->replaced)
+ return rewriteLogicalOperation(op, array, asize);
+ }
if (b->type == BOOLCONST) {
- if (b->isTrue())
+ if (isTrue(b))
continue;
- else
+ else{
return boolFalse;
+ }
} else
newarray[newindex++] = b;
}
} else if (newindex == 1) {
return newarray[0];
} else {
- qsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
+ bsdqsort(newarray, newindex, sizeof(BooleanEdge), ptrcompares);
array = newarray;
asize = newindex;
}
Boolean *boolean = new BooleanLogic(this, op, array, asize);
Boolean *b = boolMap.get(boolean);
if (b == NULL) {
+ boolean->updateParents();
boolMap.put(boolean, boolean);
allBooleans.push(boolean);
return BooleanEdge(boolean);
} else {
delete boolean;
- return BooleanEdge(b);
+ return BooleanEdge(boolean);
}
}
BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
+ ASSERT(first != second);
Boolean *constraint = new BooleanOrder(order, first, second);
allBooleans.push(constraint);
return BooleanEdge(constraint);
}
void CSolver::addConstraint(BooleanEdge constraint) {
- if (constraint == boolTrue)
+ if(constraint.isNegated())
+ model_print("!");
+ constraint.getBoolean()->print();
+ if (isTrue(constraint))
return;
- else if (constraint == boolFalse)
+ else if (isFalse(constraint)) {
+ int t=0;
setUnSAT();
+ }
else {
- if (!constraint.isNegated() && constraint->type == LOGICOP) {
+ if (constraint->type == LOGICOP) {
BooleanLogic *b=(BooleanLogic *) constraint.getBoolean();
- if (b->op==SATC_AND) {
- for(uint i=0;i<b->inputs.getSize();i++) {
- addConstraint(b->inputs.get(i));
+ if (!constraint.isNegated()) {
+ if (b->op==SATC_AND) {
+ for(uint i=0;i<b->inputs.getSize();i++) {
+ addConstraint(b->inputs.get(i));
+ }
+ return;
}
+ }
+ if (b->replaced) {
+ addConstraint(doRewrite(constraint));
return;
}
}
constraints.add(constraint);
Boolean *ptr=constraint.getBoolean();
- if (constraint.isNegated())
- updateMustValue(ptr, BV_MUSTBEFALSE);
- else
- updateMustValue(ptr, BV_MUSTBETRUE);
- if (ptr->boolVal == BV_UNSAT)
+ if (ptr->boolVal == BV_UNSAT) {
setUnSAT();
+ }
replaceBooleanWithTrueNoRemove(constraint);
constraint->parents.clear();
long long startTime = getTimeNano();
computePolarities(this);
+ Preprocess pp(this);
+ pp.doTransform();
+
DecomposeOrderTransform dot(this);
dot.doTransform();
- //This leaks like crazy
- // IntegerEncodingTransform iet(this);
- //iet.doTransform();
+ IntegerEncodingTransform iet(this);
+ iet.doTransform();
+ EncodingGraph eg(this);
+ eg.buildGraph();
+ eg.encode();
+
naiveEncodingDecision(this);
satEncoder->encodeAllSATEncoder(this);
+ model_print("Is problem UNSAT after encoding: %d\n", unsat);
int result = unsat ? IS_UNSAT : satEncoder->solve();
+ model_print("Result Computed in CSolver: %d\n", result);
long long finishTime = getTimeNano();
elapsedTime = finishTime - startTime;
if (deleteTuner) {
projects / satune.git / blobdiff