Fixing some bugs + improving the testcase ...
[satune.git] / src / Test / buildconstraints.c
1 #include "csolver.h"
2
3 int main(int numargs, char ** argv) {
4         CSolver * solver=allocCSolver();
5         uint64_t set1[]={0, 1, 2};
6         Set * s=createSet(solver, 0, set1, 3);
7         Element * e1=getElementVar(solver, s);
8         Element * e2=getElementVar(solver, s);
9         Set * domain[]={s, s};
10         Predicate *equals=createPredicateOperator(solver, EQUALS, domain, 2);
11         Element * inputs[]={e1, e2};
12         Boolean * b=applyPredicate(solver, equals, inputs, 2);
13         addBoolean(solver, b);
14         Order * o=createOrder(solver, TOTAL, s);
15         Boolean * oc=orderConstraint(solver, o, 1, 2);
16         addBoolean(solver, oc);
17         
18         uint64_t set2[] = {2, 3};
19         Set* range = createSet(solver, 1, set2, 2);
20         Function * f1 = createFunctionOperator(solver, ADD, domain, 2, range, IGNORE);
21         /*Table* table = createTable(solver, domain, 2, range);
22         uint64_t row1[] = {0, 1};
23         uint64_t row2[] = {1, 1};
24         addTableEntry(solver, table, row1, 2, 2);
25         addTableEntry(solver, table, row2, 2, 3);
26         Function * f2 = completeTable(solver, table); */
27         Boolean* overflow = getBooleanVar(solver , 2);
28         Element * e3 = applyFunction(solver, f1, inputs, 2, overflow);
29         Set* domain2[] = {s,range};
30         Predicate* equal2 = createPredicateOperator(solver, EQUALS, domain2, 2);
31         Element* inputs2 [] = {e1, e3};
32         Boolean* pred = applyPredicate(solver, equal2, inputs2, 2);
33         addBoolean(solver, pred);
34         startEncoding(solver);
35         deleteSolver(solver);
36 }