Loading arrays0.pri ...
Preprocessing ...
Proving ...

VALID

Under the constraint:
res3 = 123 & res2 = 34 & res1 = 13

Loading arrays1.pri ...
Preprocessing ...
Proving ...

VALID

Loading arrays2.pri ...
Preprocessing ...
Proving ...

VALID

Loading arrays0b.pri ...
Preprocessing ...
Proving ...

VALID

Under the constraint:
res3 = 123 & res2 = 34 & res1 = 13

Loading arrays1b.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading arrays2b.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading SET027p3.pri ...
Preprocessing ...
Proving ...

VALID

Loading SET063p3-clauses.pri ...
Preprocessing ...
Proving ...

VALID

Loading PUZ031p1-clauses.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading functions2b.pri ...
Preprocessing ...
Proving ...

VALID

Loading functions4.pri ...
Preprocessing ...
Proving ...

VALID

Loading functions5.pri ...
Preprocessing ...
Constructing countermodel ...

UNKNOWN

Loading functions6.pri ...
Preprocessing ...
Proving ...

VALID

Loading sepLogic0.pri ...
Preprocessing ...
Proving ...

VALID

Under the constraint:
X = 3

Loading multiplication.pri ...
Preprocessing ...
Proving ...

VALID

Loading multiplication2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading group1.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading betaTaskBug.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading factNormalisationBug.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading instantiationBug.pri ...
Preprocessing ...
Proving ...

VALID

Loading transitivityCounterExample.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
b = 3 & a = 0 & p(1, 2) & p(0, 2) & p(0, 1) & p(0, 0) & !p(0, 3)

Loading arrayProperties.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading eps1.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading eps2.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading eps3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading eps4.pri ...
Preprocessing ...
Proving ...

VALID

Loading matchableCheckBug.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading negMatching.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading blockedOmegaBug.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
d = 0 & c = 0 & b = 0 & a = 1 & f(1) = 0 & f(0) = 0

Loading mulTermination.pri ...
Warning: using theory to encode multiplication: GroebnerMultiplication
Preprocessing ...
Proving ...

INVALID

Loading adt2.pri ...
Preprocessing ...
Proving ...

VALID

Loading adt3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading adt4.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading adt-cexes.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
l = cons(green, nil)

Loading adt-totality.pri ...
Preprocessing ...
Proving ...

VALID

Loading adt-expand-nonterm.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
l = cons(green, cons(green, cons(green, nil)))

Loading pairs.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
q = Pair(false, true) & p = Pair(true, true)

Loading pairs2.pri ...
Preprocessing ...
Constructing satisfying assignment for the existential constants ...

VALID

Under the assignment:
s = Pair(true, true) & r = Pair(false, true) & q = Pair(false, false) & p = Pair(true, false)

Loading adt-nats.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
z = zero & y = succ(zero) & x = zero

Loading adt-size.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
l = cons(blue, cons(green, nil)) & gl(cons(blue, cons(green, nil))) & gl(cons(green, nil)) & gl(nil)

Loading adt-size2.pri ...
Warning: using theory to encode multiplication: GroebnerMultiplication
Preprocessing ...
Constructing countermodel ...

VALID

Loading adt-size3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading adt-finite-ctor-args.pri ...
Preprocessing ...
Constructing countermodel ...

INVALID

Countermodel:
d1 = dig(0, dig(2, null)) & value(dig(0, dig(2, null))) = 20 & value(null) = 0 & value(dig(2, null)) = 2

Loading adt-unfold3.pri ...
Preprocessing ...
Constructing countermodel ...

VALID

Loading mulTermination.pri ...
Warning: using theory to encode multiplication: BitShiftMultiplication
Preprocessing ...
Proving ...

INVALID

