size = allElements.getSize();
for (uint i = 0; i < size; i++) {
Element* el = allElements.get(i);
- model_print("deleting ...%u", i);
- ASSERT(el != NULL);
delete el;
}
for (uint i = 0; i < size; i++) {
delete allOrders.get(i);
}
-
size = allFunctions.getSize();
for (uint i = 0; i < size; i++) {
delete allFunctions.get(i);
return copy;
}
+CSolver* CSolver::deserialize(const char * file){
+ model_print("deserializing ...\n");
+ Deserializer deserializer(file);
+ return deserializer.deserialize();
+}
+
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;
+ printConstraints();
+ Serializer serializer("dump");
+ SetIteratorBooleanEdge *it = getConstraints();
+ while (it->hasNext()) {
+ BooleanEdge b = it->next();
+ serializeBooleanEdge(&serializer, b, true);
}
-// model_print("deserializing ...\n");
-// {
-// Deserializer deserializer("dump");
-// deserializer.deserialize();
-// }
-
+ delete it;
}
Set *CSolver::createSet(VarType type, uint64_t *elements, uint numelements) {
return set;
}
-VarType CSolver::getSetVarType(Set *set){
+VarType CSolver::getSetVarType(Set *set) {
return set->getType();
}
return element;
}
-void CSolver::finalizeMutableSet(MutableSet* set){
+void CSolver::finalizeMutableSet(MutableSet *set) {
set->finalize();
}
Element *CSolver::getElementVar(Set *set) {
Element *element = new ElementSet(set);
- model_println("%%%%ElementVar:%u", allElements.getSize());
allElements.push(element);
return element;
}
-Set* CSolver::getElementRange (Element* element){
+Set *CSolver::getElementRange (Element *element) {
return element->getRange();
}
Element *e = elemMap.get(element);
if (e == NULL) {
allSets.push(set);
- model_println("%%%%ElementConst:%u", allElements.getSize());
allElements.push(element);
elemMap.put(element, element);
return element;
}
}
+
Element *CSolver::applyFunction(Function *function, Element **array, uint numArrays, BooleanEdge overflowstatus) {
Element *element = new ElementFunction(function,array,numArrays,overflowstatus);
Element *e = elemMap.get(element);
if (e == NULL) {
element->updateParents();
- model_println("%%%%ElementFunction:%u", allElements.getSize());
allElements.push(element);
elemMap.put(element, element);
return element;
}
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) {
static int ptrcompares(const void *p1, const void *p2) {
uintptr_t b1 = *(uintptr_t const *) p1;
- uintptr_t b2 = *(uintptr_t const *) p2;
+ uintptr_t b2 = *(uintptr_t const *) p2;
if (b1 < b2)
return -1;
else if (b1 == b2)
return 1;
}
-BooleanEdge CSolver::rewriteLogicalOperation(LogicOp op, BooleanEdge * array, uint asize) {
- return applyLogicalOperation(op, array, asize);
- /* BooleanEdge newarray[asize];
+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];
+ 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]);
}
}
}
- return applyLogicalOperation(op, newarray, asize);*/
+ return applyLogicalOperation(op, newarray, asize);
}
BooleanEdge CSolver::applyLogicalOperation(LogicOp op, BooleanEdge *array, uint asize) {
}
case SATC_IFF: {
for (uint i = 0; i < 2; i++) {
- if (array[i]->type == BOOLCONST) {
- if (isTrue(array[i])) { // It can be undefined
- return array[1 - i];
- } else if(isFalse(array[i])) {
- newarray[0] = array[1 - i];
- return applyLogicalOperation(SATC_NOT, newarray, 1);
- }
+ if (isTrue(array[i])) { // It can be undefined
+ return array[1 - i];
+ } 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();
+ BooleanLogic *b = (BooleanLogic *)array[i].getBoolean();
if (b->replaced) {
return rewriteLogicalOperation(op, array, asize);
}
break;
}
case SATC_OR: {
- for (uint i =0; i <asize; i++) {
+ for (uint i = 0; i < asize; i++) {
newarray[i] = applyLogicalOperation(SATC_NOT, array[i]);
}
return applyLogicalOperation(SATC_NOT, applyLogicalOperation(SATC_AND, newarray, asize));
uint newindex = 0;
for (uint i = 0; i < asize; i++) {
BooleanEdge b = array[i];
-// model_print("And: Argument %u:", i);
-// if(b.isNegated())
-// model_print("!");
-// b->print();
if (b->type == LOGICOP) {
if (((BooleanLogic *)b.getBoolean())->replaced)
return rewriteLogicalOperation(op, array, asize);
}
- if (b->type == BOOLCONST) {
- if (isTrue(b))
- continue;
- else{
- return boolFalse;
- }
+ if (isTrue(b))
+ continue;
+ else if (isFalse(b)) {
+ return boolFalse;
} else
newarray[newindex++] = b;
}
}
case SATC_IMPLIES: {
//handle by translation
-// model_print("Implies: first:");
-// if(array[0].isNegated())
-// model_print("!");
-// array[0]->print();
-// model_print("Implies: second:");
-// if(array[1].isNegated())
-// model_print("!");
-// array[1]->print();
-// model_println("##### OK let's get the operation done");
return applyLogicalOperation(SATC_OR, applyLogicalOperation(SATC_NOT, array[0]), array[1]);
}
}
ASSERT(asize != 0);
Boolean *boolean = new BooleanLogic(this, op, array, asize);
- /* Boolean *b = boolMap.get(boolean);
+ 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(boolean);
- /* }*/
+ delete boolean;
+ return BooleanEdge(b);
+ }
}
BooleanEdge CSolver::orderConstraint(Order *order, uint64_t first, uint64_t second) {
-#ifdef TRACE_DEBUG
- model_println("Creating order: From:%lu => To:%lu", first, second);
-#endif
- if(first == second)
- return boolFalse;
+ // ASSERT(first != second);
+ if (first == second)
+ return getBooleanFalse();
+
+ bool negate = false;
+ if (order->type == SATC_TOTAL) {
+ if (first > second) {
+ uint64_t tmp = first;
+ first = second;
+ second = tmp;
+ negate = true;
+ }
+ }
Boolean *constraint = new BooleanOrder(order, first, second);
- allBooleans.push(constraint);
- return BooleanEdge(constraint);
+ Boolean *b = boolMap.get(constraint);
+
+ if (b == NULL) {
+ allBooleans.push(constraint);
+ boolMap.put(constraint, constraint);
+ constraint->updateParents();
+ } else {
+ delete constraint;
+ constraint = b;
+ }
+
+ BooleanEdge be = BooleanEdge(constraint);
+ return negate ? be.negate() : be;
}
void CSolver::addConstraint(BooleanEdge constraint) {
#ifdef TRACE_DEBUG
model_println("****New Constraint******");
#endif
+ if(constraint.isNegated())
+ model_print("!");
+ constraint.getBoolean()->print();
if (isTrue(constraint))
return;
- else if (isFalse(constraint)){
- int t=0;
-#ifdef TRACE_DEBUG
- model_println("Adding constraint which is false :|");
-#endif
- setUnSAT();
- }
+ else if (isFalse(constraint)) {
+ int t = 0;
+ setUnSAT();
+ }
else {
if (constraint->type == LOGICOP) {
- BooleanLogic *b=(BooleanLogic *) constraint.getBoolean();
+ BooleanLogic *b = (BooleanLogic *) constraint.getBoolean();
if (!constraint.isNegated()) {
- if (b->op==SATC_AND) {
- for(uint i=0;i<b->inputs.getSize();i++) {
-#ifdef TRACE_DEBUG
- model_println("In loop");
-#endif
+ if (b->op == SATC_AND) {
+ for (uint i = 0; i < b->inputs.getSize(); i++) {
addConstraint(b->inputs.get(i));
}
return;
}
}
if (b->replaced) {
-#ifdef TRACE_DEBUG
- model_println("While rewriting");
-#endif
addConstraint(doRewrite(constraint));
return;
}
}
constraints.add(constraint);
- Boolean *ptr=constraint.getBoolean();
-
- if (ptr->boolVal == BV_UNSAT){
-#ifdef TRACE_DEBUG
- model_println("BooleanValue is Set to UnSAT");
-#endif
- setUnSAT();
- }
-
+ Boolean *ptr = constraint.getBoolean();
+
+ 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();
+ Preprocess pp(this);
+ pp.doTransform();
+
+ DecomposeOrderTransform dot(this);
+ dot.doTransform();
-// IntegerEncodingTransform iet(this);
-// iet.doTransform();
+ //IntegerEncodingTransform iet(this);
+ //iet.doTransform();
-// EncodingGraph eg(this);
-// eg.buildGraph();
-// eg.encode();
-
+ EncodingGraph eg(this);
+ eg.buildGraph();
+ eg.encode();
+// printConstraints();
naiveEncodingDecision(this);
satEncoder->encodeAllSATEncoder(this);
- model_println("Is problem UNSAT after encoding: %d", unsat);
+ model_print("Is problem UNSAT after encoding: %d\n", unsat);
int result = unsat ? IS_UNSAT : satEncoder->solve();
- model_println("Result Computed in CSolver: %d", result);
+ model_print("Result Computed in CSolver: %d\n", result);
long long finishTime = getTimeNano();
elapsedTime = finishTime - startTime;
if (deleteTuner) {
return result;
}
+void CSolver::printConstraints() {
+ SetIteratorBooleanEdge *it = getConstraints();
+ while (it->hasNext()) {
+ BooleanEdge b = it->next();
+ if (b.isNegated())
+ model_print("!");
+ b->print();
+ model_print("\n");
+ }
+ delete it;
+}
+
+void CSolver::printConstraint(BooleanEdge b) {
+ if (b.isNegated())
+ model_print("!");
+ b->print();
+ model_print("\n");
+}
+
uint64_t CSolver::getElementValue(Element *element) {
switch (element->type) {
case ELEMSET:
}
bool CSolver::getBooleanValue(BooleanEdge bedge) {
- Boolean *boolean=bedge.getBoolean();
+ Boolean *boolean = bedge.getBoolean();
switch (boolean->type) {
case BOOLEANVAR:
return getBooleanVariableValueSATTranslator(this, boolean);
projects / satune.git / blobdiff