// verify all the cases
// stop on the first case which has a solution (i.e counter-example)
int i = 0;
Solution result = new Solution();
while (i<cases.size() && result.empty()) {
result = new Solution();
Expression c = cases.get(i);
constSyst.addConstraint(c);
if (multi)
System.out.println("Case # " + (i+1));