diff --git a/farith2/extracted/Defs.ml b/farith2/extracted/Defs.ml
new file mode 100644
index 0000000000000000000000000000000000000000..9337fe2a6c9ce9b77e910a12acee4e54b1603b14
--- /dev/null
+++ b/farith2/extracted/Defs.ml
@@ -0,0 +1,2 @@
+
+type float = { coq_Fnum : Farith_Big.big_int; coq_Fexp : Farith_Big.big_int }
diff --git a/farith2/extracted/Defs.mli b/farith2/extracted/Defs.mli
new file mode 100644
index 0000000000000000000000000000000000000000..9337fe2a6c9ce9b77e910a12acee4e54b1603b14
--- /dev/null
+++ b/farith2/extracted/Defs.mli
@@ -0,0 +1,2 @@
+
+type float = { coq_Fnum : Farith_Big.big_int; coq_Fexp : Farith_Big.big_int }
diff --git a/farith2/extracted/Operations.ml b/farith2/extracted/Operations.ml
new file mode 100644
index 0000000000000000000000000000000000000000..f17de46a1942637d5f5c17d9b4fec1a02c529ebe
--- /dev/null
+++ b/farith2/extracted/Operations.ml
@@ -0,0 +1,30 @@
+open BinInt
+open Defs
+open Zaux
+
+(** val coq_Falign :
+ radix -> float -> float ->
+ (Farith_Big.big_int * Farith_Big.big_int) * Farith_Big.big_int **)
+
+let coq_Falign beta f1 f2 =
+ let { coq_Fnum = m1; coq_Fexp = e1 } = f1 in
+ let { coq_Fnum = m2; coq_Fexp = e2 } = f2 in
+ if Farith_Big.le e1 e2
+ then ((m1,
+ (Farith_Big.mult m2 (Z.pow (radix_val beta) (Farith_Big.sub e2 e1)))),
+ e1)
+ else (((Farith_Big.mult m1 (Z.pow (radix_val beta) (Farith_Big.sub e1 e2))),
+ m2), e2)
+
+(** val coq_Fplus : radix -> float -> float -> float **)
+
+let coq_Fplus beta f1 f2 =
+ let (p, e) = coq_Falign beta f1 f2 in
+ let (m1, m2) = p in { coq_Fnum = (Farith_Big.add m1 m2); coq_Fexp = e }
+
+(** val coq_Fmult : radix -> float -> float -> float **)
+
+let coq_Fmult _ f1 f2 =
+ let { coq_Fnum = m1; coq_Fexp = e1 } = f1 in
+ let { coq_Fnum = m2; coq_Fexp = e2 } = f2 in
+ { coq_Fnum = (Farith_Big.mult m1 m2); coq_Fexp = (Farith_Big.add e1 e2) }
diff --git a/farith2/extracted/Operations.mli b/farith2/extracted/Operations.mli
new file mode 100644
index 0000000000000000000000000000000000000000..386fb4067413c8904c1a847e021e25d1805a47f3
--- /dev/null
+++ b/farith2/extracted/Operations.mli
@@ -0,0 +1,11 @@
+open BinInt
+open Defs
+open Zaux
+
+val coq_Falign :
+ radix -> float -> float ->
+ (Farith_Big.big_int * Farith_Big.big_int) * Farith_Big.big_int
+
+val coq_Fplus : radix -> float -> float -> float
+
+val coq_Fmult : radix -> float -> float -> float
diff --git a/src_colibri2/solver/input.ml b/src_colibri2/solver/input.ml
index a7ada0824c85df5f849de24dc7e15988e9dbc42b..6fb706ce1831d61b2e63a5018487f30e09b95700 100644
--- a/src_colibri2/solver/input.ml
+++ b/src_colibri2/solver/input.ml
@@ -312,7 +312,7 @@ let handle_stmt ?(show_check_sat_result = true) ?(show_steps = false)
Symbol
{
Id.ns = Namespace.Attr;
- Id.name = Simple ":status-colibri2";
+ Id.name = Simple (":status-colibri2" | ":status");
};
_;
},
diff --git a/src_colibri2/tests/solve/colibri/arr.smt2 b/src_colibri2/tests/solve/colibri/arr.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..97b7ef8bc39cbb848c99776f828b956cbfd6a371
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/arr.smt2
@@ -0,0 +1,28 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+
+
+(declare-sort u 0)
+
+(declare-fun to_rep (u) Int)
+
+(declare-sort t 0)
+
+(declare-fun mk ((Array Int u) Bool) t)
+
+(declare-fun get_a (t) (Array Int u))
+
+(declare-fun get_b (t) Bool)
+(declare-const rliteral u)
+
+(declare-const r t)
+
+
+(assert
+ (= (to_rep (select (get_a (mk (store (get_a r) 3 rliteral) (get_b r))) 3)) 5))
+
+(assert
+ (not
+ (= (to_rep (select (get_a (mk (store (get_a r) 3 rliteral) (get_b r))) 1)) 5)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/bug25.smt2 b/src_colibri2/tests/solve/colibri/bug25.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..82767ec227d3b7ff0c81d39d92edacfccfe66ffd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/bug25.smt2
@@ -0,0 +1,65 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+
+
+(declare-sort value 0)
+
+(declare-fun valueqtint (value) Int)
+
+(define-fun to_rep ((x value)) Int (valueqtint x))
+
+
+(declare-const a (Array Int (Array Int value)))
+
+(declare-const i Int)
+(declare-const j Int)
+
+(declare-const x value)
+(declare-const y value)
+
+(assert
+ (not
+ (= (to_rep
+ (select
+ (select
+ (store
+ (store a i
+ (store
+ (select a i)
+ j x))
+ i
+ (store
+ (select
+ (store a i
+ (store
+ (select a i)
+ j x))
+ i)
+ j y))
+ i)
+ j))
+ (to_rep
+ (select
+ (select
+ (store
+ (store a i
+ (store
+ (select a i)
+ j x))
+ i
+ (store
+ (select
+ (store a i
+ (store
+ (select a i)
+ j x))
+ i)
+ j y))
+ j)
+ i)))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/expInUnit.smt2 b/src_colibri2/tests/solve/colibri/expInUnit.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e4cbd3fb27f16ed4c85b2e84ef81b86c9105ba56
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/expInUnit.smt2
@@ -0,0 +1,121 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+(set-logic QF_FPLRA)
+(set-info :source |
+Generated by: Matthias Güdemann
+Generated on: 2019-03-10
+Generator: SBV
+Application: Numerical Approximation of Elementary Functions
+Target Solver: z3
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+; --- uninterpreted sorts ---
+; --- literal constants ---
+(define-fun s_2 () Bool false)
+(define-fun s_1 () Bool true)
+(define-fun s2 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1152921504606847.0 1152921504606846976.0)))
+(define-fun s5 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1.0)))
+(define-fun s13 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6.0 1.0)))
+(define-fun s14 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1725329017245637.0 2251799813685248.0)))
+(define-fun s18 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6743802672015265.0 1125899906842624.0)))
+(define-fun s19 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 8479827738375907.0 2251799813685248.0)))
+(define-fun s24 () (_ FloatingPoint 11 53) (_ +zero 11 53))
+(define-fun s31 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 2.0 1.0)))
+(define-fun s38 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 24.0 1.0)))
+(define-fun s42 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 120.0 1.0)))
+(define-fun s46 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 720.0 1.0)))
+(define-fun s50 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5040.0 1.0)))
+(define-fun s54 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 40320.0 1.0)))
+(define-fun s58 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 362880.0 1.0)))
+; --- skolem constants ---
+(declare-fun s0 () (_ FloatingPoint 11 53))
+(declare-fun s1 () (_ FloatingPoint 11 53))
+; --- constant tables ---
+; --- skolemized tables ---
+; --- arrays ---
+; --- uninterpreted constants ---
+; --- user given axioms ---
+; --- formula ---
+(define-fun s3 () Bool (fp.gt s0 s2))
+(define-fun s4 () Bool (fp.gt s1 s2))
+(define-fun s6 () Bool (fp.lt s0 s5))
+(define-fun s7 () Bool (fp.lt s1 s5))
+(define-fun s8 () Bool (and s6 s7))
+(define-fun s9 () Bool (and s4 s8))
+(define-fun s10 () Bool (and s3 s9))
+(define-fun s11 () Bool (not s10))
+(define-fun s12 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s0 s5))
+(define-fun s15 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s14))
+(define-fun s16 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s13 s15))
+(define-fun s17 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s16))
+(define-fun s20 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s19))
+(define-fun s21 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s18 s20))
+(define-fun s22 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s17 s21))
+(define-fun s23 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s22))
+(define-fun s25 () Bool (fp.lt s23 s24))
+(define-fun s26 () (_ FloatingPoint 11 53) (fp.neg s23))
+(define-fun s27 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s5 s26))
+(define-fun s28 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s27 s5))
+(define-fun s29 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s5 s28))
+(define-fun s30 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s27))
+(define-fun s32 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s30 s31))
+(define-fun s33 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s29 s32))
+(define-fun s34 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s30))
+(define-fun s35 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s34 s13))
+(define-fun s36 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s33 s35))
+(define-fun s37 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s34))
+(define-fun s39 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s37 s38))
+(define-fun s40 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s36 s39))
+(define-fun s41 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s37))
+(define-fun s43 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s41 s42))
+(define-fun s44 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s40 s43))
+(define-fun s45 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s41))
+(define-fun s47 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s45 s46))
+(define-fun s48 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s44 s47))
+(define-fun s49 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s45))
+(define-fun s51 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s49 s50))
+(define-fun s52 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s48 s51))
+(define-fun s53 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s49))
+(define-fun s55 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s53 s54))
+(define-fun s56 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s52 s55))
+(define-fun s57 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s26 s53))
+(define-fun s59 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s57 s58))
+(define-fun s60 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s56 s59))
+(define-fun s61 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s5 s60))
+(define-fun s62 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s5 s23))
+(define-fun s63 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s62 s5))
+(define-fun s64 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s5 s63))
+(define-fun s65 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s62))
+(define-fun s66 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s65 s31))
+(define-fun s67 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s64 s66))
+(define-fun s68 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s65))
+(define-fun s69 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s68 s13))
+(define-fun s70 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s67 s69))
+(define-fun s71 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s68))
+(define-fun s72 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s71 s38))
+(define-fun s73 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s70 s72))
+(define-fun s74 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s71))
+(define-fun s75 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s74 s42))
+(define-fun s76 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s73 s75))
+(define-fun s77 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s74))
+(define-fun s78 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s77 s46))
+(define-fun s79 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s76 s78))
+(define-fun s80 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s77))
+(define-fun s81 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s80 s50))
+(define-fun s82 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s79 s81))
+(define-fun s83 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s80))
+(define-fun s84 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s83 s54))
+(define-fun s85 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s82 s84))
+(define-fun s86 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s23 s83))
+(define-fun s87 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s86 s58))
+(define-fun s88 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s85 s87))
+(define-fun s89 () (_ FloatingPoint 11 53) (ite s25 s61 s88))
+(define-fun s90 () Bool (fp.geq s89 s24))
+(define-fun s91 () Bool (fp.lt s89 s5))
+(define-fun s92 () Bool (and s90 s91))
+(define-fun s93 () Bool (or s11 s92))
+(assert (not s93))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/Float_div_bad-main.smt2 b/src_colibri2/tests/solve/colibri/sat/Float_div_bad-main.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5765247e8e48d276446fcf747438d1b47ae77d14
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/Float_div_bad-main.smt2
@@ -0,0 +1,4194 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |ESBMC floating-point test cases contributed by Mikhail Ramalho.|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun |c::main::main::1::x@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#1| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#2| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#2| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#2| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#3| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#3| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#3| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#4| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#4| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#4| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#5| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#5| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#5| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#6| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#6| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#6| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#7| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#7| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#7| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#8| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#8| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#8| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#9| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#9| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#9| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#10| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#10| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#10| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#11| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#11| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#11| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#12| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#12| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#12| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#13| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#13| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#13| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#14| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#14| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#14| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#15| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#15| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#15| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#16| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#16| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#16| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#17| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#17| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#17| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#18| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#18| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#18| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#19| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#19| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#19| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#20| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#20| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#20| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#21| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#21| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#21| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#22| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#22| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#22| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#23| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#23| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#23| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#24| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#24| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#24| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#25| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#25| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#25| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#26| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#26| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#26| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#27| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#27| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#27| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#28| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#28| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#28| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#29| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#29| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#29| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#30| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#30| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#30| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#31| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#31| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#31| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#32| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#32| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#32| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#33| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#33| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#33| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#34| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#34| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#34| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#35| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#35| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#35| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#36| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#36| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#36| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#37| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#37| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#37| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#38| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#38| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#38| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#39| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#39| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#39| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#40| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#40| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#40| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#41| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#41| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#41| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#42| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#42| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#42| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#43| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#43| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#43| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#44| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#44| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#44| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#45| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#45| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#45| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#46| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#46| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#46| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#47| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#47| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#47| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#48| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#48| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#48| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#49| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#49| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#49| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#50| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#50| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#50| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#51| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#51| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#51| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#52| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#52| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#52| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#53| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#53| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#53| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#54| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#54| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#54| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#55| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#55| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#55| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#56| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#56| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#56| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#57| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#57| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#57| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#58| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#58| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#58| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#59| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#59| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#59| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#60| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#60| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#60| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#61| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#61| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#61| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#62| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#62| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#62| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#63| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#63| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#63| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#64| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#64| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#64| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#65| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#65| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#65| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#66| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#66| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#66| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#67| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#67| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#67| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#68| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#68| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#68| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#69| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#69| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#69| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#70| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#70| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#70| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#71| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#71| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#71| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#72| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#72| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#72| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#73| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#73| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#73| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#74| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#74| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#74| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#75| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#75| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#75| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#76| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#76| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#76| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#77| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#77| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#77| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#78| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#78| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#78| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#79| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#79| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#79| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#80| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#80| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#80| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#81| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#81| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#81| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#82| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#82| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#82| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#83| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#83| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#83| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#84| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#84| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#84| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#85| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#85| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#85| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#86| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#86| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#86| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#87| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#87| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#87| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#88| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#88| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#88| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#89| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#89| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#89| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#90| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#90| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#90| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#91| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#91| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#91| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#92| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#92| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#92| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#93| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#93| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#93| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#94| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#94| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#94| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#95| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#95| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#95| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#96| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#96| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#96| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#97| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#97| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#97| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#98| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#98| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#98| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#99| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#99| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#99| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#100| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#100| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#100| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#101| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#101| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#101| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#102| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#102| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#102| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#103| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#103| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#103| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#104| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#104| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#104| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#105| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#105| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#105| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#106| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#106| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#106| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#107| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#107| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#107| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#108| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#108| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#108| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#109| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#109| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#109| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#110| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#110| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#110| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#111| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#111| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#111| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#112| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#112| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#112| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#113| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#113| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#113| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#114| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#114| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#114| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#115| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#115| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#115| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#116| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#116| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#116| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#117| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#117| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#117| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#118| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#118| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#118| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#119| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#119| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#119| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#120| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#120| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#120| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#121| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#121| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#121| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#122| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#122| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#122| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#123| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#123| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#123| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#124| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#124| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#124| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#125| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#125| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#125| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#126| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#126| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#126| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#127| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#127| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#127| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#128| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#128| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#128| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#129| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#129| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#129| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#130| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#130| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#130| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#131| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#131| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#131| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#132| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#132| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#132| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#133| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#133| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#133| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#134| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#134| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#134| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#135| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#135| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#135| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#136| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#136| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#136| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#137| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#137| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#137| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#138| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#138| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#138| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#139| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#139| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#139| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#140| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#140| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#140| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#141| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#141| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#141| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#142| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#142| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#142| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#143| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#143| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#143| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#144| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#144| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#144| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#145| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#145| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#145| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#146| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#146| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#146| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#147| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#147| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#147| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#148| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#148| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#148| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#149| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#149| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#149| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#150| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#150| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#150| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#151| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#151| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#151| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#152| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#152| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#152| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#153| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#153| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#153| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#154| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#154| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#154| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#155| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#155| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#155| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#156| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#156| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#156| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#157| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#157| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#157| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#158| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#158| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#158| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#159| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#159| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#159| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#160| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#160| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#160| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#161| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#161| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#161| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#162| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#162| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#162| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#163| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#163| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#163| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#164| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#164| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#164| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#165| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#165| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#165| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#166| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#166| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#166| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#167| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#167| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#167| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#168| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#168| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#168| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#169| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#169| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#169| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#170| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#170| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#170| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#171| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#171| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#171| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#172| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#172| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#172| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#173| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#173| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#173| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#174| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#174| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#174| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#175| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#175| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#175| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#176| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#176| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#176| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#177| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#177| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#177| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#178| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#178| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#178| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#179| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#179| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#179| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#180| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#180| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#180| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#181| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#181| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#181| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#182| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#182| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#182| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#183| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#183| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#183| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#184| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#184| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#184| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#185| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#185| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#185| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#186| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#186| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#186| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#187| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#187| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#187| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#188| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#188| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#188| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#189| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#189| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#189| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#190| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#190| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#190| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#191| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#191| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#191| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#192| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#192| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#192| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#193| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#193| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#193| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#194| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#194| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#194| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#195| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#195| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#195| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#196| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#196| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#196| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#197| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#197| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#197| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#198| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#198| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#198| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#199| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#199| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#199| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#200| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#200| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#200| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#201| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#201| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#201| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#202| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#202| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#202| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#203| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#203| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#203| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#204| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#204| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#204| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#205| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#205| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#205| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#206| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#206| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#206| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#207| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#207| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#207| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#208| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#208| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#208| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#209| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#209| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#209| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#210| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#210| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#210| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#211| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#211| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#211| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#212| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#212| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#212| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#213| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#213| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#213| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#214| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#214| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#214| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#215| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#215| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#215| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#216| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#216| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#216| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#217| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#217| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#217| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#218| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#218| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#218| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#219| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#219| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#219| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#220| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x1@1!0&0#220| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#220| () Bool)
+(declare-fun |c::main::main::1::x@1!0&0#222| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#223| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#224| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#225| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#226| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#227| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#228| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#229| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#230| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#231| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#232| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#233| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#234| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#235| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#236| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#237| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#238| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#239| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#240| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#241| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#242| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#243| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#244| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#245| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#246| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#247| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#248| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#249| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#250| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#251| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#252| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#253| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#254| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#255| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#256| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#257| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#258| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#259| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#260| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#261| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#262| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#263| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#264| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#265| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#266| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#267| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#268| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#269| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#270| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#271| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#272| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#273| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#274| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#275| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#276| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#277| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#278| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#279| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#280| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#281| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#282| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#283| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#284| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#285| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#286| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#287| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#288| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#289| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#290| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#291| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#292| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#293| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#294| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#295| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#296| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#297| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#298| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#299| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#300| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#301| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#302| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#303| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#304| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#305| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#306| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#307| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#308| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#309| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#310| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#311| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#312| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#313| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#314| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#315| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#316| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#317| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#318| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#319| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#320| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#321| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#322| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#323| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#324| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#325| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#326| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#327| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#328| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#329| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#330| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#331| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#332| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#333| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#334| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#335| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#336| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#337| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#338| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#339| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#340| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#341| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#342| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#343| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#344| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#345| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#346| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#347| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#348| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#349| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#350| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#351| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#352| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#353| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#354| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#355| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#356| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#357| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#358| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#359| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#360| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#361| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#362| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#363| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#364| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#365| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#366| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#367| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#368| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#369| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#370| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#371| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#372| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#373| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#374| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#375| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#376| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#377| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#378| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#379| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#380| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#381| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#382| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#383| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#384| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#385| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#386| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#387| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#388| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#389| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#390| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#391| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#392| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#393| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#394| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#395| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#396| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#397| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#398| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#399| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#400| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#401| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#402| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#403| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#404| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#405| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#406| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#407| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#408| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#409| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#410| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#411| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#412| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#413| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#414| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#415| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#416| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#417| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#418| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#419| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#420| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#421| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#422| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#423| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#424| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#425| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#426| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#427| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#428| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#429| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#430| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#431| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#432| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#433| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#434| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#435| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#436| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#437| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#438| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#439| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#440| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#441| () (_ FloatingPoint 8 24))
+(declare-fun |execution_statet::guard_exec@0!0| () Bool)
+(assert (= (fp #b0 #x7f #b00000000000000000000000) |c::main::main::1::x@1!0&0#1|))
+(assert (= (fp.div roundNearestTiesToEven
+ (fp #b0 #x7f #b00000000000000000000000)
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#1|))
+(assert (let ((a!1 (not (not (fp.eq |c::main::main::1::x1@1!0&0#1|
+ (fp #b0 #x7f #b00000000000000000000000))))))
+ (= (not a!1) |goto_symex::guard@0!0&0#1|)))
+(assert (= |c::main::main::1::x1@1!0&0#1| |c::main::main::1::x@1!0&0#2|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#2|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#2|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#2|
+ |c::main::main::1::x@1!0&0#2|))))))
+ (= a!1 |goto_symex::guard@0!0&0#2|)))
+(assert (= |c::main::main::1::x1@1!0&0#2| |c::main::main::1::x@1!0&0#3|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#3|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#3|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#3|
+ |c::main::main::1::x@1!0&0#3|))))))
+ (= a!1 |goto_symex::guard@0!0&0#3|)))
+(assert (= |c::main::main::1::x1@1!0&0#3| |c::main::main::1::x@1!0&0#4|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#4|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#4|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#4|
+ |c::main::main::1::x@1!0&0#4|))))))
+ (= a!1 |goto_symex::guard@0!0&0#4|)))
+(assert (= |c::main::main::1::x1@1!0&0#4| |c::main::main::1::x@1!0&0#5|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#5|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#5|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#5|
+ |c::main::main::1::x@1!0&0#5|))))))
+ (= a!1 |goto_symex::guard@0!0&0#5|)))
+(assert (= |c::main::main::1::x1@1!0&0#5| |c::main::main::1::x@1!0&0#6|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#6|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#6|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#6|
+ |c::main::main::1::x@1!0&0#6|))))))
+ (= a!1 |goto_symex::guard@0!0&0#6|)))
+(assert (= |c::main::main::1::x1@1!0&0#6| |c::main::main::1::x@1!0&0#7|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#7|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#7|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#7|
+ |c::main::main::1::x@1!0&0#7|))))))
+ (= a!1 |goto_symex::guard@0!0&0#7|)))
+(assert (= |c::main::main::1::x1@1!0&0#7| |c::main::main::1::x@1!0&0#8|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#8|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#8|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#8|
+ |c::main::main::1::x@1!0&0#8|))))))
+ (= a!1 |goto_symex::guard@0!0&0#8|)))
+(assert (= |c::main::main::1::x1@1!0&0#8| |c::main::main::1::x@1!0&0#9|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#9|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#9|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#9|
+ |c::main::main::1::x@1!0&0#9|))))))
+ (= a!1 |goto_symex::guard@0!0&0#9|)))
+(assert (= |c::main::main::1::x1@1!0&0#9| |c::main::main::1::x@1!0&0#10|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#10|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#10|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#10|
+ |c::main::main::1::x@1!0&0#10|))))))
+ (= a!1 |goto_symex::guard@0!0&0#10|)))
+(assert (= |c::main::main::1::x1@1!0&0#10| |c::main::main::1::x@1!0&0#11|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#11|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#11|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#11|
+ |c::main::main::1::x@1!0&0#11|))))))
+ (= a!1 |goto_symex::guard@0!0&0#11|)))
+(assert (= |c::main::main::1::x1@1!0&0#11| |c::main::main::1::x@1!0&0#12|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#12|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#12|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#12|
+ |c::main::main::1::x@1!0&0#12|))))))
+ (= a!1 |goto_symex::guard@0!0&0#12|)))
+(assert (= |c::main::main::1::x1@1!0&0#12| |c::main::main::1::x@1!0&0#13|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#13|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#13|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#13|
+ |c::main::main::1::x@1!0&0#13|))))))
+ (= a!1 |goto_symex::guard@0!0&0#13|)))
+(assert (= |c::main::main::1::x1@1!0&0#13| |c::main::main::1::x@1!0&0#14|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#14|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#14|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#14|
+ |c::main::main::1::x@1!0&0#14|))))))
+ (= a!1 |goto_symex::guard@0!0&0#14|)))
+(assert (= |c::main::main::1::x1@1!0&0#14| |c::main::main::1::x@1!0&0#15|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#15|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#15|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#15|
+ |c::main::main::1::x@1!0&0#15|))))))
+ (= a!1 |goto_symex::guard@0!0&0#15|)))
+(assert (= |c::main::main::1::x1@1!0&0#15| |c::main::main::1::x@1!0&0#16|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#16|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#16|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#16|
+ |c::main::main::1::x@1!0&0#16|))))))
+ (= a!1 |goto_symex::guard@0!0&0#16|)))
+(assert (= |c::main::main::1::x1@1!0&0#16| |c::main::main::1::x@1!0&0#17|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#17|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#17|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#17|
+ |c::main::main::1::x@1!0&0#17|))))))
+ (= a!1 |goto_symex::guard@0!0&0#17|)))
+(assert (= |c::main::main::1::x1@1!0&0#17| |c::main::main::1::x@1!0&0#18|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#18|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#18|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#18|
+ |c::main::main::1::x@1!0&0#18|))))))
+ (= a!1 |goto_symex::guard@0!0&0#18|)))
+(assert (= |c::main::main::1::x1@1!0&0#18| |c::main::main::1::x@1!0&0#19|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#19|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#19|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#19|
+ |c::main::main::1::x@1!0&0#19|))))))
+ (= a!1 |goto_symex::guard@0!0&0#19|)))
+(assert (= |c::main::main::1::x1@1!0&0#19| |c::main::main::1::x@1!0&0#20|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#20|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#20|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#20|
+ |c::main::main::1::x@1!0&0#20|))))))
+ (= a!1 |goto_symex::guard@0!0&0#20|)))
+(assert (= |c::main::main::1::x1@1!0&0#20| |c::main::main::1::x@1!0&0#21|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#21|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#21|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#21|
+ |c::main::main::1::x@1!0&0#21|))))))
+ (= a!1 |goto_symex::guard@0!0&0#21|)))
+(assert (= |c::main::main::1::x1@1!0&0#21| |c::main::main::1::x@1!0&0#22|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#22|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#22|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#22|
+ |c::main::main::1::x@1!0&0#22|))))))
+ (= a!1 |goto_symex::guard@0!0&0#22|)))
+(assert (= |c::main::main::1::x1@1!0&0#22| |c::main::main::1::x@1!0&0#23|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#23|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#23|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#23|
+ |c::main::main::1::x@1!0&0#23|))))))
+ (= a!1 |goto_symex::guard@0!0&0#23|)))
+(assert (= |c::main::main::1::x1@1!0&0#23| |c::main::main::1::x@1!0&0#24|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#24|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#24|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#24|
+ |c::main::main::1::x@1!0&0#24|))))))
+ (= a!1 |goto_symex::guard@0!0&0#24|)))
+(assert (= |c::main::main::1::x1@1!0&0#24| |c::main::main::1::x@1!0&0#25|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#25|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#25|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#25|
+ |c::main::main::1::x@1!0&0#25|))))))
+ (= a!1 |goto_symex::guard@0!0&0#25|)))
+(assert (= |c::main::main::1::x1@1!0&0#25| |c::main::main::1::x@1!0&0#26|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#26|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#26|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#26|
+ |c::main::main::1::x@1!0&0#26|))))))
+ (= a!1 |goto_symex::guard@0!0&0#26|)))
+(assert (= |c::main::main::1::x1@1!0&0#26| |c::main::main::1::x@1!0&0#27|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#27|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#27|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#27|
+ |c::main::main::1::x@1!0&0#27|))))))
+ (= a!1 |goto_symex::guard@0!0&0#27|)))
+(assert (= |c::main::main::1::x1@1!0&0#27| |c::main::main::1::x@1!0&0#28|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#28|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#28|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#28|
+ |c::main::main::1::x@1!0&0#28|))))))
+ (= a!1 |goto_symex::guard@0!0&0#28|)))
+(assert (= |c::main::main::1::x1@1!0&0#28| |c::main::main::1::x@1!0&0#29|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#29|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#29|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#29|
+ |c::main::main::1::x@1!0&0#29|))))))
+ (= a!1 |goto_symex::guard@0!0&0#29|)))
+(assert (= |c::main::main::1::x1@1!0&0#29| |c::main::main::1::x@1!0&0#30|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#30|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#30|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#30|
+ |c::main::main::1::x@1!0&0#30|))))))
+ (= a!1 |goto_symex::guard@0!0&0#30|)))
+(assert (= |c::main::main::1::x1@1!0&0#30| |c::main::main::1::x@1!0&0#31|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#31|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#31|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#31|
+ |c::main::main::1::x@1!0&0#31|))))))
+ (= a!1 |goto_symex::guard@0!0&0#31|)))
+(assert (= |c::main::main::1::x1@1!0&0#31| |c::main::main::1::x@1!0&0#32|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#32|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#32|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#32|
+ |c::main::main::1::x@1!0&0#32|))))))
+ (= a!1 |goto_symex::guard@0!0&0#32|)))
+(assert (= |c::main::main::1::x1@1!0&0#32| |c::main::main::1::x@1!0&0#33|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#33|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#33|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#33|
+ |c::main::main::1::x@1!0&0#33|))))))
+ (= a!1 |goto_symex::guard@0!0&0#33|)))
+(assert (= |c::main::main::1::x1@1!0&0#33| |c::main::main::1::x@1!0&0#34|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#34|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#34|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#34|
+ |c::main::main::1::x@1!0&0#34|))))))
+ (= a!1 |goto_symex::guard@0!0&0#34|)))
+(assert (= |c::main::main::1::x1@1!0&0#34| |c::main::main::1::x@1!0&0#35|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#35|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#35|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#35|
+ |c::main::main::1::x@1!0&0#35|))))))
+ (= a!1 |goto_symex::guard@0!0&0#35|)))
+(assert (= |c::main::main::1::x1@1!0&0#35| |c::main::main::1::x@1!0&0#36|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#36|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#36|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#36|
+ |c::main::main::1::x@1!0&0#36|))))))
+ (= a!1 |goto_symex::guard@0!0&0#36|)))
+(assert (= |c::main::main::1::x1@1!0&0#36| |c::main::main::1::x@1!0&0#37|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#37|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#37|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#37|
+ |c::main::main::1::x@1!0&0#37|))))))
+ (= a!1 |goto_symex::guard@0!0&0#37|)))
+(assert (= |c::main::main::1::x1@1!0&0#37| |c::main::main::1::x@1!0&0#38|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#38|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#38|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#38|
+ |c::main::main::1::x@1!0&0#38|))))))
+ (= a!1 |goto_symex::guard@0!0&0#38|)))
+(assert (= |c::main::main::1::x1@1!0&0#38| |c::main::main::1::x@1!0&0#39|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#39|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#39|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#39|
+ |c::main::main::1::x@1!0&0#39|))))))
+ (= a!1 |goto_symex::guard@0!0&0#39|)))
+(assert (= |c::main::main::1::x1@1!0&0#39| |c::main::main::1::x@1!0&0#40|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#40|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#40|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#40|
+ |c::main::main::1::x@1!0&0#40|))))))
+ (= a!1 |goto_symex::guard@0!0&0#40|)))
+(assert (= |c::main::main::1::x1@1!0&0#40| |c::main::main::1::x@1!0&0#41|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#41|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#41|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#41|
+ |c::main::main::1::x@1!0&0#41|))))))
+ (= a!1 |goto_symex::guard@0!0&0#41|)))
+(assert (= |c::main::main::1::x1@1!0&0#41| |c::main::main::1::x@1!0&0#42|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#42|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#42|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#42|
+ |c::main::main::1::x@1!0&0#42|))))))
+ (= a!1 |goto_symex::guard@0!0&0#42|)))
+(assert (= |c::main::main::1::x1@1!0&0#42| |c::main::main::1::x@1!0&0#43|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#43|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#43|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#43|
+ |c::main::main::1::x@1!0&0#43|))))))
+ (= a!1 |goto_symex::guard@0!0&0#43|)))
+(assert (= |c::main::main::1::x1@1!0&0#43| |c::main::main::1::x@1!0&0#44|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#44|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#44|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#44|
+ |c::main::main::1::x@1!0&0#44|))))))
+ (= a!1 |goto_symex::guard@0!0&0#44|)))
+(assert (= |c::main::main::1::x1@1!0&0#44| |c::main::main::1::x@1!0&0#45|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#45|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#45|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#45|
+ |c::main::main::1::x@1!0&0#45|))))))
+ (= a!1 |goto_symex::guard@0!0&0#45|)))
+(assert (= |c::main::main::1::x1@1!0&0#45| |c::main::main::1::x@1!0&0#46|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#46|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#46|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#46|
+ |c::main::main::1::x@1!0&0#46|))))))
+ (= a!1 |goto_symex::guard@0!0&0#46|)))
+(assert (= |c::main::main::1::x1@1!0&0#46| |c::main::main::1::x@1!0&0#47|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#47|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#47|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#47|
+ |c::main::main::1::x@1!0&0#47|))))))
+ (= a!1 |goto_symex::guard@0!0&0#47|)))
+(assert (= |c::main::main::1::x1@1!0&0#47| |c::main::main::1::x@1!0&0#48|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#48|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#48|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#48|
+ |c::main::main::1::x@1!0&0#48|))))))
+ (= a!1 |goto_symex::guard@0!0&0#48|)))
+(assert (= |c::main::main::1::x1@1!0&0#48| |c::main::main::1::x@1!0&0#49|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#49|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#49|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#49|
+ |c::main::main::1::x@1!0&0#49|))))))
+ (= a!1 |goto_symex::guard@0!0&0#49|)))
+(assert (= |c::main::main::1::x1@1!0&0#49| |c::main::main::1::x@1!0&0#50|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#50|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#50|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#50|
+ |c::main::main::1::x@1!0&0#50|))))))
+ (= a!1 |goto_symex::guard@0!0&0#50|)))
+(assert (= |c::main::main::1::x1@1!0&0#50| |c::main::main::1::x@1!0&0#51|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#51|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#51|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#51|
+ |c::main::main::1::x@1!0&0#51|))))))
+ (= a!1 |goto_symex::guard@0!0&0#51|)))
+(assert (= |c::main::main::1::x1@1!0&0#51| |c::main::main::1::x@1!0&0#52|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#52|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#52|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#52|
+ |c::main::main::1::x@1!0&0#52|))))))
+ (= a!1 |goto_symex::guard@0!0&0#52|)))
+(assert (= |c::main::main::1::x1@1!0&0#52| |c::main::main::1::x@1!0&0#53|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#53|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#53|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#53|
+ |c::main::main::1::x@1!0&0#53|))))))
+ (= a!1 |goto_symex::guard@0!0&0#53|)))
+(assert (= |c::main::main::1::x1@1!0&0#53| |c::main::main::1::x@1!0&0#54|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#54|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#54|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#54|
+ |c::main::main::1::x@1!0&0#54|))))))
+ (= a!1 |goto_symex::guard@0!0&0#54|)))
+(assert (= |c::main::main::1::x1@1!0&0#54| |c::main::main::1::x@1!0&0#55|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#55|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#55|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#55|
+ |c::main::main::1::x@1!0&0#55|))))))
+ (= a!1 |goto_symex::guard@0!0&0#55|)))
+(assert (= |c::main::main::1::x1@1!0&0#55| |c::main::main::1::x@1!0&0#56|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#56|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#56|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#56|
+ |c::main::main::1::x@1!0&0#56|))))))
+ (= a!1 |goto_symex::guard@0!0&0#56|)))
+(assert (= |c::main::main::1::x1@1!0&0#56| |c::main::main::1::x@1!0&0#57|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#57|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#57|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#57|
+ |c::main::main::1::x@1!0&0#57|))))))
+ (= a!1 |goto_symex::guard@0!0&0#57|)))
+(assert (= |c::main::main::1::x1@1!0&0#57| |c::main::main::1::x@1!0&0#58|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#58|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#58|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#58|
+ |c::main::main::1::x@1!0&0#58|))))))
+ (= a!1 |goto_symex::guard@0!0&0#58|)))
+(assert (= |c::main::main::1::x1@1!0&0#58| |c::main::main::1::x@1!0&0#59|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#59|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#59|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#59|
+ |c::main::main::1::x@1!0&0#59|))))))
+ (= a!1 |goto_symex::guard@0!0&0#59|)))
+(assert (= |c::main::main::1::x1@1!0&0#59| |c::main::main::1::x@1!0&0#60|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#60|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#60|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#60|
+ |c::main::main::1::x@1!0&0#60|))))))
+ (= a!1 |goto_symex::guard@0!0&0#60|)))
+(assert (= |c::main::main::1::x1@1!0&0#60| |c::main::main::1::x@1!0&0#61|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#61|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#61|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#61|
+ |c::main::main::1::x@1!0&0#61|))))))
+ (= a!1 |goto_symex::guard@0!0&0#61|)))
+(assert (= |c::main::main::1::x1@1!0&0#61| |c::main::main::1::x@1!0&0#62|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#62|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#62|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#62|
+ |c::main::main::1::x@1!0&0#62|))))))
+ (= a!1 |goto_symex::guard@0!0&0#62|)))
+(assert (= |c::main::main::1::x1@1!0&0#62| |c::main::main::1::x@1!0&0#63|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#63|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#63|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#63|
+ |c::main::main::1::x@1!0&0#63|))))))
+ (= a!1 |goto_symex::guard@0!0&0#63|)))
+(assert (= |c::main::main::1::x1@1!0&0#63| |c::main::main::1::x@1!0&0#64|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#64|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#64|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#64|
+ |c::main::main::1::x@1!0&0#64|))))))
+ (= a!1 |goto_symex::guard@0!0&0#64|)))
+(assert (= |c::main::main::1::x1@1!0&0#64| |c::main::main::1::x@1!0&0#65|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#65|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#65|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#65|
+ |c::main::main::1::x@1!0&0#65|))))))
+ (= a!1 |goto_symex::guard@0!0&0#65|)))
+(assert (= |c::main::main::1::x1@1!0&0#65| |c::main::main::1::x@1!0&0#66|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#66|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#66|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#66|
+ |c::main::main::1::x@1!0&0#66|))))))
+ (= a!1 |goto_symex::guard@0!0&0#66|)))
+(assert (= |c::main::main::1::x1@1!0&0#66| |c::main::main::1::x@1!0&0#67|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#67|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#67|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#67|
+ |c::main::main::1::x@1!0&0#67|))))))
+ (= a!1 |goto_symex::guard@0!0&0#67|)))
+(assert (= |c::main::main::1::x1@1!0&0#67| |c::main::main::1::x@1!0&0#68|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#68|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#68|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#68|
+ |c::main::main::1::x@1!0&0#68|))))))
+ (= a!1 |goto_symex::guard@0!0&0#68|)))
+(assert (= |c::main::main::1::x1@1!0&0#68| |c::main::main::1::x@1!0&0#69|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#69|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#69|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#69|
+ |c::main::main::1::x@1!0&0#69|))))))
+ (= a!1 |goto_symex::guard@0!0&0#69|)))
+(assert (= |c::main::main::1::x1@1!0&0#69| |c::main::main::1::x@1!0&0#70|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#70|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#70|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#70|
+ |c::main::main::1::x@1!0&0#70|))))))
+ (= a!1 |goto_symex::guard@0!0&0#70|)))
+(assert (= |c::main::main::1::x1@1!0&0#70| |c::main::main::1::x@1!0&0#71|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#71|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#71|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#71|
+ |c::main::main::1::x@1!0&0#71|))))))
+ (= a!1 |goto_symex::guard@0!0&0#71|)))
+(assert (= |c::main::main::1::x1@1!0&0#71| |c::main::main::1::x@1!0&0#72|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#72|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#72|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#72|
+ |c::main::main::1::x@1!0&0#72|))))))
+ (= a!1 |goto_symex::guard@0!0&0#72|)))
+(assert (= |c::main::main::1::x1@1!0&0#72| |c::main::main::1::x@1!0&0#73|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#73|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#73|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#73|
+ |c::main::main::1::x@1!0&0#73|))))))
+ (= a!1 |goto_symex::guard@0!0&0#73|)))
+(assert (= |c::main::main::1::x1@1!0&0#73| |c::main::main::1::x@1!0&0#74|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#74|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#74|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#74|
+ |c::main::main::1::x@1!0&0#74|))))))
+ (= a!1 |goto_symex::guard@0!0&0#74|)))
+(assert (= |c::main::main::1::x1@1!0&0#74| |c::main::main::1::x@1!0&0#75|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#75|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#75|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#75|
+ |c::main::main::1::x@1!0&0#75|))))))
+ (= a!1 |goto_symex::guard@0!0&0#75|)))
+(assert (= |c::main::main::1::x1@1!0&0#75| |c::main::main::1::x@1!0&0#76|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#76|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#76|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#76|
+ |c::main::main::1::x@1!0&0#76|))))))
+ (= a!1 |goto_symex::guard@0!0&0#76|)))
+(assert (= |c::main::main::1::x1@1!0&0#76| |c::main::main::1::x@1!0&0#77|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#77|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#77|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#77|
+ |c::main::main::1::x@1!0&0#77|))))))
+ (= a!1 |goto_symex::guard@0!0&0#77|)))
+(assert (= |c::main::main::1::x1@1!0&0#77| |c::main::main::1::x@1!0&0#78|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#78|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#78|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#78|
+ |c::main::main::1::x@1!0&0#78|))))))
+ (= a!1 |goto_symex::guard@0!0&0#78|)))
+(assert (= |c::main::main::1::x1@1!0&0#78| |c::main::main::1::x@1!0&0#79|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#79|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#79|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#79|
+ |c::main::main::1::x@1!0&0#79|))))))
+ (= a!1 |goto_symex::guard@0!0&0#79|)))
+(assert (= |c::main::main::1::x1@1!0&0#79| |c::main::main::1::x@1!0&0#80|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#80|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#80|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#80|
+ |c::main::main::1::x@1!0&0#80|))))))
+ (= a!1 |goto_symex::guard@0!0&0#80|)))
+(assert (= |c::main::main::1::x1@1!0&0#80| |c::main::main::1::x@1!0&0#81|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#81|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#81|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#81|
+ |c::main::main::1::x@1!0&0#81|))))))
+ (= a!1 |goto_symex::guard@0!0&0#81|)))
+(assert (= |c::main::main::1::x1@1!0&0#81| |c::main::main::1::x@1!0&0#82|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#82|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#82|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#82|
+ |c::main::main::1::x@1!0&0#82|))))))
+ (= a!1 |goto_symex::guard@0!0&0#82|)))
+(assert (= |c::main::main::1::x1@1!0&0#82| |c::main::main::1::x@1!0&0#83|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#83|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#83|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#83|
+ |c::main::main::1::x@1!0&0#83|))))))
+ (= a!1 |goto_symex::guard@0!0&0#83|)))
+(assert (= |c::main::main::1::x1@1!0&0#83| |c::main::main::1::x@1!0&0#84|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#84|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#84|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#84|
+ |c::main::main::1::x@1!0&0#84|))))))
+ (= a!1 |goto_symex::guard@0!0&0#84|)))
+(assert (= |c::main::main::1::x1@1!0&0#84| |c::main::main::1::x@1!0&0#85|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#85|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#85|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#85|
+ |c::main::main::1::x@1!0&0#85|))))))
+ (= a!1 |goto_symex::guard@0!0&0#85|)))
+(assert (= |c::main::main::1::x1@1!0&0#85| |c::main::main::1::x@1!0&0#86|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#86|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#86|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#86|
+ |c::main::main::1::x@1!0&0#86|))))))
+ (= a!1 |goto_symex::guard@0!0&0#86|)))
+(assert (= |c::main::main::1::x1@1!0&0#86| |c::main::main::1::x@1!0&0#87|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#87|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#87|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#87|
+ |c::main::main::1::x@1!0&0#87|))))))
+ (= a!1 |goto_symex::guard@0!0&0#87|)))
+(assert (= |c::main::main::1::x1@1!0&0#87| |c::main::main::1::x@1!0&0#88|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#88|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#88|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#88|
+ |c::main::main::1::x@1!0&0#88|))))))
+ (= a!1 |goto_symex::guard@0!0&0#88|)))
+(assert (= |c::main::main::1::x1@1!0&0#88| |c::main::main::1::x@1!0&0#89|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#89|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#89|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#89|
+ |c::main::main::1::x@1!0&0#89|))))))
+ (= a!1 |goto_symex::guard@0!0&0#89|)))
+(assert (= |c::main::main::1::x1@1!0&0#89| |c::main::main::1::x@1!0&0#90|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#90|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#90|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#90|
+ |c::main::main::1::x@1!0&0#90|))))))
+ (= a!1 |goto_symex::guard@0!0&0#90|)))
+(assert (= |c::main::main::1::x1@1!0&0#90| |c::main::main::1::x@1!0&0#91|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#91|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#91|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#91|
+ |c::main::main::1::x@1!0&0#91|))))))
+ (= a!1 |goto_symex::guard@0!0&0#91|)))
+(assert (= |c::main::main::1::x1@1!0&0#91| |c::main::main::1::x@1!0&0#92|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#92|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#92|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#92|
+ |c::main::main::1::x@1!0&0#92|))))))
+ (= a!1 |goto_symex::guard@0!0&0#92|)))
+(assert (= |c::main::main::1::x1@1!0&0#92| |c::main::main::1::x@1!0&0#93|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#93|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#93|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#93|
+ |c::main::main::1::x@1!0&0#93|))))))
+ (= a!1 |goto_symex::guard@0!0&0#93|)))
+(assert (= |c::main::main::1::x1@1!0&0#93| |c::main::main::1::x@1!0&0#94|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#94|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#94|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#94|
+ |c::main::main::1::x@1!0&0#94|))))))
+ (= a!1 |goto_symex::guard@0!0&0#94|)))
+(assert (= |c::main::main::1::x1@1!0&0#94| |c::main::main::1::x@1!0&0#95|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#95|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#95|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#95|
+ |c::main::main::1::x@1!0&0#95|))))))
+ (= a!1 |goto_symex::guard@0!0&0#95|)))
+(assert (= |c::main::main::1::x1@1!0&0#95| |c::main::main::1::x@1!0&0#96|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#96|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#96|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#96|
+ |c::main::main::1::x@1!0&0#96|))))))
+ (= a!1 |goto_symex::guard@0!0&0#96|)))
+(assert (= |c::main::main::1::x1@1!0&0#96| |c::main::main::1::x@1!0&0#97|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#97|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#97|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#97|
+ |c::main::main::1::x@1!0&0#97|))))))
+ (= a!1 |goto_symex::guard@0!0&0#97|)))
+(assert (= |c::main::main::1::x1@1!0&0#97| |c::main::main::1::x@1!0&0#98|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#98|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#98|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#98|
+ |c::main::main::1::x@1!0&0#98|))))))
+ (= a!1 |goto_symex::guard@0!0&0#98|)))
+(assert (= |c::main::main::1::x1@1!0&0#98| |c::main::main::1::x@1!0&0#99|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#99|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#99|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#99|
+ |c::main::main::1::x@1!0&0#99|))))))
+ (= a!1 |goto_symex::guard@0!0&0#99|)))
+(assert (= |c::main::main::1::x1@1!0&0#99| |c::main::main::1::x@1!0&0#100|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#100|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#100|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#100|
+ |c::main::main::1::x@1!0&0#100|))))))
+ (= a!1 |goto_symex::guard@0!0&0#100|)))
+(assert (= |c::main::main::1::x1@1!0&0#100| |c::main::main::1::x@1!0&0#101|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#101|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#101|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#101|
+ |c::main::main::1::x@1!0&0#101|))))))
+ (= a!1 |goto_symex::guard@0!0&0#101|)))
+(assert (= |c::main::main::1::x1@1!0&0#101| |c::main::main::1::x@1!0&0#102|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#102|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#102|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#102|
+ |c::main::main::1::x@1!0&0#102|))))))
+ (= a!1 |goto_symex::guard@0!0&0#102|)))
+(assert (= |c::main::main::1::x1@1!0&0#102| |c::main::main::1::x@1!0&0#103|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#103|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#103|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#103|
+ |c::main::main::1::x@1!0&0#103|))))))
+ (= a!1 |goto_symex::guard@0!0&0#103|)))
+(assert (= |c::main::main::1::x1@1!0&0#103| |c::main::main::1::x@1!0&0#104|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#104|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#104|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#104|
+ |c::main::main::1::x@1!0&0#104|))))))
+ (= a!1 |goto_symex::guard@0!0&0#104|)))
+(assert (= |c::main::main::1::x1@1!0&0#104| |c::main::main::1::x@1!0&0#105|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#105|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#105|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#105|
+ |c::main::main::1::x@1!0&0#105|))))))
+ (= a!1 |goto_symex::guard@0!0&0#105|)))
+(assert (= |c::main::main::1::x1@1!0&0#105| |c::main::main::1::x@1!0&0#106|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#106|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#106|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#106|
+ |c::main::main::1::x@1!0&0#106|))))))
+ (= a!1 |goto_symex::guard@0!0&0#106|)))
+(assert (= |c::main::main::1::x1@1!0&0#106| |c::main::main::1::x@1!0&0#107|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#107|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#107|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#107|
+ |c::main::main::1::x@1!0&0#107|))))))
+ (= a!1 |goto_symex::guard@0!0&0#107|)))
+(assert (= |c::main::main::1::x1@1!0&0#107| |c::main::main::1::x@1!0&0#108|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#108|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#108|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#108|
+ |c::main::main::1::x@1!0&0#108|))))))
+ (= a!1 |goto_symex::guard@0!0&0#108|)))
+(assert (= |c::main::main::1::x1@1!0&0#108| |c::main::main::1::x@1!0&0#109|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#109|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#109|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#109|
+ |c::main::main::1::x@1!0&0#109|))))))
+ (= a!1 |goto_symex::guard@0!0&0#109|)))
+(assert (= |c::main::main::1::x1@1!0&0#109| |c::main::main::1::x@1!0&0#110|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#110|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#110|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#110|
+ |c::main::main::1::x@1!0&0#110|))))))
+ (= a!1 |goto_symex::guard@0!0&0#110|)))
+(assert (= |c::main::main::1::x1@1!0&0#110| |c::main::main::1::x@1!0&0#111|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#111|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#111|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#111|
+ |c::main::main::1::x@1!0&0#111|))))))
+ (= a!1 |goto_symex::guard@0!0&0#111|)))
+(assert (= |c::main::main::1::x1@1!0&0#111| |c::main::main::1::x@1!0&0#112|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#112|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#112|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#112|
+ |c::main::main::1::x@1!0&0#112|))))))
+ (= a!1 |goto_symex::guard@0!0&0#112|)))
+(assert (= |c::main::main::1::x1@1!0&0#112| |c::main::main::1::x@1!0&0#113|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#113|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#113|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#113|
+ |c::main::main::1::x@1!0&0#113|))))))
+ (= a!1 |goto_symex::guard@0!0&0#113|)))
+(assert (= |c::main::main::1::x1@1!0&0#113| |c::main::main::1::x@1!0&0#114|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#114|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#114|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#114|
+ |c::main::main::1::x@1!0&0#114|))))))
+ (= a!1 |goto_symex::guard@0!0&0#114|)))
+(assert (= |c::main::main::1::x1@1!0&0#114| |c::main::main::1::x@1!0&0#115|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#115|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#115|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#115|
+ |c::main::main::1::x@1!0&0#115|))))))
+ (= a!1 |goto_symex::guard@0!0&0#115|)))
+(assert (= |c::main::main::1::x1@1!0&0#115| |c::main::main::1::x@1!0&0#116|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#116|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#116|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#116|
+ |c::main::main::1::x@1!0&0#116|))))))
+ (= a!1 |goto_symex::guard@0!0&0#116|)))
+(assert (= |c::main::main::1::x1@1!0&0#116| |c::main::main::1::x@1!0&0#117|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#117|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#117|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#117|
+ |c::main::main::1::x@1!0&0#117|))))))
+ (= a!1 |goto_symex::guard@0!0&0#117|)))
+(assert (= |c::main::main::1::x1@1!0&0#117| |c::main::main::1::x@1!0&0#118|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#118|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#118|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#118|
+ |c::main::main::1::x@1!0&0#118|))))))
+ (= a!1 |goto_symex::guard@0!0&0#118|)))
+(assert (= |c::main::main::1::x1@1!0&0#118| |c::main::main::1::x@1!0&0#119|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#119|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#119|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#119|
+ |c::main::main::1::x@1!0&0#119|))))))
+ (= a!1 |goto_symex::guard@0!0&0#119|)))
+(assert (= |c::main::main::1::x1@1!0&0#119| |c::main::main::1::x@1!0&0#120|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#120|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#120|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#120|
+ |c::main::main::1::x@1!0&0#120|))))))
+ (= a!1 |goto_symex::guard@0!0&0#120|)))
+(assert (= |c::main::main::1::x1@1!0&0#120| |c::main::main::1::x@1!0&0#121|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#121|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#121|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#121|
+ |c::main::main::1::x@1!0&0#121|))))))
+ (= a!1 |goto_symex::guard@0!0&0#121|)))
+(assert (= |c::main::main::1::x1@1!0&0#121| |c::main::main::1::x@1!0&0#122|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#122|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#122|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#122|
+ |c::main::main::1::x@1!0&0#122|))))))
+ (= a!1 |goto_symex::guard@0!0&0#122|)))
+(assert (= |c::main::main::1::x1@1!0&0#122| |c::main::main::1::x@1!0&0#123|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#123|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#123|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#123|
+ |c::main::main::1::x@1!0&0#123|))))))
+ (= a!1 |goto_symex::guard@0!0&0#123|)))
+(assert (= |c::main::main::1::x1@1!0&0#123| |c::main::main::1::x@1!0&0#124|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#124|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#124|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#124|
+ |c::main::main::1::x@1!0&0#124|))))))
+ (= a!1 |goto_symex::guard@0!0&0#124|)))
+(assert (= |c::main::main::1::x1@1!0&0#124| |c::main::main::1::x@1!0&0#125|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#125|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#125|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#125|
+ |c::main::main::1::x@1!0&0#125|))))))
+ (= a!1 |goto_symex::guard@0!0&0#125|)))
+(assert (= |c::main::main::1::x1@1!0&0#125| |c::main::main::1::x@1!0&0#126|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#126|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#126|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#126|
+ |c::main::main::1::x@1!0&0#126|))))))
+ (= a!1 |goto_symex::guard@0!0&0#126|)))
+(assert (= |c::main::main::1::x1@1!0&0#126| |c::main::main::1::x@1!0&0#127|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#127|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#127|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#127|
+ |c::main::main::1::x@1!0&0#127|))))))
+ (= a!1 |goto_symex::guard@0!0&0#127|)))
+(assert (= |c::main::main::1::x1@1!0&0#127| |c::main::main::1::x@1!0&0#128|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#128|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#128|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#128|
+ |c::main::main::1::x@1!0&0#128|))))))
+ (= a!1 |goto_symex::guard@0!0&0#128|)))
+(assert (= |c::main::main::1::x1@1!0&0#128| |c::main::main::1::x@1!0&0#129|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#129|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#129|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#129|
+ |c::main::main::1::x@1!0&0#129|))))))
+ (= a!1 |goto_symex::guard@0!0&0#129|)))
+(assert (= |c::main::main::1::x1@1!0&0#129| |c::main::main::1::x@1!0&0#130|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#130|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#130|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#130|
+ |c::main::main::1::x@1!0&0#130|))))))
+ (= a!1 |goto_symex::guard@0!0&0#130|)))
+(assert (= |c::main::main::1::x1@1!0&0#130| |c::main::main::1::x@1!0&0#131|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#131|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#131|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#131|
+ |c::main::main::1::x@1!0&0#131|))))))
+ (= a!1 |goto_symex::guard@0!0&0#131|)))
+(assert (= |c::main::main::1::x1@1!0&0#131| |c::main::main::1::x@1!0&0#132|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#132|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#132|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#132|
+ |c::main::main::1::x@1!0&0#132|))))))
+ (= a!1 |goto_symex::guard@0!0&0#132|)))
+(assert (= |c::main::main::1::x1@1!0&0#132| |c::main::main::1::x@1!0&0#133|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#133|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#133|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#133|
+ |c::main::main::1::x@1!0&0#133|))))))
+ (= a!1 |goto_symex::guard@0!0&0#133|)))
+(assert (= |c::main::main::1::x1@1!0&0#133| |c::main::main::1::x@1!0&0#134|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#134|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#134|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#134|
+ |c::main::main::1::x@1!0&0#134|))))))
+ (= a!1 |goto_symex::guard@0!0&0#134|)))
+(assert (= |c::main::main::1::x1@1!0&0#134| |c::main::main::1::x@1!0&0#135|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#135|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#135|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#135|
+ |c::main::main::1::x@1!0&0#135|))))))
+ (= a!1 |goto_symex::guard@0!0&0#135|)))
+(assert (= |c::main::main::1::x1@1!0&0#135| |c::main::main::1::x@1!0&0#136|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#136|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#136|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#136|
+ |c::main::main::1::x@1!0&0#136|))))))
+ (= a!1 |goto_symex::guard@0!0&0#136|)))
+(assert (= |c::main::main::1::x1@1!0&0#136| |c::main::main::1::x@1!0&0#137|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#137|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#137|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#137|
+ |c::main::main::1::x@1!0&0#137|))))))
+ (= a!1 |goto_symex::guard@0!0&0#137|)))
+(assert (= |c::main::main::1::x1@1!0&0#137| |c::main::main::1::x@1!0&0#138|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#138|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#138|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#138|
+ |c::main::main::1::x@1!0&0#138|))))))
+ (= a!1 |goto_symex::guard@0!0&0#138|)))
+(assert (= |c::main::main::1::x1@1!0&0#138| |c::main::main::1::x@1!0&0#139|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#139|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#139|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#139|
+ |c::main::main::1::x@1!0&0#139|))))))
+ (= a!1 |goto_symex::guard@0!0&0#139|)))
+(assert (= |c::main::main::1::x1@1!0&0#139| |c::main::main::1::x@1!0&0#140|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#140|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#140|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#140|
+ |c::main::main::1::x@1!0&0#140|))))))
+ (= a!1 |goto_symex::guard@0!0&0#140|)))
+(assert (= |c::main::main::1::x1@1!0&0#140| |c::main::main::1::x@1!0&0#141|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#141|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#141|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#141|
+ |c::main::main::1::x@1!0&0#141|))))))
+ (= a!1 |goto_symex::guard@0!0&0#141|)))
+(assert (= |c::main::main::1::x1@1!0&0#141| |c::main::main::1::x@1!0&0#142|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#142|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#142|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#142|
+ |c::main::main::1::x@1!0&0#142|))))))
+ (= a!1 |goto_symex::guard@0!0&0#142|)))
+(assert (= |c::main::main::1::x1@1!0&0#142| |c::main::main::1::x@1!0&0#143|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#143|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#143|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#143|
+ |c::main::main::1::x@1!0&0#143|))))))
+ (= a!1 |goto_symex::guard@0!0&0#143|)))
+(assert (= |c::main::main::1::x1@1!0&0#143| |c::main::main::1::x@1!0&0#144|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#144|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#144|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#144|
+ |c::main::main::1::x@1!0&0#144|))))))
+ (= a!1 |goto_symex::guard@0!0&0#144|)))
+(assert (= |c::main::main::1::x1@1!0&0#144| |c::main::main::1::x@1!0&0#145|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#145|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#145|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#145|
+ |c::main::main::1::x@1!0&0#145|))))))
+ (= a!1 |goto_symex::guard@0!0&0#145|)))
+(assert (= |c::main::main::1::x1@1!0&0#145| |c::main::main::1::x@1!0&0#146|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#146|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#146|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#146|
+ |c::main::main::1::x@1!0&0#146|))))))
+ (= a!1 |goto_symex::guard@0!0&0#146|)))
+(assert (= |c::main::main::1::x1@1!0&0#146| |c::main::main::1::x@1!0&0#147|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#147|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#147|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#147|
+ |c::main::main::1::x@1!0&0#147|))))))
+ (= a!1 |goto_symex::guard@0!0&0#147|)))
+(assert (= |c::main::main::1::x1@1!0&0#147| |c::main::main::1::x@1!0&0#148|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#148|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#148|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#148|
+ |c::main::main::1::x@1!0&0#148|))))))
+ (= a!1 |goto_symex::guard@0!0&0#148|)))
+(assert (= |c::main::main::1::x1@1!0&0#148| |c::main::main::1::x@1!0&0#149|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#149|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#149|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#149|
+ |c::main::main::1::x@1!0&0#149|))))))
+ (= a!1 |goto_symex::guard@0!0&0#149|)))
+(assert (= |c::main::main::1::x1@1!0&0#149| |c::main::main::1::x@1!0&0#150|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#150|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#150|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#150|
+ |c::main::main::1::x@1!0&0#150|))))))
+ (= a!1 |goto_symex::guard@0!0&0#150|)))
+(assert (= |c::main::main::1::x1@1!0&0#150| |c::main::main::1::x@1!0&0#151|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#151|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#151|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#151|
+ |c::main::main::1::x@1!0&0#151|))))))
+ (= a!1 |goto_symex::guard@0!0&0#151|)))
+(assert (= |c::main::main::1::x1@1!0&0#151| |c::main::main::1::x@1!0&0#152|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#152|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#152|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#152|
+ |c::main::main::1::x@1!0&0#152|))))))
+ (= a!1 |goto_symex::guard@0!0&0#152|)))
+(assert (= |c::main::main::1::x1@1!0&0#152| |c::main::main::1::x@1!0&0#153|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#153|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#153|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#153|
+ |c::main::main::1::x@1!0&0#153|))))))
+ (= a!1 |goto_symex::guard@0!0&0#153|)))
+(assert (= |c::main::main::1::x1@1!0&0#153| |c::main::main::1::x@1!0&0#154|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#154|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#154|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#154|
+ |c::main::main::1::x@1!0&0#154|))))))
+ (= a!1 |goto_symex::guard@0!0&0#154|)))
+(assert (= |c::main::main::1::x1@1!0&0#154| |c::main::main::1::x@1!0&0#155|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#155|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#155|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#155|
+ |c::main::main::1::x@1!0&0#155|))))))
+ (= a!1 |goto_symex::guard@0!0&0#155|)))
+(assert (= |c::main::main::1::x1@1!0&0#155| |c::main::main::1::x@1!0&0#156|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#156|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#156|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#156|
+ |c::main::main::1::x@1!0&0#156|))))))
+ (= a!1 |goto_symex::guard@0!0&0#156|)))
+(assert (= |c::main::main::1::x1@1!0&0#156| |c::main::main::1::x@1!0&0#157|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#157|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#157|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#157|
+ |c::main::main::1::x@1!0&0#157|))))))
+ (= a!1 |goto_symex::guard@0!0&0#157|)))
+(assert (= |c::main::main::1::x1@1!0&0#157| |c::main::main::1::x@1!0&0#158|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#158|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#158|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#158|
+ |c::main::main::1::x@1!0&0#158|))))))
+ (= a!1 |goto_symex::guard@0!0&0#158|)))
+(assert (= |c::main::main::1::x1@1!0&0#158| |c::main::main::1::x@1!0&0#159|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#159|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#159|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#159|
+ |c::main::main::1::x@1!0&0#159|))))))
+ (= a!1 |goto_symex::guard@0!0&0#159|)))
+(assert (= |c::main::main::1::x1@1!0&0#159| |c::main::main::1::x@1!0&0#160|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#160|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#160|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#160|
+ |c::main::main::1::x@1!0&0#160|))))))
+ (= a!1 |goto_symex::guard@0!0&0#160|)))
+(assert (= |c::main::main::1::x1@1!0&0#160| |c::main::main::1::x@1!0&0#161|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#161|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#161|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#161|
+ |c::main::main::1::x@1!0&0#161|))))))
+ (= a!1 |goto_symex::guard@0!0&0#161|)))
+(assert (= |c::main::main::1::x1@1!0&0#161| |c::main::main::1::x@1!0&0#162|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#162|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#162|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#162|
+ |c::main::main::1::x@1!0&0#162|))))))
+ (= a!1 |goto_symex::guard@0!0&0#162|)))
+(assert (= |c::main::main::1::x1@1!0&0#162| |c::main::main::1::x@1!0&0#163|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#163|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#163|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#163|
+ |c::main::main::1::x@1!0&0#163|))))))
+ (= a!1 |goto_symex::guard@0!0&0#163|)))
+(assert (= |c::main::main::1::x1@1!0&0#163| |c::main::main::1::x@1!0&0#164|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#164|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#164|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#164|
+ |c::main::main::1::x@1!0&0#164|))))))
+ (= a!1 |goto_symex::guard@0!0&0#164|)))
+(assert (= |c::main::main::1::x1@1!0&0#164| |c::main::main::1::x@1!0&0#165|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#165|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#165|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#165|
+ |c::main::main::1::x@1!0&0#165|))))))
+ (= a!1 |goto_symex::guard@0!0&0#165|)))
+(assert (= |c::main::main::1::x1@1!0&0#165| |c::main::main::1::x@1!0&0#166|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#166|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#166|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#166|
+ |c::main::main::1::x@1!0&0#166|))))))
+ (= a!1 |goto_symex::guard@0!0&0#166|)))
+(assert (= |c::main::main::1::x1@1!0&0#166| |c::main::main::1::x@1!0&0#167|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#167|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#167|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#167|
+ |c::main::main::1::x@1!0&0#167|))))))
+ (= a!1 |goto_symex::guard@0!0&0#167|)))
+(assert (= |c::main::main::1::x1@1!0&0#167| |c::main::main::1::x@1!0&0#168|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#168|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#168|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#168|
+ |c::main::main::1::x@1!0&0#168|))))))
+ (= a!1 |goto_symex::guard@0!0&0#168|)))
+(assert (= |c::main::main::1::x1@1!0&0#168| |c::main::main::1::x@1!0&0#169|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#169|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#169|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#169|
+ |c::main::main::1::x@1!0&0#169|))))))
+ (= a!1 |goto_symex::guard@0!0&0#169|)))
+(assert (= |c::main::main::1::x1@1!0&0#169| |c::main::main::1::x@1!0&0#170|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#170|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#170|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#170|
+ |c::main::main::1::x@1!0&0#170|))))))
+ (= a!1 |goto_symex::guard@0!0&0#170|)))
+(assert (= |c::main::main::1::x1@1!0&0#170| |c::main::main::1::x@1!0&0#171|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#171|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#171|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#171|
+ |c::main::main::1::x@1!0&0#171|))))))
+ (= a!1 |goto_symex::guard@0!0&0#171|)))
+(assert (= |c::main::main::1::x1@1!0&0#171| |c::main::main::1::x@1!0&0#172|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#172|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#172|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#172|
+ |c::main::main::1::x@1!0&0#172|))))))
+ (= a!1 |goto_symex::guard@0!0&0#172|)))
+(assert (= |c::main::main::1::x1@1!0&0#172| |c::main::main::1::x@1!0&0#173|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#173|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#173|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#173|
+ |c::main::main::1::x@1!0&0#173|))))))
+ (= a!1 |goto_symex::guard@0!0&0#173|)))
+(assert (= |c::main::main::1::x1@1!0&0#173| |c::main::main::1::x@1!0&0#174|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#174|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#174|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#174|
+ |c::main::main::1::x@1!0&0#174|))))))
+ (= a!1 |goto_symex::guard@0!0&0#174|)))
+(assert (= |c::main::main::1::x1@1!0&0#174| |c::main::main::1::x@1!0&0#175|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#175|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#175|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#175|
+ |c::main::main::1::x@1!0&0#175|))))))
+ (= a!1 |goto_symex::guard@0!0&0#175|)))
+(assert (= |c::main::main::1::x1@1!0&0#175| |c::main::main::1::x@1!0&0#176|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#176|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#176|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#176|
+ |c::main::main::1::x@1!0&0#176|))))))
+ (= a!1 |goto_symex::guard@0!0&0#176|)))
+(assert (= |c::main::main::1::x1@1!0&0#176| |c::main::main::1::x@1!0&0#177|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#177|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#177|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#177|
+ |c::main::main::1::x@1!0&0#177|))))))
+ (= a!1 |goto_symex::guard@0!0&0#177|)))
+(assert (= |c::main::main::1::x1@1!0&0#177| |c::main::main::1::x@1!0&0#178|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#178|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#178|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#178|
+ |c::main::main::1::x@1!0&0#178|))))))
+ (= a!1 |goto_symex::guard@0!0&0#178|)))
+(assert (= |c::main::main::1::x1@1!0&0#178| |c::main::main::1::x@1!0&0#179|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#179|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#179|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#179|
+ |c::main::main::1::x@1!0&0#179|))))))
+ (= a!1 |goto_symex::guard@0!0&0#179|)))
+(assert (= |c::main::main::1::x1@1!0&0#179| |c::main::main::1::x@1!0&0#180|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#180|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#180|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#180|
+ |c::main::main::1::x@1!0&0#180|))))))
+ (= a!1 |goto_symex::guard@0!0&0#180|)))
+(assert (= |c::main::main::1::x1@1!0&0#180| |c::main::main::1::x@1!0&0#181|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#181|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#181|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#181|
+ |c::main::main::1::x@1!0&0#181|))))))
+ (= a!1 |goto_symex::guard@0!0&0#181|)))
+(assert (= |c::main::main::1::x1@1!0&0#181| |c::main::main::1::x@1!0&0#182|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#182|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#182|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#182|
+ |c::main::main::1::x@1!0&0#182|))))))
+ (= a!1 |goto_symex::guard@0!0&0#182|)))
+(assert (= |c::main::main::1::x1@1!0&0#182| |c::main::main::1::x@1!0&0#183|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#183|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#183|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#183|
+ |c::main::main::1::x@1!0&0#183|))))))
+ (= a!1 |goto_symex::guard@0!0&0#183|)))
+(assert (= |c::main::main::1::x1@1!0&0#183| |c::main::main::1::x@1!0&0#184|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#184|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#184|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#184|
+ |c::main::main::1::x@1!0&0#184|))))))
+ (= a!1 |goto_symex::guard@0!0&0#184|)))
+(assert (= |c::main::main::1::x1@1!0&0#184| |c::main::main::1::x@1!0&0#185|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#185|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#185|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#185|
+ |c::main::main::1::x@1!0&0#185|))))))
+ (= a!1 |goto_symex::guard@0!0&0#185|)))
+(assert (= |c::main::main::1::x1@1!0&0#185| |c::main::main::1::x@1!0&0#186|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#186|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#186|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#186|
+ |c::main::main::1::x@1!0&0#186|))))))
+ (= a!1 |goto_symex::guard@0!0&0#186|)))
+(assert (= |c::main::main::1::x1@1!0&0#186| |c::main::main::1::x@1!0&0#187|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#187|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#187|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#187|
+ |c::main::main::1::x@1!0&0#187|))))))
+ (= a!1 |goto_symex::guard@0!0&0#187|)))
+(assert (= |c::main::main::1::x1@1!0&0#187| |c::main::main::1::x@1!0&0#188|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#188|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#188|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#188|
+ |c::main::main::1::x@1!0&0#188|))))))
+ (= a!1 |goto_symex::guard@0!0&0#188|)))
+(assert (= |c::main::main::1::x1@1!0&0#188| |c::main::main::1::x@1!0&0#189|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#189|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#189|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#189|
+ |c::main::main::1::x@1!0&0#189|))))))
+ (= a!1 |goto_symex::guard@0!0&0#189|)))
+(assert (= |c::main::main::1::x1@1!0&0#189| |c::main::main::1::x@1!0&0#190|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#190|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#190|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#190|
+ |c::main::main::1::x@1!0&0#190|))))))
+ (= a!1 |goto_symex::guard@0!0&0#190|)))
+(assert (= |c::main::main::1::x1@1!0&0#190| |c::main::main::1::x@1!0&0#191|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#191|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#191|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#191|
+ |c::main::main::1::x@1!0&0#191|))))))
+ (= a!1 |goto_symex::guard@0!0&0#191|)))
+(assert (= |c::main::main::1::x1@1!0&0#191| |c::main::main::1::x@1!0&0#192|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#192|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#192|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#192|
+ |c::main::main::1::x@1!0&0#192|))))))
+ (= a!1 |goto_symex::guard@0!0&0#192|)))
+(assert (= |c::main::main::1::x1@1!0&0#192| |c::main::main::1::x@1!0&0#193|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#193|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#193|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#193|
+ |c::main::main::1::x@1!0&0#193|))))))
+ (= a!1 |goto_symex::guard@0!0&0#193|)))
+(assert (= |c::main::main::1::x1@1!0&0#193| |c::main::main::1::x@1!0&0#194|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#194|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#194|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#194|
+ |c::main::main::1::x@1!0&0#194|))))))
+ (= a!1 |goto_symex::guard@0!0&0#194|)))
+(assert (= |c::main::main::1::x1@1!0&0#194| |c::main::main::1::x@1!0&0#195|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#195|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#195|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#195|
+ |c::main::main::1::x@1!0&0#195|))))))
+ (= a!1 |goto_symex::guard@0!0&0#195|)))
+(assert (= |c::main::main::1::x1@1!0&0#195| |c::main::main::1::x@1!0&0#196|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#196|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#196|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#196|
+ |c::main::main::1::x@1!0&0#196|))))))
+ (= a!1 |goto_symex::guard@0!0&0#196|)))
+(assert (= |c::main::main::1::x1@1!0&0#196| |c::main::main::1::x@1!0&0#197|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#197|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#197|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#197|
+ |c::main::main::1::x@1!0&0#197|))))))
+ (= a!1 |goto_symex::guard@0!0&0#197|)))
+(assert (= |c::main::main::1::x1@1!0&0#197| |c::main::main::1::x@1!0&0#198|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#198|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#198|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#198|
+ |c::main::main::1::x@1!0&0#198|))))))
+ (= a!1 |goto_symex::guard@0!0&0#198|)))
+(assert (= |c::main::main::1::x1@1!0&0#198| |c::main::main::1::x@1!0&0#199|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#199|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#199|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#199|
+ |c::main::main::1::x@1!0&0#199|))))))
+ (= a!1 |goto_symex::guard@0!0&0#199|)))
+(assert (= |c::main::main::1::x1@1!0&0#199| |c::main::main::1::x@1!0&0#200|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#200|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#200|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#200|
+ |c::main::main::1::x@1!0&0#200|))))))
+ (= a!1 |goto_symex::guard@0!0&0#200|)))
+(assert (= |c::main::main::1::x1@1!0&0#200| |c::main::main::1::x@1!0&0#201|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#201|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#201|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#201|
+ |c::main::main::1::x@1!0&0#201|))))))
+ (= a!1 |goto_symex::guard@0!0&0#201|)))
+(assert (= |c::main::main::1::x1@1!0&0#201| |c::main::main::1::x@1!0&0#202|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#202|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#202|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#202|
+ |c::main::main::1::x@1!0&0#202|))))))
+ (= a!1 |goto_symex::guard@0!0&0#202|)))
+(assert (= |c::main::main::1::x1@1!0&0#202| |c::main::main::1::x@1!0&0#203|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#203|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#203|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#203|
+ |c::main::main::1::x@1!0&0#203|))))))
+ (= a!1 |goto_symex::guard@0!0&0#203|)))
+(assert (= |c::main::main::1::x1@1!0&0#203| |c::main::main::1::x@1!0&0#204|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#204|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#204|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#204|
+ |c::main::main::1::x@1!0&0#204|))))))
+ (= a!1 |goto_symex::guard@0!0&0#204|)))
+(assert (= |c::main::main::1::x1@1!0&0#204| |c::main::main::1::x@1!0&0#205|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#205|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#205|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#205|
+ |c::main::main::1::x@1!0&0#205|))))))
+ (= a!1 |goto_symex::guard@0!0&0#205|)))
+(assert (= |c::main::main::1::x1@1!0&0#205| |c::main::main::1::x@1!0&0#206|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#206|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#206|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#206|
+ |c::main::main::1::x@1!0&0#206|))))))
+ (= a!1 |goto_symex::guard@0!0&0#206|)))
+(assert (= |c::main::main::1::x1@1!0&0#206| |c::main::main::1::x@1!0&0#207|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#207|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#207|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#207|
+ |c::main::main::1::x@1!0&0#207|))))))
+ (= a!1 |goto_symex::guard@0!0&0#207|)))
+(assert (= |c::main::main::1::x1@1!0&0#207| |c::main::main::1::x@1!0&0#208|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#208|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#208|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#208|
+ |c::main::main::1::x@1!0&0#208|))))))
+ (= a!1 |goto_symex::guard@0!0&0#208|)))
+(assert (= |c::main::main::1::x1@1!0&0#208| |c::main::main::1::x@1!0&0#209|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#209|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#209|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#209|
+ |c::main::main::1::x@1!0&0#209|))))))
+ (= a!1 |goto_symex::guard@0!0&0#209|)))
+(assert (= |c::main::main::1::x1@1!0&0#209| |c::main::main::1::x@1!0&0#210|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#210|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#210|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#210|
+ |c::main::main::1::x@1!0&0#210|))))))
+ (= a!1 |goto_symex::guard@0!0&0#210|)))
+(assert (= |c::main::main::1::x1@1!0&0#210| |c::main::main::1::x@1!0&0#211|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#211|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#211|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#211|
+ |c::main::main::1::x@1!0&0#211|))))))
+ (= a!1 |goto_symex::guard@0!0&0#211|)))
+(assert (= |c::main::main::1::x1@1!0&0#211| |c::main::main::1::x@1!0&0#212|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#212|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#212|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#212|
+ |c::main::main::1::x@1!0&0#212|))))))
+ (= a!1 |goto_symex::guard@0!0&0#212|)))
+(assert (= |c::main::main::1::x1@1!0&0#212| |c::main::main::1::x@1!0&0#213|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#213|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#213|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#213|
+ |c::main::main::1::x@1!0&0#213|))))))
+ (= a!1 |goto_symex::guard@0!0&0#213|)))
+(assert (= |c::main::main::1::x1@1!0&0#213| |c::main::main::1::x@1!0&0#214|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#214|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#214|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#214|
+ |c::main::main::1::x@1!0&0#214|))))))
+ (= a!1 |goto_symex::guard@0!0&0#214|)))
+(assert (= |c::main::main::1::x1@1!0&0#214| |c::main::main::1::x@1!0&0#215|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#215|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#215|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#215|
+ |c::main::main::1::x@1!0&0#215|))))))
+ (= a!1 |goto_symex::guard@0!0&0#215|)))
+(assert (= |c::main::main::1::x1@1!0&0#215| |c::main::main::1::x@1!0&0#216|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#216|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#216|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#216|
+ |c::main::main::1::x@1!0&0#216|))))))
+ (= a!1 |goto_symex::guard@0!0&0#216|)))
+(assert (= |c::main::main::1::x1@1!0&0#216| |c::main::main::1::x@1!0&0#217|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#217|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#217|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#217|
+ |c::main::main::1::x@1!0&0#217|))))))
+ (= a!1 |goto_symex::guard@0!0&0#217|)))
+(assert (= |c::main::main::1::x1@1!0&0#217| |c::main::main::1::x@1!0&0#218|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#218|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#218|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#218|
+ |c::main::main::1::x@1!0&0#218|))))))
+ (= a!1 |goto_symex::guard@0!0&0#218|)))
+(assert (= |c::main::main::1::x1@1!0&0#218| |c::main::main::1::x@1!0&0#219|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#219|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#219|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#219|
+ |c::main::main::1::x@1!0&0#219|))))))
+ (= a!1 |goto_symex::guard@0!0&0#219|)))
+(assert (= |c::main::main::1::x1@1!0&0#219| |c::main::main::1::x@1!0&0#220|))
+(assert (= (fp.div roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#220|
+ (fp #b0 #x7f #b10011001100110011001101))
+ |c::main::main::1::x1@1!0&0#220|))
+(assert (let ((a!1 (not (not (not (fp.eq |c::main::main::1::x1@1!0&0#220|
+ |c::main::main::1::x@1!0&0#220|))))))
+ (= a!1 |goto_symex::guard@0!0&0#220|)))
+(assert (= |c::main::main::1::x@1!0&0#220| |c::main::main::1::x@1!0&0#222|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#219|)
+ |c::main::main::1::x@1!0&0#219|
+ |c::main::main::1::x@1!0&0#222|)
+ |c::main::main::1::x@1!0&0#223|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#218|)
+ |c::main::main::1::x@1!0&0#218|
+ |c::main::main::1::x@1!0&0#223|)
+ |c::main::main::1::x@1!0&0#224|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#217|)
+ |c::main::main::1::x@1!0&0#217|
+ |c::main::main::1::x@1!0&0#224|)
+ |c::main::main::1::x@1!0&0#225|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#216|)
+ |c::main::main::1::x@1!0&0#216|
+ |c::main::main::1::x@1!0&0#225|)
+ |c::main::main::1::x@1!0&0#226|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#215|)
+ |c::main::main::1::x@1!0&0#215|
+ |c::main::main::1::x@1!0&0#226|)
+ |c::main::main::1::x@1!0&0#227|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#214|)
+ |c::main::main::1::x@1!0&0#214|
+ |c::main::main::1::x@1!0&0#227|)
+ |c::main::main::1::x@1!0&0#228|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#213|)
+ |c::main::main::1::x@1!0&0#213|
+ |c::main::main::1::x@1!0&0#228|)
+ |c::main::main::1::x@1!0&0#229|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#212|)
+ |c::main::main::1::x@1!0&0#212|
+ |c::main::main::1::x@1!0&0#229|)
+ |c::main::main::1::x@1!0&0#230|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#211|)
+ |c::main::main::1::x@1!0&0#211|
+ |c::main::main::1::x@1!0&0#230|)
+ |c::main::main::1::x@1!0&0#231|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#210|)
+ |c::main::main::1::x@1!0&0#210|
+ |c::main::main::1::x@1!0&0#231|)
+ |c::main::main::1::x@1!0&0#232|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#209|)
+ |c::main::main::1::x@1!0&0#209|
+ |c::main::main::1::x@1!0&0#232|)
+ |c::main::main::1::x@1!0&0#233|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#208|)
+ |c::main::main::1::x@1!0&0#208|
+ |c::main::main::1::x@1!0&0#233|)
+ |c::main::main::1::x@1!0&0#234|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#207|)
+ |c::main::main::1::x@1!0&0#207|
+ |c::main::main::1::x@1!0&0#234|)
+ |c::main::main::1::x@1!0&0#235|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#206|)
+ |c::main::main::1::x@1!0&0#206|
+ |c::main::main::1::x@1!0&0#235|)
+ |c::main::main::1::x@1!0&0#236|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#205|)
+ |c::main::main::1::x@1!0&0#205|
+ |c::main::main::1::x@1!0&0#236|)
+ |c::main::main::1::x@1!0&0#237|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#204|)
+ |c::main::main::1::x@1!0&0#204|
+ |c::main::main::1::x@1!0&0#237|)
+ |c::main::main::1::x@1!0&0#238|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#203|)
+ |c::main::main::1::x@1!0&0#203|
+ |c::main::main::1::x@1!0&0#238|)
+ |c::main::main::1::x@1!0&0#239|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#202|)
+ |c::main::main::1::x@1!0&0#202|
+ |c::main::main::1::x@1!0&0#239|)
+ |c::main::main::1::x@1!0&0#240|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#201|)
+ |c::main::main::1::x@1!0&0#201|
+ |c::main::main::1::x@1!0&0#240|)
+ |c::main::main::1::x@1!0&0#241|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#200|)
+ |c::main::main::1::x@1!0&0#200|
+ |c::main::main::1::x@1!0&0#241|)
+ |c::main::main::1::x@1!0&0#242|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#199|)
+ |c::main::main::1::x@1!0&0#199|
+ |c::main::main::1::x@1!0&0#242|)
+ |c::main::main::1::x@1!0&0#243|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#198|)
+ |c::main::main::1::x@1!0&0#198|
+ |c::main::main::1::x@1!0&0#243|)
+ |c::main::main::1::x@1!0&0#244|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#197|)
+ |c::main::main::1::x@1!0&0#197|
+ |c::main::main::1::x@1!0&0#244|)
+ |c::main::main::1::x@1!0&0#245|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#196|)
+ |c::main::main::1::x@1!0&0#196|
+ |c::main::main::1::x@1!0&0#245|)
+ |c::main::main::1::x@1!0&0#246|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#195|)
+ |c::main::main::1::x@1!0&0#195|
+ |c::main::main::1::x@1!0&0#246|)
+ |c::main::main::1::x@1!0&0#247|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#194|)
+ |c::main::main::1::x@1!0&0#194|
+ |c::main::main::1::x@1!0&0#247|)
+ |c::main::main::1::x@1!0&0#248|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#193|)
+ |c::main::main::1::x@1!0&0#193|
+ |c::main::main::1::x@1!0&0#248|)
+ |c::main::main::1::x@1!0&0#249|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#192|)
+ |c::main::main::1::x@1!0&0#192|
+ |c::main::main::1::x@1!0&0#249|)
+ |c::main::main::1::x@1!0&0#250|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#191|)
+ |c::main::main::1::x@1!0&0#191|
+ |c::main::main::1::x@1!0&0#250|)
+ |c::main::main::1::x@1!0&0#251|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#190|)
+ |c::main::main::1::x@1!0&0#190|
+ |c::main::main::1::x@1!0&0#251|)
+ |c::main::main::1::x@1!0&0#252|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#189|)
+ |c::main::main::1::x@1!0&0#189|
+ |c::main::main::1::x@1!0&0#252|)
+ |c::main::main::1::x@1!0&0#253|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#188|)
+ |c::main::main::1::x@1!0&0#188|
+ |c::main::main::1::x@1!0&0#253|)
+ |c::main::main::1::x@1!0&0#254|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#187|)
+ |c::main::main::1::x@1!0&0#187|
+ |c::main::main::1::x@1!0&0#254|)
+ |c::main::main::1::x@1!0&0#255|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#186|)
+ |c::main::main::1::x@1!0&0#186|
+ |c::main::main::1::x@1!0&0#255|)
+ |c::main::main::1::x@1!0&0#256|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#185|)
+ |c::main::main::1::x@1!0&0#185|
+ |c::main::main::1::x@1!0&0#256|)
+ |c::main::main::1::x@1!0&0#257|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#184|)
+ |c::main::main::1::x@1!0&0#184|
+ |c::main::main::1::x@1!0&0#257|)
+ |c::main::main::1::x@1!0&0#258|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#183|)
+ |c::main::main::1::x@1!0&0#183|
+ |c::main::main::1::x@1!0&0#258|)
+ |c::main::main::1::x@1!0&0#259|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#182|)
+ |c::main::main::1::x@1!0&0#182|
+ |c::main::main::1::x@1!0&0#259|)
+ |c::main::main::1::x@1!0&0#260|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#181|)
+ |c::main::main::1::x@1!0&0#181|
+ |c::main::main::1::x@1!0&0#260|)
+ |c::main::main::1::x@1!0&0#261|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#180|)
+ |c::main::main::1::x@1!0&0#180|
+ |c::main::main::1::x@1!0&0#261|)
+ |c::main::main::1::x@1!0&0#262|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#179|)
+ |c::main::main::1::x@1!0&0#179|
+ |c::main::main::1::x@1!0&0#262|)
+ |c::main::main::1::x@1!0&0#263|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#178|)
+ |c::main::main::1::x@1!0&0#178|
+ |c::main::main::1::x@1!0&0#263|)
+ |c::main::main::1::x@1!0&0#264|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#177|)
+ |c::main::main::1::x@1!0&0#177|
+ |c::main::main::1::x@1!0&0#264|)
+ |c::main::main::1::x@1!0&0#265|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#176|)
+ |c::main::main::1::x@1!0&0#176|
+ |c::main::main::1::x@1!0&0#265|)
+ |c::main::main::1::x@1!0&0#266|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#175|)
+ |c::main::main::1::x@1!0&0#175|
+ |c::main::main::1::x@1!0&0#266|)
+ |c::main::main::1::x@1!0&0#267|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#174|)
+ |c::main::main::1::x@1!0&0#174|
+ |c::main::main::1::x@1!0&0#267|)
+ |c::main::main::1::x@1!0&0#268|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#173|)
+ |c::main::main::1::x@1!0&0#173|
+ |c::main::main::1::x@1!0&0#268|)
+ |c::main::main::1::x@1!0&0#269|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#172|)
+ |c::main::main::1::x@1!0&0#172|
+ |c::main::main::1::x@1!0&0#269|)
+ |c::main::main::1::x@1!0&0#270|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#171|)
+ |c::main::main::1::x@1!0&0#171|
+ |c::main::main::1::x@1!0&0#270|)
+ |c::main::main::1::x@1!0&0#271|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#170|)
+ |c::main::main::1::x@1!0&0#170|
+ |c::main::main::1::x@1!0&0#271|)
+ |c::main::main::1::x@1!0&0#272|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#169|)
+ |c::main::main::1::x@1!0&0#169|
+ |c::main::main::1::x@1!0&0#272|)
+ |c::main::main::1::x@1!0&0#273|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#168|)
+ |c::main::main::1::x@1!0&0#168|
+ |c::main::main::1::x@1!0&0#273|)
+ |c::main::main::1::x@1!0&0#274|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#167|)
+ |c::main::main::1::x@1!0&0#167|
+ |c::main::main::1::x@1!0&0#274|)
+ |c::main::main::1::x@1!0&0#275|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#166|)
+ |c::main::main::1::x@1!0&0#166|
+ |c::main::main::1::x@1!0&0#275|)
+ |c::main::main::1::x@1!0&0#276|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#165|)
+ |c::main::main::1::x@1!0&0#165|
+ |c::main::main::1::x@1!0&0#276|)
+ |c::main::main::1::x@1!0&0#277|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#164|)
+ |c::main::main::1::x@1!0&0#164|
+ |c::main::main::1::x@1!0&0#277|)
+ |c::main::main::1::x@1!0&0#278|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#163|)
+ |c::main::main::1::x@1!0&0#163|
+ |c::main::main::1::x@1!0&0#278|)
+ |c::main::main::1::x@1!0&0#279|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#162|)
+ |c::main::main::1::x@1!0&0#162|
+ |c::main::main::1::x@1!0&0#279|)
+ |c::main::main::1::x@1!0&0#280|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#161|)
+ |c::main::main::1::x@1!0&0#161|
+ |c::main::main::1::x@1!0&0#280|)
+ |c::main::main::1::x@1!0&0#281|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#160|)
+ |c::main::main::1::x@1!0&0#160|
+ |c::main::main::1::x@1!0&0#281|)
+ |c::main::main::1::x@1!0&0#282|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#159|)
+ |c::main::main::1::x@1!0&0#159|
+ |c::main::main::1::x@1!0&0#282|)
+ |c::main::main::1::x@1!0&0#283|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#158|)
+ |c::main::main::1::x@1!0&0#158|
+ |c::main::main::1::x@1!0&0#283|)
+ |c::main::main::1::x@1!0&0#284|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#157|)
+ |c::main::main::1::x@1!0&0#157|
+ |c::main::main::1::x@1!0&0#284|)
+ |c::main::main::1::x@1!0&0#285|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#156|)
+ |c::main::main::1::x@1!0&0#156|
+ |c::main::main::1::x@1!0&0#285|)
+ |c::main::main::1::x@1!0&0#286|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#155|)
+ |c::main::main::1::x@1!0&0#155|
+ |c::main::main::1::x@1!0&0#286|)
+ |c::main::main::1::x@1!0&0#287|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#154|)
+ |c::main::main::1::x@1!0&0#154|
+ |c::main::main::1::x@1!0&0#287|)
+ |c::main::main::1::x@1!0&0#288|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#153|)
+ |c::main::main::1::x@1!0&0#153|
+ |c::main::main::1::x@1!0&0#288|)
+ |c::main::main::1::x@1!0&0#289|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#152|)
+ |c::main::main::1::x@1!0&0#152|
+ |c::main::main::1::x@1!0&0#289|)
+ |c::main::main::1::x@1!0&0#290|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#151|)
+ |c::main::main::1::x@1!0&0#151|
+ |c::main::main::1::x@1!0&0#290|)
+ |c::main::main::1::x@1!0&0#291|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#150|)
+ |c::main::main::1::x@1!0&0#150|
+ |c::main::main::1::x@1!0&0#291|)
+ |c::main::main::1::x@1!0&0#292|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#149|)
+ |c::main::main::1::x@1!0&0#149|
+ |c::main::main::1::x@1!0&0#292|)
+ |c::main::main::1::x@1!0&0#293|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#148|)
+ |c::main::main::1::x@1!0&0#148|
+ |c::main::main::1::x@1!0&0#293|)
+ |c::main::main::1::x@1!0&0#294|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#147|)
+ |c::main::main::1::x@1!0&0#147|
+ |c::main::main::1::x@1!0&0#294|)
+ |c::main::main::1::x@1!0&0#295|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#146|)
+ |c::main::main::1::x@1!0&0#146|
+ |c::main::main::1::x@1!0&0#295|)
+ |c::main::main::1::x@1!0&0#296|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#145|)
+ |c::main::main::1::x@1!0&0#145|
+ |c::main::main::1::x@1!0&0#296|)
+ |c::main::main::1::x@1!0&0#297|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#144|)
+ |c::main::main::1::x@1!0&0#144|
+ |c::main::main::1::x@1!0&0#297|)
+ |c::main::main::1::x@1!0&0#298|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#143|)
+ |c::main::main::1::x@1!0&0#143|
+ |c::main::main::1::x@1!0&0#298|)
+ |c::main::main::1::x@1!0&0#299|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#142|)
+ |c::main::main::1::x@1!0&0#142|
+ |c::main::main::1::x@1!0&0#299|)
+ |c::main::main::1::x@1!0&0#300|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#141|)
+ |c::main::main::1::x@1!0&0#141|
+ |c::main::main::1::x@1!0&0#300|)
+ |c::main::main::1::x@1!0&0#301|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#140|)
+ |c::main::main::1::x@1!0&0#140|
+ |c::main::main::1::x@1!0&0#301|)
+ |c::main::main::1::x@1!0&0#302|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#139|)
+ |c::main::main::1::x@1!0&0#139|
+ |c::main::main::1::x@1!0&0#302|)
+ |c::main::main::1::x@1!0&0#303|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#138|)
+ |c::main::main::1::x@1!0&0#138|
+ |c::main::main::1::x@1!0&0#303|)
+ |c::main::main::1::x@1!0&0#304|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#137|)
+ |c::main::main::1::x@1!0&0#137|
+ |c::main::main::1::x@1!0&0#304|)
+ |c::main::main::1::x@1!0&0#305|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#136|)
+ |c::main::main::1::x@1!0&0#136|
+ |c::main::main::1::x@1!0&0#305|)
+ |c::main::main::1::x@1!0&0#306|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#135|)
+ |c::main::main::1::x@1!0&0#135|
+ |c::main::main::1::x@1!0&0#306|)
+ |c::main::main::1::x@1!0&0#307|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#134|)
+ |c::main::main::1::x@1!0&0#134|
+ |c::main::main::1::x@1!0&0#307|)
+ |c::main::main::1::x@1!0&0#308|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#133|)
+ |c::main::main::1::x@1!0&0#133|
+ |c::main::main::1::x@1!0&0#308|)
+ |c::main::main::1::x@1!0&0#309|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#132|)
+ |c::main::main::1::x@1!0&0#132|
+ |c::main::main::1::x@1!0&0#309|)
+ |c::main::main::1::x@1!0&0#310|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#131|)
+ |c::main::main::1::x@1!0&0#131|
+ |c::main::main::1::x@1!0&0#310|)
+ |c::main::main::1::x@1!0&0#311|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#130|)
+ |c::main::main::1::x@1!0&0#130|
+ |c::main::main::1::x@1!0&0#311|)
+ |c::main::main::1::x@1!0&0#312|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#129|)
+ |c::main::main::1::x@1!0&0#129|
+ |c::main::main::1::x@1!0&0#312|)
+ |c::main::main::1::x@1!0&0#313|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#128|)
+ |c::main::main::1::x@1!0&0#128|
+ |c::main::main::1::x@1!0&0#313|)
+ |c::main::main::1::x@1!0&0#314|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#127|)
+ |c::main::main::1::x@1!0&0#127|
+ |c::main::main::1::x@1!0&0#314|)
+ |c::main::main::1::x@1!0&0#315|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#126|)
+ |c::main::main::1::x@1!0&0#126|
+ |c::main::main::1::x@1!0&0#315|)
+ |c::main::main::1::x@1!0&0#316|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#125|)
+ |c::main::main::1::x@1!0&0#125|
+ |c::main::main::1::x@1!0&0#316|)
+ |c::main::main::1::x@1!0&0#317|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#124|)
+ |c::main::main::1::x@1!0&0#124|
+ |c::main::main::1::x@1!0&0#317|)
+ |c::main::main::1::x@1!0&0#318|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#123|)
+ |c::main::main::1::x@1!0&0#123|
+ |c::main::main::1::x@1!0&0#318|)
+ |c::main::main::1::x@1!0&0#319|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#122|)
+ |c::main::main::1::x@1!0&0#122|
+ |c::main::main::1::x@1!0&0#319|)
+ |c::main::main::1::x@1!0&0#320|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#121|)
+ |c::main::main::1::x@1!0&0#121|
+ |c::main::main::1::x@1!0&0#320|)
+ |c::main::main::1::x@1!0&0#321|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#120|)
+ |c::main::main::1::x@1!0&0#120|
+ |c::main::main::1::x@1!0&0#321|)
+ |c::main::main::1::x@1!0&0#322|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#119|)
+ |c::main::main::1::x@1!0&0#119|
+ |c::main::main::1::x@1!0&0#322|)
+ |c::main::main::1::x@1!0&0#323|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#118|)
+ |c::main::main::1::x@1!0&0#118|
+ |c::main::main::1::x@1!0&0#323|)
+ |c::main::main::1::x@1!0&0#324|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#117|)
+ |c::main::main::1::x@1!0&0#117|
+ |c::main::main::1::x@1!0&0#324|)
+ |c::main::main::1::x@1!0&0#325|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#116|)
+ |c::main::main::1::x@1!0&0#116|
+ |c::main::main::1::x@1!0&0#325|)
+ |c::main::main::1::x@1!0&0#326|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#115|)
+ |c::main::main::1::x@1!0&0#115|
+ |c::main::main::1::x@1!0&0#326|)
+ |c::main::main::1::x@1!0&0#327|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#114|)
+ |c::main::main::1::x@1!0&0#114|
+ |c::main::main::1::x@1!0&0#327|)
+ |c::main::main::1::x@1!0&0#328|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#113|)
+ |c::main::main::1::x@1!0&0#113|
+ |c::main::main::1::x@1!0&0#328|)
+ |c::main::main::1::x@1!0&0#329|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#112|)
+ |c::main::main::1::x@1!0&0#112|
+ |c::main::main::1::x@1!0&0#329|)
+ |c::main::main::1::x@1!0&0#330|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#111|)
+ |c::main::main::1::x@1!0&0#111|
+ |c::main::main::1::x@1!0&0#330|)
+ |c::main::main::1::x@1!0&0#331|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#110|)
+ |c::main::main::1::x@1!0&0#110|
+ |c::main::main::1::x@1!0&0#331|)
+ |c::main::main::1::x@1!0&0#332|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#109|)
+ |c::main::main::1::x@1!0&0#109|
+ |c::main::main::1::x@1!0&0#332|)
+ |c::main::main::1::x@1!0&0#333|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#108|)
+ |c::main::main::1::x@1!0&0#108|
+ |c::main::main::1::x@1!0&0#333|)
+ |c::main::main::1::x@1!0&0#334|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#107|)
+ |c::main::main::1::x@1!0&0#107|
+ |c::main::main::1::x@1!0&0#334|)
+ |c::main::main::1::x@1!0&0#335|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#106|)
+ |c::main::main::1::x@1!0&0#106|
+ |c::main::main::1::x@1!0&0#335|)
+ |c::main::main::1::x@1!0&0#336|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#105|)
+ |c::main::main::1::x@1!0&0#105|
+ |c::main::main::1::x@1!0&0#336|)
+ |c::main::main::1::x@1!0&0#337|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#104|)
+ |c::main::main::1::x@1!0&0#104|
+ |c::main::main::1::x@1!0&0#337|)
+ |c::main::main::1::x@1!0&0#338|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#103|)
+ |c::main::main::1::x@1!0&0#103|
+ |c::main::main::1::x@1!0&0#338|)
+ |c::main::main::1::x@1!0&0#339|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#102|)
+ |c::main::main::1::x@1!0&0#102|
+ |c::main::main::1::x@1!0&0#339|)
+ |c::main::main::1::x@1!0&0#340|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#101|)
+ |c::main::main::1::x@1!0&0#101|
+ |c::main::main::1::x@1!0&0#340|)
+ |c::main::main::1::x@1!0&0#341|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#100|)
+ |c::main::main::1::x@1!0&0#100|
+ |c::main::main::1::x@1!0&0#341|)
+ |c::main::main::1::x@1!0&0#342|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#99|)
+ |c::main::main::1::x@1!0&0#99|
+ |c::main::main::1::x@1!0&0#342|)
+ |c::main::main::1::x@1!0&0#343|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#98|)
+ |c::main::main::1::x@1!0&0#98|
+ |c::main::main::1::x@1!0&0#343|)
+ |c::main::main::1::x@1!0&0#344|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#97|)
+ |c::main::main::1::x@1!0&0#97|
+ |c::main::main::1::x@1!0&0#344|)
+ |c::main::main::1::x@1!0&0#345|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#96|)
+ |c::main::main::1::x@1!0&0#96|
+ |c::main::main::1::x@1!0&0#345|)
+ |c::main::main::1::x@1!0&0#346|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#95|)
+ |c::main::main::1::x@1!0&0#95|
+ |c::main::main::1::x@1!0&0#346|)
+ |c::main::main::1::x@1!0&0#347|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#94|)
+ |c::main::main::1::x@1!0&0#94|
+ |c::main::main::1::x@1!0&0#347|)
+ |c::main::main::1::x@1!0&0#348|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#93|)
+ |c::main::main::1::x@1!0&0#93|
+ |c::main::main::1::x@1!0&0#348|)
+ |c::main::main::1::x@1!0&0#349|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#92|)
+ |c::main::main::1::x@1!0&0#92|
+ |c::main::main::1::x@1!0&0#349|)
+ |c::main::main::1::x@1!0&0#350|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#91|)
+ |c::main::main::1::x@1!0&0#91|
+ |c::main::main::1::x@1!0&0#350|)
+ |c::main::main::1::x@1!0&0#351|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#90|)
+ |c::main::main::1::x@1!0&0#90|
+ |c::main::main::1::x@1!0&0#351|)
+ |c::main::main::1::x@1!0&0#352|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#89|)
+ |c::main::main::1::x@1!0&0#89|
+ |c::main::main::1::x@1!0&0#352|)
+ |c::main::main::1::x@1!0&0#353|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#88|)
+ |c::main::main::1::x@1!0&0#88|
+ |c::main::main::1::x@1!0&0#353|)
+ |c::main::main::1::x@1!0&0#354|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#87|)
+ |c::main::main::1::x@1!0&0#87|
+ |c::main::main::1::x@1!0&0#354|)
+ |c::main::main::1::x@1!0&0#355|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#86|)
+ |c::main::main::1::x@1!0&0#86|
+ |c::main::main::1::x@1!0&0#355|)
+ |c::main::main::1::x@1!0&0#356|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#85|)
+ |c::main::main::1::x@1!0&0#85|
+ |c::main::main::1::x@1!0&0#356|)
+ |c::main::main::1::x@1!0&0#357|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#84|)
+ |c::main::main::1::x@1!0&0#84|
+ |c::main::main::1::x@1!0&0#357|)
+ |c::main::main::1::x@1!0&0#358|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#83|)
+ |c::main::main::1::x@1!0&0#83|
+ |c::main::main::1::x@1!0&0#358|)
+ |c::main::main::1::x@1!0&0#359|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#82|)
+ |c::main::main::1::x@1!0&0#82|
+ |c::main::main::1::x@1!0&0#359|)
+ |c::main::main::1::x@1!0&0#360|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#81|)
+ |c::main::main::1::x@1!0&0#81|
+ |c::main::main::1::x@1!0&0#360|)
+ |c::main::main::1::x@1!0&0#361|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#80|)
+ |c::main::main::1::x@1!0&0#80|
+ |c::main::main::1::x@1!0&0#361|)
+ |c::main::main::1::x@1!0&0#362|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#79|)
+ |c::main::main::1::x@1!0&0#79|
+ |c::main::main::1::x@1!0&0#362|)
+ |c::main::main::1::x@1!0&0#363|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#78|)
+ |c::main::main::1::x@1!0&0#78|
+ |c::main::main::1::x@1!0&0#363|)
+ |c::main::main::1::x@1!0&0#364|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#77|)
+ |c::main::main::1::x@1!0&0#77|
+ |c::main::main::1::x@1!0&0#364|)
+ |c::main::main::1::x@1!0&0#365|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#76|)
+ |c::main::main::1::x@1!0&0#76|
+ |c::main::main::1::x@1!0&0#365|)
+ |c::main::main::1::x@1!0&0#366|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#75|)
+ |c::main::main::1::x@1!0&0#75|
+ |c::main::main::1::x@1!0&0#366|)
+ |c::main::main::1::x@1!0&0#367|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#74|)
+ |c::main::main::1::x@1!0&0#74|
+ |c::main::main::1::x@1!0&0#367|)
+ |c::main::main::1::x@1!0&0#368|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#73|)
+ |c::main::main::1::x@1!0&0#73|
+ |c::main::main::1::x@1!0&0#368|)
+ |c::main::main::1::x@1!0&0#369|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#72|)
+ |c::main::main::1::x@1!0&0#72|
+ |c::main::main::1::x@1!0&0#369|)
+ |c::main::main::1::x@1!0&0#370|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#71|)
+ |c::main::main::1::x@1!0&0#71|
+ |c::main::main::1::x@1!0&0#370|)
+ |c::main::main::1::x@1!0&0#371|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#70|)
+ |c::main::main::1::x@1!0&0#70|
+ |c::main::main::1::x@1!0&0#371|)
+ |c::main::main::1::x@1!0&0#372|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#69|)
+ |c::main::main::1::x@1!0&0#69|
+ |c::main::main::1::x@1!0&0#372|)
+ |c::main::main::1::x@1!0&0#373|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#68|)
+ |c::main::main::1::x@1!0&0#68|
+ |c::main::main::1::x@1!0&0#373|)
+ |c::main::main::1::x@1!0&0#374|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#67|)
+ |c::main::main::1::x@1!0&0#67|
+ |c::main::main::1::x@1!0&0#374|)
+ |c::main::main::1::x@1!0&0#375|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#66|)
+ |c::main::main::1::x@1!0&0#66|
+ |c::main::main::1::x@1!0&0#375|)
+ |c::main::main::1::x@1!0&0#376|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#65|)
+ |c::main::main::1::x@1!0&0#65|
+ |c::main::main::1::x@1!0&0#376|)
+ |c::main::main::1::x@1!0&0#377|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#64|)
+ |c::main::main::1::x@1!0&0#64|
+ |c::main::main::1::x@1!0&0#377|)
+ |c::main::main::1::x@1!0&0#378|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#63|)
+ |c::main::main::1::x@1!0&0#63|
+ |c::main::main::1::x@1!0&0#378|)
+ |c::main::main::1::x@1!0&0#379|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#62|)
+ |c::main::main::1::x@1!0&0#62|
+ |c::main::main::1::x@1!0&0#379|)
+ |c::main::main::1::x@1!0&0#380|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#61|)
+ |c::main::main::1::x@1!0&0#61|
+ |c::main::main::1::x@1!0&0#380|)
+ |c::main::main::1::x@1!0&0#381|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#60|)
+ |c::main::main::1::x@1!0&0#60|
+ |c::main::main::1::x@1!0&0#381|)
+ |c::main::main::1::x@1!0&0#382|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#59|)
+ |c::main::main::1::x@1!0&0#59|
+ |c::main::main::1::x@1!0&0#382|)
+ |c::main::main::1::x@1!0&0#383|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#58|)
+ |c::main::main::1::x@1!0&0#58|
+ |c::main::main::1::x@1!0&0#383|)
+ |c::main::main::1::x@1!0&0#384|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#57|)
+ |c::main::main::1::x@1!0&0#57|
+ |c::main::main::1::x@1!0&0#384|)
+ |c::main::main::1::x@1!0&0#385|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#56|)
+ |c::main::main::1::x@1!0&0#56|
+ |c::main::main::1::x@1!0&0#385|)
+ |c::main::main::1::x@1!0&0#386|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#55|)
+ |c::main::main::1::x@1!0&0#55|
+ |c::main::main::1::x@1!0&0#386|)
+ |c::main::main::1::x@1!0&0#387|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#54|)
+ |c::main::main::1::x@1!0&0#54|
+ |c::main::main::1::x@1!0&0#387|)
+ |c::main::main::1::x@1!0&0#388|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#53|)
+ |c::main::main::1::x@1!0&0#53|
+ |c::main::main::1::x@1!0&0#388|)
+ |c::main::main::1::x@1!0&0#389|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#52|)
+ |c::main::main::1::x@1!0&0#52|
+ |c::main::main::1::x@1!0&0#389|)
+ |c::main::main::1::x@1!0&0#390|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#51|)
+ |c::main::main::1::x@1!0&0#51|
+ |c::main::main::1::x@1!0&0#390|)
+ |c::main::main::1::x@1!0&0#391|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#50|)
+ |c::main::main::1::x@1!0&0#50|
+ |c::main::main::1::x@1!0&0#391|)
+ |c::main::main::1::x@1!0&0#392|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#49|)
+ |c::main::main::1::x@1!0&0#49|
+ |c::main::main::1::x@1!0&0#392|)
+ |c::main::main::1::x@1!0&0#393|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#48|)
+ |c::main::main::1::x@1!0&0#48|
+ |c::main::main::1::x@1!0&0#393|)
+ |c::main::main::1::x@1!0&0#394|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#47|)
+ |c::main::main::1::x@1!0&0#47|
+ |c::main::main::1::x@1!0&0#394|)
+ |c::main::main::1::x@1!0&0#395|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#46|)
+ |c::main::main::1::x@1!0&0#46|
+ |c::main::main::1::x@1!0&0#395|)
+ |c::main::main::1::x@1!0&0#396|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#45|)
+ |c::main::main::1::x@1!0&0#45|
+ |c::main::main::1::x@1!0&0#396|)
+ |c::main::main::1::x@1!0&0#397|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#44|)
+ |c::main::main::1::x@1!0&0#44|
+ |c::main::main::1::x@1!0&0#397|)
+ |c::main::main::1::x@1!0&0#398|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#43|)
+ |c::main::main::1::x@1!0&0#43|
+ |c::main::main::1::x@1!0&0#398|)
+ |c::main::main::1::x@1!0&0#399|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#42|)
+ |c::main::main::1::x@1!0&0#42|
+ |c::main::main::1::x@1!0&0#399|)
+ |c::main::main::1::x@1!0&0#400|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#41|)
+ |c::main::main::1::x@1!0&0#41|
+ |c::main::main::1::x@1!0&0#400|)
+ |c::main::main::1::x@1!0&0#401|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#40|)
+ |c::main::main::1::x@1!0&0#40|
+ |c::main::main::1::x@1!0&0#401|)
+ |c::main::main::1::x@1!0&0#402|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#39|)
+ |c::main::main::1::x@1!0&0#39|
+ |c::main::main::1::x@1!0&0#402|)
+ |c::main::main::1::x@1!0&0#403|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#38|)
+ |c::main::main::1::x@1!0&0#38|
+ |c::main::main::1::x@1!0&0#403|)
+ |c::main::main::1::x@1!0&0#404|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#37|)
+ |c::main::main::1::x@1!0&0#37|
+ |c::main::main::1::x@1!0&0#404|)
+ |c::main::main::1::x@1!0&0#405|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#36|)
+ |c::main::main::1::x@1!0&0#36|
+ |c::main::main::1::x@1!0&0#405|)
+ |c::main::main::1::x@1!0&0#406|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#35|)
+ |c::main::main::1::x@1!0&0#35|
+ |c::main::main::1::x@1!0&0#406|)
+ |c::main::main::1::x@1!0&0#407|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#34|)
+ |c::main::main::1::x@1!0&0#34|
+ |c::main::main::1::x@1!0&0#407|)
+ |c::main::main::1::x@1!0&0#408|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#33|)
+ |c::main::main::1::x@1!0&0#33|
+ |c::main::main::1::x@1!0&0#408|)
+ |c::main::main::1::x@1!0&0#409|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#32|)
+ |c::main::main::1::x@1!0&0#32|
+ |c::main::main::1::x@1!0&0#409|)
+ |c::main::main::1::x@1!0&0#410|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#31|)
+ |c::main::main::1::x@1!0&0#31|
+ |c::main::main::1::x@1!0&0#410|)
+ |c::main::main::1::x@1!0&0#411|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#30|)
+ |c::main::main::1::x@1!0&0#30|
+ |c::main::main::1::x@1!0&0#411|)
+ |c::main::main::1::x@1!0&0#412|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#29|)
+ |c::main::main::1::x@1!0&0#29|
+ |c::main::main::1::x@1!0&0#412|)
+ |c::main::main::1::x@1!0&0#413|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#28|)
+ |c::main::main::1::x@1!0&0#28|
+ |c::main::main::1::x@1!0&0#413|)
+ |c::main::main::1::x@1!0&0#414|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#27|)
+ |c::main::main::1::x@1!0&0#27|
+ |c::main::main::1::x@1!0&0#414|)
+ |c::main::main::1::x@1!0&0#415|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#26|)
+ |c::main::main::1::x@1!0&0#26|
+ |c::main::main::1::x@1!0&0#415|)
+ |c::main::main::1::x@1!0&0#416|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#25|)
+ |c::main::main::1::x@1!0&0#25|
+ |c::main::main::1::x@1!0&0#416|)
+ |c::main::main::1::x@1!0&0#417|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#24|)
+ |c::main::main::1::x@1!0&0#24|
+ |c::main::main::1::x@1!0&0#417|)
+ |c::main::main::1::x@1!0&0#418|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#23|)
+ |c::main::main::1::x@1!0&0#23|
+ |c::main::main::1::x@1!0&0#418|)
+ |c::main::main::1::x@1!0&0#419|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#22|)
+ |c::main::main::1::x@1!0&0#22|
+ |c::main::main::1::x@1!0&0#419|)
+ |c::main::main::1::x@1!0&0#420|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#21|)
+ |c::main::main::1::x@1!0&0#21|
+ |c::main::main::1::x@1!0&0#420|)
+ |c::main::main::1::x@1!0&0#421|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#20|)
+ |c::main::main::1::x@1!0&0#20|
+ |c::main::main::1::x@1!0&0#421|)
+ |c::main::main::1::x@1!0&0#422|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#19|)
+ |c::main::main::1::x@1!0&0#19|
+ |c::main::main::1::x@1!0&0#422|)
+ |c::main::main::1::x@1!0&0#423|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#18|)
+ |c::main::main::1::x@1!0&0#18|
+ |c::main::main::1::x@1!0&0#423|)
+ |c::main::main::1::x@1!0&0#424|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#17|)
+ |c::main::main::1::x@1!0&0#17|
+ |c::main::main::1::x@1!0&0#424|)
+ |c::main::main::1::x@1!0&0#425|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#16|)
+ |c::main::main::1::x@1!0&0#16|
+ |c::main::main::1::x@1!0&0#425|)
+ |c::main::main::1::x@1!0&0#426|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#15|)
+ |c::main::main::1::x@1!0&0#15|
+ |c::main::main::1::x@1!0&0#426|)
+ |c::main::main::1::x@1!0&0#427|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#14|)
+ |c::main::main::1::x@1!0&0#14|
+ |c::main::main::1::x@1!0&0#427|)
+ |c::main::main::1::x@1!0&0#428|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#13|)
+ |c::main::main::1::x@1!0&0#13|
+ |c::main::main::1::x@1!0&0#428|)
+ |c::main::main::1::x@1!0&0#429|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#12|)
+ |c::main::main::1::x@1!0&0#12|
+ |c::main::main::1::x@1!0&0#429|)
+ |c::main::main::1::x@1!0&0#430|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#11|)
+ |c::main::main::1::x@1!0&0#11|
+ |c::main::main::1::x@1!0&0#430|)
+ |c::main::main::1::x@1!0&0#431|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#10|)
+ |c::main::main::1::x@1!0&0#10|
+ |c::main::main::1::x@1!0&0#431|)
+ |c::main::main::1::x@1!0&0#432|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#9|)
+ |c::main::main::1::x@1!0&0#9|
+ |c::main::main::1::x@1!0&0#432|)
+ |c::main::main::1::x@1!0&0#433|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#8|)
+ |c::main::main::1::x@1!0&0#8|
+ |c::main::main::1::x@1!0&0#433|)
+ |c::main::main::1::x@1!0&0#434|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#7|)
+ |c::main::main::1::x@1!0&0#7|
+ |c::main::main::1::x@1!0&0#434|)
+ |c::main::main::1::x@1!0&0#435|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#6|)
+ |c::main::main::1::x@1!0&0#6|
+ |c::main::main::1::x@1!0&0#435|)
+ |c::main::main::1::x@1!0&0#436|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#5|)
+ |c::main::main::1::x@1!0&0#5|
+ |c::main::main::1::x@1!0&0#436|)
+ |c::main::main::1::x@1!0&0#437|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#4|)
+ |c::main::main::1::x@1!0&0#4|
+ |c::main::main::1::x@1!0&0#437|)
+ |c::main::main::1::x@1!0&0#438|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#3|)
+ |c::main::main::1::x@1!0&0#3|
+ |c::main::main::1::x@1!0&0#438|)
+ |c::main::main::1::x@1!0&0#439|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#2|)
+ |c::main::main::1::x@1!0&0#2|
+ |c::main::main::1::x@1!0&0#439|)
+ |c::main::main::1::x@1!0&0#440|))
+(assert (= (ite (not |goto_symex::guard@0!0&0#1|)
+ |c::main::main::1::x@1!0&0#1|
+ |c::main::main::1::x@1!0&0#440|)
+ |c::main::main::1::x@1!0&0#441|))
+(assert (let ((a!1 (=> (and (not (not |goto_symex::guard@0!0&0#1|))
+ (not (not |goto_symex::guard@0!0&0#2|))
+ (not (not |goto_symex::guard@0!0&0#3|))
+ (not (not |goto_symex::guard@0!0&0#4|))
+ (not (not |goto_symex::guard@0!0&0#5|))
+ (not (not |goto_symex::guard@0!0&0#6|))
+ (not (not |goto_symex::guard@0!0&0#7|))
+ (not (not |goto_symex::guard@0!0&0#8|))
+ (not (not |goto_symex::guard@0!0&0#9|))
+ (not (not |goto_symex::guard@0!0&0#10|))
+ (not (not |goto_symex::guard@0!0&0#11|))
+ (not (not |goto_symex::guard@0!0&0#12|))
+ (not (not |goto_symex::guard@0!0&0#13|))
+ (not (not |goto_symex::guard@0!0&0#14|))
+ (not (not |goto_symex::guard@0!0&0#15|))
+ (not (not |goto_symex::guard@0!0&0#16|))
+ (not (not |goto_symex::guard@0!0&0#17|))
+ (not (not |goto_symex::guard@0!0&0#18|))
+ (not (not |goto_symex::guard@0!0&0#19|))
+ (not (not |goto_symex::guard@0!0&0#20|))
+ (not (not |goto_symex::guard@0!0&0#21|))
+ (not (not |goto_symex::guard@0!0&0#22|))
+ (not (not |goto_symex::guard@0!0&0#23|))
+ (not (not |goto_symex::guard@0!0&0#24|))
+ (not (not |goto_symex::guard@0!0&0#25|))
+ (not (not |goto_symex::guard@0!0&0#26|))
+ (not (not |goto_symex::guard@0!0&0#27|))
+ (not (not |goto_symex::guard@0!0&0#28|))
+ (not (not |goto_symex::guard@0!0&0#29|))
+ (not (not |goto_symex::guard@0!0&0#30|))
+ (not (not |goto_symex::guard@0!0&0#31|))
+ (not (not |goto_symex::guard@0!0&0#32|))
+ (not (not |goto_symex::guard@0!0&0#33|))
+ (not (not |goto_symex::guard@0!0&0#34|))
+ (not (not |goto_symex::guard@0!0&0#35|))
+ (not (not |goto_symex::guard@0!0&0#36|))
+ (not (not |goto_symex::guard@0!0&0#37|))
+ (not (not |goto_symex::guard@0!0&0#38|))
+ (not (not |goto_symex::guard@0!0&0#39|))
+ (not (not |goto_symex::guard@0!0&0#40|))
+ (not (not |goto_symex::guard@0!0&0#41|))
+ (not (not |goto_symex::guard@0!0&0#42|))
+ (not (not |goto_symex::guard@0!0&0#43|))
+ (not (not |goto_symex::guard@0!0&0#44|))
+ (not (not |goto_symex::guard@0!0&0#45|))
+ (not (not |goto_symex::guard@0!0&0#46|))
+ (not (not |goto_symex::guard@0!0&0#47|))
+ (not (not |goto_symex::guard@0!0&0#48|))
+ (not (not |goto_symex::guard@0!0&0#49|))
+ (not (not |goto_symex::guard@0!0&0#50|))
+ (not (not |goto_symex::guard@0!0&0#51|))
+ (not (not |goto_symex::guard@0!0&0#52|))
+ (not (not |goto_symex::guard@0!0&0#53|))
+ (not (not |goto_symex::guard@0!0&0#54|))
+ (not (not |goto_symex::guard@0!0&0#55|))
+ (not (not |goto_symex::guard@0!0&0#56|))
+ (not (not |goto_symex::guard@0!0&0#57|))
+ (not (not |goto_symex::guard@0!0&0#58|))
+ (not (not |goto_symex::guard@0!0&0#59|))
+ (not (not |goto_symex::guard@0!0&0#60|))
+ (not (not |goto_symex::guard@0!0&0#61|))
+ (not (not |goto_symex::guard@0!0&0#62|))
+ (not (not |goto_symex::guard@0!0&0#63|))
+ (not (not |goto_symex::guard@0!0&0#64|))
+ (not (not |goto_symex::guard@0!0&0#65|))
+ (not (not |goto_symex::guard@0!0&0#66|))
+ (not (not |goto_symex::guard@0!0&0#67|))
+ (not (not |goto_symex::guard@0!0&0#68|))
+ (not (not |goto_symex::guard@0!0&0#69|))
+ (not (not |goto_symex::guard@0!0&0#70|))
+ (not (not |goto_symex::guard@0!0&0#71|))
+ (not (not |goto_symex::guard@0!0&0#72|))
+ (not (not |goto_symex::guard@0!0&0#73|))
+ (not (not |goto_symex::guard@0!0&0#74|))
+ (not (not |goto_symex::guard@0!0&0#75|))
+ (not (not |goto_symex::guard@0!0&0#76|))
+ (not (not |goto_symex::guard@0!0&0#77|))
+ (not (not |goto_symex::guard@0!0&0#78|))
+ (not (not |goto_symex::guard@0!0&0#79|))
+ (not (not |goto_symex::guard@0!0&0#80|))
+ (not (not |goto_symex::guard@0!0&0#81|))
+ (not (not |goto_symex::guard@0!0&0#82|))
+ (not (not |goto_symex::guard@0!0&0#83|))
+ (not (not |goto_symex::guard@0!0&0#84|))
+ (not (not |goto_symex::guard@0!0&0#85|))
+ (not (not |goto_symex::guard@0!0&0#86|))
+ (not (not |goto_symex::guard@0!0&0#87|))
+ (not (not |goto_symex::guard@0!0&0#88|))
+ (not (not |goto_symex::guard@0!0&0#89|))
+ (not (not |goto_symex::guard@0!0&0#90|))
+ (not (not |goto_symex::guard@0!0&0#91|))
+ (not (not |goto_symex::guard@0!0&0#92|))
+ (not (not |goto_symex::guard@0!0&0#93|))
+ (not (not |goto_symex::guard@0!0&0#94|))
+ (not (not |goto_symex::guard@0!0&0#95|))
+ (not (not |goto_symex::guard@0!0&0#96|))
+ (not (not |goto_symex::guard@0!0&0#97|))
+ (not (not |goto_symex::guard@0!0&0#98|))
+ (not (not |goto_symex::guard@0!0&0#99|))
+ (not (not |goto_symex::guard@0!0&0#100|))
+ (not (not |goto_symex::guard@0!0&0#101|))
+ (not (not |goto_symex::guard@0!0&0#102|))
+ (not (not |goto_symex::guard@0!0&0#103|))
+ (not (not |goto_symex::guard@0!0&0#104|))
+ (not (not |goto_symex::guard@0!0&0#105|))
+ (not (not |goto_symex::guard@0!0&0#106|))
+ (not (not |goto_symex::guard@0!0&0#107|))
+ (not (not |goto_symex::guard@0!0&0#108|))
+ (not (not |goto_symex::guard@0!0&0#109|))
+ (not (not |goto_symex::guard@0!0&0#110|))
+ (not (not |goto_symex::guard@0!0&0#111|))
+ (not (not |goto_symex::guard@0!0&0#112|))
+ (not (not |goto_symex::guard@0!0&0#113|))
+ (not (not |goto_symex::guard@0!0&0#114|))
+ (not (not |goto_symex::guard@0!0&0#115|))
+ (not (not |goto_symex::guard@0!0&0#116|))
+ (not (not |goto_symex::guard@0!0&0#117|))
+ (not (not |goto_symex::guard@0!0&0#118|))
+ (not (not |goto_symex::guard@0!0&0#119|))
+ (not (not |goto_symex::guard@0!0&0#120|))
+ (not (not |goto_symex::guard@0!0&0#121|))
+ (not (not |goto_symex::guard@0!0&0#122|))
+ (not (not |goto_symex::guard@0!0&0#123|))
+ (not (not |goto_symex::guard@0!0&0#124|))
+ (not (not |goto_symex::guard@0!0&0#125|))
+ (not (not |goto_symex::guard@0!0&0#126|))
+ (not (not |goto_symex::guard@0!0&0#127|))
+ (not (not |goto_symex::guard@0!0&0#128|))
+ (not (not |goto_symex::guard@0!0&0#129|))
+ (not (not |goto_symex::guard@0!0&0#130|))
+ (not (not |goto_symex::guard@0!0&0#131|))
+ (not (not |goto_symex::guard@0!0&0#132|))
+ (not (not |goto_symex::guard@0!0&0#133|))
+ (not (not |goto_symex::guard@0!0&0#134|))
+ (not (not |goto_symex::guard@0!0&0#135|))
+ (not (not |goto_symex::guard@0!0&0#136|))
+ (not (not |goto_symex::guard@0!0&0#137|))
+ (not (not |goto_symex::guard@0!0&0#138|))
+ (not (not |goto_symex::guard@0!0&0#139|))
+ (not (not |goto_symex::guard@0!0&0#140|))
+ (not (not |goto_symex::guard@0!0&0#141|))
+ (not (not |goto_symex::guard@0!0&0#142|))
+ (not (not |goto_symex::guard@0!0&0#143|))
+ (not (not |goto_symex::guard@0!0&0#144|))
+ (not (not |goto_symex::guard@0!0&0#145|))
+ (not (not |goto_symex::guard@0!0&0#146|))
+ (not (not |goto_symex::guard@0!0&0#147|))
+ (not (not |goto_symex::guard@0!0&0#148|))
+ (not (not |goto_symex::guard@0!0&0#149|))
+ (not (not |goto_symex::guard@0!0&0#150|))
+ (not (not |goto_symex::guard@0!0&0#151|))
+ (not (not |goto_symex::guard@0!0&0#152|))
+ (not (not |goto_symex::guard@0!0&0#153|))
+ (not (not |goto_symex::guard@0!0&0#154|))
+ (not (not |goto_symex::guard@0!0&0#155|))
+ (not (not |goto_symex::guard@0!0&0#156|))
+ (not (not |goto_symex::guard@0!0&0#157|))
+ (not (not |goto_symex::guard@0!0&0#158|))
+ (not (not |goto_symex::guard@0!0&0#159|))
+ (not (not |goto_symex::guard@0!0&0#160|))
+ (not (not |goto_symex::guard@0!0&0#161|))
+ (not (not |goto_symex::guard@0!0&0#162|))
+ (not (not |goto_symex::guard@0!0&0#163|))
+ (not (not |goto_symex::guard@0!0&0#164|))
+ (not (not |goto_symex::guard@0!0&0#165|))
+ (not (not |goto_symex::guard@0!0&0#166|))
+ (not (not |goto_symex::guard@0!0&0#167|))
+ (not (not |goto_symex::guard@0!0&0#168|))
+ (not (not |goto_symex::guard@0!0&0#169|))
+ (not (not |goto_symex::guard@0!0&0#170|))
+ (not (not |goto_symex::guard@0!0&0#171|))
+ (not (not |goto_symex::guard@0!0&0#172|))
+ (not (not |goto_symex::guard@0!0&0#173|))
+ (not (not |goto_symex::guard@0!0&0#174|))
+ (not (not |goto_symex::guard@0!0&0#175|))
+ (not (not |goto_symex::guard@0!0&0#176|))
+ (not (not |goto_symex::guard@0!0&0#177|))
+ (not (not |goto_symex::guard@0!0&0#178|))
+ (not (not |goto_symex::guard@0!0&0#179|))
+ (not (not |goto_symex::guard@0!0&0#180|))
+ (not (not |goto_symex::guard@0!0&0#181|))
+ (not (not |goto_symex::guard@0!0&0#182|))
+ (not (not |goto_symex::guard@0!0&0#183|))
+ (not (not |goto_symex::guard@0!0&0#184|))
+ (not (not |goto_symex::guard@0!0&0#185|))
+ (not (not |goto_symex::guard@0!0&0#186|))
+ (not (not |goto_symex::guard@0!0&0#187|))
+ (not (not |goto_symex::guard@0!0&0#188|))
+ (not (not |goto_symex::guard@0!0&0#189|))
+ (not (not |goto_symex::guard@0!0&0#190|))
+ (not (not |goto_symex::guard@0!0&0#191|))
+ (not (not |goto_symex::guard@0!0&0#192|))
+ (not (not |goto_symex::guard@0!0&0#193|))
+ (not (not |goto_symex::guard@0!0&0#194|))
+ (not (not |goto_symex::guard@0!0&0#195|))
+ (not (not |goto_symex::guard@0!0&0#196|))
+ (not (not |goto_symex::guard@0!0&0#197|))
+ (not (not |goto_symex::guard@0!0&0#198|))
+ (not (not |goto_symex::guard@0!0&0#199|))
+ (not (not |goto_symex::guard@0!0&0#200|))
+ (not (not |goto_symex::guard@0!0&0#201|))
+ (not (not |goto_symex::guard@0!0&0#202|))
+ (not (not |goto_symex::guard@0!0&0#203|))
+ (not (not |goto_symex::guard@0!0&0#204|))
+ (not (not |goto_symex::guard@0!0&0#205|))
+ (not (not |goto_symex::guard@0!0&0#206|))
+ (not (not |goto_symex::guard@0!0&0#207|))
+ (not (not |goto_symex::guard@0!0&0#208|))
+ (not (not |goto_symex::guard@0!0&0#209|))
+ (not (not |goto_symex::guard@0!0&0#210|))
+ (not (not |goto_symex::guard@0!0&0#211|))
+ (not (not |goto_symex::guard@0!0&0#212|))
+ (not (not |goto_symex::guard@0!0&0#213|))
+ (not (not |goto_symex::guard@0!0&0#214|))
+ (not (not |goto_symex::guard@0!0&0#215|))
+ (not (not |goto_symex::guard@0!0&0#216|))
+ (not (not |goto_symex::guard@0!0&0#217|))
+ (not (not |goto_symex::guard@0!0&0#218|))
+ (not (not |goto_symex::guard@0!0&0#219|))
+ (not (not |goto_symex::guard@0!0&0#220|)))
+ false))
+ (a!2 (or (and (not (not |goto_symex::guard@0!0&0#219|))
+ (not |goto_symex::guard@0!0&0#220|))
+ (not |goto_symex::guard@0!0&0#219|))))
+(let ((a!3 (or (and (not (not |goto_symex::guard@0!0&0#218|)) a!2)
+ (not |goto_symex::guard@0!0&0#218|))))
+(let ((a!4 (or (and (not (not |goto_symex::guard@0!0&0#217|)) a!3)
+ (not |goto_symex::guard@0!0&0#217|))))
+(let ((a!5 (or (and (not (not |goto_symex::guard@0!0&0#216|)) a!4)
+ (not |goto_symex::guard@0!0&0#216|))))
+(let ((a!6 (or (and (not (not |goto_symex::guard@0!0&0#215|)) a!5)
+ (not |goto_symex::guard@0!0&0#215|))))
+(let ((a!7 (or (and (not (not |goto_symex::guard@0!0&0#214|)) a!6)
+ (not |goto_symex::guard@0!0&0#214|))))
+(let ((a!8 (or (and (not (not |goto_symex::guard@0!0&0#213|)) a!7)
+ (not |goto_symex::guard@0!0&0#213|))))
+(let ((a!9 (or (and (not (not |goto_symex::guard@0!0&0#212|)) a!8)
+ (not |goto_symex::guard@0!0&0#212|))))
+(let ((a!10 (or (and (not (not |goto_symex::guard@0!0&0#211|)) a!9)
+ (not |goto_symex::guard@0!0&0#211|))))
+(let ((a!11 (or (and (not (not |goto_symex::guard@0!0&0#210|)) a!10)
+ (not |goto_symex::guard@0!0&0#210|))))
+(let ((a!12 (or (and (not (not |goto_symex::guard@0!0&0#209|)) a!11)
+ (not |goto_symex::guard@0!0&0#209|))))
+(let ((a!13 (or (and (not (not |goto_symex::guard@0!0&0#208|)) a!12)
+ (not |goto_symex::guard@0!0&0#208|))))
+(let ((a!14 (or (and (not (not |goto_symex::guard@0!0&0#207|)) a!13)
+ (not |goto_symex::guard@0!0&0#207|))))
+(let ((a!15 (or (and (not (not |goto_symex::guard@0!0&0#206|)) a!14)
+ (not |goto_symex::guard@0!0&0#206|))))
+(let ((a!16 (or (and (not (not |goto_symex::guard@0!0&0#205|)) a!15)
+ (not |goto_symex::guard@0!0&0#205|))))
+(let ((a!17 (or (and (not (not |goto_symex::guard@0!0&0#204|)) a!16)
+ (not |goto_symex::guard@0!0&0#204|))))
+(let ((a!18 (or (and (not (not |goto_symex::guard@0!0&0#203|)) a!17)
+ (not |goto_symex::guard@0!0&0#203|))))
+(let ((a!19 (or (and (not (not |goto_symex::guard@0!0&0#202|)) a!18)
+ (not |goto_symex::guard@0!0&0#202|))))
+(let ((a!20 (or (and (not (not |goto_symex::guard@0!0&0#201|)) a!19)
+ (not |goto_symex::guard@0!0&0#201|))))
+(let ((a!21 (or (and (not (not |goto_symex::guard@0!0&0#200|)) a!20)
+ (not |goto_symex::guard@0!0&0#200|))))
+(let ((a!22 (or (and (not (not |goto_symex::guard@0!0&0#199|)) a!21)
+ (not |goto_symex::guard@0!0&0#199|))))
+(let ((a!23 (or (and (not (not |goto_symex::guard@0!0&0#198|)) a!22)
+ (not |goto_symex::guard@0!0&0#198|))))
+(let ((a!24 (or (and (not (not |goto_symex::guard@0!0&0#197|)) a!23)
+ (not |goto_symex::guard@0!0&0#197|))))
+(let ((a!25 (or (and (not (not |goto_symex::guard@0!0&0#196|)) a!24)
+ (not |goto_symex::guard@0!0&0#196|))))
+(let ((a!26 (or (and (not (not |goto_symex::guard@0!0&0#195|)) a!25)
+ (not |goto_symex::guard@0!0&0#195|))))
+(let ((a!27 (or (and (not (not |goto_symex::guard@0!0&0#194|)) a!26)
+ (not |goto_symex::guard@0!0&0#194|))))
+(let ((a!28 (or (and (not (not |goto_symex::guard@0!0&0#193|)) a!27)
+ (not |goto_symex::guard@0!0&0#193|))))
+(let ((a!29 (or (and (not (not |goto_symex::guard@0!0&0#192|)) a!28)
+ (not |goto_symex::guard@0!0&0#192|))))
+(let ((a!30 (or (and (not (not |goto_symex::guard@0!0&0#191|)) a!29)
+ (not |goto_symex::guard@0!0&0#191|))))
+(let ((a!31 (or (and (not (not |goto_symex::guard@0!0&0#190|)) a!30)
+ (not |goto_symex::guard@0!0&0#190|))))
+(let ((a!32 (or (and (not (not |goto_symex::guard@0!0&0#189|)) a!31)
+ (not |goto_symex::guard@0!0&0#189|))))
+(let ((a!33 (or (and (not (not |goto_symex::guard@0!0&0#188|)) a!32)
+ (not |goto_symex::guard@0!0&0#188|))))
+(let ((a!34 (or (and (not (not |goto_symex::guard@0!0&0#187|)) a!33)
+ (not |goto_symex::guard@0!0&0#187|))))
+(let ((a!35 (or (and (not (not |goto_symex::guard@0!0&0#186|)) a!34)
+ (not |goto_symex::guard@0!0&0#186|))))
+(let ((a!36 (or (and (not (not |goto_symex::guard@0!0&0#185|)) a!35)
+ (not |goto_symex::guard@0!0&0#185|))))
+(let ((a!37 (or (and (not (not |goto_symex::guard@0!0&0#184|)) a!36)
+ (not |goto_symex::guard@0!0&0#184|))))
+(let ((a!38 (or (and (not (not |goto_symex::guard@0!0&0#183|)) a!37)
+ (not |goto_symex::guard@0!0&0#183|))))
+(let ((a!39 (or (and (not (not |goto_symex::guard@0!0&0#182|)) a!38)
+ (not |goto_symex::guard@0!0&0#182|))))
+(let ((a!40 (or (and (not (not |goto_symex::guard@0!0&0#181|)) a!39)
+ (not |goto_symex::guard@0!0&0#181|))))
+(let ((a!41 (or (and (not (not |goto_symex::guard@0!0&0#180|)) a!40)
+ (not |goto_symex::guard@0!0&0#180|))))
+(let ((a!42 (or (and (not (not |goto_symex::guard@0!0&0#179|)) a!41)
+ (not |goto_symex::guard@0!0&0#179|))))
+(let ((a!43 (or (and (not (not |goto_symex::guard@0!0&0#178|)) a!42)
+ (not |goto_symex::guard@0!0&0#178|))))
+(let ((a!44 (or (and (not (not |goto_symex::guard@0!0&0#177|)) a!43)
+ (not |goto_symex::guard@0!0&0#177|))))
+(let ((a!45 (or (and (not (not |goto_symex::guard@0!0&0#176|)) a!44)
+ (not |goto_symex::guard@0!0&0#176|))))
+(let ((a!46 (or (and (not (not |goto_symex::guard@0!0&0#175|)) a!45)
+ (not |goto_symex::guard@0!0&0#175|))))
+(let ((a!47 (or (and (not (not |goto_symex::guard@0!0&0#174|)) a!46)
+ (not |goto_symex::guard@0!0&0#174|))))
+(let ((a!48 (or (and (not (not |goto_symex::guard@0!0&0#173|)) a!47)
+ (not |goto_symex::guard@0!0&0#173|))))
+(let ((a!49 (or (and (not (not |goto_symex::guard@0!0&0#172|)) a!48)
+ (not |goto_symex::guard@0!0&0#172|))))
+(let ((a!50 (or (and (not (not |goto_symex::guard@0!0&0#171|)) a!49)
+ (not |goto_symex::guard@0!0&0#171|))))
+(let ((a!51 (or (and (not (not |goto_symex::guard@0!0&0#170|)) a!50)
+ (not |goto_symex::guard@0!0&0#170|))))
+(let ((a!52 (or (and (not (not |goto_symex::guard@0!0&0#169|)) a!51)
+ (not |goto_symex::guard@0!0&0#169|))))
+(let ((a!53 (or (and (not (not |goto_symex::guard@0!0&0#168|)) a!52)
+ (not |goto_symex::guard@0!0&0#168|))))
+(let ((a!54 (or (and (not (not |goto_symex::guard@0!0&0#167|)) a!53)
+ (not |goto_symex::guard@0!0&0#167|))))
+(let ((a!55 (or (and (not (not |goto_symex::guard@0!0&0#166|)) a!54)
+ (not |goto_symex::guard@0!0&0#166|))))
+(let ((a!56 (or (and (not (not |goto_symex::guard@0!0&0#165|)) a!55)
+ (not |goto_symex::guard@0!0&0#165|))))
+(let ((a!57 (or (and (not (not |goto_symex::guard@0!0&0#164|)) a!56)
+ (not |goto_symex::guard@0!0&0#164|))))
+(let ((a!58 (or (and (not (not |goto_symex::guard@0!0&0#163|)) a!57)
+ (not |goto_symex::guard@0!0&0#163|))))
+(let ((a!59 (or (and (not (not |goto_symex::guard@0!0&0#162|)) a!58)
+ (not |goto_symex::guard@0!0&0#162|))))
+(let ((a!60 (or (and (not (not |goto_symex::guard@0!0&0#161|)) a!59)
+ (not |goto_symex::guard@0!0&0#161|))))
+(let ((a!61 (or (and (not (not |goto_symex::guard@0!0&0#160|)) a!60)
+ (not |goto_symex::guard@0!0&0#160|))))
+(let ((a!62 (or (and (not (not |goto_symex::guard@0!0&0#159|)) a!61)
+ (not |goto_symex::guard@0!0&0#159|))))
+(let ((a!63 (or (and (not (not |goto_symex::guard@0!0&0#158|)) a!62)
+ (not |goto_symex::guard@0!0&0#158|))))
+(let ((a!64 (or (and (not (not |goto_symex::guard@0!0&0#157|)) a!63)
+ (not |goto_symex::guard@0!0&0#157|))))
+(let ((a!65 (or (and (not (not |goto_symex::guard@0!0&0#156|)) a!64)
+ (not |goto_symex::guard@0!0&0#156|))))
+(let ((a!66 (or (and (not (not |goto_symex::guard@0!0&0#155|)) a!65)
+ (not |goto_symex::guard@0!0&0#155|))))
+(let ((a!67 (or (and (not (not |goto_symex::guard@0!0&0#154|)) a!66)
+ (not |goto_symex::guard@0!0&0#154|))))
+(let ((a!68 (or (and (not (not |goto_symex::guard@0!0&0#153|)) a!67)
+ (not |goto_symex::guard@0!0&0#153|))))
+(let ((a!69 (or (and (not (not |goto_symex::guard@0!0&0#152|)) a!68)
+ (not |goto_symex::guard@0!0&0#152|))))
+(let ((a!70 (or (and (not (not |goto_symex::guard@0!0&0#151|)) a!69)
+ (not |goto_symex::guard@0!0&0#151|))))
+(let ((a!71 (or (and (not (not |goto_symex::guard@0!0&0#150|)) a!70)
+ (not |goto_symex::guard@0!0&0#150|))))
+(let ((a!72 (or (and (not (not |goto_symex::guard@0!0&0#149|)) a!71)
+ (not |goto_symex::guard@0!0&0#149|))))
+(let ((a!73 (or (and (not (not |goto_symex::guard@0!0&0#148|)) a!72)
+ (not |goto_symex::guard@0!0&0#148|))))
+(let ((a!74 (or (and (not (not |goto_symex::guard@0!0&0#147|)) a!73)
+ (not |goto_symex::guard@0!0&0#147|))))
+(let ((a!75 (or (and (not (not |goto_symex::guard@0!0&0#146|)) a!74)
+ (not |goto_symex::guard@0!0&0#146|))))
+(let ((a!76 (or (and (not (not |goto_symex::guard@0!0&0#145|)) a!75)
+ (not |goto_symex::guard@0!0&0#145|))))
+(let ((a!77 (or (and (not (not |goto_symex::guard@0!0&0#144|)) a!76)
+ (not |goto_symex::guard@0!0&0#144|))))
+(let ((a!78 (or (and (not (not |goto_symex::guard@0!0&0#143|)) a!77)
+ (not |goto_symex::guard@0!0&0#143|))))
+(let ((a!79 (or (and (not (not |goto_symex::guard@0!0&0#142|)) a!78)
+ (not |goto_symex::guard@0!0&0#142|))))
+(let ((a!80 (or (and (not (not |goto_symex::guard@0!0&0#141|)) a!79)
+ (not |goto_symex::guard@0!0&0#141|))))
+(let ((a!81 (or (and (not (not |goto_symex::guard@0!0&0#140|)) a!80)
+ (not |goto_symex::guard@0!0&0#140|))))
+(let ((a!82 (or (and (not (not |goto_symex::guard@0!0&0#139|)) a!81)
+ (not |goto_symex::guard@0!0&0#139|))))
+(let ((a!83 (or (and (not (not |goto_symex::guard@0!0&0#138|)) a!82)
+ (not |goto_symex::guard@0!0&0#138|))))
+(let ((a!84 (or (and (not (not |goto_symex::guard@0!0&0#137|)) a!83)
+ (not |goto_symex::guard@0!0&0#137|))))
+(let ((a!85 (or (and (not (not |goto_symex::guard@0!0&0#136|)) a!84)
+ (not |goto_symex::guard@0!0&0#136|))))
+(let ((a!86 (or (and (not (not |goto_symex::guard@0!0&0#135|)) a!85)
+ (not |goto_symex::guard@0!0&0#135|))))
+(let ((a!87 (or (and (not (not |goto_symex::guard@0!0&0#134|)) a!86)
+ (not |goto_symex::guard@0!0&0#134|))))
+(let ((a!88 (or (and (not (not |goto_symex::guard@0!0&0#133|)) a!87)
+ (not |goto_symex::guard@0!0&0#133|))))
+(let ((a!89 (or (and (not (not |goto_symex::guard@0!0&0#132|)) a!88)
+ (not |goto_symex::guard@0!0&0#132|))))
+(let ((a!90 (or (and (not (not |goto_symex::guard@0!0&0#131|)) a!89)
+ (not |goto_symex::guard@0!0&0#131|))))
+(let ((a!91 (or (and (not (not |goto_symex::guard@0!0&0#130|)) a!90)
+ (not |goto_symex::guard@0!0&0#130|))))
+(let ((a!92 (or (and (not (not |goto_symex::guard@0!0&0#129|)) a!91)
+ (not |goto_symex::guard@0!0&0#129|))))
+(let ((a!93 (or (and (not (not |goto_symex::guard@0!0&0#128|)) a!92)
+ (not |goto_symex::guard@0!0&0#128|))))
+(let ((a!94 (or (and (not (not |goto_symex::guard@0!0&0#127|)) a!93)
+ (not |goto_symex::guard@0!0&0#127|))))
+(let ((a!95 (or (and (not (not |goto_symex::guard@0!0&0#126|)) a!94)
+ (not |goto_symex::guard@0!0&0#126|))))
+(let ((a!96 (or (and (not (not |goto_symex::guard@0!0&0#125|)) a!95)
+ (not |goto_symex::guard@0!0&0#125|))))
+(let ((a!97 (or (and (not (not |goto_symex::guard@0!0&0#124|)) a!96)
+ (not |goto_symex::guard@0!0&0#124|))))
+(let ((a!98 (or (and (not (not |goto_symex::guard@0!0&0#123|)) a!97)
+ (not |goto_symex::guard@0!0&0#123|))))
+(let ((a!99 (or (and (not (not |goto_symex::guard@0!0&0#122|)) a!98)
+ (not |goto_symex::guard@0!0&0#122|))))
+(let ((a!100 (or (and (not (not |goto_symex::guard@0!0&0#121|)) a!99)
+ (not |goto_symex::guard@0!0&0#121|))))
+(let ((a!101 (or (and (not (not |goto_symex::guard@0!0&0#120|)) a!100)
+ (not |goto_symex::guard@0!0&0#120|))))
+(let ((a!102 (or (and (not (not |goto_symex::guard@0!0&0#119|)) a!101)
+ (not |goto_symex::guard@0!0&0#119|))))
+(let ((a!103 (or (and (not (not |goto_symex::guard@0!0&0#118|)) a!102)
+ (not |goto_symex::guard@0!0&0#118|))))
+(let ((a!104 (or (and (not (not |goto_symex::guard@0!0&0#117|)) a!103)
+ (not |goto_symex::guard@0!0&0#117|))))
+(let ((a!105 (or (and (not (not |goto_symex::guard@0!0&0#116|)) a!104)
+ (not |goto_symex::guard@0!0&0#116|))))
+(let ((a!106 (or (and (not (not |goto_symex::guard@0!0&0#115|)) a!105)
+ (not |goto_symex::guard@0!0&0#115|))))
+(let ((a!107 (or (and (not (not |goto_symex::guard@0!0&0#114|)) a!106)
+ (not |goto_symex::guard@0!0&0#114|))))
+(let ((a!108 (or (and (not (not |goto_symex::guard@0!0&0#113|)) a!107)
+ (not |goto_symex::guard@0!0&0#113|))))
+(let ((a!109 (or (and (not (not |goto_symex::guard@0!0&0#112|)) a!108)
+ (not |goto_symex::guard@0!0&0#112|))))
+(let ((a!110 (or (and (not (not |goto_symex::guard@0!0&0#111|)) a!109)
+ (not |goto_symex::guard@0!0&0#111|))))
+(let ((a!111 (or (and (not (not |goto_symex::guard@0!0&0#110|)) a!110)
+ (not |goto_symex::guard@0!0&0#110|))))
+(let ((a!112 (or (and (not (not |goto_symex::guard@0!0&0#109|)) a!111)
+ (not |goto_symex::guard@0!0&0#109|))))
+(let ((a!113 (or (and (not (not |goto_symex::guard@0!0&0#108|)) a!112)
+ (not |goto_symex::guard@0!0&0#108|))))
+(let ((a!114 (or (and (not (not |goto_symex::guard@0!0&0#107|)) a!113)
+ (not |goto_symex::guard@0!0&0#107|))))
+(let ((a!115 (or (and (not (not |goto_symex::guard@0!0&0#106|)) a!114)
+ (not |goto_symex::guard@0!0&0#106|))))
+(let ((a!116 (or (and (not (not |goto_symex::guard@0!0&0#105|)) a!115)
+ (not |goto_symex::guard@0!0&0#105|))))
+(let ((a!117 (or (and (not (not |goto_symex::guard@0!0&0#104|)) a!116)
+ (not |goto_symex::guard@0!0&0#104|))))
+(let ((a!118 (or (and (not (not |goto_symex::guard@0!0&0#103|)) a!117)
+ (not |goto_symex::guard@0!0&0#103|))))
+(let ((a!119 (or (and (not (not |goto_symex::guard@0!0&0#102|)) a!118)
+ (not |goto_symex::guard@0!0&0#102|))))
+(let ((a!120 (or (and (not (not |goto_symex::guard@0!0&0#101|)) a!119)
+ (not |goto_symex::guard@0!0&0#101|))))
+(let ((a!121 (or (and (not (not |goto_symex::guard@0!0&0#100|)) a!120)
+ (not |goto_symex::guard@0!0&0#100|))))
+(let ((a!122 (or (and (not (not |goto_symex::guard@0!0&0#99|)) a!121)
+ (not |goto_symex::guard@0!0&0#99|))))
+(let ((a!123 (or (and (not (not |goto_symex::guard@0!0&0#98|)) a!122)
+ (not |goto_symex::guard@0!0&0#98|))))
+(let ((a!124 (or (and (not (not |goto_symex::guard@0!0&0#97|)) a!123)
+ (not |goto_symex::guard@0!0&0#97|))))
+(let ((a!125 (or (and (not (not |goto_symex::guard@0!0&0#96|)) a!124)
+ (not |goto_symex::guard@0!0&0#96|))))
+(let ((a!126 (or (and (not (not |goto_symex::guard@0!0&0#95|)) a!125)
+ (not |goto_symex::guard@0!0&0#95|))))
+(let ((a!127 (or (and (not (not |goto_symex::guard@0!0&0#94|)) a!126)
+ (not |goto_symex::guard@0!0&0#94|))))
+(let ((a!128 (or (and (not (not |goto_symex::guard@0!0&0#93|)) a!127)
+ (not |goto_symex::guard@0!0&0#93|))))
+(let ((a!129 (or (and (not (not |goto_symex::guard@0!0&0#92|)) a!128)
+ (not |goto_symex::guard@0!0&0#92|))))
+(let ((a!130 (or (and (not (not |goto_symex::guard@0!0&0#91|)) a!129)
+ (not |goto_symex::guard@0!0&0#91|))))
+(let ((a!131 (or (and (not (not |goto_symex::guard@0!0&0#90|)) a!130)
+ (not |goto_symex::guard@0!0&0#90|))))
+(let ((a!132 (or (and (not (not |goto_symex::guard@0!0&0#89|)) a!131)
+ (not |goto_symex::guard@0!0&0#89|))))
+(let ((a!133 (or (and (not (not |goto_symex::guard@0!0&0#88|)) a!132)
+ (not |goto_symex::guard@0!0&0#88|))))
+(let ((a!134 (or (and (not (not |goto_symex::guard@0!0&0#87|)) a!133)
+ (not |goto_symex::guard@0!0&0#87|))))
+(let ((a!135 (or (and (not (not |goto_symex::guard@0!0&0#86|)) a!134)
+ (not |goto_symex::guard@0!0&0#86|))))
+(let ((a!136 (or (and (not (not |goto_symex::guard@0!0&0#85|)) a!135)
+ (not |goto_symex::guard@0!0&0#85|))))
+(let ((a!137 (or (and (not (not |goto_symex::guard@0!0&0#84|)) a!136)
+ (not |goto_symex::guard@0!0&0#84|))))
+(let ((a!138 (or (and (not (not |goto_symex::guard@0!0&0#83|)) a!137)
+ (not |goto_symex::guard@0!0&0#83|))))
+(let ((a!139 (or (and (not (not |goto_symex::guard@0!0&0#82|)) a!138)
+ (not |goto_symex::guard@0!0&0#82|))))
+(let ((a!140 (or (and (not (not |goto_symex::guard@0!0&0#81|)) a!139)
+ (not |goto_symex::guard@0!0&0#81|))))
+(let ((a!141 (or (and (not (not |goto_symex::guard@0!0&0#80|)) a!140)
+ (not |goto_symex::guard@0!0&0#80|))))
+(let ((a!142 (or (and (not (not |goto_symex::guard@0!0&0#79|)) a!141)
+ (not |goto_symex::guard@0!0&0#79|))))
+(let ((a!143 (or (and (not (not |goto_symex::guard@0!0&0#78|)) a!142)
+ (not |goto_symex::guard@0!0&0#78|))))
+(let ((a!144 (or (and (not (not |goto_symex::guard@0!0&0#77|)) a!143)
+ (not |goto_symex::guard@0!0&0#77|))))
+(let ((a!145 (or (and (not (not |goto_symex::guard@0!0&0#76|)) a!144)
+ (not |goto_symex::guard@0!0&0#76|))))
+(let ((a!146 (or (and (not (not |goto_symex::guard@0!0&0#75|)) a!145)
+ (not |goto_symex::guard@0!0&0#75|))))
+(let ((a!147 (or (and (not (not |goto_symex::guard@0!0&0#74|)) a!146)
+ (not |goto_symex::guard@0!0&0#74|))))
+(let ((a!148 (or (and (not (not |goto_symex::guard@0!0&0#73|)) a!147)
+ (not |goto_symex::guard@0!0&0#73|))))
+(let ((a!149 (or (and (not (not |goto_symex::guard@0!0&0#72|)) a!148)
+ (not |goto_symex::guard@0!0&0#72|))))
+(let ((a!150 (or (and (not (not |goto_symex::guard@0!0&0#71|)) a!149)
+ (not |goto_symex::guard@0!0&0#71|))))
+(let ((a!151 (or (and (not (not |goto_symex::guard@0!0&0#70|)) a!150)
+ (not |goto_symex::guard@0!0&0#70|))))
+(let ((a!152 (or (and (not (not |goto_symex::guard@0!0&0#69|)) a!151)
+ (not |goto_symex::guard@0!0&0#69|))))
+(let ((a!153 (or (and (not (not |goto_symex::guard@0!0&0#68|)) a!152)
+ (not |goto_symex::guard@0!0&0#68|))))
+(let ((a!154 (or (and (not (not |goto_symex::guard@0!0&0#67|)) a!153)
+ (not |goto_symex::guard@0!0&0#67|))))
+(let ((a!155 (or (and (not (not |goto_symex::guard@0!0&0#66|)) a!154)
+ (not |goto_symex::guard@0!0&0#66|))))
+(let ((a!156 (or (and (not (not |goto_symex::guard@0!0&0#65|)) a!155)
+ (not |goto_symex::guard@0!0&0#65|))))
+(let ((a!157 (or (and (not (not |goto_symex::guard@0!0&0#64|)) a!156)
+ (not |goto_symex::guard@0!0&0#64|))))
+(let ((a!158 (or (and (not (not |goto_symex::guard@0!0&0#63|)) a!157)
+ (not |goto_symex::guard@0!0&0#63|))))
+(let ((a!159 (or (and (not (not |goto_symex::guard@0!0&0#62|)) a!158)
+ (not |goto_symex::guard@0!0&0#62|))))
+(let ((a!160 (or (and (not (not |goto_symex::guard@0!0&0#61|)) a!159)
+ (not |goto_symex::guard@0!0&0#61|))))
+(let ((a!161 (or (and (not (not |goto_symex::guard@0!0&0#60|)) a!160)
+ (not |goto_symex::guard@0!0&0#60|))))
+(let ((a!162 (or (and (not (not |goto_symex::guard@0!0&0#59|)) a!161)
+ (not |goto_symex::guard@0!0&0#59|))))
+(let ((a!163 (or (and (not (not |goto_symex::guard@0!0&0#58|)) a!162)
+ (not |goto_symex::guard@0!0&0#58|))))
+(let ((a!164 (or (and (not (not |goto_symex::guard@0!0&0#57|)) a!163)
+ (not |goto_symex::guard@0!0&0#57|))))
+(let ((a!165 (or (and (not (not |goto_symex::guard@0!0&0#56|)) a!164)
+ (not |goto_symex::guard@0!0&0#56|))))
+(let ((a!166 (or (and (not (not |goto_symex::guard@0!0&0#55|)) a!165)
+ (not |goto_symex::guard@0!0&0#55|))))
+(let ((a!167 (or (and (not (not |goto_symex::guard@0!0&0#54|)) a!166)
+ (not |goto_symex::guard@0!0&0#54|))))
+(let ((a!168 (or (and (not (not |goto_symex::guard@0!0&0#53|)) a!167)
+ (not |goto_symex::guard@0!0&0#53|))))
+(let ((a!169 (or (and (not (not |goto_symex::guard@0!0&0#52|)) a!168)
+ (not |goto_symex::guard@0!0&0#52|))))
+(let ((a!170 (or (and (not (not |goto_symex::guard@0!0&0#51|)) a!169)
+ (not |goto_symex::guard@0!0&0#51|))))
+(let ((a!171 (or (and (not (not |goto_symex::guard@0!0&0#50|)) a!170)
+ (not |goto_symex::guard@0!0&0#50|))))
+(let ((a!172 (or (and (not (not |goto_symex::guard@0!0&0#49|)) a!171)
+ (not |goto_symex::guard@0!0&0#49|))))
+(let ((a!173 (or (and (not (not |goto_symex::guard@0!0&0#48|)) a!172)
+ (not |goto_symex::guard@0!0&0#48|))))
+(let ((a!174 (or (and (not (not |goto_symex::guard@0!0&0#47|)) a!173)
+ (not |goto_symex::guard@0!0&0#47|))))
+(let ((a!175 (or (and (not (not |goto_symex::guard@0!0&0#46|)) a!174)
+ (not |goto_symex::guard@0!0&0#46|))))
+(let ((a!176 (or (and (not (not |goto_symex::guard@0!0&0#45|)) a!175)
+ (not |goto_symex::guard@0!0&0#45|))))
+(let ((a!177 (or (and (not (not |goto_symex::guard@0!0&0#44|)) a!176)
+ (not |goto_symex::guard@0!0&0#44|))))
+(let ((a!178 (or (and (not (not |goto_symex::guard@0!0&0#43|)) a!177)
+ (not |goto_symex::guard@0!0&0#43|))))
+(let ((a!179 (or (and (not (not |goto_symex::guard@0!0&0#42|)) a!178)
+ (not |goto_symex::guard@0!0&0#42|))))
+(let ((a!180 (or (and (not (not |goto_symex::guard@0!0&0#41|)) a!179)
+ (not |goto_symex::guard@0!0&0#41|))))
+(let ((a!181 (or (and (not (not |goto_symex::guard@0!0&0#40|)) a!180)
+ (not |goto_symex::guard@0!0&0#40|))))
+(let ((a!182 (or (and (not (not |goto_symex::guard@0!0&0#39|)) a!181)
+ (not |goto_symex::guard@0!0&0#39|))))
+(let ((a!183 (or (and (not (not |goto_symex::guard@0!0&0#38|)) a!182)
+ (not |goto_symex::guard@0!0&0#38|))))
+(let ((a!184 (or (and (not (not |goto_symex::guard@0!0&0#37|)) a!183)
+ (not |goto_symex::guard@0!0&0#37|))))
+(let ((a!185 (or (and (not (not |goto_symex::guard@0!0&0#36|)) a!184)
+ (not |goto_symex::guard@0!0&0#36|))))
+(let ((a!186 (or (and (not (not |goto_symex::guard@0!0&0#35|)) a!185)
+ (not |goto_symex::guard@0!0&0#35|))))
+(let ((a!187 (or (and (not (not |goto_symex::guard@0!0&0#34|)) a!186)
+ (not |goto_symex::guard@0!0&0#34|))))
+(let ((a!188 (or (and (not (not |goto_symex::guard@0!0&0#33|)) a!187)
+ (not |goto_symex::guard@0!0&0#33|))))
+(let ((a!189 (or (and (not (not |goto_symex::guard@0!0&0#32|)) a!188)
+ (not |goto_symex::guard@0!0&0#32|))))
+(let ((a!190 (or (and (not (not |goto_symex::guard@0!0&0#31|)) a!189)
+ (not |goto_symex::guard@0!0&0#31|))))
+(let ((a!191 (or (and (not (not |goto_symex::guard@0!0&0#30|)) a!190)
+ (not |goto_symex::guard@0!0&0#30|))))
+(let ((a!192 (or (and (not (not |goto_symex::guard@0!0&0#29|)) a!191)
+ (not |goto_symex::guard@0!0&0#29|))))
+(let ((a!193 (or (and (not (not |goto_symex::guard@0!0&0#28|)) a!192)
+ (not |goto_symex::guard@0!0&0#28|))))
+(let ((a!194 (or (and (not (not |goto_symex::guard@0!0&0#27|)) a!193)
+ (not |goto_symex::guard@0!0&0#27|))))
+(let ((a!195 (or (and (not (not |goto_symex::guard@0!0&0#26|)) a!194)
+ (not |goto_symex::guard@0!0&0#26|))))
+(let ((a!196 (or (and (not (not |goto_symex::guard@0!0&0#25|)) a!195)
+ (not |goto_symex::guard@0!0&0#25|))))
+(let ((a!197 (or (and (not (not |goto_symex::guard@0!0&0#24|)) a!196)
+ (not |goto_symex::guard@0!0&0#24|))))
+(let ((a!198 (or (and (not (not |goto_symex::guard@0!0&0#23|)) a!197)
+ (not |goto_symex::guard@0!0&0#23|))))
+(let ((a!199 (or (and (not (not |goto_symex::guard@0!0&0#22|)) a!198)
+ (not |goto_symex::guard@0!0&0#22|))))
+(let ((a!200 (or (and (not (not |goto_symex::guard@0!0&0#21|)) a!199)
+ (not |goto_symex::guard@0!0&0#21|))))
+(let ((a!201 (or (and (not (not |goto_symex::guard@0!0&0#20|)) a!200)
+ (not |goto_symex::guard@0!0&0#20|))))
+(let ((a!202 (or (and (not (not |goto_symex::guard@0!0&0#19|)) a!201)
+ (not |goto_symex::guard@0!0&0#19|))))
+(let ((a!203 (or (and (not (not |goto_symex::guard@0!0&0#18|)) a!202)
+ (not |goto_symex::guard@0!0&0#18|))))
+(let ((a!204 (or (and (not (not |goto_symex::guard@0!0&0#17|)) a!203)
+ (not |goto_symex::guard@0!0&0#17|))))
+(let ((a!205 (or (and (not (not |goto_symex::guard@0!0&0#16|)) a!204)
+ (not |goto_symex::guard@0!0&0#16|))))
+(let ((a!206 (or (and (not (not |goto_symex::guard@0!0&0#15|)) a!205)
+ (not |goto_symex::guard@0!0&0#15|))))
+(let ((a!207 (or (and (not (not |goto_symex::guard@0!0&0#14|)) a!206)
+ (not |goto_symex::guard@0!0&0#14|))))
+(let ((a!208 (or (and (not (not |goto_symex::guard@0!0&0#13|)) a!207)
+ (not |goto_symex::guard@0!0&0#13|))))
+(let ((a!209 (or (and (not (not |goto_symex::guard@0!0&0#12|)) a!208)
+ (not |goto_symex::guard@0!0&0#12|))))
+(let ((a!210 (or (and (not (not |goto_symex::guard@0!0&0#11|)) a!209)
+ (not |goto_symex::guard@0!0&0#11|))))
+(let ((a!211 (or (and (not (not |goto_symex::guard@0!0&0#10|)) a!210)
+ (not |goto_symex::guard@0!0&0#10|))))
+(let ((a!212 (or (and (not (not |goto_symex::guard@0!0&0#9|)) a!211)
+ (not |goto_symex::guard@0!0&0#9|))))
+(let ((a!213 (or (and (not (not |goto_symex::guard@0!0&0#8|)) a!212)
+ (not |goto_symex::guard@0!0&0#8|))))
+(let ((a!214 (or (and (not (not |goto_symex::guard@0!0&0#7|)) a!213)
+ (not |goto_symex::guard@0!0&0#7|))))
+(let ((a!215 (or (and (not (not |goto_symex::guard@0!0&0#6|)) a!214)
+ (not |goto_symex::guard@0!0&0#6|))))
+(let ((a!216 (or (and (not (not |goto_symex::guard@0!0&0#5|)) a!215)
+ (not |goto_symex::guard@0!0&0#5|))))
+(let ((a!217 (or (and (not (not |goto_symex::guard@0!0&0#4|)) a!216)
+ (not |goto_symex::guard@0!0&0#4|))))
+(let ((a!218 (or (and (not (not |goto_symex::guard@0!0&0#3|)) a!217)
+ (not |goto_symex::guard@0!0&0#3|))))
+(let ((a!219 (or (and (not (not |goto_symex::guard@0!0&0#2|)) a!218)
+ (not |goto_symex::guard@0!0&0#2|))))
+(let ((a!220 (or (and (not (not |goto_symex::guard@0!0&0#1|)) a!219)
+ (not |goto_symex::guard@0!0&0#1|))))
+(let ((a!221 (=> |execution_statet::guard_exec@0!0|
+ (=> a!220
+ (fp.eq |c::main::main::1::x@1!0&0#441|
+ (fp #b0 #x00 #b00000000000000000000000))))))
+ (or (not (=> true (=> |execution_statet::guard_exec@0!0| a!1)))
+ (not (=> true a!221))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
+
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/O220-024.smt2 b/src_colibri2/tests/solve/colibri/sat/O220-024.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a2cc56a040a92f4ca563c8b8a64c735e7401bb23
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/O220-024.smt2
@@ -0,0 +1,21 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun isFinite ((f Float32)) Bool (or (fp.isNormal f) (fp.isSubnormal f) (fp.isZero f)))
+(define-fun float__first () Float32 ((_ to_fp 8 24) #xFF7FFFFF))
+(define-fun float__last () Float32 ((_ to_fp 8 24) #x7F7FFFFF))
+(define-fun f0 () Float32 (_ +zero 8 24))
+(declare-fun desired () Float32)
+(declare-fun measured () Float32)
+(assert (isFinite desired))
+(assert (isFinite measured))
+(assert (ite (fp.gt measured f0) (fp.geq desired (fp.add RNE float__first measured)) (fp.leq desired (fp.add RNE float__last measured))))
+(define-fun error () Float32 (fp.sub RNE desired measured))
+(assert (not (isFinite error)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/average_3.smt2 b/src_colibri2/tests/solve/colibri/sat/average_3.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..45a899b9f7251cc3ce6f001205345dc02a717c7c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/average_3.smt2
@@ -0,0 +1,17 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-fun is_finite ((f Float32)) Bool (or (fp.isNormal f) (fp.isSubnormal f) (fp.isZero f)))
+(define-fun f2 () Float32 ((_ to_fp 8 24) #x40000000))
+(declare-fun a () Float32)
+(declare-fun b () Float32)
+(assert (is_finite (fp.add RNE a b)))
+(assert (fp.lt a b))
+(define-fun mid () Float32 (fp.div RNE (fp.add RNE a b) f2))
+(assert (not (and (fp.lt a mid) (fp.lt mid b))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug22.smt2 b/src_colibri2/tests/solve/colibri/sat/bug22.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d968081a2e94bbe40e8fbce3bc883ba8efb2a0fe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug22.smt2
@@ -0,0 +1,42 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+
+(declare-sort integer 0)
+(declare-sort t 0)
+(declare-sort u 0)
+(declare-sort v 0)
+
+(declare-fun to_u (integer) u)
+(declare-fun to_v (t u) v)
+(declare-fun user_eq (v v) Bool)
+
+(declare-const dummy v)
+
+
+(declare-const x t)
+(declare-const y t)
+(declare-const z t)
+
+(declare-const a integer)
+(declare-const b integer)
+(declare-const c integer)
+
+
+
+
+(assert
+;; defqtvc
+ ;; File "member_alt.adb", line 1, characters 0-0
+ (not
+ (=
+ (not
+ (let ((tmp (to_v x (to_u a))))
+ (or (user_eq tmp (to_v y (to_u b)))
+ (user_eq tmp (to_v z (to_u c))))))
+ true)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug36.smt2 b/src_colibri2/tests/solve/colibri/sat/bug36.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4cce5860f5a323a7640a1458fcd5688a8ae2c9ce
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug36.smt2
@@ -0,0 +1,12 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :status-colibri2 sat)
+
+(declare-fun bool_eq (Real Real) Bool)
+(declare-const x Int)
+(declare-fun to_big_real (Int) Real)
+
+(assert
+ (not
+ (= (bool_eq (to_big_real x) (fp.to_real ((_ to_fp 11 53) RNE (to_real x)))) true)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug_26.smt2 b/src_colibri2/tests/solve/colibri/sat/bug_26.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d7ca8b53b86577f3ee82dec632ca33f80d757447
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug_26.smt2
@@ -0,0 +1,21 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(define-fun in_range ((x Int)) Bool (and (<= (- 2147483648) x) (<= x 2147483647)))
+
+(declare-const salt (_ BitVec 64))
+
+(declare-const hash (_ BitVec 64))
+
+(define-fun o () Int (bv2nat (bvxor (bvmul #x0000000000000005 salt) (bvmul #x0000000000000007 hash))))
+
+;; Ensures
+ (assert (in_range o))
+
+(assert
+;; defqtvc
+ ;; File "usergroup_examples.adb", line 42, characters 0-0
+ (not (<= 1 (mod o 256))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug_26_bv.smt2 b/src_colibri2/tests/solve/colibri/sat/bug_26_bv.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e0ed39b6858dfae9d853cf84f1f38010f16f5157
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug_26_bv.smt2
@@ -0,0 +1,11 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(declare-const salt (_ BitVec 64))
+(declare-const hash (_ BitVec 64))
+(define-fun o () (_ BitVec 64) (bvxor (bvmul #x0000000000000005 salt) (bvmul #x0000000000000007 hash)))
+(assert
+;; defqtvc
+ ;; File "usergroup_examples.adb", line 42, characters 0-0
+ (not (bvult #x0000000000000000 (bvurem o #x0000000000000100))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug_43.smt2 b/src_colibri2/tests/solve/colibri/sat/bug_43.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2065eb5c263366af2349c9b3983445e64e221931
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug_43.smt2
@@ -0,0 +1,21 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(define-fun in_range1 ((x Int)) Bool (and (<= (- 2147483648) x) (<= x 2147483647)))
+
+(declare-const x Int)
+
+(define-fun res () Int (- x (colibri_cdiv (- (* 2 x) 1) 2)))
+
+;; Ensures
+ (assert (in_range1 res))
+
+;; H
+ (assert (<= 0 x))
+
+(assert
+;; defqtvc
+ ;; File "arithmetic.adb", line 291, characters 0-0
+ (not (= res 0)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/bug_factorization_urem_udiv.smt2 b/src_colibri2/tests/solve/colibri/sat/bug_factorization_urem_udiv.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..bf749305da7158fe46b2164cf441fc10a2e420ae
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/bug_factorization_urem_udiv.smt2
@@ -0,0 +1,14 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(declare-const x (_ BitVec 512))
+(declare-const y (_ BitVec 512))
+(declare-const z (_ BitVec 512))
+
+(assert (= (bvurem x y) (bvurem x z)))
+(assert (= (bvudiv x y) (bvudiv x z)))
+
+(assert (not (= y z)))
+
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/cancel_2.smt2 b/src_colibri2/tests/solve/colibri/sat/cancel_2.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6d3d710643aa517c435e6fa3d87f93884ce5dda2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/cancel_2.smt2
@@ -0,0 +1,14 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda and Martin Brain|)
+(set-info :category "crafted")
+(set-info :status sat)
+(define-fun is_valid ((f Float32)) Bool (not (fp.isNaN f)))
+(define-fun f0 () Float32 ((_ to_fp 8 24) #x00000000))
+(declare-fun a () Float32)
+(assert (is_valid a))
+(assert (not (fp.eq (fp.add RNE a (fp.neg a)) f0)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/cases_2.smt2 b/src_colibri2/tests/solve/colibri/sat/cases_2.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..84dcf7cbf1097978c764aa77be6cea4b1dd6e865
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/cases_2.smt2
@@ -0,0 +1,12 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda and Martin Brain|)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-fun a () Float32)
+(declare-fun b () Float32)
+(assert (not (or (fp.leq a b) (fp.leq b a))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/div_zero.smt2 b/src_colibri2/tests/solve/colibri/sat/div_zero.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8d767d6113ec3984b5daea9c3c6af2184cc2a10b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/div_zero.smt2
@@ -0,0 +1,98 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(declare-sort tuple0 0)
+
+;; uncomment to pass the VC to cvc4 or z3
+;; (define-fun colibri_cdiv ((x Int) (y Int)) Int (div x y))
+;; (define-fun colibri_crem ((x Int) (y Int)) Int (mod x y))
+;; (define-fun colibri_abs_int ((x Int)) Int (abs x))
+
+(define-fun mod1 ((x Int)
+ (y Int)) Int (ite (< 0 y) (mod x y) (+ (mod x y) y)))
+
+(declare-sort integer 0)
+
+(define-fun in_range ((x Int)) Bool (and (<= (- 2147483648) x)
+ (<= x 2147483647)))
+
+
+(define-fun dynamic_invariant ((temp___expr_18 Int) (temp___is_init_14 Bool)
+ (temp___skip_constant_15 Bool) (temp___do_toplevel_16 Bool)
+ (temp___do_typ_inv_17 Bool)) Bool (=>
+ (or (= temp___is_init_14 true)
+ (<= (- 2147483648) 2147483647)) (in_range
+ temp___expr_18)))
+
+(declare-const x Int)
+
+(declare-const y Int)
+
+(declare-const z Int)
+
+(declare-const tmp1 Int)
+
+(declare-const tmp2 Int)
+
+;; Assume
+ (assert (dynamic_invariant x true false true true))
+
+;; Assume
+ (assert (dynamic_invariant y true false true true))
+
+;; Assume
+ (assert (dynamic_invariant z true false true true))
+
+;; Assume
+ (assert (dynamic_invariant tmp1 false false true true))
+
+;; Assume
+ (assert (dynamic_invariant tmp2 false false true true))
+
+(define-fun o () Int (+ x y))
+
+;; Ensures
+ (assert (in_range o))
+
+;; Ensures
+ (assert (in_range (+ o z)))
+
+(define-fun o1 () Int (+ x y))
+
+;; Ensures
+ (assert (in_range o1))
+
+;; Ensures
+ (assert (in_range (- o1 z)))
+
+(define-fun o2 () Int (+ x y))
+
+;; Ensures
+ (assert (in_range o2))
+
+;; Ensures
+ (assert (in_range (+ o2 z)))
+
+(define-fun o3 () Int (- y z))
+
+;; Ensures
+ (assert (in_range o3))
+
+;; Ensures
+ (assert (in_range (+ x o3)))
+
+;; Assert
+ (assert (or (not (= x (- 2147483648))) (not (= y (- 1)))))
+
+;; Ensures
+ (assert (in_range (* x y)))
+
+;; Uncomment to prove VC in z3 and cvc4
+;; (assert (distinct y 0))
+
+(assert
+;; defqtvc
+ ;; File "arith.adb", line 1, characters 0-0
+ (not (in_range (colibri_cdiv x y))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/dune b/src_colibri2/tests/solve/colibri/sat/dune
new file mode 100644
index 0000000000000000000000000000000000000000..99dbf886e3ef625f519e20588d6a610d5be43eb6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/dune
@@ -0,0 +1,12 @@
+(include dune.inc)
+
+(rule
+ (alias runtest)
+ (deps
+ (glob_files *.cnf)
+ (glob_files *.smt2))
+ (action
+ (with-stdout-to
+ dune.inc
+ (run %{exe:../../../generate_tests/generate_dune_tests.exe} .)))
+ (mode promote))
diff --git a/src_colibri2/tests/solve/colibri/sat/dune.inc b/src_colibri2/tests/solve/colibri/sat/dune.inc
new file mode 100644
index 0000000000000000000000000000000000000000..18d8365da2eb0f83c914203f317f9f70b1cbde2e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/dune.inc
@@ -0,0 +1,544 @@
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:Float_div_bad-main.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:Float_div_bad-main.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:O220-024.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:O220-024.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:average_3.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:average_3.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug22.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug22.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug36.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug36.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug_26.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug_26.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug_26_bv.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug_26_bv.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug_43.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug_43.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:bug_factorization_urem_udiv.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:bug_factorization_urem_udiv.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:cancel_2.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:cancel_2.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:cases_2.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:cases_2.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:div_zero.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:div_zero.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:expLaw.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:expLaw.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:exp_3_precision.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:exp_3_precision.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:guarded_div_1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:guarded_div_1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:guarded_div_2.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:guarded_div_2.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:incorrect_reordering.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:incorrect_reordering.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue40_sat.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue40_sat.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue46.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue46.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue_40.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue_40.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue_42.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue_42.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue_42_bis.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue_42_bis.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue_45.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue_45.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:issue_46.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:issue_46.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:mod_repr.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:mod_repr.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:mul_03_3_1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:mul_03_3_1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:mult.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:mult.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:nan_double-main.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:nan_double-main.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:nan_float-main.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:nan_float-main.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:newton_3_6_false-unreach-call-main.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:newton_3_6_false-unreach-call-main.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:propExpLn1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:propExpLn1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:propLnExp3.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:propLnExp3.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:protected_divide.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:protected_divide.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.00.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.00.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0040.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0040.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0071.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0071.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.01.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.01.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.02.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.02.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0208.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0208.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0214.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0214.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0234.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0234.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0245.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0245.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0246.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0246.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.04.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.04.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0408.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0408.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0449.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0449.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0451.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0451.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0480.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0480.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0490.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0490.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0499.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0499.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0507.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0507.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0525.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0525.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0534.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0534.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0591.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0591.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0611.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0611.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0625.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0625.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0629.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0629.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0630.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0630.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0640.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0640.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0641.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0641.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0643.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0643.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0670.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0670.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0675.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0675.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0682.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0682.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0689.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0689.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0692.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0692.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0698.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0698.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.07.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.07.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0743.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0743.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0778.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0778.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.08.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.08.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0808.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0808.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0811.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0811.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0815.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0815.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0842.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0842.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0875.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0875.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0881.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0881.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.09.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.09.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0907.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0907.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0928.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0928.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0936.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0936.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0949.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0949.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0955.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0955.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0961.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0961.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0985.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0985.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.0994.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.0994.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1.bis.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1.bis.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.10.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.10.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1024.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1024.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1034.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1034.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1035.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1035.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1057.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1057.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1091.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1091.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1094.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1094.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1110.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1110.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1116.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1116.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1123.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1123.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1124.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1124.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1133.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1133.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1137.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1137.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1139.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1139.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1161.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1161.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1165.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1165.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1166.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1166.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1178.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1178.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1179.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1179.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1194.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1194.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1210.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1210.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1214.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1214.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1227.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1227.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1237.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1237.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1244.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1244.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1261.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1261.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1275.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1275.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1300.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1300.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1313.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1313.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1321.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1321.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1323.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1323.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1331.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1331.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1335.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1335.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1393.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1393.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1399.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1399.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1411.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1411.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1418.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1418.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1422.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1422.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1426.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1426.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1443.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1443.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1449.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1449.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1463.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1463.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1472.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1472.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1482.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1482.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1487.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1487.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1496.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1496.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.15.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.15.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1504.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1504.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1508.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1508.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1511.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1511.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1520.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1520.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1523.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1523.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1537.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1537.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1553.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1553.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1560.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1560.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1570.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1570.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1571.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1571.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1588.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1588.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1599.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1599.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1619.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1619.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1633.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1633.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1640.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1640.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1656.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1656.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1667.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1667.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1668.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1668.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1669.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1669.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1671.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1671.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1693.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1693.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1729.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1729.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1741.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1741.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1749.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1749.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1758.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1758.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1771.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1771.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1773.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1773.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1781.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1781.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1784.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1784.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1792.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1792.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1815.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1815.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1819.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1819.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1820.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1820.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1831.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1831.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1834.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1834.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1838.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1838.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1858.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1858.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1859.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1859.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1873.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1873.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1876.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1876.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1878.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1878.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1883.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1883.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1906.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1906.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1909.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1909.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1910.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1910.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1916.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1916.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1919.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1919.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1926.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1926.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1933.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1933.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1937.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1937.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1963.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1963.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1972.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1972.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1975.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1975.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1993.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1993.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.1995.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.1995.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.20.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.20.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2005.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2005.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2036.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2036.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2037.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2037.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2097.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2097.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2099.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2099.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2110.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2110.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2116.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2116.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2117.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2117.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2119.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2119.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2133.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2133.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2150.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2150.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2155.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2155.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2157.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2157.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.2198.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.2198.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.25.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.25.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.30.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.30.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:query.35.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:query.35.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:range_mult_fix_44.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:range_mult_fix_44.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:real_repr.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:real_repr.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:repr2.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:repr2.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:repr_pow.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:repr_pow.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:riposte_floats_are_not_rational.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:riposte_floats_are_not_rational.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:scale_1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:scale_1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-10284.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-10284.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-10286.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-10286.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-11504.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-11504.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-11967.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-11967.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-1201.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-1201.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-12401.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-12401.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-12581.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-12581.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-13316.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-13316.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-13690.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-13690.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-13762.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-13762.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-13880.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-13880.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-14248.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-14248.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-14254.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-14254.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-145.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-145.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-14564.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-14564.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-14628.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-14628.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-15135.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-15135.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-15730.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-15730.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-16064.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-16064.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-16305.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-16305.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-16646.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-16646.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-16876.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-16876.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-17024.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-17024.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-17361.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-17361.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-17538.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-17538.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-1766.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-1766.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-18917.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-18917.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-18939.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-18939.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-19265.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-19265.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-19297.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-19297.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-19725.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-19725.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-2173.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-2173.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-3270.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-3270.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-3535.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-3535.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-4100.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-4100.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-4331.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-4331.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-5119.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-5119.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-5274.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-5274.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-5905.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-5905.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-6014.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-6014.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-6055.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-6055.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-6410.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-6410.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-6585.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-6585.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-673.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-673.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-674.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-674.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-7134.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-7134.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-7164.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-7164.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-7272.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-7272.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-8776.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-8776.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-8940.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-8940.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-9497.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-9497.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:sqrt-has-solution-9896.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:sqrt-has-solution-9896.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:test-Top-Floor_ceil_invalid.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:test-Top-Floor_ceil_invalid.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:test-Top-G2_invalid.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:test-Top-G2_invalid.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:test-Top-Int_Pow2_invalid.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:test-Top-Int_Pow2_invalid.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:test-Top-Int_Pow_invalid.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:test-Top-Int_Pow_invalid.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:underflow_1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:underflow_1.smt2})))
+(rule (alias runtest) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result %{dep:zeros_count_1.smt2})))
+(rule (alias runtest-learning) (action (run %{bin:colibri2} --size=50M --time=30s --max-steps 3500 --check-status colibri2 --dont-print-result --learning %{dep:zeros_count_1.smt2})))
diff --git a/src_colibri2/tests/solve/colibri/sat/expLaw.smt2 b/src_colibri2/tests/solve/colibri/sat/expLaw.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5008ee2566b1f2468a7ea96688f75c2a8b2e9c2c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/expLaw.smt2
@@ -0,0 +1,230 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+(set-logic QF_FPLRA)
+(set-info :source |
+Generated by: Matthias Güdemann
+Generated on: 2019-03-10
+Generator: SBV
+Application: Numerical Approximation of Elementary Functions
+Target Solver: z3
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+; --- uninterpreted sorts ---
+; --- literal constants ---
+(define-fun s_2 () Bool false)
+(define-fun s_1 () Bool true)
+(define-fun s2 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 7378697629483821.0 73786976294838206464.0)))
+(define-fun s4 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1.0)))
+(define-fun s13 () (_ FloatingPoint 11 53) (_ +zero 11 53))
+(define-fun s20 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 2.0 1.0)))
+(define-fun s24 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6.0 1.0)))
+(define-fun s28 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 24.0 1.0)))
+(define-fun s32 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 120.0 1.0)))
+(define-fun s36 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 720.0 1.0)))
+(define-fun s40 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5040.0 1.0)))
+(define-fun s44 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 40320.0 1.0)))
+(define-fun s48 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 362880.0 1.0)))
+(define-fun s201 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 4951760157141521.0 4951760157141521099596496896.0)))
+; --- skolem constants ---
+(declare-fun s0 () (_ FloatingPoint 11 53))
+(declare-fun s1 () (_ FloatingPoint 11 53))
+; --- constant tables ---
+; --- skolemized tables ---
+; --- arrays ---
+; --- uninterpreted constants ---
+; --- user given axioms ---
+; --- formula ---
+(define-fun s3 () Bool (fp.gt s0 s2))
+(define-fun s5 () Bool (fp.leq s0 s4))
+(define-fun s6 () Bool (fp.gt s1 s2))
+(define-fun s7 () Bool (fp.leq s1 s4))
+(define-fun s8 () Bool (and s6 s7))
+(define-fun s9 () Bool (and s5 s8))
+(define-fun s10 () Bool (and s3 s9))
+(define-fun s11 () Bool (not s10))
+(define-fun s12 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s1))
+(define-fun s14 () Bool (fp.lt s12 s13))
+(define-fun s15 () (_ FloatingPoint 11 53) (fp.neg s12))
+(define-fun s16 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s4 s15))
+(define-fun s17 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s16 s4))
+(define-fun s18 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s17))
+(define-fun s19 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s16))
+(define-fun s21 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s19 s20))
+(define-fun s22 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s18 s21))
+(define-fun s23 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s19))
+(define-fun s25 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s23 s24))
+(define-fun s26 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s22 s25))
+(define-fun s27 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s23))
+(define-fun s29 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s27 s28))
+(define-fun s30 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s26 s29))
+(define-fun s31 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s27))
+(define-fun s33 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s31 s32))
+(define-fun s34 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s30 s33))
+(define-fun s35 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s31))
+(define-fun s37 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s35 s36))
+(define-fun s38 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s34 s37))
+(define-fun s39 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s35))
+(define-fun s41 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s39 s40))
+(define-fun s42 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s38 s41))
+(define-fun s43 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s39))
+(define-fun s45 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s43 s44))
+(define-fun s46 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s42 s45))
+(define-fun s47 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s15 s43))
+(define-fun s49 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s47 s48))
+(define-fun s50 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s46 s49))
+(define-fun s51 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s4 s50))
+(define-fun s52 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s4 s12))
+(define-fun s53 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s52 s4))
+(define-fun s54 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s53))
+(define-fun s55 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s52))
+(define-fun s56 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s55 s20))
+(define-fun s57 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s54 s56))
+(define-fun s58 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s55))
+(define-fun s59 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s58 s24))
+(define-fun s60 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s57 s59))
+(define-fun s61 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s58))
+(define-fun s62 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s61 s28))
+(define-fun s63 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s60 s62))
+(define-fun s64 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s61))
+(define-fun s65 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s64 s32))
+(define-fun s66 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s63 s65))
+(define-fun s67 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s64))
+(define-fun s68 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s67 s36))
+(define-fun s69 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s66 s68))
+(define-fun s70 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s67))
+(define-fun s71 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s70 s40))
+(define-fun s72 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s69 s71))
+(define-fun s73 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s70))
+(define-fun s74 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s73 s44))
+(define-fun s75 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s72 s74))
+(define-fun s76 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s12 s73))
+(define-fun s77 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s76 s48))
+(define-fun s78 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s75 s77))
+(define-fun s79 () (_ FloatingPoint 11 53) (ite s14 s51 s78))
+(define-fun s80 () Bool (fp.lt s0 s13))
+(define-fun s81 () (_ FloatingPoint 11 53) (fp.neg s0))
+(define-fun s82 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s4 s81))
+(define-fun s83 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s82 s4))
+(define-fun s84 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s83))
+(define-fun s85 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s82))
+(define-fun s86 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s85 s20))
+(define-fun s87 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s84 s86))
+(define-fun s88 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s85))
+(define-fun s89 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s88 s24))
+(define-fun s90 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s87 s89))
+(define-fun s91 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s88))
+(define-fun s92 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s91 s28))
+(define-fun s93 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s90 s92))
+(define-fun s94 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s91))
+(define-fun s95 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s94 s32))
+(define-fun s96 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s93 s95))
+(define-fun s97 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s94))
+(define-fun s98 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s97 s36))
+(define-fun s99 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s96 s98))
+(define-fun s100 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s97))
+(define-fun s101 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s100 s40))
+(define-fun s102 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s99 s101))
+(define-fun s103 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s100))
+(define-fun s104 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s103 s44))
+(define-fun s105 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s102 s104))
+(define-fun s106 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s81 s103))
+(define-fun s107 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s106 s48))
+(define-fun s108 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s105 s107))
+(define-fun s109 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s4 s108))
+(define-fun s110 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s4))
+(define-fun s111 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s110 s4))
+(define-fun s112 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s111))
+(define-fun s113 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s110))
+(define-fun s114 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s113 s20))
+(define-fun s115 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s112 s114))
+(define-fun s116 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s113))
+(define-fun s117 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s116 s24))
+(define-fun s118 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s115 s117))
+(define-fun s119 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s116))
+(define-fun s120 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s119 s28))
+(define-fun s121 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s118 s120))
+(define-fun s122 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s119))
+(define-fun s123 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s122 s32))
+(define-fun s124 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s121 s123))
+(define-fun s125 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s122))
+(define-fun s126 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s125 s36))
+(define-fun s127 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s124 s126))
+(define-fun s128 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s125))
+(define-fun s129 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s128 s40))
+(define-fun s130 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s127 s129))
+(define-fun s131 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s128))
+(define-fun s132 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s131 s44))
+(define-fun s133 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s130 s132))
+(define-fun s134 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s131))
+(define-fun s135 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s134 s48))
+(define-fun s136 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s133 s135))
+(define-fun s137 () (_ FloatingPoint 11 53) (ite s80 s109 s136))
+(define-fun s138 () Bool (fp.lt s1 s13))
+(define-fun s139 () (_ FloatingPoint 11 53) (fp.neg s1))
+(define-fun s140 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s4 s139))
+(define-fun s141 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s140 s4))
+(define-fun s142 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s141))
+(define-fun s143 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s140))
+(define-fun s144 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s143 s20))
+(define-fun s145 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s142 s144))
+(define-fun s146 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s143))
+(define-fun s147 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s146 s24))
+(define-fun s148 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s145 s147))
+(define-fun s149 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s146))
+(define-fun s150 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s149 s28))
+(define-fun s151 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s148 s150))
+(define-fun s152 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s149))
+(define-fun s153 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s152 s32))
+(define-fun s154 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s151 s153))
+(define-fun s155 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s152))
+(define-fun s156 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s155 s36))
+(define-fun s157 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s154 s156))
+(define-fun s158 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s155))
+(define-fun s159 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s158 s40))
+(define-fun s160 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s157 s159))
+(define-fun s161 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s158))
+(define-fun s162 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s161 s44))
+(define-fun s163 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s160 s162))
+(define-fun s164 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s139 s161))
+(define-fun s165 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s164 s48))
+(define-fun s166 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s163 s165))
+(define-fun s167 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s4 s166))
+(define-fun s168 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s4))
+(define-fun s169 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s168 s4))
+(define-fun s170 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s4 s169))
+(define-fun s171 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s168))
+(define-fun s172 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s171 s20))
+(define-fun s173 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s170 s172))
+(define-fun s174 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s171))
+(define-fun s175 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s174 s24))
+(define-fun s176 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s173 s175))
+(define-fun s177 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s174))
+(define-fun s178 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s177 s28))
+(define-fun s179 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s176 s178))
+(define-fun s180 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s177))
+(define-fun s181 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s180 s32))
+(define-fun s182 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s179 s181))
+(define-fun s183 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s180))
+(define-fun s184 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s183 s36))
+(define-fun s185 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s182 s184))
+(define-fun s186 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s183))
+(define-fun s187 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s186 s40))
+(define-fun s188 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s185 s187))
+(define-fun s189 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s186))
+(define-fun s190 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s189 s44))
+(define-fun s191 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s188 s190))
+(define-fun s192 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s1 s189))
+(define-fun s193 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s192 s48))
+(define-fun s194 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s191 s193))
+(define-fun s195 () (_ FloatingPoint 11 53) (ite s138 s167 s194))
+(define-fun s196 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s137 s195))
+(define-fun s197 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s79 s196))
+(define-fun s198 () Bool (fp.lt s197 s13))
+(define-fun s199 () (_ FloatingPoint 11 53) (fp.neg s197))
+(define-fun s200 () (_ FloatingPoint 11 53) (ite s198 s199 s197))
+(define-fun s202 () Bool (fp.lt s200 s201))
+(define-fun s203 () Bool (or s11 s202))
+(assert (not s203))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/exp_3_precision.smt2 b/src_colibri2/tests/solve/colibri/sat/exp_3_precision.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..114310b6f22a6f01b7bead51a823598c0b4cbc6c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/exp_3_precision.smt2
@@ -0,0 +1,13 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-fun x () Float32)
+(assert (or (fp.isNormal x) (fp.isSubnormal x) (fp.isZero x)))
+(define-fun y () Float64 ((_ to_fp 11 53) RNE x))
+(assert (not (fp.eq (fp.mul RNE (fp.mul RNE x x) x) ((_ to_fp 8 24) RNE (fp.mul RNE (fp.mul RNE y y) y)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/guarded_div_1.smt2 b/src_colibri2/tests/solve/colibri/sat/guarded_div_1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..28eab6851a17e850582f09447c7fe82ee2914592
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/guarded_div_1.smt2
@@ -0,0 +1,22 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun isFinite ((f Float32)) Bool (or (fp.isNormal f) (fp.isSubnormal f) (fp.isZero f)))
+(define-fun f0 () Float32 (_ +zero 8 24))
+(define-fun f0_1 () Float32 ((_ to_fp 8 24) #x3dcccccd))
+(define-fun f1 () Float32 ((_ to_fp 8 24) #x3f800000))
+(define-fun f1000 () Float32 ((_ to_fp 8 24) #x447a0000))
+(declare-fun x () Float32)
+(declare-fun y () Float32)
+(assert (and (isFinite x) (fp.geq x f0)))
+(assert (fp.lt f0_1 y f1))
+(assert (fp.leq (fp.div RNE x f1000) y))
+(define-fun res () Float32 (fp.div RNE x y))
+(assert (not (fp.lt res f1000)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/guarded_div_2.smt2 b/src_colibri2/tests/solve/colibri/sat/guarded_div_2.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..446bded70f73843e428eaed71c87398c82825658
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/guarded_div_2.smt2
@@ -0,0 +1,21 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun is_spark_float ((f Float32)) Bool (not (or (fp.isNaN f) (fp.isInfinite f))))
+(define-fun float__last () Float32 ((_ to_fp 8 24) #x7F7FFFFF))
+(declare-fun x () Float32)
+(declare-fun y () Float32)
+(assert (is_spark_float x))
+(assert (is_spark_float y))
+(assert (fp.geq x (_ +zero 8 24)))
+(assert (fp.geq y (_ +zero 8 24)))
+(assert (not (fp.eq y (_ +zero 8 24))))
+(assert (not (fp.lt y (fp.div RNE x float__last))))
+(assert (not (is_spark_float (fp.div RNE x y))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/incorrect_reordering.smt2 b/src_colibri2/tests/solve/colibri/sat/incorrect_reordering.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ce55836251ecdd4b8d09d02999d49d8917dae788
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/incorrect_reordering.smt2
@@ -0,0 +1,15 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-fun a () Float32)
+(declare-fun b () Float32)
+(declare-fun n () Float32)
+(assert (fp.lt a (fp.mul RNE n b)))
+(assert (fp.gt b (_ +zero 8 24)))
+(assert (not (fp.leq (fp.div RNE a b) n)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue40_sat.smt2 b/src_colibri2/tests/solve/colibri/sat/issue40_sat.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..63f03e2025cbe8471a4bddb7d09de0fc9bb013a6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue40_sat.smt2
@@ -0,0 +1,13 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(declare-const x Int)
+(declare-const y Int)
+
+;(assert (not (= y 0)))
+
+(assert
+ (not (= (colibri_abs_int (colibri_cdiv x y))
+ (colibri_cdiv (colibri_abs_int x) (colibri_abs_int y)))))
+
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue46.smt2 b/src_colibri2/tests/solve/colibri/sat/issue46.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..60982be66d1550d16b18c44a03daa37ed9ef8fb7
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue46.smt2
@@ -0,0 +1,11 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(declare-const modes_on Bool)
+
+(declare-const unit_delay_memory Bool)
+
+(assert (not (= (ite (= unit_delay_memory true) true (ite (= modes_on true) false true)) true)))
+
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue_40.smt2 b/src_colibri2/tests/solve/colibri/sat/issue_40.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..12761e035a3d1bc8280e01e92f337a3271bed654
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue_40.smt2
@@ -0,0 +1,9 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(declare-const x Int)
+(declare-const y Int)
+(assert
+ (not (= (colibri_abs_int (colibri_cdiv x y))
+ (colibri_cdiv (colibri_abs_int x) (colibri_abs_int y)))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue_42.smt2 b/src_colibri2/tests/solve/colibri/sat/issue_42.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ceff54948da1cfa30fd7c5b6a5a45b831e2f1165
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue_42.smt2
@@ -0,0 +1,10 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(declare-const a Int)
+(assert (and (< 1 a) (< a 100)))
+
+(assert (= (colibri_crem 100 a) 0))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue_42_bis.smt2 b/src_colibri2/tests/solve/colibri/sat/issue_42_bis.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..282f4b50980beaf2abc202b176fdcffb1a895735
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue_42_bis.smt2
@@ -0,0 +1,6 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(assert (not (= (colibri_crem (- 1) (- 1)) (- 1))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue_45.smt2 b/src_colibri2/tests/solve/colibri/sat/issue_45.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..07b673e1b25e109d45487e835543a26ab21f6e1b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue_45.smt2
@@ -0,0 +1,33 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+
+
+
+(declare-const x Float32)
+
+(declare-const y Float32)
+
+(declare-const z Float32)
+
+;; Assume
+(assert (fp.leq (fp #b0 #b00000000 #b00000000000000000000000) x))
+
+;; Assume
+(assert (fp.leq (fp #b0 #b00000000 #b00000000000000000000000) y))
+
+;; Assume
+(assert (fp.leq (fp #b0 #b00000000 #b00000000000000000000000) z))
+
+;; Assume
+(assert (fp.leq x (fp #b0 #b10010111 #b00000000000000000000000)))
+
+;; Assume
+(assert (fp.leq y (fp #b0 #b10010111 #b00000000000000000000000)))
+
+
+(assert
+ (not (= (ite (fp.lt (fp.neg (fp.mul RNE x y)) z) true false) true)))
+
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/issue_46.smt2 b/src_colibri2/tests/solve/colibri/sat/issue_46.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e973922b7969e139b14671e04c5ff7de0f0863cc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/issue_46.smt2
@@ -0,0 +1,9 @@
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(declare-const modes_on Bool)
+(declare-const unit_delay_memory Bool)
+(assert
+(not
+(= (ite (= unit_delay_memory true) true (ite (= modes_on true) false true)) true)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/mod_repr.smt2 b/src_colibri2/tests/solve/colibri/sat/mod_repr.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..aec432c088cca35a615e9a855f8e2e28db0c8a0a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/mod_repr.smt2
@@ -0,0 +1,19 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+(define-fun mod1 ((x Int) (y Int)) Int (ite (< 0 y) (mod x y) (+ (mod x y) y)))
+
+
+(define-fun in_range1 ((x Int)) Bool (and (<= 1 x) (<= x 100)))
+
+
+(declare-const x Int)
+
+;; Assume
+ (assert (in_range1 x))
+
+(assert (not (in_range1 (mod1 (+ x 1) 100))))
+(check-sat)
+;(get-value (x))
diff --git a/src_colibri2/tests/solve/colibri/sat/mul_03_3_1.smt2 b/src_colibri2/tests/solve/colibri/sat/mul_03_3_1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e88275bfa76dc3cf5fe30dd93069c1addc5697fe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/mul_03_3_1.smt2
@@ -0,0 +1,71 @@
+(set-option :print-success false)
+(set-logic QF_FP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x25 () (_ FloatingPoint 8 24))
+(declare-fun x18 () Bool)
+(declare-fun x42 () (_ FloatingPoint 8 24))
+(declare-fun x17 () (_ FloatingPoint 8 24))
+(define-fun x24 () RoundingMode RNE)
+(define-fun x46 () (_ FloatingPoint 8 24) x25)
+(define-fun x12 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) x24 x46))
+(define-fun x20 () (_ FloatingPoint 11 53) (fp #b0 #b10000001000 #b1111010000000000000000000000000000000000000000000000))
+(define-fun x21 () Bool (fp.lt x12 x20))
+(define-fun x39 () (_ FloatingPoint 8 24) x42)
+(define-fun x45 () (_ FloatingPoint 8 24) x17)
+(define-fun x49 () (_ FloatingPoint 8 24) (fp.mul x24 x45 x39))
+(define-fun x28 () (_ FloatingPoint 8 24) (fp.mul x24 x46 x49))
+(define-fun x23 () (_ FloatingPoint 8 24) (fp.neg x28))
+(define-fun x30 () (_ FloatingPoint 8 24) (fp.mul x24 x46 x39))
+(define-fun x22 () (_ FloatingPoint 8 24) (fp.mul x24 x30 x45))
+(define-fun x40 () (_ FloatingPoint 8 24) (fp.add x24 x23 x22))
+(define-fun x3 () (_ FloatingPoint 8 24) (fp #b0 #b10000000 #b10000000000000000000000))
+(define-fun x64 () Bool (fp.leq x40 x3))
+(define-fun x27 () (_ FloatingPoint 11 53) (fp #b1 #b10000001000 #b1111010000000000000000000000000000000000000000000000))
+(define-fun x5 () Bool (fp.lt x27 x12))
+(define-fun x54 () Bool (and x5 x21))
+(define-fun x37 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) x24 x39))
+(define-fun x44 () Bool (fp.gt x20 x37))
+(define-fun x2 () Bool (and x44 x54))
+(define-fun x26 () Bool (fp.lt x27 x37))
+(define-fun x55 () Bool (and x2 x26))
+(define-fun x4 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) x24 x45))
+(define-fun x41 () Bool (fp.lt x4 x20))
+(define-fun x14 () Bool (and x55 x41))
+(define-fun x51 () Bool (fp.gt x4 x27))
+(define-fun x13 () Bool (and x14 x51))
+(define-fun x34 () Bool (fp.geq x46 x39))
+(define-fun x58 () Bool (and x34 x13))
+(define-fun x53 () Bool (fp.geq x39 x45))
+(define-fun x31 () Bool (and x58 x53))
+(define-fun x59 () (_ FloatingPoint 8 24) (fp.neg x39))
+(define-fun x35 () (_ FloatingPoint 8 24) (fp.add x24 x59 x46))
+(define-fun x19 () (_ FloatingPoint 8 24) (fp #b0 #b01111101 #b00110011001100110011001))
+(define-fun x7 () Bool (fp.geq x19 x35))
+(define-fun x57 () Bool (and x31 x7))
+(define-fun x63 () (_ FloatingPoint 8 24) (fp.neg x45))
+(define-fun x15 () (_ FloatingPoint 8 24) (fp.add x24 x46 x63))
+(define-fun x62 () Bool (fp.leq x15 x19))
+(define-fun x8 () Bool (and x57 x62))
+(define-fun x1 () (_ FloatingPoint 8 24) (fp.add x24 x63 x39))
+(define-fun x60 () Bool (fp.leq x1 x19))
+(define-fun x29 () Bool (and x8 x60))
+(define-fun x36 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) x24 x22))
+(define-fun x48 () (_ FloatingPoint 11 53) (_ +oo 11 53))
+(define-fun x6 () Bool (fp.lt x36 x48))
+(define-fun x38 () (_ FloatingPoint 11 53) (_ -oo 11 53))
+(define-fun x50 () Bool (fp.lt x38 x36))
+(define-fun x32 () Bool (and x6 x50))
+(define-fun x16 () Bool (and x29 x32))
+(define-fun x11 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) x24 x28))
+(define-fun x61 () Bool (fp.lt x11 x48))
+(define-fun x33 () Bool (fp.gt x11 x38))
+(define-fun x47 () Bool (and x61 x33))
+(define-fun x52 () Bool (and x16 x47))
+(define-fun x56 () Bool (fp.geq x22 x28))
+(define-fun x10 () Bool (and x52 x56))
+(define-fun x43 () Bool (not x64))
+(define-fun x9 () Bool (and x10 x43))
+(assert x9)
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/mult.smt2 b/src_colibri2/tests/solve/colibri/sat/mult.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9d4cacba6b840bb1f99c744fd986fa2f9181e4e3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/mult.smt2
@@ -0,0 +1,13 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun in_range1 ((x Int)) Bool (and (<= (- 2147483648) x)
+ (<= x 2147483647)))
+
+(declare-const b11 Int)
+(assert (in_range1 b11))
+
+(assert (not (<= (* b11 b11) 2147483647)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/nan_double-main.smt2 b/src_colibri2/tests/solve/colibri/sat/nan_double-main.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..063a3fd4187791cac98d2550dc22bd1908dbcc7c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/nan_double-main.smt2
@@ -0,0 +1,25 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+(set-logic ALL)
+(set-info :source |ESBMC floating-point test cases contributed by Mikhail Ramalho.|)
+(set-info :category "crafted")
+(set-info :status sat)
+
+(declare-fun |c::main::$tmp::return_value_nondet_double$1@1!0&0#1|
+ ()
+ (_ FloatingPoint 11 53))
+(declare-fun |nondet$symex::nondet0| () (_ FloatingPoint 11 53))
+(declare-fun |c::main::main::1::x@1!0&0#1| () (_ FloatingPoint 11 53))
+(declare-fun |execution_statet::guard_exec@0!0| () Bool)
+(assert (= |nondet$symex::nondet0|
+ |c::main::$tmp::return_value_nondet_double$1@1!0&0#1|))
+(assert (= |c::main::$tmp::return_value_nondet_double$1@1!0&0#1|
+ |c::main::main::1::x@1!0&0#1|))
+(assert (let ((a!1 (not (=> true
+ (=> |execution_statet::guard_exec@0!0|
+ (fp.eq |c::main::main::1::x@1!0&0#1|
+ |c::main::main::1::x@1!0&0#1|))))))
+ a!1))
+
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/nan_float-main.smt2 b/src_colibri2/tests/solve/colibri/sat/nan_float-main.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..98d5641c7510d3ee3a3f16ea1b4a91232034520e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/nan_float-main.smt2
@@ -0,0 +1,23 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |ESBMC floating-point test cases contributed by Mikhail Ramalho.|)
+(set-info :category "crafted")
+(set-info :status sat)
+
+(declare-fun |c::main::$tmp::return_value_nondet_float$1@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |nondet$symex::nondet0| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |execution_statet::guard_exec@0!0| () Bool)
+(assert (= |nondet$symex::nondet0| |c::main::$tmp::return_value_nondet_float$1@1!0&0#1|))
+(assert (= |c::main::$tmp::return_value_nondet_float$1@1!0&0#1|
+ |c::main::main::1::x@1!0&0#1|))
+(assert (let ((a!1 (not (=> true
+ (=> |execution_statet::guard_exec@0!0|
+ (fp.eq |c::main::main::1::x@1!0&0#1|
+ |c::main::main::1::x@1!0&0#1|))))))
+ a!1))
+
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/newton_3_6_false-unreach-call-main.smt2 b/src_colibri2/tests/solve/colibri/sat/newton_3_6_false-unreach-call-main.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8192aed753d51e583735c7910f9aeebc360331d9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/newton_3_6_false-unreach-call-main.smt2
@@ -0,0 +1,254 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |ESBMC floating-point test cases contributed by Mikhail Ramalho.|)
+(set-info :category "crafted")
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun |c::main::f::x@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::IN@1!0&0#0| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_f$1@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::fp::x@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_fp$2@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::f::x@2!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_f$3@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::fp::x@2!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_fp$4@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#2| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::f::x@3!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_f$5@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::fp::x@3!0&0#1| () (_ FloatingPoint 8 24))
+(declare-fun |c::main::$tmp::return_value_fp$6@1!0&0#1|
+ ()
+ (_ FloatingPoint 8 24))
+(declare-fun |c::main::main::1::x@1!0&0#3| () (_ FloatingPoint 8 24))
+(declare-fun |goto_symex::guard@0!0&0#1| () Bool)
+(declare-fun |execution_statet::guard_exec@0!0| () Bool)
+(assert (= |c::main::main::1::IN@1!0&0#0| |c::main::f::x@1!0&0#1|))
+(assert (let ((a!1 (fp.sub roundNearestTiesToEven
+ |c::main::f::x@1!0&0#1|
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@1!0&0#1|
+ |c::main::f::x@1!0&0#1|)
+ |c::main::f::x@1!0&0#1|)
+ (fp #b0 #x81 #b10000000000000000000000))))
+ (a!2 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@1!0&0#1|
+ |c::main::f::x@1!0&0#1|)
+ |c::main::f::x@1!0&0#1|)
+ |c::main::f::x@1!0&0#1|)
+ |c::main::f::x@1!0&0#1|)))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ (fp.add roundNearestTiesToEven
+ a!1
+ (fp.div roundNearestTiesToEven
+ a!2
+ (fp #b0 #x85 #b11100000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!2
+ |c::main::f::x@1!0&0#1|)
+ |c::main::f::x@1!0&0#1|)
+ (fp #b0 #x8b #b00111011000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_f$1@1!0&0#1|))))
+(assert (= |c::main::main::1::IN@1!0&0#0| |c::main::fp::x@1!0&0#1|))
+(assert (let ((a!1 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@1!0&0#1|
+ |c::main::fp::x@1!0&0#1|)
+ |c::main::fp::x@1!0&0#1|)
+ |c::main::fp::x@1!0&0#1|)))
+(let ((a!2 (fp.add roundNearestTiesToEven
+ (fp.sub roundNearestTiesToEven
+ (fp #b0 #x7f #b00000000000000000000000)
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@1!0&0#1|
+ |c::main::fp::x@1!0&0#1|)
+ (fp #b0 #x80 #b00000000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ a!1
+ (fp #b0 #x83 #b10000000000000000000000)))))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ a!2
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!1
+ |c::main::fp::x@1!0&0#1|)
+ |c::main::fp::x@1!0&0#1|)
+ (fp #b0 #x88 #b01101000000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_fp$2@1!0&0#1|)))))
+(assert (= (fp.sub roundNearestTiesToEven
+ |c::main::main::1::IN@1!0&0#0|
+ (fp.div roundNearestTiesToEven
+ |c::main::$tmp::return_value_f$1@1!0&0#1|
+ |c::main::$tmp::return_value_fp$2@1!0&0#1|))
+ |c::main::main::1::x@1!0&0#1|))
+(assert (= |c::main::main::1::x@1!0&0#1| |c::main::f::x@2!0&0#1|))
+(assert (let ((a!1 (fp.sub roundNearestTiesToEven
+ |c::main::f::x@2!0&0#1|
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@2!0&0#1|
+ |c::main::f::x@2!0&0#1|)
+ |c::main::f::x@2!0&0#1|)
+ (fp #b0 #x81 #b10000000000000000000000))))
+ (a!2 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@2!0&0#1|
+ |c::main::f::x@2!0&0#1|)
+ |c::main::f::x@2!0&0#1|)
+ |c::main::f::x@2!0&0#1|)
+ |c::main::f::x@2!0&0#1|)))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ (fp.add roundNearestTiesToEven
+ a!1
+ (fp.div roundNearestTiesToEven
+ a!2
+ (fp #b0 #x85 #b11100000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!2
+ |c::main::f::x@2!0&0#1|)
+ |c::main::f::x@2!0&0#1|)
+ (fp #b0 #x8b #b00111011000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_f$3@1!0&0#1|))))
+(assert (= |c::main::main::1::x@1!0&0#1| |c::main::fp::x@2!0&0#1|))
+(assert (let ((a!1 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@2!0&0#1|
+ |c::main::fp::x@2!0&0#1|)
+ |c::main::fp::x@2!0&0#1|)
+ |c::main::fp::x@2!0&0#1|)))
+(let ((a!2 (fp.add roundNearestTiesToEven
+ (fp.sub roundNearestTiesToEven
+ (fp #b0 #x7f #b00000000000000000000000)
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@2!0&0#1|
+ |c::main::fp::x@2!0&0#1|)
+ (fp #b0 #x80 #b00000000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ a!1
+ (fp #b0 #x83 #b10000000000000000000000)))))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ a!2
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!1
+ |c::main::fp::x@2!0&0#1|)
+ |c::main::fp::x@2!0&0#1|)
+ (fp #b0 #x88 #b01101000000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_fp$4@1!0&0#1|)))))
+(assert (= (fp.sub roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#1|
+ (fp.div roundNearestTiesToEven
+ |c::main::$tmp::return_value_f$3@1!0&0#1|
+ |c::main::$tmp::return_value_fp$4@1!0&0#1|))
+ |c::main::main::1::x@1!0&0#2|))
+(assert (= |c::main::main::1::x@1!0&0#2| |c::main::f::x@3!0&0#1|))
+(assert (let ((a!1 (fp.sub roundNearestTiesToEven
+ |c::main::f::x@3!0&0#1|
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@3!0&0#1|
+ |c::main::f::x@3!0&0#1|)
+ |c::main::f::x@3!0&0#1|)
+ (fp #b0 #x81 #b10000000000000000000000))))
+ (a!2 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::f::x@3!0&0#1|
+ |c::main::f::x@3!0&0#1|)
+ |c::main::f::x@3!0&0#1|)
+ |c::main::f::x@3!0&0#1|)
+ |c::main::f::x@3!0&0#1|)))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ (fp.add roundNearestTiesToEven
+ a!1
+ (fp.div roundNearestTiesToEven
+ a!2
+ (fp #b0 #x85 #b11100000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!2
+ |c::main::f::x@3!0&0#1|)
+ |c::main::f::x@3!0&0#1|)
+ (fp #b0 #x8b #b00111011000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_f$5@1!0&0#1|))))
+(assert (= |c::main::main::1::x@1!0&0#2| |c::main::fp::x@3!0&0#1|))
+(assert (let ((a!1 (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@3!0&0#1|
+ |c::main::fp::x@3!0&0#1|)
+ |c::main::fp::x@3!0&0#1|)
+ |c::main::fp::x@3!0&0#1|)))
+(let ((a!2 (fp.add roundNearestTiesToEven
+ (fp.sub roundNearestTiesToEven
+ (fp #b0 #x7f #b00000000000000000000000)
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ |c::main::fp::x@3!0&0#1|
+ |c::main::fp::x@3!0&0#1|)
+ (fp #b0 #x80 #b00000000000000000000000)))
+ (fp.div roundNearestTiesToEven
+ a!1
+ (fp #b0 #x83 #b10000000000000000000000)))))
+(let ((a!3 (fp.add roundNearestTiesToEven
+ a!2
+ (fp.div roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ (fp.mul roundNearestTiesToEven
+ a!1
+ |c::main::fp::x@3!0&0#1|)
+ |c::main::fp::x@3!0&0#1|)
+ (fp #b0 #x88 #b01101000000000000000000)))))
+ (= a!3 |c::main::$tmp::return_value_fp$6@1!0&0#1|)))))
+(assert (= (fp.sub roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#2|
+ (fp.div roundNearestTiesToEven
+ |c::main::$tmp::return_value_f$5@1!0&0#1|
+ |c::main::$tmp::return_value_fp$6@1!0&0#1|))
+ |c::main::main::1::x@1!0&0#3|))
+(assert (let ((a!1 (not (not (fp.lt ((_ to_fp 11 53)
+ roundNearestTiesToEven
+ |c::main::main::1::x@1!0&0#3|)
+ (fp #b0 #b01111111011 #x999999999999a))))))
+ (= (not a!1) |goto_symex::guard@0!0&0#1|)))
+(assert (let ((a!1 (and (fp.gt |c::main::main::1::IN@1!0&0#0|
+ (fp.neg (fp #b0 #x7f #b00110011001100110011010)))
+ (fp.lt |c::main::main::1::IN@1!0&0#0|
+ (fp #b0 #x7f #b00110011001100110011010)))))
+(let ((a!2 (=> (and a!1 (not (not |goto_symex::guard@0!0&0#1|))) false)))
+ (not (=> (and true a!1) (=> |execution_statet::guard_exec@0!0| a!2))))))
+
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/propExpLn1.smt2 b/src_colibri2/tests/solve/colibri/sat/propExpLn1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..735622a04f6635c624e0b88cb1a5ed1d81f07c05
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/propExpLn1.smt2
@@ -0,0 +1,121 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_FPLRA)
+(set-info :source |
+Generated by: Matthias Güdemann
+Generated on: 2019-03-10
+Generator: SBV
+Application: Numerical Approximation of Elementary Functions
+Target Solver: z3
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+; --- uninterpreted sorts ---
+; --- literal constants ---
+(define-fun s_2 () Bool false)
+(define-fun s_1 () Bool true)
+(define-fun s1 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 7378697629483821.0 73786976294838206464.0)))
+(define-fun s3 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 10.0 1.0)))
+(define-fun s7 () (_ FloatingPoint 11 53) (_ +zero 11 53))
+(define-fun s9 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1.0)))
+(define-fun s15 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 2.0 1.0)))
+(define-fun s19 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6.0 1.0)))
+(define-fun s23 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 24.0 1.0)))
+(define-fun s27 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 120.0 1.0)))
+(define-fun s31 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 720.0 1.0)))
+(define-fun s35 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5040.0 1.0)))
+(define-fun s39 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 40320.0 1.0)))
+(define-fun s43 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 362880.0 1.0)))
+(define-fun s76 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1725329017245637.0 2251799813685248.0)))
+(define-fun s80 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6743802672015265.0 1125899906842624.0)))
+(define-fun s81 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 8479827738375907.0 2251799813685248.0)))
+(define-fun s90 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 7737125245533627.0 77371252455336267181195264.0)))
+; --- skolem constants ---
+(declare-fun s0 () (_ FloatingPoint 11 53))
+; --- constant tables ---
+; --- skolemized tables ---
+; --- arrays ---
+; --- uninterpreted constants ---
+; --- user given axioms ---
+; --- formula ---
+(define-fun s2 () Bool (fp.gt s0 s1))
+(define-fun s4 () Bool (fp.lt s0 s3))
+(define-fun s5 () Bool (and s2 s4))
+(define-fun s6 () Bool (not s5))
+(define-fun s8 () Bool (fp.lt s0 s7))
+(define-fun s10 () (_ FloatingPoint 11 53) (fp.neg s0))
+(define-fun s11 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s9 s10))
+(define-fun s12 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s11 s9))
+(define-fun s13 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s9 s12))
+(define-fun s14 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s11))
+(define-fun s16 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s14 s15))
+(define-fun s17 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s13 s16))
+(define-fun s18 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s14))
+(define-fun s20 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s18 s19))
+(define-fun s21 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s17 s20))
+(define-fun s22 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s18))
+(define-fun s24 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s22 s23))
+(define-fun s25 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s21 s24))
+(define-fun s26 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s22))
+(define-fun s28 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s26 s27))
+(define-fun s29 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s25 s28))
+(define-fun s30 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s26))
+(define-fun s32 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s30 s31))
+(define-fun s33 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s29 s32))
+(define-fun s34 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s30))
+(define-fun s36 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s34 s35))
+(define-fun s37 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s33 s36))
+(define-fun s38 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s34))
+(define-fun s40 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s38 s39))
+(define-fun s41 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s37 s40))
+(define-fun s42 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s10 s38))
+(define-fun s44 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s42 s43))
+(define-fun s45 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s41 s44))
+(define-fun s46 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s9 s45))
+(define-fun s47 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s9))
+(define-fun s48 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s47 s9))
+(define-fun s49 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s9 s48))
+(define-fun s50 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s47))
+(define-fun s51 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s50 s15))
+(define-fun s52 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s49 s51))
+(define-fun s53 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s50))
+(define-fun s54 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s53 s19))
+(define-fun s55 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s52 s54))
+(define-fun s56 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s53))
+(define-fun s57 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s56 s23))
+(define-fun s58 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s55 s57))
+(define-fun s59 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s56))
+(define-fun s60 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s59 s27))
+(define-fun s61 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s58 s60))
+(define-fun s62 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s59))
+(define-fun s63 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s62 s31))
+(define-fun s64 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s61 s63))
+(define-fun s65 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s62))
+(define-fun s66 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s65 s35))
+(define-fun s67 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s64 s66))
+(define-fun s68 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s65))
+(define-fun s69 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s68 s39))
+(define-fun s70 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s67 s69))
+(define-fun s71 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s0 s68))
+(define-fun s72 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s71 s43))
+(define-fun s73 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s70 s72))
+(define-fun s74 () (_ FloatingPoint 11 53) (ite s8 s46 s73))
+(define-fun s75 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s74 s9))
+(define-fun s77 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s75 s76))
+(define-fun s78 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s19 s77))
+(define-fun s79 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s75 s78))
+(define-fun s82 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s75 s81))
+(define-fun s83 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s80 s82))
+(define-fun s84 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s79 s83))
+(define-fun s85 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s0 s84))
+(define-fun s86 () Bool (fp.lt s85 s7))
+(define-fun s87 () (_ FloatingPoint 11 53) (fp.neg s85))
+(define-fun s88 () (_ FloatingPoint 11 53) (ite s86 s87 s85))
+(define-fun s89 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s88 s0))
+(define-fun s91 () Bool (fp.leq s89 s90))
+(define-fun s92 () Bool (or s6 s91))
+(assert (not s92))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/propLnExp3.smt2 b/src_colibri2/tests/solve/colibri/sat/propLnExp3.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2dd6d09a44aa3a1744bdc27ce79a145c0d8210d4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/propLnExp3.smt2
@@ -0,0 +1,120 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_FPLRA)
+(set-info :source |
+Generated by: Matthias Güdemann
+Generated on: 2019-03-10
+Generator: SBV
+Application: Numerical Approximation of Elementary Functions
+Target Solver: z3
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status-colibri2 steplimitreached)
+
+; --- uninterpreted sorts ---
+; --- literal constants ---
+(define-fun s_2 () Bool false)
+(define-fun s_1 () Bool true)
+(define-fun s1 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 7378697629483821.0 73786976294838206464.0)))
+(define-fun s3 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5764607523034235.0 576460752303423488.0)))
+(define-fun s7 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1.0)))
+(define-fun s9 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6.0 1.0)))
+(define-fun s10 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 1725329017245637.0 2251799813685248.0)))
+(define-fun s14 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 6743802672015265.0 1125899906842624.0)))
+(define-fun s15 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 8479827738375907.0 2251799813685248.0)))
+(define-fun s19 () (_ FloatingPoint 11 53) (_ +zero 11 53))
+(define-fun s26 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 2.0 1.0)))
+(define-fun s33 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 24.0 1.0)))
+(define-fun s37 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 120.0 1.0)))
+(define-fun s41 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 720.0 1.0)))
+(define-fun s45 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5040.0 1.0)))
+(define-fun s49 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 40320.0 1.0)))
+(define-fun s53 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 362880.0 1.0)))
+(define-fun s90 () (_ FloatingPoint 11 53) ((_ to_fp 11 53) roundNearestTiesToEven (/ 7737125245533627.0 77371252455336267181195264.0)))
+; --- skolem constants ---
+(declare-fun s0 () (_ FloatingPoint 11 53))
+; --- constant tables ---
+; --- skolemized tables ---
+; --- arrays ---
+; --- uninterpreted constants ---
+; --- user given axioms ---
+; --- formula ---
+(define-fun s2 () Bool (fp.gt s0 s1))
+(define-fun s4 () Bool (fp.lt s0 s3))
+(define-fun s5 () Bool (and s2 s4))
+(define-fun s6 () Bool (not s5))
+(define-fun s8 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s0 s7))
+(define-fun s11 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s8 s10))
+(define-fun s12 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s9 s11))
+(define-fun s13 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s8 s12))
+(define-fun s16 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s8 s15))
+(define-fun s17 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s14 s16))
+(define-fun s18 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s13 s17))
+(define-fun s20 () Bool (fp.lt s18 s19))
+(define-fun s21 () (_ FloatingPoint 11 53) (fp.neg s18))
+(define-fun s22 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s7 s21))
+(define-fun s23 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s22 s7))
+(define-fun s24 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s7 s23))
+(define-fun s25 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s22))
+(define-fun s27 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s25 s26))
+(define-fun s28 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s24 s27))
+(define-fun s29 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s25))
+(define-fun s30 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s29 s9))
+(define-fun s31 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s28 s30))
+(define-fun s32 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s29))
+(define-fun s34 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s32 s33))
+(define-fun s35 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s31 s34))
+(define-fun s36 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s32))
+(define-fun s38 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s36 s37))
+(define-fun s39 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s35 s38))
+(define-fun s40 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s36))
+(define-fun s42 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s40 s41))
+(define-fun s43 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s39 s42))
+(define-fun s44 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s40))
+(define-fun s46 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s44 s45))
+(define-fun s47 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s43 s46))
+(define-fun s48 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s44))
+(define-fun s50 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s48 s49))
+(define-fun s51 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s47 s50))
+(define-fun s52 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s21 s48))
+(define-fun s54 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s52 s53))
+(define-fun s55 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s51 s54))
+(define-fun s56 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s7 s55))
+(define-fun s57 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s7 s18))
+(define-fun s58 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s57 s7))
+(define-fun s59 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s7 s58))
+(define-fun s60 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s57))
+(define-fun s61 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s60 s26))
+(define-fun s62 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s59 s61))
+(define-fun s63 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s60))
+(define-fun s64 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s63 s9))
+(define-fun s65 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s62 s64))
+(define-fun s66 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s63))
+(define-fun s67 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s66 s33))
+(define-fun s68 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s65 s67))
+(define-fun s69 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s66))
+(define-fun s70 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s69 s37))
+(define-fun s71 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s68 s70))
+(define-fun s72 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s69))
+(define-fun s73 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s72 s41))
+(define-fun s74 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s71 s73))
+(define-fun s75 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s72))
+(define-fun s76 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s75 s45))
+(define-fun s77 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s74 s76))
+(define-fun s78 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s75))
+(define-fun s79 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s78 s49))
+(define-fun s80 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s77 s79))
+(define-fun s81 () (_ FloatingPoint 11 53) (fp.mul roundNearestTiesToEven s18 s78))
+(define-fun s82 () (_ FloatingPoint 11 53) (fp.div roundNearestTiesToEven s81 s53))
+(define-fun s83 () (_ FloatingPoint 11 53) (fp.add roundNearestTiesToEven s80 s82))
+(define-fun s84 () (_ FloatingPoint 11 53) (ite s20 s56 s83))
+(define-fun s85 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s0 s84))
+(define-fun s86 () Bool (fp.lt s85 s19))
+(define-fun s87 () (_ FloatingPoint 11 53) (fp.neg s85))
+(define-fun s88 () (_ FloatingPoint 11 53) (ite s86 s87 s85))
+(define-fun s89 () (_ FloatingPoint 11 53) (fp.sub roundNearestTiesToEven s88 s0))
+(define-fun s91 () Bool (fp.leq s89 s90))
+(define-fun s92 () Bool (or s6 s91))
+(assert (not s92))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/protected_divide.smt2 b/src_colibri2/tests/solve/colibri/sat/protected_divide.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a346e504d4894cdb529ed2ce0c0f112c02b20342
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/protected_divide.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun isFinite ((f Float32)) Bool (or (fp.isNormal f) (fp.isSubnormal f) (fp.isZero f)))
+(define-fun float__last () Float32 ((_ to_fp 8 24) #x7F7FFFFF))
+(define-fun f0 () Float32 (_ +zero 8 24))
+(define-fun f1 () Float32 ((_ to_fp 8 24) #x3f800000))
+(declare-fun left () Float32)
+(declare-fun right () Float32)
+(assert (isFinite left))
+(assert (isFinite right))
+(assert (fp.geq left f0))
+(assert (fp.geq right f0))
+(define-fun result_1 () Float32 (fp.div RNE left right))
+(define-fun result_2 () Float32 (ite (fp.eq right f0) float__last (ite (fp.lt right (fp.div RNE left float__last)) float__last result_1)))
+(define-fun result_3 () Float32 (ite (fp.lt right f1) result_2 result_1))
+(assert (not (isFinite result_3)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.00.smt2 b/src_colibri2/tests/solve/colibri/sat/query.00.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ee3f01b01094d2f33a986d420b4be14a5a32dc65
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.00.smt2
@@ -0,0 +1,18 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/aachen_syn_mod_double.x86_64/query.00.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(declare-fun f_ackermann!0 () (_ BitVec 64))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) f_ackermann!0))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0040.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0040.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..89328661a462c67d77a4f8095e7ec8365a272afe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0040.smt2
@@ -0,0 +1,41 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0040.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4)))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x35 (and (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))))
+(not $x35)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0071.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0071.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c85d347ad61fe6b3b36420bd98d5f5908a4f63bf
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0071.smt2
@@ -0,0 +1,46 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0071.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.01.smt2 b/src_colibri2/tests/solve/colibri/sat/query.01.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3bd4896f19121bc0948ec8e328bca51fa9d373d9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.01.smt2
@@ -0,0 +1,18 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/aachen_syn_mod_double.x86_64/query.01.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(declare-fun g_ackermann!0 () (_ BitVec 64))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) g_ackermann!0))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.02.smt2 b/src_colibri2/tests/solve/colibri/sat/query.02.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a6e4629614e63256a726570c462694b1d5d0df2a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.02.smt2
@@ -0,0 +1,37 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/aachen_syn_mod_double.x86_64/query.02.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun f_ackermann!1 () (_ BitVec 64))
+(declare-fun g_ackermann!0 () (_ BitVec 64))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) f_ackermann!1))))
+(assert
+ (let ((?x20 (ite (fp.isInfinite ((_ to_fp 11 53) f_ackermann!1)) (ite (fp.gt ((_ to_fp 11 53) f_ackermann!1) ((_ to_fp 11 53) (_ bv0 64))) (_ bv1 32) (_ bv4294967295 32)) (_ bv0 32))))
+ (= (_ bv0 32) ?x20)))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) f_ackermann!1)))
+ (fp.gt ?x9 ((_ to_fp 11 53) (_ bv0 64)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) g_ackermann!0))))
+(assert
+ (let ((?x28 (ite (fp.isInfinite ((_ to_fp 11 53) g_ackermann!0)) (ite (fp.gt ((_ to_fp 11 53) g_ackermann!0) ((_ to_fp 11 53) (_ bv0 64))) (_ bv1 32) (_ bv4294967295 32)) (_ bv0 32))))
+ (= (_ bv0 32) ?x28)))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) g_ackermann!0)))
+ (fp.gt ?x22 ((_ to_fp 11 53) (_ bv0 64)))))
+(assert
+ (not (not (fp.gt ((_ to_fp 11 53) g_ackermann!0) ((_ to_fp 11 53) f_ackermann!1)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0208.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0208.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c31a3621cebdd69a2458dd7ac4073aa28c4adb8c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0208.smt2
@@ -0,0 +1,49 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0208.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x17))))
+(assert
+ (let (($x22 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let (($x42 (and (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))))
+(not $x42)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0214.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0214.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9e14d15a049e449635f1deb015bcfafd841ac70a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0214.smt2
@@ -0,0 +1,46 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0214.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let (($x35 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x35 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0234.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0234.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..60824d7ae95517ef382ba6e36c38ad59881b28a1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0234.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0234.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x30 (fp.isNaN ?x13)))
+ (let (($x35 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x30) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x13))))
+ (let (($x31 (not $x30)))
+ (not (and $x31 $x35)))))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x30 (fp.isNaN ?x13)))
+(let (($x31 (not $x30)))
+(not $x31)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0245.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0245.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1c3c3c1e15b41f7d7ea566546e87d0fc4a139598
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0245.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0245.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x31 (fp.isNaN ?x13)))
+ (let (($x36 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x31) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x13))))
+ (let (($x32 (not $x31)))
+ (not (and $x32 $x36)))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x31 (fp.isNaN ?x13)))
+(not $x31))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0246.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0246.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5e7a0a66f10094d2a239d6deadf878e27e0f084f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0246.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0246.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x14))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x22) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let (($x42 (and (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))))
+(not (and $x42 (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.04.smt2 b/src_colibri2/tests/solve/colibri/sat/query.04.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ffa23b218a1222fb260f3935d081fc984a915a0c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.04.smt2
@@ -0,0 +1,18 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_statistics_klee_bug.x86_64/query.04.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(declare-fun data_ackermann!0 () (_ BitVec 64))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) data_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0408.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0408.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..59d2fbae067ecb080a60cfb7bbba6355490c97fe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0408.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0408.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let (($x23 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+ (or $x23 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0449.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0449.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..14e85b5ce3f411d97198b68a6b4f8684f9475dec
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0449.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0449.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x20) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x19)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0451.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0451.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b280253b43962ac0df8147e67c5e87165c952801
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0451.smt2
@@ -0,0 +1,51 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0451.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let (($x23 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+ (or $x23 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let (($x33 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x33 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x30 ?x20))))
+(assert
+ (let (($x44 (and (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))))
+(not (and $x44 (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0480.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0480.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6b0e0559136f81347040dd8a8b3815f2a21a9783
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0480.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0480.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x13))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or $x29 (fp.lt ?x28 ((_ to_fp 11 53) x_ackermann!3))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x29 (fp.isNaN ?x28)))
+(let (($x42 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x29) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x28))))
+(not (not (and (not $x29) $x42)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0490.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0490.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2a7cdb5a0384572144a871aad613bf92450563ff
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0490.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0490.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x30 ?x13))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+(let (($x39 (fp.isNaN ?x17)))
+(let (($x44 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x39) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x17))))
+(not (and (not $x39) $x44))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0499.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0499.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f9561634201bdbfd773ae452eaa955abbea49d4f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0499.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0499.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x13))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0507.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0507.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..57050753efca9d260a66458ff419ed810d5f5ee3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0507.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0507.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or $x25 (fp.lt ?x24 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x24 ?x14))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x25) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x24)))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x37 (fp.isNaN ?x13)))
+(let (($x42 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x37) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x13))))
+(not (not (and (not $x37) $x42)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0525.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0525.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9a7e0ab7780736095bc185ae0f03a55b299ba46d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0525.smt2
@@ -0,0 +1,48 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0525.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0534.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0534.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d8e5e820fb77ae9c939992af993591f2d0e8568d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0534.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0534.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.lt ?x25 ?x14))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0591.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0591.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3524472b4bde3221cc620a9473596de8aea95279
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0591.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0591.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0611.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0611.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..522876ef357cf4a0695763a20de373df6ed852fe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0611.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0611.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or $x26 (fp.lt ?x25 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x17))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x26) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x25)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0625.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0625.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3f22f04d4c6a19be0a3e799ceacff74bfb667cbe
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0625.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0625.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x16) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ?x15)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x34 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0629.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0629.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..334d329d117fe5a7cac61578eb023594c7ff36da
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0629.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0629.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let (($x28 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x28 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x31 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let (($x38 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x38 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0630.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0630.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..505720e20c2dbab7cabff8ec97d214dcf43a7daf
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0630.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0630.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let (($x28 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x28 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x31 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let (($x38 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x38 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0640.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0640.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..81ba8ff3f4c47cacafb070c77c513d483eee2ab2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0640.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0640.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.lt ?x25 ?x13))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x36 (fp.isNaN ?x25)))
+ (not $x36))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x36 (fp.isNaN ?x25)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x36) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x25)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0641.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0641.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..44f6bb4b049255efe66fd30f1f70bb83b09ce2e9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0641.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0641.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x16) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ?x15)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x30 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0643.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0643.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7f1d4fa0898cbd52de6178d7f63fc69976113812
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0643.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0643.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x32 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0670.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0670.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6acb11f9debf55f7c1c7c55279ddc790ced8fbd1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0670.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0670.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x16) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ?x15)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0675.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0675.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2d52b191bfaa586779dc8fb75944ed2e34b8dbf9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0675.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0675.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 $x20) (fp.lt ?x26 ?x19)))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x14))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x27) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x26)))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x32 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x38 (fp.isNaN ?x13)))
+(let (($x43 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x38) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x13))))
+(not (and (not $x38) $x43))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0682.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0682.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9d0b0dc2b2a7416466373d143140142e858d6bc6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0682.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0682.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x31 ?x15))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0689.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0689.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a3ce13d4329839bcc6848b78119a64aced3e30fc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0689.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0689.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x27 ?x17))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.isNaN ?x13)))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0692.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0692.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..edf48bd2b7c955e1dc79cdb91a4ca26fdbd23a20
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0692.smt2
@@ -0,0 +1,49 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0692.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let (($x21 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x21 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let (($x31 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+ (or $x31 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x18))))
+(assert
+ (let (($x40 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+(not (or $x40 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0698.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0698.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2e6ff079478312743c429b86abc4cf5958d1068c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0698.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0698.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x33 (not $x14)))
+ (not (and $x33 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x40 ?x20))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.07.smt2 b/src_colibri2/tests/solve/colibri/sat/query.07.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0fc3a08bc7f6241e03d958c0c5cdea7f9c09d292
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.07.smt2
@@ -0,0 +1,33 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_statistics_klee_bug.x86_64/query.07.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun data_ackermann!0 () (_ BitVec 64))
+(declare-fun data_ackermann!1 () (_ BitVec 64))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.geq ?x9 ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.leq ?x9 ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) data_ackermann!1))))
+(assert
+ (let ((?x26 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+(let ((?x29 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x26)) data_ackermann!1 ?x26)))
+(let ((?x32 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x29)) (_ bv4625844209755933901 64) ?x29)))
+(let (($x39 (fp.gt ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32)) ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+(let (($x38 (not (fp.isNaN ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32))))))
+(not (and $x38 (not $x39)))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0743.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0743.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..48ab9cf4f3df023863afa8c5881de0ea8ac14a49
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0743.smt2
@@ -0,0 +1,49 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0743.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let (($x39 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)))))
+ (or $x39 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3)))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0778.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0778.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..94aed543734cce9c5ac66419cbecb190ad4518cf
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0778.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0778.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (or (or $x19 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x33 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+(let (($x19 (fp.isNaN ?x18)))
+(let (($x44 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x19) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x18))))
+(not (not (and (not $x19) $x44)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.08.smt2 b/src_colibri2/tests/solve/colibri/sat/query.08.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1ba8aaa4abb39cbef9c002621902e3bea5b6d12e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.08.smt2
@@ -0,0 +1,44 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_statistics_klee_bug.x86_64/query.08.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun data_ackermann!0 () (_ BitVec 64))
+(declare-fun data_ackermann!1 () (_ BitVec 64))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.geq ?x9 ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.leq ?x9 ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) data_ackermann!1))))
+(assert
+ (let ((?x26 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x29 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x26)) data_ackermann!1 ?x26)))
+ (let ((?x32 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x29)) (_ bv4625844209755933901 64) ?x29)))
+ (not (fp.isNaN ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32))))))))
+(assert
+ (let ((?x26 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x29 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x26)) data_ackermann!1 ?x26)))
+ (let ((?x32 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x29)) (_ bv4625844209755933901 64) ?x29)))
+ (let (($x39 (fp.gt ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32)) ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+ (not $x39))))))
+(assert
+ (let ((?x42 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+(let ((?x45 (ite (fp.lt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x42)) data_ackermann!1 ?x42)))
+(let ((?x48 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x45)) (_ bv4625844209755933901 64) ?x45)))
+(let (($x54 (fp.lt ((_ to_fp 11 53) (ite (fp.lt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x48)) (_ bv4623282787467866931 64) ?x48)) ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+(let (($x55 (or (fp.isNaN ((_ to_fp 11 53) (ite (fp.lt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x48)) (_ bv4623282787467866931 64) ?x48))) $x54)))
+(not $x55)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0808.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0808.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..63de7f4d2a2ffeb68993b7234f11155d07720fb9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0808.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0808.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x22) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x13))))
+(assert
+ (let (($x39 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x39 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0811.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0811.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1bd8194c86925b3b37f950f1fd3d28c9f58e52f6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0811.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0811.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or $x14 (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x21)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0815.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0815.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..76ad195ae917c6eb29f124c7277095e226f23771
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0815.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0815.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0842.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0842.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e01bbfb49cd76c555931443e090d0ff7ba74f1bd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0842.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0842.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+(let (($x21 (fp.isNaN ?x20)))
+(let (($x46 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x21) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x20))))
+(not (and (not $x21) $x46))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0875.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0875.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0a28616abfebd526d34ce878adaec2185e666594
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0875.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0875.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x27 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0881.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0881.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d18405fc7718e99c43e91041bf779b7980028f8d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0881.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0881.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x33 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or $x16 (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.09.smt2 b/src_colibri2/tests/solve/colibri/sat/query.09.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4e2131499076d38bf057897406837908c7ddb8d9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.09.smt2
@@ -0,0 +1,34 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_statistics_klee_bug.x86_64/query.09.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun data_ackermann!0 () (_ BitVec 64))
+(declare-fun data_ackermann!1 () (_ BitVec 64))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.geq ?x9 ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.leq ?x9 ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+(assert
+ (let ((?x24 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x27 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x24)) data_ackermann!1 ?x24)))
+ (let ((?x30 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x27)) (_ bv4625844209755933901 64) ?x27)))
+ (let (($x36 (fp.gt ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x30)) (_ bv4623282787467866931 64) ?x30)) ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+ (or (fp.isNaN ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x30)) (_ bv4623282787467866931 64) ?x30))) $x36))))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) data_ackermann!1))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0907.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0907.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9ba5a800a390cb3c872a68bd2a149ad5854d7866
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0907.smt2
@@ -0,0 +1,51 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0907.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let (($x28 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x28 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x32 ?x15))))
+(assert
+ (let (($x36 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x36 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0928.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0928.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..92ac453994e14a2a770cf1f1b6be2ad2d39918a6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0928.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0928.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or $x27 (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x27 (fp.isNaN ?x26)))
+(let (($x47 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x27) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x26))))
+(not (not (and (not $x27) $x47)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0936.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0936.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9c45baae6e9b730ee3384c3d81268c00980ca7c2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0936.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0936.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x36 (not $x14)))
+ (not (and $x36 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0949.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0949.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..99b8d3507d84bcbe3e1c05aca90fde2201b0c612
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0949.smt2
@@ -0,0 +1,66 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0949.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (or (or $x19 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x18 ?x13))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or (or $x26 $x19) (fp.lt ?x25 ?x18)))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x13))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or $x26 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x25)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x38 (fp.isNaN ?x31)))
+ (not $x38))))
+(assert
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x38 (fp.isNaN ?x31)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x38) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x31)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0955.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0955.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3ccb6de6584532bd78a75f36562cb8af3d1c02a9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0955.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0955.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x28 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0961.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0961.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..86c3d8e184cc269968ed44b2048b778ce2b53341
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0961.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0961.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x30 (fp.isNaN ?x29)))
+ (or (or $x30 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x29 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x29 ?x16))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x30 (fp.isNaN ?x29)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x30) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x29)))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x36 ?x16))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x42 (fp.isNaN ?x22)))
+ (not $x42))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x42 (fp.isNaN ?x22)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x42) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x22)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0985.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0985.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4fe2a60ca859111f11cb508fb98e99abafeaeb14
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0985.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0985.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x23 (fp.isNaN ?x22)))
+ (or (or $x23 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x22 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x22 ?x13))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x23 (fp.isNaN ?x22)))
+ (or $x23 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x22)))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x29 ?x13))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+(let (($x40 (fp.isNaN ?x17)))
+(let (($x45 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x40) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x17))))
+(not (and (not $x40) $x45))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.0994.smt2 b/src_colibri2/tests/solve/colibri/sat/query.0994.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..baadf6bd7967eff5a6fc4e53228e03b3373e51fc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.0994.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.0994.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 $x22) (fp.lt ?x28 ?x21)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x29 (fp.isNaN ?x28)))
+(let (($x48 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x29) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x28))))
+(not (and (not $x29) $x48))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1.bis.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1.bis.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b3cfec09237a59558a89bec9dda189cf373ea09c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1.bis.smt2
@@ -0,0 +1,10 @@
+(set-option :print-success false)
+(set-logic QF_BVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x8 () (_ BitVec 32))
+(assert (let ((x4 ((_ to_fp 8 24) x8))) (fp.geq ((_ to_fp 8 24) (_ bv1101004800 32)) x4)))
+(assert (let ((x5 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) x8) ((_ to_fp 8 24) (_ bv3196059648 32))) ((_ to_fp 8 24) (_ bv3236780938 32))))) (let ((x6 (fp.div roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv1075663419 32))))) (let ((x4 ((_ to_fp 8 24) x8))) (let ((x9 (fp.sub roundNearestTiesToEven x4 (fp.mul roundNearestTiesToEven x6 ((_ to_fp 8 24) (_ bv3196059648 32)))))) (let ((x7 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3254779904 32)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv1056964608 32)) x6)))) (let ((x1 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv1074236894 32)) x7)))) (let ((x2 (fp.add roundNearestTiesToEven x1 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3204448256 32)) x9)))) (let ((x3 (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven x2 ((_ to_fp 8 24) (_ bv1075285470 32))) ((_ to_fp 8 24) (_ bv3204448256 32))))) (not (not (fp.eq (fp.sub roundNearestTiesToEven x9 x3) ((_ to_fp 8 24) (_ bv0 32))))))))))))))
+(assert (let ((x4 ((_ to_fp 8 24) x8))) (fp.geq x4 ((_ to_fp 8 24) (_ bv1065353216 32)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1f4902f993201009e71043844c7af31bea240cb6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1.smt2
@@ -0,0 +1,10 @@
+(set-option :print-success false)
+(set-logic QF_ABVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x8 () (Array (_ BitVec 32) (_ BitVec 8)))
+(assert (let ((x7 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x6 ((_ to_fp 8 24) (concat (select x8 (_ bv3 32)) x7)))) (fp.geq x6 ((_ to_fp 8 24) (_ bv1065353216 32))))))
+(assert (let ((x7 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x6 ((_ to_fp 8 24) (concat (select x8 (_ bv3 32)) x7)))) (let ((x4 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3236780938 32)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3196059648 32)) x6)))) (let ((x10 (fp.div roundNearestTiesToEven x4 ((_ to_fp 8 24) (_ bv1075663419 32))))) (let ((x5 (fp.sub roundNearestTiesToEven x6 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3196059648 32)) x10)))) (let ((x2 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) (_ bv3254779904 32)) (fp.mul roundNearestTiesToEven x10 ((_ to_fp 8 24) (_ bv1056964608 32)))))) (let ((x1 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) (_ bv1074236894 32)) x2)))) (let ((x9 (fp.add roundNearestTiesToEven x1 (fp.mul roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv3204448256 32)))))) (let ((x3 (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven x9 ((_ to_fp 8 24) (_ bv1075285470 32))) ((_ to_fp 8 24) (_ bv3204448256 32))))) (not (not (fp.eq (fp.sub roundNearestTiesToEven x5 x3) ((_ to_fp 8 24) (_ bv0 32)))))))))))))))
+(assert (let ((x7 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x6 ((_ to_fp 8 24) (concat (select x8 (_ bv3 32)) x7)))) (fp.leq x6 ((_ to_fp 8 24) (_ bv1101004800 32))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.10.smt2 b/src_colibri2/tests/solve/colibri/sat/query.10.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..23d2a2a5d17a4f2b63a016d2b3747b38e429bffc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.10.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_statistics_klee_bug.x86_64/query.10.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun data_ackermann!0 () (_ BitVec 64))
+(declare-fun data_ackermann!1 () (_ BitVec 64))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.geq ?x9 ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+(assert
+ (let ((?x9 ((_ to_fp 11 53) data_ackermann!0)))
+ (fp.leq ?x9 ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) data_ackermann!1))))
+(assert
+ (let ((?x26 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x29 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x26)) data_ackermann!1 ?x26)))
+ (let ((?x32 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x29)) (_ bv4625844209755933901 64) ?x29)))
+ (not (fp.isNaN ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32))))))))
+(assert
+ (let ((?x26 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x29 (ite (fp.gt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x26)) data_ackermann!1 ?x26)))
+ (let ((?x32 (ite (fp.gt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x29)) (_ bv4625844209755933901 64) ?x29)))
+ (let (($x39 (fp.gt ((_ to_fp 11 53) (ite (fp.gt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x32)) (_ bv4623282787467866931 64) ?x32)) ((_ to_fp 11 53) (_ bv4626322717216342016 64)))))
+ (not $x39))))))
+(assert
+ (let ((?x42 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x45 (ite (fp.lt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x42)) data_ackermann!1 ?x42)))
+ (let ((?x48 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x45)) (_ bv4625844209755933901 64) ?x45)))
+ (not (fp.isNaN ((_ to_fp 11 53) (ite (fp.lt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x48)) (_ bv4623282787467866931 64) ?x48))))))))
+(assert
+ (let ((?x42 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625787914760591770 64)) ((_ to_fp 11 53) data_ackermann!0)) (_ bv4625787914760591770 64) data_ackermann!0)))
+ (let ((?x45 (ite (fp.lt ((_ to_fp 11 53) data_ackermann!1) ((_ to_fp 11 53) ?x42)) data_ackermann!1 ?x42)))
+ (let ((?x48 (ite (fp.lt ((_ to_fp 11 53) (_ bv4625844209755933901 64)) ((_ to_fp 11 53) ?x45)) (_ bv4625844209755933901 64) ?x45)))
+ (let (($x55 (fp.lt ((_ to_fp 11 53) (ite (fp.lt ((_ to_fp 11 53) (_ bv4623282787467866931 64)) ((_ to_fp 11 53) ?x48)) (_ bv4623282787467866931 64) ?x48)) ((_ to_fp 11 53) (_ bv4621819117588971520 64)))))
+ (not $x55))))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1024.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1024.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7caaf0ee21ba4ec67e846ccb75d43796eb9735c4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1024.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1024.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or $x16 (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1034.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1034.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5a0dbadbc063da314f362344e0df40b2d50a1593
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1034.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1034.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1035.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1035.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a83bf7bcd62cc2c4f4168a4227ebe3f14533c622
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1035.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1035.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x16))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x21) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x20)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1057.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1057.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..74ecc2f82a4b5e04cdefac86f7b009d45822dc78
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1057.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1057.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x22 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x41 (fp.isNaN ?x29)))
+ (not $x41))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x41 (fp.isNaN ?x29)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x41) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x29)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1091.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1091.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b734191fe6cbbabce791272684f11da22ab22ad9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1091.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1091.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x42 (fp.isNaN ?x28)))
+ (not $x42))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x42 (fp.isNaN ?x28)))
+ (or $x42 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x28)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1094.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1094.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5f0568bd1a2bbecc9192049ef82196d63b4b4dcf
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1094.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1094.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x34 ?x15))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!4)))
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.lt ?x23 ?x34))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1110.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1110.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..733ca41bb90f7190eb837803589fc5f1e71c962b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1110.smt2
@@ -0,0 +1,66 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1110.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x17))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or $x28 $x21) (fp.lt ?x27 ?x20)))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x17))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x28) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x27)))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x33 ?x17))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x39 (fp.isNaN ?x13)))
+ (let (($x44 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x39) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x13))))
+ (let (($x40 (not $x39)))
+ (not (and $x40 $x44)))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x39 (fp.isNaN ?x13)))
+(not $x39))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1116.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1116.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1f09aba9de9927f1d4f9a27220e77bb20f8bf934
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1116.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1116.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1123.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1123.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8f6e67c3c5778ce135ca63bdff1c926adcedbfb1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1123.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1123.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x33 ?x14))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x38 (fp.isNaN ?x21)))
+ (not $x38))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x38 (fp.isNaN ?x21)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x38) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x21)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1124.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1124.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..14f89bbdcb0097eea603017bf800e9689b57d0bd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1124.smt2
@@ -0,0 +1,51 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1124.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1133.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1133.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7c5628b835e6412783154a47af83d9f0fbc158ec
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1133.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1133.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x23))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x27) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x26)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1137.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1137.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5dcc58745ee45b96d18ade90886c1cb6010aac27
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1137.smt2
@@ -0,0 +1,49 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1137.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let (($x28 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x28 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let (($x40 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x40 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1139.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1139.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4cfdd704179a820c0a9cb89b5126fecb0089b625
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1139.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1139.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1161.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1161.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9ea52b65bf7fa4ed67af5d855df3de4c45832966
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1161.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1161.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x36 (not $x14)))
+ (not (and $x36 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1165.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1165.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f579b874b8cdd1f3cf80dd67b08df1637da3110c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1165.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1165.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x14))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let (($x38 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x38 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x35 ?x16))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x42 (fp.isNaN ?x28)))
+ (not $x42))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x42 (fp.isNaN ?x28)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x42) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x28)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1166.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1166.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7c960a9695a7c379d700e4867829a782a14c4c80
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1166.smt2
@@ -0,0 +1,66 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1166.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 $x20) (fp.lt ?x26 ?x19)))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x14))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or $x27 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x26)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x32)))
+ (not $x41))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x32)))
+ (or $x41 (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x32)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1178.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1178.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..88f26b013fe88b92873ca49dcd87d9f6759a08d3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1178.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1178.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let (($x22 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x13))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x28 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x19))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x28)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x42 (fp.isNaN ?x35)))
+ (not $x42))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x42 (fp.isNaN ?x35)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x42) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x35)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1179.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1179.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..57a764791922e803084a3a2242c972b6e6d31f2a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1179.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1179.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1194.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1194.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..76268b5c3cd85f6db1bb5cf6764f7c569279b907
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1194.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1194.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1210.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1210.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..cf0f826e6fbe9f38bd9a84d6a340ea63b928ec72
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1210.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1210.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x33 (fp.isNaN ?x13)))
+ (let (($x38 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x33) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x13))))
+ (let (($x34 (not $x33)))
+ (not (and $x34 $x38)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x33 (fp.isNaN ?x13)))
+(not $x33))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1214.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1214.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d085c0b7cdd872ea92414688c597e37495493d87
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1214.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1214.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let (($x21 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x21 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x18 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x32 ?x13))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x38 (fp.isNaN ?x32)))
+ (not $x38))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x38 (fp.isNaN ?x32)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x38) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x32)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1227.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1227.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f05761ef55b839cf9fcf9b1d66499270aa53b200
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1227.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1227.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x13))))
+(assert
+ (let (($x31 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x31 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x13))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or $x20 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x19)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x44 (fp.isNaN ?x37)))
+ (not $x44))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x44 (fp.isNaN ?x37)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x44) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x37)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1237.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1237.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..cb735a3cd306e9c3f018a88d3b63d9d4b1ecfcf9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1237.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1237.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.lt ?x25 ?x13))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x32)))
+ (not $x41))))
+(assert
+ (let ((?x32 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x32)))
+ (or $x41 (fp.gt ((_ to_fp 11 53) x_ackermann!4) ?x32)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1244.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1244.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..80f423c972ef6bc74ba556960744e8908cc8ae37
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1244.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1244.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x34 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x42 (fp.isNaN ?x34)))
+ (not $x42))))
+(assert
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x42 (fp.isNaN ?x34)))
+ (or $x42 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x34)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1261.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1261.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..bb289641e8600832b760ce432b03f30055435cd4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1261.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1261.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1275.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1275.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4037cf8de04b05f687a3b5bf52f4e4fe45782eea
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1275.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1275.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x14))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x27) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x26)))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x33 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x39 (fp.isNaN ?x19)))
+ (not $x39))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x39 (fp.isNaN ?x19)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x39) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x19)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1300.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1300.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8e27204b57887adea92b4b840a27ae527ad227bc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1300.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1300.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x27 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1313.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1313.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..698c672660e9cf5512ce6cb2c67e4fc21548722e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1313.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1313.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1321.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1321.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2641944a3fbb987c55d7885dd078c3f77480e4a2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1321.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1321.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x24 (fp.isNaN ?x23)))
+ (or $x24 (fp.lt ?x23 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x23 ?x13))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x24 (fp.isNaN ?x23)))
+ (or $x24 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x23)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1323.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1323.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..51d90117589a09cee051c3ac6e919f1686927ccd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1323.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1323.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (or (or $x19 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x18 ?x14))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or $x28 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x27 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x19) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x18)))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x37 ?x14))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x28 (fp.isNaN ?x27)))
+(let (($x47 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x28) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x27))))
+(not (and (not $x28) $x47))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1331.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1331.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1b406aae3f2543c5a7ff92202d6115f174116ca1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1331.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1331.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x40 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x36 (not $x14)))
+ (not (and $x36 $x40)))))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x36 (not $x14)))
+(not $x36)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1335.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1335.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..01d7bf869048d7a9985a7de0abc73f93a3340622
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1335.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1335.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.lt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x25 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x25 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x22 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x16))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1393.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1393.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..536415d95604fdd5967513032e00c831e8772f40
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1393.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1393.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x33 (not $x14)))
+ (not (and $x33 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x38 ?x15))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1399.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1399.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4e91be13011f08aa4305d6cd368987c23d43672e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1399.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1399.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 $x22) (fp.lt ?x28 ?x21)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let (($x40 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x40 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x37 ?x13))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x29 (fp.isNaN ?x28)))
+(let (($x48 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x29) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x28))))
+(not (and (not $x29) $x48))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1411.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1411.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c4943bd5005abf075af7a61f9c04e76fde19fae3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1411.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1411.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x36 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1418.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1418.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9e3bb527affd3bff353462264d26faa94cb23442
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1418.smt2
@@ -0,0 +1,53 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1418.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x27 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x27 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1422.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1422.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..624e143834ff67df9e2932becbfc15b93709713a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1422.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1422.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or (or $x25 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x24 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x25 (fp.isNaN ?x24)))
+(not (not (and (not $x25) (or $x25 (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x24))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1426.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1426.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2116246635d7b560d0dcecff3ca326de9c094b86
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1426.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1426.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.lt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x23 (fp.isNaN ?x22)))
+ (or (or $x23 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x22 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x16))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x23 (fp.isNaN ?x22)))
+(not (not (and (not $x23) (or $x23 (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x22))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1443.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1443.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6da00e6e7c7f3fc74393b0c213b6c5266e5829ad
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1443.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1443.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x23))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x27) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x26)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1449.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1449.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..98753e4657e9d6e3afdbee0f2de3c36b4b4f0100
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1449.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1449.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1463.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1463.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..12b58367e2842206bf9d1c53f1c8231d6eb11922
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1463.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1463.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1472.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1472.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5ff55df97cad0b564887609aaf327f499fab6926
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1472.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1472.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x22 ?x14))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x31 ?x22))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1482.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1482.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2b38b40ba4c8f9e464831044c5348928920614bc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1482.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1482.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x13))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or $x28 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x27 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x28 (fp.isNaN ?x27)))
+(let (($x49 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x28) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x27))))
+(not (not (and (not $x28) $x49)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1487.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1487.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6868582eb86dee21bbe95d2db589c5e11d245757
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1487.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1487.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or $x14 (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x27 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x27 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x24 ?x21))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x35 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x31 (not $x14)))
+ (not (and $x31 $x35)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1496.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1496.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5ead7a7eee2f214cf05c5f476c62b1ff949054a2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1496.smt2
@@ -0,0 +1,52 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1496.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.15.smt2 b/src_colibri2/tests/solve/colibri/sat/query.15.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2d1726bf1d7efd86aec1d1a9a44712f2f7c674f5
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.15.smt2
@@ -0,0 +1,17 @@
+(set-option :print-success false)
+(set-logic QF_ABVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x4 () (_ BitVec 32))
+(declare-fun x15 () (_ BitVec 32))
+(declare-fun x8 () (Array (_ BitVec 32) (_ BitVec 8)))
+(assert (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (not (fp.lt ((_ to_fp 8 24) (_ bv1120403456 32)) x16))))))
+(assert (let ((x17 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (let ((x5 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x3 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (_ bv0 32))) x5))) (let ((x14 (fp.mul roundNearestTiesToEven x3 x3))) (not (fp.gt x17 (fp.abs (fp.sub roundNearestTiesToEven x14 x16))))))))))))
+(assert (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (not (fp.isNaN x16))))))
+(assert (let ((x17 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (let ((x5 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x3 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (_ bv0 32))) x5))) (let ((x10 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x14 (fp.mul roundNearestTiesToEven x3 x3))) (let ((x11 (fp.gt x14 x16))) (let ((x6 (ite x11 x10 x3))) (let ((x20 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x11 x15 x19)) x6))) (let ((x2 (fp.mul roundNearestTiesToEven x20 x5))) (let ((x13 (fp.mul roundNearestTiesToEven x2 x2))) (not (fp.gt x17 (fp.abs (fp.sub roundNearestTiesToEven x13 x16))))))))))))))))))
+(assert (let ((x17 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (let ((x5 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x3 (fp.mul roundNearestTiesToEven x5 (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x10 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x14 (fp.mul roundNearestTiesToEven x3 x3))) (let ((x11 (fp.lt x16 x14))) (let ((x6 (ite x11 x10 x3))) (let ((x20 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x11 x15 x19)) x6))) (let ((x2 (fp.mul roundNearestTiesToEven x20 x5))) (let ((x13 (fp.mul roundNearestTiesToEven x2 x2))) (let ((x1 (fp.lt x16 x13))) (let ((x7 ((_ to_fp 8 24) (ite x1 x4 (ite x11 x15 x19))))) (let ((x9 (fp.mul roundNearestTiesToEven x5 (fp.add roundNearestTiesToEven x7 (ite x1 x6 x2))))) (let ((x12 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven x9 x9) x16))) (not (not (fp.lt (fp.abs x12) x17)))))))))))))))))))))
+(assert (let ((x10 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (not (fp.lt x16 x10)))))))
+(assert (let ((x5 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x10 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (let ((x3 (fp.mul roundNearestTiesToEven x5 (fp.add roundNearestTiesToEven x16 x10)))) (= x3 ((_ to_fp 8 24) x15)))))))))
+(assert (let ((x5 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x10 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x18 (concat (select x8 (_ bv2 32)) (concat (select x8 (_ bv1 32)) (select x8 (_ bv0 32)))))) (let ((x19 (concat (select x8 (_ bv3 32)) x18))) (let ((x16 ((_ to_fp 8 24) x19))) (let ((x3 (fp.mul roundNearestTiesToEven x5 (fp.add roundNearestTiesToEven x16 x10)))) (let ((x14 (fp.mul roundNearestTiesToEven x3 x3))) (let ((x11 (fp.lt x16 x14))) (let ((x6 (ite x11 x10 x3))) (let ((x20 (fp.add roundNearestTiesToEven x6 ((_ to_fp 8 24) (ite x11 x15 x19))))) (let ((x2 (fp.mul roundNearestTiesToEven x5 x20))) (= x2 ((_ to_fp 8 24) x4))))))))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1504.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1504.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9e2abe05ae2cf7fbf1387cb81b7bbeff028dfa2c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1504.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1504.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x14))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1508.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1508.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3a3b3125c5c71da0a1944c64f39a4803565befd7
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1508.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1508.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1511.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1511.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..21d93fb920833291119b13c9e95ea49e772bd6f1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1511.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1511.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1520.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1520.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9793823ea6141118486a09fbfa3da30fd5f5345d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1520.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1520.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x31 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x40 (fp.isNaN ?x23)))
+ (not $x40))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x40 (fp.isNaN ?x23)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x40) (fp.gt ((_ to_fp 11 53) x_ackermann!2) ?x23)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1523.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1523.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0d1f588313b25e4c5752a811965aa8d4d4dd8dee
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1523.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1523.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1537.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1537.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5d6be67fe634d2b1c146e5c70c4bee179e6931d1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1537.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1537.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x16))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or $x21 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x20)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let (($x37 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x37 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x34 ?x14))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x41 (fp.isNaN ?x27)))
+ (not $x41))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x41 (fp.isNaN ?x27)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) $x41) (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x27)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1553.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1553.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e1afc86f130c405c9c96ab11e03c2db9a620cf65
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1553.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1553.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x30 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1560.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1560.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..316ae1476015ec64add7b14ea3998a069986bab1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1560.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1560.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or $x26 (fp.lt ?x25 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x17))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x26) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x25)))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x30 ?x17))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1570.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1570.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a9a9d4d38f758b567aa7627bc1606b5e8cf21706
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1570.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1570.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x30 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x26 (not $x14)))
+ (not (and $x26 $x30)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x26 (not $x14)))
+(not $x26)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1571.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1571.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d39fde408d48b92c7935a911f8abbe3a93e38909
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1571.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1571.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x21))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x21))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1588.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1588.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c1075b8cb7a38e8b25e09f64689c3aa7c39cad52
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1588.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1588.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x17))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1599.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1599.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9320ee9107e7d65b7e35ffad61dac3ace4412d6e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1599.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1599.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or (or $x25 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x24 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x24 ?x21))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x25) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x24)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1619.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1619.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ba85f099f0c074e994504f5272f870e921c4b77d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1619.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1619.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or $x16 (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1633.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1633.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6722a8d4b47082878aaebacb04efe2629d9bb8d2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1633.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1633.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.lt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x25 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x25 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x22 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1640.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1640.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..bb32a0a85558ccaf6489471e288cb90fadf00294
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1640.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1640.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x21))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x18))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1656.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1656.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b3b77b922655ebe2dab47ea9fb1b9ceab0746247
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1656.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1656.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x17))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or $x28 $x21) (fp.lt ?x27 ?x20)))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x17))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x28 (fp.isNaN ?x27)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) $x28) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x27)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1667.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1667.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7a69d3bf71b4776ad349fa96d0248757b70a1a62
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1667.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1667.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x26 (fp.isNaN ?x23)))
+ (or $x26 (fp.lt ?x23 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1668.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1668.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..91884137ec075b4a2cadbd622391c1ba8873044b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1668.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1668.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x13))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x36 (fp.isNaN ?x35)))
+ (or (or $x36 (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))) (fp.lt ?x35 ((_ to_fp 11 53) x_ackermann!3))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x36 (fp.isNaN ?x35)))
+(let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not (and (not $x36) (or (or $x14 $x36) (fp.gt ?x13 ?x35)))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1669.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1669.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a63bca6800da665840f8b97007d3eae29698d64c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1669.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1669.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.lt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x25 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x25 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x22 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1671.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1671.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1aa3992355c7cc22a086cd51e25f8792220acbc6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1671.smt2
@@ -0,0 +1,50 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1671.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1693.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1693.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9b1c494aea6344c91d060a4429691540e008aaf4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1693.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1693.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x31 (fp.isNaN ?x30)))
+ (or (or $x31 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x30 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x30 ?x13))))
+(assert
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x31 (fp.isNaN ?x30)))
+ (or $x31 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x30)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x20)))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1729.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1729.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e6e4ceb390561384cf991445ba012be841fb6d62
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1729.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1729.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x13))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x36 (fp.isNaN ?x35)))
+ (or (or $x36 (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))) (fp.lt ?x35 ((_ to_fp 11 53) x_ackermann!3))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x36 (fp.isNaN ?x35)))
+(let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not (and (not $x36) (or (or $x14 $x36) (fp.gt ?x13 ?x35)))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1741.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1741.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..233110bf12655411808b522aaaef1d1c0c12a71b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1741.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1741.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x33 (not $x14)))
+ (not (and $x33 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1749.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1749.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..77331647d03d53f2f683e27b47d519dc3b4d46ae
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1749.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1749.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x35 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x31 (not $x14)))
+ (not (and $x31 $x35)))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x38 ?x15))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x31 (not $x14)))
+(not $x31)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1758.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1758.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e94938d29cddddc53a4e3ebf15cdb04cfad8024e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1758.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1758.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x16) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ?x15)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x41 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x41 ?x20))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1771.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1771.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e8420c0fb7fa876f00e69afc62c9c605e6018755
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1771.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1771.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x20))))
+(assert
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x27))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x26 (fp.isNaN ?x23)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x23 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1773.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1773.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c4e3c45292d50f6accf1344fffb0c860ad7fabb5
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1773.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1773.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.lt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x25 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x25 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x22 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x22 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x19))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x19))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1781.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1781.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ea574f69c86c9b4e354b9dbfd393da597299b0f7
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1781.smt2
@@ -0,0 +1,59 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1781.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x29 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x26 ?x13))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x36 (fp.isNaN ?x35)))
+ (or (or $x36 (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))) (fp.lt ?x35 ((_ to_fp 11 53) x_ackermann!3))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x36 (fp.isNaN ?x35)))
+(let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not (and (not $x36) (or (or $x14 $x36) (fp.gt ?x13 ?x35)))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1784.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1784.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d36d8b0264dcea8b347f2b802d28a8040283b29f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1784.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1784.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let (($x32 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x32 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x29 ?x19))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x46 (fp.isNaN ?x39)))
+ (not $x46))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x46 (fp.isNaN ?x39)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 $x46) (fp.gt ?x19 ?x39)))))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1792.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1792.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1dd8ba7e990df6e0ab128ea7566d3007eda16d7d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1792.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1792.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x25 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x13))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or $x26 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x25)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1815.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1815.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..67e9ec4a0d75198d55f08532e8be5de93be1b34f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1815.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1815.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x30 (fp.isNaN ?x29)))
+ (or $x30 (fp.lt ?x29 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x30 (fp.isNaN ?x29)))
+(not (and (not $x30) (or $x30 (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x29)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1819.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1819.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..43964c9718ea7f6d49fccfe0e72b331ac63f7865
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1819.smt2
@@ -0,0 +1,67 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1819.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x33 ?x20))))
+(assert
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x35 ?x33))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1820.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1820.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9e72df105c6839af4353faf814a4cffc4ea3dbca
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1820.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1820.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x17))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x21) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x20)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x13))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x36 (fp.isNaN ?x35)))
+ (or (or $x36 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x35 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x14 ?x17))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+(let (($x36 (fp.isNaN ?x35)))
+(let (($x50 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x36) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x35))))
+(not (not (and (not $x36) $x50)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1831.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1831.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9f89a9e0765102aef5624905f39f7721d3d14067
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1831.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1831.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x27 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)))))
+ (or $x27 (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x18))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x37 ?x13))))
+(assert
+ (let (($x41 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x41 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1834.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1834.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5540b9317b305da3505a132c4fec6b88a6ae4061
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1834.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1834.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x14))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 $x22) (fp.lt ?x28 ?x21)))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x14))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x28)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1838.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1838.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..64f364dbda5cdea6df1f34dd4731cc6c86ff7bb2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1838.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1838.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x26 (fp.isNaN ?x23)))
+ (or $x26 (fp.lt ?x23 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1858.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1858.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d9118eff93873012c508089d266db063fa456a61
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1858.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1858.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x35 ?x13))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x43 (fp.isNaN ?x35)))
+ (not $x43))))
+(assert
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x43 (fp.isNaN ?x35)))
+ (or $x43 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x35)))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1859.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1859.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ea4679c6beb6307eed5d75d1cb8f9bc612fc6e2c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1859.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1859.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x35 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x31 (not $x14)))
+ (not (and $x31 $x35)))))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x38 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1873.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1873.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..279478e6eaec173baaed8523ff45136316771e3c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1873.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1873.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let (($x24 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x24 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x13))))
+(assert
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x31 (fp.isNaN ?x30)))
+ (or (or $x31 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x30 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x30 ?x21))))
+(assert
+ (let ((?x30 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x31 (fp.isNaN ?x30)))
+ (or $x31 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x30)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x44 (fp.isNaN ?x37)))
+ (not $x44))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x44 (fp.isNaN ?x37)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x44) (fp.gt ((_ to_fp 11 53) x_ackermann!0) ?x37)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1876.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1876.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..3a41d97c411028d2cb2c592cf07e5ebc41fad26f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1876.smt2
@@ -0,0 +1,54 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1876.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x21))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1878.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1878.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..73d1519fe1aa351a367137be2f38b833e8274f47
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1878.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1878.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.isNaN ?x26)))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1883.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1883.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1b9cf69907c392c839ccfb4c2060f1cef5e1e764
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1883.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1883.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x27 (fp.isNaN ?x26)))
+ (or (or $x27 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x26 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let (($x39 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)))))
+ (or $x39 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3)))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x36 ?x13))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x26 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x27 (fp.isNaN ?x26)))
+(let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not (and (not $x27) (or (or $x14 $x27) (fp.gt ?x13 ?x26)))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1906.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1906.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..49e81c287a00d70c08365e986c9898be01e92d26
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1906.smt2
@@ -0,0 +1,68 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1906.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x20 ?x14))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or $x21 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x20)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x46 (fp.isNaN ?x37)))
+ (not $x46))))
+(assert
+ (let ((?x37 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x46 (fp.isNaN ?x37)))
+ (or $x46 (fp.gt ((_ to_fp 11 53) x_ackermann!4) ?x37)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1909.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1909.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..96f31d96d61aa4d02fa6b14205cdbcf22f593d73
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1909.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1909.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x26) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x18)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1910.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1910.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7b2dca77269b07ddcded547dfc2147310d42988e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1910.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1910.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x25 (fp.isNaN ?x24)))
+ (or (or $x25 $x26) (fp.lt ?x24 ?x18)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x21))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (let ((?x24 ((_ to_fp 11 53) x_ackermann!4)))
+(let (($x25 (fp.isNaN ?x24)))
+(not (and (not $x25) (or $x25 (fp.gt ((_ to_fp 11 53) x_ackermann!1) ?x24)))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1916.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1916.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e7fafdd525ff9c6cb22cd70be680498c2fb48f58
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1916.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1916.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) $x16) (fp.lt ((_ to_fp 11 53) x_ackermann!0) ?x15)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x39 ?x23))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1919.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1919.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9240bd514fc33a9bdb6978badd2f10aeea9644d6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1919.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1919.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x20 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let (($x41 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x41 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x38 ?x20))))
+(assert
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x45 (fp.isNaN ?x31)))
+ (not $x45))))
+(assert
+ (let ((?x31 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x45 (fp.isNaN ?x31)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x21 (fp.isNaN ?x20)))
+ (or (or $x21 $x45) (fp.gt ?x20 ?x31)))))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1926.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1926.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..275af1527960e38613f8f4e25e2eacf986183da6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1926.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1926.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.lt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) $x26) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ?x18)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (let (($x26 (fp.isNaN ?x18)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x18 ?x21))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1933.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1933.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..85692e3171165d17a61e3e1f5597e2cd9906f4bd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1933.smt2
@@ -0,0 +1,67 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1933.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x30 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x26 (not $x14)))
+ (not (and $x26 $x30)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x40 (fp.isNaN ?x39)))
+ (or (or $x40 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x39 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x39 ?x15))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x40 (fp.isNaN ?x39)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x40) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ?x39)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x26 (not $x14)))
+(not $x26)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1937.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1937.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..393641e926ca7307fa75d783a94a71d2ad667904
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1937.smt2
@@ -0,0 +1,66 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1937.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or (or $x22 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x21 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x22 (fp.isNaN ?x21)))
+ (or $x22 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x21)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x47 (fp.isNaN ?x38)))
+ (not $x47))))
+(assert
+ (let ((?x38 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x47 (fp.isNaN ?x38)))
+ (or $x47 (fp.gt ((_ to_fp 11 53) x_ackermann!4) ?x38)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1963.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1963.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8780bd0dee69dba3584df35e99b55ac15a637c10
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1963.smt2
@@ -0,0 +1,61 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1963.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x13))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x19 (fp.isNaN ?x18)))
+ (or (or $x19 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x18 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 (fp.isNaN ((_ to_fp 11 53) x_ackermann!0))) (fp.lt ?x28 ((_ to_fp 11 53) x_ackermann!0))))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x14))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x28)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x18 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x18)))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1972.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1972.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..772d0e64e26f7f3fe51e071725b5fba5dc2992f4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1972.smt2
@@ -0,0 +1,55 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1972.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or $x14 (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x21)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x21 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x24 (fp.isNaN ?x21)))
+ (or (or $x24 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x21 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1975.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1975.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..34f9bf68bcfd966a42cf76bbd5dea0fefb3ea588
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1975.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1975.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.lt ?x25 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1993.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1993.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8f118e2c1f330cd9da4702b2bcbd94aa395093f8
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1993.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1993.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x35 (fp.isNaN ?x34)))
+ (or (or $x35 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x34 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x34 ?x20))))
+(assert
+ (let ((?x34 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x35 (fp.isNaN ?x34)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 $x35) (fp.lt ?x15 ?x34)))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.1995.smt2 b/src_colibri2/tests/solve/colibri/sat/query.1995.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2da9cf8a5f2fb10daf0dc921065a618ce776eed1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.1995.smt2
@@ -0,0 +1,67 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.1995.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.isNaN ?x23)))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x27 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x27 ?x20))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x29 ?x20))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x26 (fp.isNaN ?x23)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))) (fp.lt ?x23 ((_ to_fp 11 53) x_ackermann!5))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.20.smt2 b/src_colibri2/tests/solve/colibri/sat/query.20.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..53830b8aa99928dad8a43e6f95e52fc9d851117d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.20.smt2
@@ -0,0 +1,20 @@
+(set-option :print-success false)
+(set-logic QF_BVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x16 () (_ BitVec 32))
+(declare-fun x11 () (_ BitVec 32))
+(declare-fun x23 () (_ BitVec 32))
+(declare-fun x24 () (_ BitVec 32))
+(assert (not (fp.isNaN ((_ to_fp 8 24) x16))))
+(assert (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x16)) x20))) (let ((x14 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x4 (fp.gt x12 x25))) (let ((x10 (ite x4 x14 x8))) (let ((x22 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x4 x24 x16)) x10))) (let ((x2 (fp.mul roundNearestTiesToEven x22 x20))) (let ((x17 (fp.mul roundNearestTiesToEven x2 x2))) (let ((x15 (fp.gt x17 x25))) (let ((x21 (ite x15 x10 x2))) (let ((x3 (ite x4 x24 x16))) (let ((x6 (ite x15 x23 x3))) (let ((x5 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven x21 ((_ to_fp 8 24) x6))))) (= x5 ((_ to_fp 8 24) x11))))))))))))))))))
+(assert (let ((x7 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x25 ((_ to_fp 8 24) (_ bv0 32))) x20))) (let ((x14 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x4 (fp.lt x25 x12))) (let ((x10 (ite x4 x14 x8))) (let ((x22 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x4 x24 x16)) x10))) (let ((x2 (fp.mul roundNearestTiesToEven x20 x22))) (let ((x17 (fp.mul roundNearestTiesToEven x2 x2))) (not (fp.gt x7 (fp.abs (fp.sub roundNearestTiesToEven x17 x25))))))))))))))))
+(assert (not (fp.gt ((_ to_fp 8 24) x16) ((_ to_fp 8 24) (_ bv1120403456 32)))))
+(assert (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x16) ((_ to_fp 8 24) (_ bv0 32)))))) (= x8 ((_ to_fp 8 24) x24)))))
+(assert (not (fp.gt ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x16))))
+(assert (let ((x7 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven x25 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x14 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x4 (fp.lt x25 x12))) (let ((x10 (ite x4 x14 x8))) (let ((x22 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x4 x24 x16)) x10))) (let ((x2 (fp.mul roundNearestTiesToEven x22 x20))) (let ((x17 (fp.mul roundNearestTiesToEven x2 x2))) (let ((x15 (fp.gt x17 x25))) (let ((x21 (ite x15 x10 x2))) (let ((x3 (ite x4 x24 x16))) (let ((x6 (ite x15 x23 x3))) (let ((x5 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x6) x21) x20))) (let ((x1 (fp.mul roundNearestTiesToEven x5 x5))) (not (fp.gt x7 (fp.abs (fp.sub roundNearestTiesToEven x1 x25))))))))))))))))))))))
+(assert (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x16))))) (let ((x14 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x4 (fp.gt x12 x25))) (let ((x10 (ite x4 x14 x8))) (let ((x22 (fp.add roundNearestTiesToEven x10 ((_ to_fp 8 24) (ite x4 x24 x16))))) (let ((x2 (fp.mul roundNearestTiesToEven x22 x20))) (= ((_ to_fp 8 24) x23) x2)))))))))))
+(assert (let ((x7 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x25)))) (let ((x14 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x4 (fp.gt x12 x25))) (let ((x10 (ite x4 x14 x8))) (let ((x22 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x4 x24 x16)) x10))) (let ((x2 (fp.mul roundNearestTiesToEven x20 x22))) (let ((x17 (fp.mul roundNearestTiesToEven x2 x2))) (let ((x15 (fp.lt x25 x17))) (let ((x21 (ite x15 x10 x2))) (let ((x3 (ite x4 x24 x16))) (let ((x6 (ite x15 x23 x3))) (let ((x5 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x6) x21) x20))) (let ((x1 (fp.mul roundNearestTiesToEven x5 x5))) (let ((x19 (fp.lt x25 x1))) (let ((x13 (fp.add roundNearestTiesToEven (ite x19 x21 x5) ((_ to_fp 8 24) (ite x19 x11 x6))))) (let ((x9 (fp.mul roundNearestTiesToEven x20 x13))) (let ((x18 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven x9 x9) x25))) (not (not (fp.gt x7 (fp.abs x18))))))))))))))))))))))))))
+(assert (let ((x7 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x25 ((_ to_fp 8 24) x16))) (let ((x20 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x8 (fp.mul roundNearestTiesToEven x20 (fp.add roundNearestTiesToEven x25 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x12 (fp.mul roundNearestTiesToEven x8 x8))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x12 x25)) x7))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2005.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2005.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b583c7e0931f3945f867302f5eadbad6e92e32c4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2005.smt2
@@ -0,0 +1,70 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2005.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x30 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x26 (not $x14)))
+ (not (and $x26 $x30)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x23))))
+(assert
+ (let (($x48 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x48 (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x33 ?x36))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x26 (not $x14)))
+(not $x26)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2036.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2036.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ab60144373420d5926ff1a24c1caf50991f13c8f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2036.smt2
@@ -0,0 +1,62 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2036.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x33 ?x15))))
+(assert
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x35 ?x33))))
+(assert
+ (let (($x39 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)))))
+ (or $x39 (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2037.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2037.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e969a05b5cc95500c415e971da223caeb5a0bde0
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2037.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2037.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x14))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x16 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x16 ?x14))))
+(assert
+ (let (($x23 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)))))
+ (or $x23 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x48 (fp.isNaN ?x39)))
+ (not $x48))))
+(assert
+ (let ((?x39 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x48 (fp.isNaN ?x39)))
+ (or $x48 (fp.gt ((_ to_fp 11 53) x_ackermann!4) ?x39)))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2097.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2097.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a2bb8500ee945a47b6370a50cf53fa95d8120ab2
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2097.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2097.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x30 (fp.isNaN ?x29)))
+ (or (or $x30 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x29 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x29 ?x13))))
+(assert
+ (let ((?x29 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x30 (fp.isNaN ?x29)))
+ (or $x30 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x29)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2099.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2099.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..26c97fd08a4704d3312d6075e2b16a493c501a70
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2099.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2099.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (fp.gt ?x13 ?x23))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or (or $x26 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x25 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x25 ?x13))))
+(assert
+ (let ((?x25 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x26 (fp.isNaN ?x25)))
+ (or $x26 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x25)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2110.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2110.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2fe823bdc3e06072116d29e562f5f0076138dccc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2110.smt2
@@ -0,0 +1,57 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2110.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let (($x17 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!0)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)))))
+ (or $x17 (fp.lt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) (fp.lt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2116.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2116.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b9f973eaa0c85faa0b8e4c41b0f152a4b7b7c0fd
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2116.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2116.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 $x16) (fp.lt ?x13 ?x15)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x36 ?x33))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let (($x16 (fp.isNaN ?x15)))
+ (or (or $x16 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x15 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (fp.gt ?x15 ?x20))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x28 (not $x14)))
+(not $x28)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2117.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2117.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..dbdba9a02bf33bf5b1dd8f6b2d7193604675dda1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2117.smt2
@@ -0,0 +1,56 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2117.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.lt ?x33 ?x17))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2119.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2119.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4267fca0c501336d08e0be200f313ea3241bb41d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2119.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2119.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x40)))
+ (or (or $x41 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x40 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x40 ?x15))))
+(assert
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x40)))
+ (or $x41 (fp.lt ((_ to_fp 11 53) x_ackermann!3) ?x40)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2133.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2133.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..60f79990817ea0ee0ec7ae9f69d0b7289b06a5b4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2133.smt2
@@ -0,0 +1,65 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2133.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x30 (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!3)) $x14) (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))
+ (let (($x26 (not $x14)))
+ (not (and $x26 $x30)))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x40)))
+ (or (or $x41 (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))) (fp.lt ?x40 ((_ to_fp 11 53) x_ackermann!4))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x40 ?x15))))
+(assert
+ (let ((?x40 ((_ to_fp 11 53) x_ackermann!5)))
+ (let (($x41 (fp.isNaN ?x40)))
+ (or (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) $x41) (fp.lt ((_ to_fp 11 53) x_ackermann!2) ?x40)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x23 ((_ to_fp 11 53) x_ackermann!3)))
+ (let ((?x20 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x20 ?x23))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x26 (not $x14)))
+(not $x26)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2150.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2150.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..dcdc2b681d287df25e015a8066c0eabe49b5f760
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2150.smt2
@@ -0,0 +1,64 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2150.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x33 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x33 ?x15))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x35 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x35 ?x15))))
+(assert
+ (let (($x41 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)))))
+ (or $x41 (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(not $x14))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2155.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2155.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2863200dc9e578abd920b7d2dcbaf3ef1f835509
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2155.smt2
@@ -0,0 +1,60 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2155.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x14 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x17 ((_ to_fp 11 53) x_ackermann!2)))
+ (fp.gt ?x17 ?x14))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or (or $x20 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x19 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (fp.gt ?x19 ?x13))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x19 ((_ to_fp 11 53) x_ackermann!3)))
+ (let (($x20 (fp.isNaN ?x19)))
+ (or $x20 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x19)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!4) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2157.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2157.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..450399e4b0f6f577071ac38c76e6a6d04335d212
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2157.smt2
@@ -0,0 +1,63 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2157.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (or (or $x14 (fp.isNaN ((_ to_fp 11 53) x_ackermann!1))) (fp.lt ?x13 ((_ to_fp 11 53) x_ackermann!1))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let (($x14 (fp.isNaN ?x13)))
+ (let (($x28 (not $x14)))
+ (not (and $x28 (or $x14 (fp.gt ((_ to_fp 11 53) x_ackermann!3) ?x13))))))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!1) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!4))))
+(assert
+ (let ((?x15 ((_ to_fp 11 53) x_ackermann!1)))
+ (let ((?x36 ((_ to_fp 11 53) x_ackermann!5)))
+ (fp.gt ?x36 ?x15))))
+(assert
+ (let (($x42 (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!2)) (fp.isNaN ((_ to_fp 11 53) x_ackermann!4)))))
+ (or $x42 (fp.lt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!4)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!5)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+(let (($x14 (fp.isNaN ?x13)))
+(let (($x28 (not $x14)))
+(not $x28)))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.2198.smt2 b/src_colibri2/tests/solve/colibri/sat/query.2198.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..44b4591bf566fba6215629439abe87c8830c7b75
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.2198.smt2
@@ -0,0 +1,58 @@
+(set-info :smt-lib-version 2.6)
+(set-logic QF_BVFP)
+(set-info :source |
+Generated by: Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl
+Generated on: 2017-4-28
+Generator: KLEE
+Application: Branch satisfiability check for symbolic execution of C programs
+Target solver: Z3 or MathSAT5
+Corresponding query: An equisatisfiable query (bitvectors replaced with reads from arrays of bitvectors) is available at QF_FPABV/liew/imperial_gsl_benchmarks_sort_smallest_klee_bug.x86_64/query.2198.smt2
+|)
+(set-info :license "https://creativecommons.org/licenses/by/4.0/")
+(set-info :category "industrial")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(declare-fun x_ackermann!1 () (_ BitVec 64))
+(declare-fun x_ackermann!0 () (_ BitVec 64))
+(declare-fun x_ackermann!2 () (_ BitVec 64))
+(declare-fun x_ackermann!3 () (_ BitVec 64))
+(declare-fun x_ackermann!4 () (_ BitVec 64))
+(declare-fun x_ackermann!5 () (_ BitVec 64))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!0) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (or (fp.isNaN ((_ to_fp 11 53) x_ackermann!1)) (fp.lt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!2))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or (or $x29 (fp.isNaN ((_ to_fp 11 53) x_ackermann!2))) (fp.lt ?x28 ((_ to_fp 11 53) x_ackermann!2))))))
+(assert
+ (let ((?x13 ((_ to_fp 11 53) x_ackermann!0)))
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (fp.gt ?x28 ?x13))))
+(assert
+ (let ((?x28 ((_ to_fp 11 53) x_ackermann!4)))
+ (let (($x29 (fp.isNaN ?x28)))
+ (or $x29 (fp.lt ((_ to_fp 11 53) x_ackermann!5) ?x28)))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!0))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!5) ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!3))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!3) ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.isNaN ((_ to_fp 11 53) x_ackermann!5))))
+(assert
+ (not (fp.gt ((_ to_fp 11 53) x_ackermann!2) ((_ to_fp 11 53) x_ackermann!1))))
+(assert
+ (not false))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.25.smt2 b/src_colibri2/tests/solve/colibri/sat/query.25.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..2ffd7a24f6c45d3e2f92c9da116f00831158039c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.25.smt2
@@ -0,0 +1,23 @@
+(set-option :print-success false)
+(set-logic QF_BVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x30 () (_ BitVec 32))
+(declare-fun x1 () (_ BitVec 32))
+(declare-fun x22 () (_ BitVec 32))
+(declare-fun x20 () (_ BitVec 32))
+(declare-fun x26 () (_ BitVec 32))
+(assert (not (fp.gt ((_ to_fp 8 24) x22) ((_ to_fp 8 24) (_ bv1120403456 32)))))
+(assert (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x22)) x13))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.lt x5 x10))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x14 x13))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (let ((x23 (fp.lt x5 x16))) (let ((x4 (ite x23 x2 x24))) (let ((x31 (ite x17 x26 x22))) (let ((x25 (ite x23 x30 x31))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x25)) x13))) (= ((_ to_fp 8 24) x1) x8)))))))))))))))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv0 32))) x13))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.lt x5 x10))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x13 x14))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (not (fp.gt x12 (fp.abs (fp.sub roundNearestTiesToEven x16 x5))))))))))))))))
+(assert (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x22))))) (= ((_ to_fp 8 24) x26) x27))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.lt x5 x10))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x14 x13))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (let ((x23 (fp.gt x16 x5))) (let ((x4 (ite x23 x2 x24))) (let ((x31 (ite x17 x26 x22))) (let ((x25 (ite x23 x30 x31))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x4) x13))) (let ((x15 (fp.mul roundNearestTiesToEven x8 x8))) (not (fp.gt x12 (fp.abs (fp.sub roundNearestTiesToEven x15 x5))))))))))))))))))))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.gt x10 x5))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x14 x13))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (let ((x23 (fp.lt x5 x16))) (let ((x4 (ite x23 x2 x24))) (let ((x31 (ite x17 x26 x22))) (let ((x25 (ite x23 x30 x31))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x4) x13))) (let ((x15 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x3 (fp.lt x5 x15))) (let ((x21 (ite x3 x4 x8))) (let ((x19 (fp.add roundNearestTiesToEven x21 ((_ to_fp 8 24) (ite x3 x1 x25))))) (let ((x18 (fp.mul roundNearestTiesToEven x13 x19))) (let ((x7 (fp.mul roundNearestTiesToEven x18 x18))) (let ((x6 (fp.gt x7 x5))) (let ((x29 ((_ to_fp 8 24) (ite x6 x20 (ite x3 x1 x25))))) (let ((x11 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven x29 (ite x6 x21 x18))))) (let ((x28 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven x11 x11) x5))) (not (not (fp.gt x12 (fp.abs x28)))))))))))))))))))))))))))))))
+(assert (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x22) ((_ to_fp 8 24) (_ bv0 32))) x13))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.lt x5 x10))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x13 x14))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (let ((x23 (fp.lt x5 x16))) (let ((x4 (ite x23 x2 x24))) (let ((x31 (ite x17 x26 x22))) (let ((x25 (ite x23 x30 x31))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x25)) x13))) (let ((x15 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x3 (fp.lt x5 x15))) (let ((x21 (ite x3 x4 x8))) (let ((x19 (fp.add roundNearestTiesToEven x21 ((_ to_fp 8 24) (ite x3 x1 x25))))) (let ((x18 (fp.mul roundNearestTiesToEven x19 x13))) (= x18 ((_ to_fp 8 24) x20)))))))))))))))))))))))
+(assert (not (fp.gt ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x22))))
+(assert (not (fp.isNaN ((_ to_fp 8 24) x22))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven x5 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x10 x5)) x12))))))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x5) x13))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.lt x5 x10))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x17 x26 x22)) x2))) (let ((x24 (fp.mul roundNearestTiesToEven x14 x13))) (let ((x16 (fp.mul roundNearestTiesToEven x24 x24))) (let ((x23 (fp.gt x16 x5))) (let ((x4 (ite x23 x2 x24))) (let ((x31 (ite x17 x26 x22))) (let ((x25 (ite x23 x30 x31))) (let ((x8 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x4) x13))) (let ((x15 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x3 (fp.gt x15 x5))) (let ((x21 (ite x3 x4 x8))) (let ((x19 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x3 x1 x25)) x21))) (let ((x18 (fp.mul roundNearestTiesToEven x13 x19))) (let ((x7 (fp.mul roundNearestTiesToEven x18 x18))) (not (fp.gt x12 (fp.abs (fp.sub roundNearestTiesToEven x7 x5)))))))))))))))))))))))))))
+(assert (let ((x13 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x27 (fp.mul roundNearestTiesToEven x13 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x22))))) (let ((x9 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x5 ((_ to_fp 8 24) x22))) (let ((x10 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x17 (fp.gt x10 x5))) (let ((x2 (ite x17 x9 x27))) (let ((x14 (fp.add roundNearestTiesToEven x2 ((_ to_fp 8 24) (ite x17 x26 x22))))) (let ((x24 (fp.mul roundNearestTiesToEven x14 x13))) (= ((_ to_fp 8 24) x30) x24)))))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.30.smt2 b/src_colibri2/tests/solve/colibri/sat/query.30.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..48b43789b5543ff0a241c6fd27ab752328d475ff
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.30.smt2
@@ -0,0 +1,26 @@
+(set-option :print-success false)
+(set-logic QF_ABVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x27 () (_ BitVec 32))
+(declare-fun x37 () (_ BitVec 32))
+(declare-fun x23 () (_ BitVec 32))
+(declare-fun x39 () (_ BitVec 32))
+(declare-fun x13 () (_ BitVec 32))
+(declare-fun x9 () (Array (_ BitVec 32) (_ BitVec 8)))
+(assert (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x12 x26) x11))) (= ((_ to_fp 8 24) x27) x17))))))))
+(assert (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x12 x26) x11))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.lt x26 x29))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x33 x11))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.lt x26 x21))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven x1 ((_ to_fp 8 24) x20))))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (let ((x7 (fp.lt x26 x32))) (let ((x16 (ite x7 x1 x34))) (let ((x24 (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (ite x7 x23 x20))))) (let ((x5 (fp.mul roundNearestTiesToEven x11 x24))) (= ((_ to_fp 8 24) x37) x5))))))))))))))))))))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x26)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.lt x26 x29))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x33 x11))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.gt x21 x26))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven x1 ((_ to_fp 8 24) x20))))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (let ((x7 (fp.gt x32 x26))) (let ((x16 (ite x7 x1 x34))) (let ((x24 (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (ite x7 x23 x20))))) (let ((x5 (fp.mul roundNearestTiesToEven x24 x11))) (let ((x25 (fp.mul roundNearestTiesToEven x5 x5))) (let ((x14 (fp.gt x25 x26))) (let ((x40 (ite x14 x16 x5))) (let ((x2 (ite x7 x23 x20))) (let ((x3 (ite x14 x37 x2))) (let ((x22 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x40 ((_ to_fp 8 24) x3)) x11))) (let ((x28 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x35 (fp.lt x26 x28))) (let ((x31 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x35 x13 x3)) (ite x35 x40 x22)))) (let ((x4 (fp.mul roundNearestTiesToEven x31 x11))) (let ((x18 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven x4 x4) x26))) (not (not (fp.lt (fp.abs x18) x38))))))))))))))))))))))))))))))))))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x26) x11))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.lt x26 x29))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x33 x11))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.gt x21 x26))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x20) x1) x11))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (let ((x7 (fp.lt x26 x32))) (let ((x16 (ite x7 x1 x34))) (let ((x24 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x7 x23 x20)) x16))) (let ((x5 (fp.mul roundNearestTiesToEven x11 x24))) (let ((x25 (fp.mul roundNearestTiesToEven x5 x5))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x25 x26)) x38)))))))))))))))))))))))))))
+(assert (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x17 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven x26 x12)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.gt x29 x26))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x11 x33))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.gt x21 x26))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven x1 ((_ to_fp 8 24) x20))))) (= ((_ to_fp 8 24) x23) x34)))))))))))))))))))
+(assert (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (not (fp.lt ((_ to_fp 8 24) (_ bv1120403456 32)) x26))))))
+(assert (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x12 x26) x11))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.lt x26 x29))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x33 x11))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.lt x26 x21))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x20) x1)))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (let ((x7 (fp.lt x26 x32))) (let ((x16 (ite x7 x1 x34))) (let ((x24 (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (ite x7 x23 x20))))) (let ((x5 (fp.mul roundNearestTiesToEven x11 x24))) (let ((x25 (fp.mul roundNearestTiesToEven x5 x5))) (let ((x14 (fp.gt x25 x26))) (let ((x40 (ite x14 x16 x5))) (let ((x2 (ite x7 x23 x20))) (let ((x3 (ite x14 x37 x2))) (let ((x22 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x40 ((_ to_fp 8 24) x3)) x11))) (= x22 ((_ to_fp 8 24) x13)))))))))))))))))))))))))))))))
+(assert (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (not (fp.isNaN x26))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x26)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.lt x26 x29))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x11 x33))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.gt x21 x26))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x20) x1) x11))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (let ((x7 (fp.gt x32 x26))) (let ((x16 (ite x7 x1 x34))) (let ((x24 (fp.add roundNearestTiesToEven x16 ((_ to_fp 8 24) (ite x7 x23 x20))))) (let ((x5 (fp.mul roundNearestTiesToEven x24 x11))) (let ((x25 (fp.mul roundNearestTiesToEven x5 x5))) (let ((x14 (fp.gt x25 x26))) (let ((x40 (ite x14 x16 x5))) (let ((x2 (ite x7 x23 x20))) (let ((x3 (ite x14 x37 x2))) (let ((x22 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x3) x40) x11))) (let ((x28 (fp.mul roundNearestTiesToEven x22 x22))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x28 x26)) x38)))))))))))))))))))))))))))))))))
+(assert (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (not (fp.lt x26 x12)))))))
+(assert (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x17 (fp.mul roundNearestTiesToEven x11 (fp.add roundNearestTiesToEven x26 x12)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.gt x29 x26))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x11 x33))) (= ((_ to_fp 8 24) x39) x8)))))))))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x26) x11))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.gt x29 x26))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x11 x33))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (let ((x36 (fp.lt x26 x21))) (let ((x1 (ite x36 x6 x8))) (let ((x15 (ite x30 x27 x19))) (let ((x20 (ite x36 x39 x15))) (let ((x34 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x20) x1) x11))) (let ((x32 (fp.mul roundNearestTiesToEven x34 x34))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x32 x26)) x38))))))))))))))))))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x26 ((_ to_fp 8 24) (_ bv0 32))) x11))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (not (fp.gt x38 (fp.abs (fp.sub roundNearestTiesToEven x29 x26))))))))))))
+(assert (let ((x38 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x10 (concat (select x9 (_ bv2 32)) (concat (select x9 (_ bv1 32)) (select x9 (_ bv0 32)))))) (let ((x19 (concat (select x9 (_ bv3 32)) x10))) (let ((x26 ((_ to_fp 8 24) x19))) (let ((x11 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x17 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x26 ((_ to_fp 8 24) (_ bv0 32))) x11))) (let ((x12 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x29 (fp.mul roundNearestTiesToEven x17 x17))) (let ((x30 (fp.gt x29 x26))) (let ((x6 (ite x30 x12 x17))) (let ((x33 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x30 x27 x19)) x6))) (let ((x8 (fp.mul roundNearestTiesToEven x33 x11))) (let ((x21 (fp.mul roundNearestTiesToEven x8 x8))) (not (fp.gt x38 (fp.abs (fp.sub roundNearestTiesToEven x21 x26))))))))))))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/query.35.smt2 b/src_colibri2/tests/solve/colibri/sat/query.35.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..858a7819935ff7b2f77275e8c8ff9237d78ae703
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/query.35.smt2
@@ -0,0 +1,29 @@
+(set-option :print-success false)
+(set-logic QF_BVFP)
+(set-info :status-colibri2 steplimitreached)
+
+(declare-fun x26 () (_ BitVec 32))
+(declare-fun x3 () (_ BitVec 32))
+(declare-fun x23 () (_ BitVec 32))
+(declare-fun x33 () (_ BitVec 32))
+(declare-fun x32 () (_ BitVec 32))
+(declare-fun x13 () (_ BitVec 32))
+(declare-fun x30 () (_ BitVec 32))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x13)) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.lt x8 x16))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x18) x4) x2))) (= ((_ to_fp 8 24) x3) x27)))))))))))))))))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x13) ((_ to_fp 8 24) (_ bv0 32))) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.lt x8 x16))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x18))))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.gt x7 x8))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x36 x3 x18)) x12))) (let ((x22 (fp.mul roundNearestTiesToEven x2 x14))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x43 (fp.gt x10 x8))) (let ((x11 (ite x43 x12 x22))) (let ((x6 (ite x36 x3 x18))) (let ((x25 (ite x43 x30 x6))) (let ((x38 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x11) x2))) (let ((x41 (fp.mul roundNearestTiesToEven x38 x38))) (let ((x24 (fp.lt x8 x41))) (let ((x19 (ite x24 x11 x38))) (let ((x44 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x24 x23 x25)) x19))) (let ((x1 (fp.mul roundNearestTiesToEven x44 x2))) (= ((_ to_fp 8 24) x26) x1)))))))))))))))))))))))))))))))))
+(assert (not (fp.gt ((_ to_fp 8 24) x13) ((_ to_fp 8 24) (_ bv1120403456 32)))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x8) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x18) x4) x2))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.gt x7 x8))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x36 x3 x18)) x12))) (let ((x22 (fp.mul roundNearestTiesToEven x2 x14))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (not (fp.gt x40 (fp.abs (fp.sub roundNearestTiesToEven x10 x8)))))))))))))))))))))))))))
+(assert (not (fp.gt ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x13))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x8 ((_ to_fp 8 24) (_ bv0 32))) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x2 x39))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (not (fp.gt x40 (fp.abs (fp.sub roundNearestTiesToEven x16 x8))))))))))))))))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x13)) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.gt x35 x8))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x2 x39))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x18))))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.gt x7 x8))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x36 x3 x18)) x12))) (let ((x22 (fp.mul roundNearestTiesToEven x2 x14))) (= ((_ to_fp 8 24) x30) x22))))))))))))))))))))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x8 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x35 x8)) x40))))))))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x13))))) (= x37 ((_ to_fp 8 24) x32)))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x8)))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x18) x4)))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.lt x8 x7))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x36 x3 x18)) x12))) (let ((x22 (fp.mul roundNearestTiesToEven x14 x2))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x43 (fp.gt x10 x8))) (let ((x11 (ite x43 x12 x22))) (let ((x6 (ite x36 x3 x18))) (let ((x25 (ite x43 x30 x6))) (let ((x38 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x11) x2))) (let ((x41 (fp.mul roundNearestTiesToEven x38 x38))) (not (fp.lt (fp.abs (fp.sub roundNearestTiesToEven x41 x8)) x40)))))))))))))))))))))))))))))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) x8)))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven x31 ((_ to_fp 8 24) (ite x20 x32 x13))))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x18) x4) x2))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.lt x8 x7))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven x12 ((_ to_fp 8 24) (ite x36 x3 x18))))) (let ((x22 (fp.mul roundNearestTiesToEven x14 x2))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x43 (fp.gt x10 x8))) (let ((x11 (ite x43 x12 x22))) (let ((x6 (ite x36 x3 x18))) (let ((x25 (ite x43 x30 x6))) (let ((x38 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x25) x11) x2))) (let ((x41 (fp.mul roundNearestTiesToEven x38 x38))) (let ((x24 (fp.lt x8 x41))) (let ((x19 (ite x24 x11 x38))) (let ((x44 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x24 x23 x25)) x19))) (let ((x1 (fp.mul roundNearestTiesToEven x44 x2))) (let ((x17 (fp.mul roundNearestTiesToEven x1 x1))) (not (fp.gt x40 (fp.abs (fp.sub roundNearestTiesToEven x17 x8))))))))))))))))))))))))))))))))))))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x8 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x18) x4) x2))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (not (fp.gt x40 (fp.abs (fp.sub roundNearestTiesToEven x7 x8))))))))))))))))))))))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) x13) ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.gt x35 x8))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven x31 ((_ to_fp 8 24) (ite x20 x32 x13))))) (let ((x21 (fp.mul roundNearestTiesToEven x2 x39))) (= x21 ((_ to_fp 8 24) x33))))))))))))
+(assert (not (fp.isNaN ((_ to_fp 8 24) x13))))
+(assert (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (_ bv0 32)) ((_ to_fp 8 24) x13)) x2))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x20 x32 x13)) x31))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.lt x8 x16))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x18)) x2))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.lt x8 x7))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven x12 ((_ to_fp 8 24) (ite x36 x3 x18))))) (let ((x22 (fp.mul roundNearestTiesToEven x2 x14))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x43 (fp.gt x10 x8))) (let ((x11 (ite x43 x12 x22))) (let ((x6 (ite x36 x3 x18))) (let ((x25 (ite x43 x30 x6))) (let ((x38 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x11 ((_ to_fp 8 24) x25))))) (= x38 ((_ to_fp 8 24) x23)))))))))))))))))))))))))))))
+(assert (let ((x40 ((_ to_fp 8 24) (_ bv869711765 32)))) (let ((x8 ((_ to_fp 8 24) x13))) (let ((x2 ((_ to_fp 8 24) (_ bv1056964608 32)))) (let ((x37 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x8 ((_ to_fp 8 24) (_ bv0 32)))))) (let ((x29 ((_ to_fp 8 24) (_ bv0 32)))) (let ((x35 (fp.mul roundNearestTiesToEven x37 x37))) (let ((x20 (fp.lt x8 x35))) (let ((x31 (ite x20 x29 x37))) (let ((x39 (fp.add roundNearestTiesToEven x31 ((_ to_fp 8 24) (ite x20 x32 x13))))) (let ((x21 (fp.mul roundNearestTiesToEven x39 x2))) (let ((x16 (fp.mul roundNearestTiesToEven x21 x21))) (let ((x5 (fp.gt x16 x8))) (let ((x4 (ite x5 x31 x21))) (let ((x9 (ite x20 x32 x13))) (let ((x18 (ite x5 x33 x9))) (let ((x27 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven x4 ((_ to_fp 8 24) x18))))) (let ((x7 (fp.mul roundNearestTiesToEven x27 x27))) (let ((x36 (fp.lt x8 x7))) (let ((x12 (ite x36 x4 x27))) (let ((x14 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) (ite x36 x3 x18)) x12))) (let ((x22 (fp.mul roundNearestTiesToEven x2 x14))) (let ((x10 (fp.mul roundNearestTiesToEven x22 x22))) (let ((x43 (fp.gt x10 x8))) (let ((x11 (ite x43 x12 x22))) (let ((x6 (ite x36 x3 x18))) (let ((x25 (ite x43 x30 x6))) (let ((x38 (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven x11 ((_ to_fp 8 24) x25)) x2))) (let ((x41 (fp.mul roundNearestTiesToEven x38 x38))) (let ((x24 (fp.lt x8 x41))) (let ((x19 (ite x24 x11 x38))) (let ((x44 (fp.add roundNearestTiesToEven x19 ((_ to_fp 8 24) (ite x24 x23 x25))))) (let ((x1 (fp.mul roundNearestTiesToEven x44 x2))) (let ((x17 (fp.mul roundNearestTiesToEven x1 x1))) (let ((x42 (fp.gt x17 x8))) (let ((x28 ((_ to_fp 8 24) (ite x42 x26 (ite x24 x23 x25))))) (let ((x15 (fp.mul roundNearestTiesToEven x2 (fp.add roundNearestTiesToEven (ite x42 x19 x1) x28)))) (let ((x34 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven x15 x15) x8))) (not (not (fp.gt x40 (fp.abs x34))))))))))))))))))))))))))))))))))))))))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/range_mult_fix_44.smt2 b/src_colibri2/tests/solve/colibri/sat/range_mult_fix_44.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..330ef6703a7c92d4a777c315ac494bbfa97839de
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/range_mult_fix_44.smt2
@@ -0,0 +1,35 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+
+(define-fun fp.isFinite32 ((x Float32)) Bool (not (or (fp.isInfinite x) (fp.isNaN x))))
+
+(declare-const x Float32)
+
+;; Assume
+(assert
+ (and
+ (fp.leq (fp #b0 #b10000001 #b01000000000000000000000) x)
+ (fp.leq x (fp #b0 #b10000010 #b01000000000000000000000))))
+
+;; o
+(define-fun o () Float32
+ (fp.mul RNE x (fp #b0 #b10000000 #b00000000000000000000000)))
+
+;; Ensures
+(assert (fp.isFinite32 o))
+
+;; o
+(define-fun o1 () Float32
+ (fp.sub RNE o (fp #b0 #b10000001 #b01000000000000000000000)))
+
+;; Ensures
+(assert (fp.isFinite32 o1))
+
+;; Goal def'vc
+;; File "range_mult.adb", line 4, characters 0-0
+(assert
+ (not (fp.lt x o1)))
+
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/real_repr.smt2 b/src_colibri2/tests/solve/colibri/sat/real_repr.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d57049bbccacaabc0cc6384be5295d73b5cc66b3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/real_repr.smt2
@@ -0,0 +1,192 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+;;; SMT-LIB2: real arithmetic
+(define-fun fp.isFinite32 ((x Float32)) Bool (not (or (fp.isInfinite x) (fp.isNaN x))))
+(define-fun fp.isIntegral32 ((x Float32)) Bool (or (fp.isZero x) (and (fp.isNormal x) (= x (fp.roundToIntegral RNE x)))))
+(declare-sort string 0)
+
+(declare-sort us_private 0)
+
+(declare-fun private__bool_eq (us_private us_private) Bool)
+
+(declare-const us_null_ext__ us_private)
+
+(declare-sort us_type_of_heap 0)
+
+(declare-sort us_type_of_heap__ref 0)
+
+(declare-fun us_type_of_heap__refqtmk (us_type_of_heap) us_type_of_heap__ref)
+
+(declare-fun us_type_of_heap__content (us_type_of_heap__ref) us_type_of_heap)
+
+(declare-sort us_image 0)
+
+(declare-sort int__ref 0)
+
+(declare-fun int__refqtmk (Int) int__ref)
+
+(declare-fun int__content (int__ref) Int)
+
+(declare-sort bool__ref 0)
+
+(declare-fun bool__refqtmk (Bool) bool__ref)
+
+(declare-fun bool__content (bool__ref) Bool)
+
+(declare-sort us_fixed__ref 0)
+
+(declare-fun us_fixed__refqtmk (Int) us_fixed__ref)
+
+(declare-fun us_fixed__content (us_fixed__ref) Int)
+
+(declare-sort real__ref 0)
+
+(declare-fun real__refqtmk (Real) real__ref)
+
+(declare-fun real__content (real__ref) Real)
+
+(declare-sort us_private__ref 0)
+
+(declare-fun us_private__refqtmk (us_private) us_private__ref)
+
+(declare-fun us_private__content (us_private__ref) us_private)
+
+(define-fun int__ref___projection ((a1 int__ref)) Int (int__content a1))
+
+(define-fun us_fixed__ref___projection ((a1 us_fixed__ref)) Int (us_fixed__content
+ a1))
+
+(define-fun bool__ref___projection ((a1 bool__ref)) Bool (bool__content a1))
+
+(define-fun real__ref___projection ((a1 real__ref)) Real (real__content a1))
+
+(define-fun us_private__ref___projection ((a1 us_private__ref)) us_private
+ (us_private__content a1))
+
+(declare-fun pow2 (Int) Int)
+
+(define-fun is_plus_infinity ((x Float32)) Bool (and (fp.isInfinite x)
+ (fp.isPositive x)))
+
+(define-fun is_minus_infinity ((x Float32)) Bool (and (fp.isInfinite x)
+ (fp.isNegative x)))
+
+(define-fun is_plus_zero ((x Float32)) Bool (and (fp.isZero x)
+ (fp.isPositive x)))
+
+(define-fun is_minus_zero ((x Float32)) Bool (and (fp.isZero x)
+ (fp.isNegative x)))
+
+(declare-const max_int Int)
+
+(define-fun in_int_range ((i Int)) Bool (and (<= (- max_int) i)
+ (<= i max_int)))
+
+(define-fun in_safe_int_range ((i Int)) Bool (and (<= (- 16777216) i)
+ (<= i 16777216)))
+
+(define-fun same_sign ((x Float32)
+ (y Float32)) Bool (or (and (fp.isPositive x) (fp.isPositive y))
+ (and (fp.isNegative x) (fp.isNegative y))))
+
+(define-fun diff_sign ((x Float32)
+ (y Float32)) Bool (or (and (fp.isPositive x) (fp.isNegative y))
+ (and (fp.isNegative x) (fp.isPositive y))))
+
+(define-fun product_sign ((z Float32) (x Float32)
+ (y Float32)) Bool (and (=> (same_sign x y) (fp.isPositive z))
+ (=> (diff_sign x y) (fp.isNegative z))))
+
+(define-fun sqr ((x Real)) Real (* x x))
+
+(declare-fun sqrt1 (Real) Real)
+
+(define-fun same_sign_real ((x Float32)
+ (r Real)) Bool (or (and (fp.isPositive x) (< 0.0 r))
+ (and (fp.isNegative x) (< r 0.0))))
+
+(define-fun copy_sign ((x Float32)
+ (y Float32)) Float32 (ite (same_sign x y) x (fp.neg x)))
+
+(declare-sort t__ref 0)
+
+(declare-fun t__refqtmk (Float32) t__ref)
+
+(declare-fun t__content (t__ref) Float32)
+
+(declare-const i Int)
+
+(declare-sort tinteger_64B 0)
+
+(declare-fun tinteger_64Bqtint (tinteger_64B) Int)
+
+(define-fun in_range ((x Int)) Bool (and (<= (- 9223372036854775808) x)
+ (<= x 9223372036854775807)))
+
+(declare-fun attr__ATTRIBUTE_IMAGE (Int) us_image)
+
+(declare-fun attr__ATTRIBUTE_VALUE__pre_check (us_image) Bool)
+
+(declare-fun attr__ATTRIBUTE_VALUE (us_image) Int)
+
+(declare-fun user_eq (tinteger_64B tinteger_64B) Bool)
+
+(declare-const dummy tinteger_64B)
+
+(declare-sort tinteger_64B__ref 0)
+
+(declare-fun tinteger_64B__refqtmk (tinteger_64B) tinteger_64B__ref)
+
+(declare-fun tinteger_64B__content (tinteger_64B__ref) tinteger_64B)
+
+(define-fun tinteger_64B__ref_tinteger_64B__content__projection ((a2 tinteger_64B__ref)) tinteger_64B
+ (tinteger_64B__content a2))
+
+(declare-sort integer_64 0)
+
+(declare-fun integer_64qtint (integer_64) Int)
+
+(define-fun in_range1 ((x Int)) Bool (and (<= (- 9223372036854775808) x)
+ (<= x 9223372036854775807)))
+
+(declare-fun attr__ATTRIBUTE_IMAGE1 (Int) us_image)
+
+(declare-fun attr__ATTRIBUTE_VALUE__pre_check1 (us_image) Bool)
+
+(declare-fun attr__ATTRIBUTE_VALUE1 (us_image) Int)
+
+(declare-fun user_eq1 (integer_64 integer_64) Bool)
+
+(declare-const dummy1 integer_64)
+
+(declare-sort integer_64__ref 0)
+
+(declare-fun integer_64__refqtmk (integer_64) integer_64__ref)
+
+(declare-fun integer_64__content (integer_64__ref) integer_64)
+
+(define-fun integer_64__ref_integer_64__content__2__projection ((a2 integer_64__ref)) integer_64
+ (integer_64__content a2))
+
+(define-fun dynamic_invariant ((temp___expr_166 Int)
+ (temp___is_init_162 Bool) (temp___skip_constant_163 Bool)
+ (temp___do_toplevel_164 Bool)
+ (temp___do_typ_inv_165 Bool)) Bool (=>
+ (or (= temp___is_init_162 true)
+ (<= (- 9223372036854775808) 9223372036854775807))
+ (in_range1 temp___expr_166)))
+
+;; Assume
+ (assert (dynamic_invariant i true false true true))
+
+
+(assert
+;; defqtvc
+ ;; File "fl.ads", line 16, characters 0-0
+ (not (in_range1 (to_int (fp.to_real (fp.roundToIntegral RNA ((_ to_fp 8 24) RNE (to_real i))))))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/repr2.smt2 b/src_colibri2/tests/solve/colibri/sat/repr2.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..76ee42be1bf6ca2cb6bc9bb7b734ff639cf64db9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/repr2.smt2
@@ -0,0 +1,195 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+(declare-sort string 0)
+
+(declare-fun index_bool (Bool) Int)
+
+;; index_bool_True
+ (assert (= (index_bool true) 0))
+
+;; index_bool_False
+ (assert (= (index_bool false) 1))
+
+(declare-sort tuple0 0)
+
+(declare-const Tuple0 tuple0)
+
+(declare-sort us_private 0)
+
+(declare-fun private__bool_eq (us_private us_private) Bool)
+
+(declare-const us_null_ext__ us_private)
+
+(declare-sort us_type_of_heap 0)
+
+(declare-sort us_type_of_heap__ref 0)
+
+(declare-fun us_type_of_heap__refqtmk (us_type_of_heap) us_type_of_heap__ref)
+
+(declare-fun us_type_of_heap__content (us_type_of_heap__ref) us_type_of_heap)
+
+(declare-sort us_image 0)
+
+(declare-sort int__ref 0)
+
+(declare-fun int__refqtmk (Int) int__ref)
+
+(declare-fun int__content (int__ref) Int)
+
+(declare-sort bool__ref 0)
+
+(declare-fun bool__refqtmk (Bool) bool__ref)
+
+(declare-fun bool__content (bool__ref) Bool)
+
+(declare-sort us_fixed__ref 0)
+
+(declare-fun us_fixed__refqtmk (Int) us_fixed__ref)
+
+(declare-fun us_fixed__content (us_fixed__ref) Int)
+
+(declare-sort real__ref 0)
+
+(declare-fun real__refqtmk (Real) real__ref)
+
+(declare-fun real__content (real__ref) Real)
+
+(declare-sort us_private__ref 0)
+
+(declare-fun us_private__refqtmk (us_private) us_private__ref)
+
+(declare-fun us_private__content (us_private__ref) us_private)
+
+(declare-fun int__ref___projection (int__ref) Int)
+
+(declare-fun us_fixed__ref___projection (us_fixed__ref) Int)
+
+(declare-fun bool__ref___projection (bool__ref) Bool)
+
+(declare-fun real__ref___projection (real__ref) Real)
+
+(declare-fun us_private__ref___projection (us_private__ref) us_private)
+
+(declare-fun mod1 (Int Int) Int)
+
+(declare-fun nth ((_ BitVec 8) Int) Bool)
+
+(declare-fun lsr ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun asr ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun lsl ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun rotate_right1 ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun rotate_left1 ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun pow2 (Int) Int)
+
+(declare-fun to_int1 ((_ BitVec 8)) Int)
+
+(declare-fun uint_in_range (Int) Bool)
+
+(declare-fun nth_bv ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun eq_sub_bv ((_ BitVec 8) (_ BitVec 8) (_ BitVec 8)
+ (_ BitVec 8)) Bool)
+
+(declare-fun eq_sub ((_ BitVec 8) (_ BitVec 8) Int Int) Bool)
+
+(declare-sort t__ref 0)
+
+(declare-fun t__refqtmk ((_ BitVec 8)) t__ref)
+
+(declare-fun t__content (t__ref) (_ BitVec 8))
+
+(declare-fun bool_eq ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun bool_ne ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun bool_lt ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun bool_le ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun bool_gt ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun bool_ge ((_ BitVec 8) (_ BitVec 8)) Bool)
+
+(declare-fun power ((_ BitVec 8) Int) (_ BitVec 8))
+
+(declare-fun bv_min ((_ BitVec 8) (_ BitVec 8)) (_ BitVec 8))
+
+(declare-fun bv_max ((_ BitVec 8) (_ BitVec 8)) (_ BitVec 8))
+
+(declare-fun bool_eq1 (Bool Bool) Bool)
+
+(declare-fun to_int2 (Bool) Int)
+
+(declare-fun of_int (Int) Bool)
+
+(declare-fun in_range (Int) Bool)
+
+(declare-fun attr__ATTRIBUTE_IMAGE (Bool) us_image)
+
+(declare-fun attr__ATTRIBUTE_VALUE__pre_check (us_image) Bool)
+
+(declare-fun attr__ATTRIBUTE_VALUE (us_image) Bool)
+
+(declare-const i Int)
+
+(declare-const attr__ATTRIBUTE_ADDRESS Int)
+
+(declare-const j Int)
+
+(declare-const attr__ATTRIBUTE_ADDRESS1 Int)
+
+(declare-sort avoid_overflow 0)
+
+(declare-fun avoid_overflowqtint (avoid_overflow) Int)
+
+(declare-fun in_range1 (Int) Bool)
+
+(declare-fun bool_eq2 (Int Int) Bool)
+
+(declare-fun attr__ATTRIBUTE_IMAGE1 (Int) us_image)
+
+(declare-fun attr__ATTRIBUTE_VALUE__pre_check1 (us_image) Bool)
+
+(declare-fun attr__ATTRIBUTE_VALUE1 (us_image) Int)
+
+(declare-fun user_eq (avoid_overflow avoid_overflow) Bool)
+
+(declare-const dummy avoid_overflow)
+
+(declare-sort avoid_overflow__ref 0)
+
+(declare-fun avoid_overflow__refqtmk (avoid_overflow) avoid_overflow__ref)
+
+(declare-fun avoid_overflow__content (avoid_overflow__ref) avoid_overflow)
+
+(declare-fun avoid_overflow__ref_avoid_overflow__content__projection (avoid_overflow__ref) avoid_overflow)
+
+(declare-fun dynamic_invariant (Int Bool Bool Bool Bool) Bool)
+
+;; Assume
+ (assert (dynamic_invariant i true false true true))
+
+;; Assume
+ (assert (dynamic_invariant j true false true true))
+
+;; Assume
+ (assert (= j (+ i 16)))
+
+(assert
+;; defqtvc
+ ;; File "badmod.ads", line 9, characters 0-0
+ (not
+ (= (ite (= ((_ int2bv 8) (mod1 i 256)) ((_ int2bv 8) (mod1 j 256))) true
+ false) true)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/repr_pow.smt2 b/src_colibri2/tests/solve/colibri/sat/repr_pow.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6577fff92801e399f993750870c7d938b4ae492c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/repr_pow.smt2
@@ -0,0 +1,26 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+
+
+
+
+(define-fun in_range1 ((x Int)) Bool (and (<= (- 2147483648) x)
+ (<= x 2147483647)))
+
+(declare-const a Int)
+(declare-const n Int)
+(declare-const b Int)
+
+(assert (< (colibri_pow_int_int a n) 2147483647))
+
+
+
+
+
+(assert
+;; defqtvc
+ ;; File "fib.ads", line 29, characters 0-0
+ (not (in_range1 (* b b))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/riposte_floats_are_not_rational.smt2 b/src_colibri2/tests/solve/colibri/sat/riposte_floats_are_not_rational.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5ae7bf7f80819c342fdcab240cd56a582c6c9b33
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/riposte_floats_are_not_rational.smt2
@@ -0,0 +1,15 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-fun isFinite ((f Float32)) Bool (or (fp.isNormal f) (fp.isZero f) (fp.isSubnormal f)))
+(declare-fun x () Float32)
+(define-fun f1 () Float32 ((_ to_fp 8 24) #x3f800000))
+(define-fun f10 () Float32 ((_ to_fp 8 24) #x41200000))
+(assert (isFinite x))
+(assert (not (not (fp.eq (fp.mul RNE x f10) f1))))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/scale_1.smt2 b/src_colibri2/tests/solve/colibri/sat/scale_1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a55be943cceab14c9f53a8f11805e82a73f1f40f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/scale_1.smt2
@@ -0,0 +1,15 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda and Martin Brain|)
+(set-info :category "crafted")
+(set-info :status sat)
+(define-fun is_finite ((f Float32)) Bool (or (fp.isNormal f) (fp.isZero f) (fp.isSubnormal f)))
+(declare-fun a () Float32)
+(assert (is_finite a))
+(assert (fp.isPositive a))
+(define-fun scale () Float32 ((_ to_fp 8 24) #x3f400000))
+(assert (not (fp.lt (fp.mul RNE a scale) a)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10284.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10284.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5477cb13054f5d94fcc1ceb420e5506ded6fea07
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10284.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.9866781053479025676011815448873676359653472900390625p964 {- 4443603147579441 964 (-3.09773e+290)}
+; -1.9866781053479025676011815448873676359653472900390625p964 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11111000011 #b1111110010010110111011111011001000100110000000110001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10286.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10286.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a3543de3d00fc95a92fd8097a55475b72e59aa2f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-10286.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.4010406739299134937226654074038378894329071044921875p307 {- 1806126629671171 307 (-3.65308e+092)}
+; -1.4010406739299134937226654074038378894329071044921875p307 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b10100110010 #b0110011010101010100110100000001011100101000100000011)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11504.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11504.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..cbf960d83c5704e4df468d694baea2119477602f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11504.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.8881272406469451485833133119740523397922515869140625p916 {+ 3999769510035169 916 (1.04594e+276)}
+; 1.8881272406469451485833133119740523397922515869140625p916 S == 1.3740914236858277064357025665231049060821533203125p458
+; [HW: 1.3740914236858277064357025665231049060821533203125p458]
+
+; mpf : + 1684757996313992 458
+; mpfd: + 1684757996313992 458 (1.02271e+138) class: Pos. norm. non-zero
+; hwf : + 1684757996313992 458 (1.02271e+138) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11110010011 #b1110001101011100010011101000110101000011111011100001)))
+(assert (= r (fp #b0 #b10111001001 #b0101111111000100011101001001111001110001110110001000)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11967.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11967.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8a668053fa1e58ac526e58f3e21b3da7c3ae88f1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-11967.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.443208308459445365912188208312727510929107666015625p-982 {- 1996032772825466 -982 (-3.5308e-296)}
+; -1.443208308459445365912188208312727510929107666015625p-982 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00000101001 #b0111000101110110000110011000011000100110000101111010)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1201.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1201.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9f65c35071df18ef29a8615662c371aca796825d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1201.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.1263064392537069924316028846078552305698394775390625p-925 {- 568833632757489 -925 (-3.9711e-279)}
+; -1.1263064392537069924316028846078552305698394775390625p-925 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00001100010 #b0010000001010101100111100110100111011110011011110001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12401.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12401.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..4393ba2826d87bdf7ea5a1e754ff5354f4e383d3
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12401.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = 1.4629343096259532774894296380807645618915557861328125p-13 {+ 2084870784328461 -13 (0.000178581)}
+; 1.4629343096259532774894296380807645618915557861328125p-13 S == 1.7105170619587244384973701016861014068126678466796875p-7
+; [HW: 1.7105170619587244384973701016861014068126678466796875p-7]
+
+; mpf : + 3199884375477691 -7
+; mpfd: + 3199884375477691 -7 (0.0133634) class: Pos. norm. non-zero
+; hwf : + 3199884375477691 -7 (0.0133634) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b01111110010 #b0111011010000010110111001110100000001010001100001101)))
+(assert (= r (fp #b0 #b01111111000 #b1011010111100100011100100011100001011100110110111011)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12581.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12581.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f94ea63bbeaeafc3241ca3d415d4b06af3605fd4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-12581.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.264722843237104488167688032262958586215972900390625p664 {- 1192205698159082 664 (-9.68083e+199)}
+; -1.264722843237104488167688032262958586215972900390625p664 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11010010111 #b0100001111000100111000000101001000110101000111101010)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13316.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13316.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..81dadef667ebe7da4e9ee7ec435899895ef4a3c8
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13316.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.721705659740254024114847197779454290866851806640625p-538 {+ 3250273340277386 -538 (1.91347e-162)}
+; 1.721705659740254024114847197779454290866851806640625p-538 S == 1.3121378204061697747562220683903433382511138916015625p-269
+; [HW: 1.3121378204061697747562220683903433382511138916015625p-269]
+
+; mpf : + 1405743771669465 -269
+; mpfd: + 1405743771669465 -269 (1.38328e-081) class: Pos. norm. non-zero
+; hwf : + 1405743771669465 -269 (1.38328e-081) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00111100101 #b1011100011000001101100111011110111101100001010001010)))
+(assert (= r (fp #b0 #b01011110010 #b0100111111101000010000111010001001111101001111011001)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13690.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13690.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0f6467f6be8f6a61c4beb6d3b129ef485bddb12e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13690.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.97861771541432229781776186428032815456390380859375p938 {- 4407302378478108 938 (-4.59725e+282)}
+; -1.97861771541432229781776186428032815456390380859375p938 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11110101001 #b1111101010000110101100001100101011111101101000011100)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13762.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13762.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1f5eb0dbcd23aef58aebdce0ddc0cb1a752bd119
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13762.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.559333285171588645567908315570093691349029541015625p132 {- 2519013174674682 132 (-8.48982e+039)}
+; -1.559333285171588645567908315570093691349029541015625p132 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b10010000011 #b1000111100110000011101110101011101100000010011111010)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13880.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13880.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..051984da40f553a33247dd39c0e00d1dc812c120
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-13880.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.3571348728035363961907933116890490055084228515625p1023 {- 1608392480079016 1023 (-1.21986e+308)}
+; -1.3571348728035363961907933116890490055084228515625p1023 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11111111110 #b0101101101101101001100001110011011110011110010101000)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14248.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14248.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d899226d708ee8120b0c8237051523d9072edb6d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14248.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.81863394397416033854142369818873703479766845703125p225 {+ 3686799525034868 225 (9.80605e+067)}
+; 1.81863394397416033854142369818873703479766845703125p225 S == 1.9071622605190992061352517339400947093963623046875p112
+; [HW: 1.9071622605190992061352517339400947093963623046875p112]
+
+; mpf : + 4085495618438392 112
+; mpfd: + 4085495618438392 112 (9.90255e+033) class: Pos. norm. non-zero
+; hwf : + 4085495618438392 112 (9.90255e+033) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b10011100000 #b1101000110010001111111101000000011000011101101110100)))
+(assert (= r (fp #b0 #b10001101111 #b1110100000111011110010010011000100011000010011111000)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14254.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14254.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b6a0d8ac0afd4a2135a4d021535a87150bedc83c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14254.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.306250880706244288376183249056339263916015625p600 {- 1379231352230528 600 (-5.42031e+180)}
+; -1.306250880706244288376183249056339263916015625p600 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11001010111 #b0100111001100110011101010010110100000001001010000000)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-145.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-145.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c3dfbad9869e36e841a4488a359bc8ea0aa4c631
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-145.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.4444016368819279083623996484675444662570953369140625p-212 {- 2001407046264289 -212 (-2.19447e-064)}
+; -1.4444016368819279083623996484675444662570953369140625p-212 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01100101011 #b0111000111000100010011100100000010110010010111100001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14564.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14564.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9b131ed858d1c806079f887b703ed0fd80d70d34
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14564.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.3761190398807767731881313011399470269680023193359375p607 {- 1693889567854015 607 (-7.30909e+182)}
+; -1.3761190398807767731881313011399470269680023193359375p607 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11001011110 #b0110000001001001010101100101111110110000110110111111)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14628.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14628.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..50c3111421c1458effc9dfd6bb44aa4f6d517a89
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-14628.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.947018437986577144016564488993026316165924072265625p-537 {+ 4264991884429338 -537 (4.32775e-162)}
+; 1.947018437986577144016564488993026316165924072265625p-537 S == 1.9733314156454191401479647538508288562297821044921875p-269
+; [HW: 1.9733314156454191401479647538508288562297821044921875p-269]
+
+; mpf : + 4383495000808707 -269
+; mpfd: + 4383495000808707 -269 (2.08033e-081) class: Pos. norm. non-zero
+; hwf : + 4383495000808707 -269 (2.08033e-081) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00111100110 #b1111001001101111110011001110001111011100100000011010)))
+(assert (= r (fp #b0 #b01011110010 #b1111100100101100001111110110011001011101110100000011)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15135.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15135.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..28bd1405adf8dadcf58c081419fd10302344a3dc
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15135.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.253987679328981474924376016133464872837066650390625p870 {+ 1143858817982698 870 (9.87164e+261)}
+; 1.253987679328981474924376016133464872837066650390625p870 S == 1.1198159131433083057771682433667592704296112060546875p435
+; [HW: 1.1198159131433083057771682433667592704296112060546875p435]
+
+; mpf : + 539602901785259 435
+; mpfd: + 539602901785259 435 (9.93561e+130) class: Pos. norm. non-zero
+; hwf : + 539602901785259 435 (9.93561e+130) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11101100101 #b0100000100000101010101100010100001001110000011101010)))
+(assert (= r (fp #b0 #b10110110010 #b0001111010101100010000010111010001111101101010101011)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15730.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15730.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..a10571b71665c4d211478a38dd56c49b9f376247
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-15730.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.4519480247274139106394841292058117687702178955078125p43 {- 2035392955753213 43 (-1.27715e+013)}
+; -1.4519480247274139106394841292058117687702178955078125p43 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b10000101010 #b0111001110110010110111011010000110110010001011111101)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16064.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16064.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..fe48033f7e913c270d757761b34fb6cc18ef79e7
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16064.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.7908800790036616401579294688417576253414154052734375p-838 {+ 3561807229095639 -838 (9.7708e-253)}
+; 1.7908800790036616401579294688417576253414154052734375p-838 S == 1.3382376765745542801511192010366357862949371337890625p-419
+; [HW: 1.3382376765745542801511192010366357862949371337890625p-419]
+
+; mpf : + 1523287074183825 -419
+; mpfd: + 1523287074183825 -419 (9.88474e-127) class: Pos. norm. non-zero
+; hwf : + 1523287074183825 -419 (9.88474e-127) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00010111001 #b1100101001110111000111011110101001100000111011010111)))
+(assert (= r (fp #b0 #b01001011100 #b0101011010010110101111101000111100101001101010010001)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16305.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16305.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..819a1c60a010f41c3ce6c9fe76c49a4a23fe6c96
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16305.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.56053193678175450287426428985781967639923095703125p443 {- 2524411421619572 443 (-3.54455e+133)}
+; -1.56053193678175450287426428985781967639923095703125p443 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b10110111010 #b1000111101111111000001010110000011010111010101110100)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16646.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16646.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8ee595e384bcbdb58a4247719b8878b315c2058a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16646.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.3079737789590859531330124809755943715572357177734375p751 {+ 1386990596160023 751 (1.54927e+226)}
+; 1.3079737789590859531330124809755943715572357177734375p751 S == 1.6173891176578913952965876887901686131954193115234375p375
+; [HW: 1.6173891176578913952965876887901686131954193115234375p375]
+
+; mpf : + 2780473400226679 375
+; mpfd: + 2780473400226679 375 (1.24469e+113) class: Pos. norm. non-zero
+; hwf : + 2780473400226679 375 (1.24469e+113) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11011101110 #b0100111011010111010111101001110010100111101000010111)))
+(assert (= r (fp #b0 #b10101110110 #b1001111000001101001101101001010100111111001101110111)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16876.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16876.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f89831d572155b0e4d1c7e63c20fe326fb8c2ff1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-16876.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.043882556980177067629256271175108850002288818359375p675 {+ 197629467263990 675 (1.63643e+203)}
+; 1.043882556980177067629256271175108850002288818359375p675 S == 1.444910071236391591043002335936762392520904541015625p337
+; [HW: 1.444910071236391591043002335936762392520904541015625p337]
+
+; mpf : + 2003696831033594 337
+; mpfd: + 2003696831033594 337 (4.04529e+101) class: Pos. norm. non-zero
+; hwf : + 2003696831033594 337 (4.04529e+101) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11010100010 #b0000101100111011111000110010001100011000001111110110)))
+(assert (= r (fp #b0 #b10101010000 #b0111000111100101101000000101110110011111000011111010)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17024.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17024.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..d4811602d35608aa58c9f04781aca3ccc8bb843f
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17024.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.8017718704231613369159958892851136624813079833984375p-746 {- 3610859496873895 -746 (-4.86769e-225)}
+; -1.8017718704231613369159958892851136624813079833984375p-746 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00100010101 #b1100110101000000111010111101101001010001111110100111)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17361.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17361.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ea93f573853687388e8a06fb5d337ccd4c2bd679
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17361.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.36681740492838965650435056886635720729827880859375p201 {- 1651998728148508 201 (-4.39278e+060)}
+; -1.36681740492838965650435056886635720729827880859375p201 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b10011001000 #b0101110111100111101111101101010111000101011000011100)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17538.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17538.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9f493b829ecc69e13dbd1d48494897ff9e4f175e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-17538.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.687539428165591548491875073523260653018951416015625p-813 {- 3096402312489082 -813 (-3.08935e-245)}
+; -1.687539428165591548491875073523260653018951416015625p-813 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00011010010 #b1011000000000010100101010111111010101110100001111010)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1766.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1766.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..16996d5ddf4c0eb6eef1a3cf8b09f789ae4217e1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-1766.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.9927739432137185904281295734108425676822662353515625p472 {+ 4471056360720441 472 (2.43005e+142)}
+; 1.9927739432137185904281295734108425676822662353515625p472 S == 1.4116564536790525696829945445642806589603424072265625p236
+; [HW: 1.4116564536790525696829945445642806589603424072265625p236]
+
+; mpf : + 1853935851393641 236
+; mpfd: + 1853935851393641 236 (1.55886e+071) class: Pos. norm. non-zero
+; hwf : + 1853935851393641 236 (1.55886e+071) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b10111010111 #b1111111000100110011011101110001001101100100000111001)))
+(assert (= r (fp #b0 #b10011101011 #b0110100101100010010100010011110110111101001001101001)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18917.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18917.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ac24036cef718107c0cbbe3633a96ead3f9e7e5b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18917.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.3983528091389574310454690930782817304134368896484375p-40 {- 1794021562800199 -40 (-1.27179e-012)}
+; -1.3983528091389574310454690930782817304134368896484375p-40 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01111010111 #b0110010111111010011100110001111110000101100001000111)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18939.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18939.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6abf9848367183c3f52f357f763e6a8d50eabe7c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-18939.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = 1.9019019044212346347677566882339306175708770751953125p932 {+ 4061805080676213 932 (6.90469e+280)}
+; 1.9019019044212346347677566882339306175708770751953125p932 S == 1.379094595892984553842097739106975495815277099609375p466
+; [HW: 1.379094595892984553842097739106975495815277099609375p466]
+
+; mpf : + 1707290280801814 466
+; mpfd: + 1707290280801814 466 (2.62768e+140) class: Pos. norm. non-zero
+; hwf : + 1707290280801814 466 (2.62768e+140) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11110100011 #b1110011011100011000010110000111110110000011101110101)))
+(assert (= r (fp #b0 #b10111010001 #b0110000100001100010101111110101101110011011000010110)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19265.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19265.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f75a5172421a1192167c03171f94df99f44fa0d1
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19265.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.51144588353136821723410321283154189586639404296875p881 {- 2303347490492044 881 (-2.43679e+265)}
+; -1.51144588353136821723410321283154189586639404296875p881 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11101110000 #b1000001011101110000111100000111101110000111010001100)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19297.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19297.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..c9f18f7f6c5c08fe229c3bc1ed312ce8cb8976d7
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19297.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.490565945465146757697993962210603058338165283203125p595 {- 2209312609197490 595 (-1.93285e+179)}
+; -1.490565945465146757697993962210603058338165283203125p595 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11001010010 #b0111110110010101101110101101010001001101110110110010)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19725.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19725.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..127dc40c3e85013e17eed6469f33f5ff0fc7e693
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-19725.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.5526884316961713228266717123915441334247589111328125p-208 {- 2489087415038861 -208 (-3.77438e-063)}
+; -1.5526884316961713228266717123915441334247589111328125p-208 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01100101111 #b1000110101111100111111010011001100000011001110001101)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-2173.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-2173.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..545c6df9ff87e5eb92e80f7133b5b028568b8c43
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-2173.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.6889953566008439889145620327326469123363494873046875p-129 {+ 3102959231247563 -129 (2.48176e-039)}
+; 1.6889953566008439889145620327326469123363494873046875p-129 S == 1.8379310958797361319483343322644941508769989013671875p-65
+; [HW: 1.8379310958797361319483343322644941508769989013671875p-65]
+
+; mpf : + 3773706171166131 -65
+; mpfd: + 3773706171166131 -65 (4.98172e-020) class: Pos. norm. non-zero
+; hwf : + 3773706171166131 -65 (4.98172e-020) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b01101111110 #b1011000001100001111111111110101110110010010011001011)))
+(assert (= r (fp #b0 #b01110111110 #b1101011010000010101001101111110100011010110110110011)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3270.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3270.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8acd38ad3a8156b872716e0cdd8e258f369d8a6d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3270.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.2113528000757194380554437884711660444736480712890625p-276 {+ 951848391664721 -276 (9.97681e-084)}
+; 1.2113528000757194380554437884711660444736480712890625p-276 S == 1.1006147373516854681696486295550130307674407958984375p-138
+; [HW: 1.1006147373516854681696486295550130307674407958984375p-138]
+
+; mpf : + 453128493645031 -138
+; mpfd: + 453128493645031 -138 (3.15861e-042) class: Pos. norm. non-zero
+; hwf : + 453128493645031 -138 (3.15861e-042) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b01011101011 #b0011011000011011001101111001010000111110010001010001)))
+(assert (= r (fp #b0 #b01101110101 #b0001100111000001111000110010111001101011110011100111)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3535.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3535.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..f6cc3097810800dcf364e83ef61a7793d9ddba00
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-3535.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = 1.12526158961176125927750035771168768405914306640625p-173 {+ 564128048299364 -173 (9.39862e-053)}
+; 1.12526158961176125927750035771168768405914306640625p-173 S == 1.5001743829380378425497610805905424058437347412109375p-87
+; [HW: 1.5001743829380378425497610805905424058437347412109375p-87]
+
+; mpf : + 2252585164620015 -87
+; mpfd: + 2252585164620015 -87 (9.69465e-027) class: Pos. norm. non-zero
+; hwf : + 2252585164620015 -87 (9.69465e-027) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b01101010010 #b0010000000010001001001001011111011010011110101100100)))
+(assert (= r (fp #b0 #b01110101000 #b1000000000001011011011011010100100000100000011101111)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4100.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4100.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8fc4ca2a2aaff278a41390466a04e311eda705a8
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4100.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.3936893811619597283169014190207235515117645263671875p528 {- 1773019350300723 528 (-1.22463e+159)}
+; -1.3936893811619597283169014190207235515117645263671875p528 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11000001111 #b0110010011001000110100111100100011011111100000110011)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4331.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4331.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..48a023f1a8af434a87e9e109cbd93fa58b8ea21b
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-4331.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.7058042728881657179584863115451298654079437255859375p-911 {- 3178659860375647 -911 (-9.85379e-275)}
+; -1.7058042728881657179584863115451298654079437255859375p-911 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00001110000 #b1011010010101111100101101011110101101110100001011111)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5119.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5119.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8e832091c7bebf59d04fc7c364717506aad2a952
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5119.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.8565993123956270327568063294165767729282379150390625p-219 {- 3857780344110769 -219 (-2.20368e-066)}
+; -1.8565993123956270327568063294165767729282379150390625p-219 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01100100100 #b1101101101001010000101111011000010000011111010110001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5274.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5274.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..5c1faa4cadec609d38b9425d40130bd4767d93d8
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5274.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.0762515670854500005049203537055291235446929931640625p825 {- 343406529112449 825 (-2.40802e+248)}
+; -1.0762515670854500005049203537055291235446929931640625p825 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11100111000 #b0001001110000101001110010000001011100110100110000001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5905.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5905.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..df0631b54c1cb48a720eeae0f5455bdb90e37f90
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-5905.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.95396644924768025930461590178310871124267578125p476 {+ 4296282945355808 476 (3.81237e+143)}
+; 1.95396644924768025930461590178310871124267578125p476 S == 1.3978434995548252306463155036908574402332305908203125p238
+; [HW: 1.3978434995548252306463155036908574402332305908203125p238]
+
+; mpf : + 1791727836346885 238
+; mpfd: + 1791727836346885 238 (6.17444e+071) class: Pos. norm. non-zero
+; hwf : + 1791727836346885 238 (6.17444e+071) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b10111011011 #b1111010000110111001001010010110100000000000000100000)))
+(assert (= r (fp #b0 #b10011101101 #b0110010111011001000100100101001110000011101000000101)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6014.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6014.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..287101b581ad7f351baedad78c353f352f58d464
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6014.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.03880298571301477039696692372672259807586669921875p-739 {+ 174753111997996 -739 (3.59225e-223)}
+; 1.03880298571301477039696692372672259807586669921875p-739 S == 1.4413902911515774629691577501944266259670257568359375p-370
+; [HW: 1.4413902911515774629691577501944266259670257568359375p-370]
+
+; mpf : + 1987845150755199 -370
+; mpfd: + 1987845150755199 -370 (5.99354e-112) class: Pos. norm. non-zero
+; hwf : + 1987845150755199 -370 (5.99354e-112) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00100011100 #b0000100111101110111111100001001010011111111000101100)))
+(assert (= r (fp #b0 #b01010001101 #b0111000011111110111101000100000101000100100101111111)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6055.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6055.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..83d233682d28782c8ec73677645dffde9c92e1a4
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6055.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = -1.8698164609234790844993767677806317806243896484375p-193 {- 3917305089295704 -193 (-1.48939e-058)}
+; -1.8698164609234790844993767677806317806243896484375p-193 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01100111110 #b1101111010101100010010101010010100110000010101011000)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6410.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6410.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7e14c08177849e48074df1259691ffa8599c832a
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6410.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.6211421693822172240828649592003785073757171630859375p-10 {- 2797375642573855 -10 (-0.00158315)}
+; -1.6211421693822172240828649592003785073757171630859375p-10 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01111110101 #b1001111100000011001011000101011110101001110000011111)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6585.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6585.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..ce8c9573026abaa8de2c397dde5491251c24255c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-6585.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.055919008086902977083809673786163330078125p-998 {+ 251836823983104 -998 (3.9418e-301)}
+; 1.055919008086902977083809673786163330078125p-998 S == 1.0275791979633017714235165840364061295986175537109375p-499
+; [HW: 1.0275791979633017714235165840364061295986175537109375p-499]
+
+; mpf : + 124205665670703 -499
+; mpfd: + 124205665670703 -499 (6.27838e-151) class: Pos. norm. non-zero
+; hwf : + 124205665670703 -499 (6.27838e-151) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00000011001 #b0000111001010000101101010100011011110101010000000000)))
+(assert (= r (fp #b0 #b01000001100 #b0000011100001111011011100010100101001101011000101111)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-673.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-673.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0acc585e76de173039514c3d639cfca234b64a3c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-673.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to negative
+; Precision: double (11/53)
+; X = 1.100116175620114322697418174357153475284576416015625p-303 {+ 450883171216506 -303 (6.75072e-092)}
+; 1.100116175620114322697418174357153475284576416015625p-303 S == 1.483318020938270809239156733383424580097198486328125p-152
+; [HW: 1.483318020938270809239156733383424580097198486328125p-152]
+
+; mpf : + 2176670858999042 -152
+; mpfd: + 2176670858999042 -152 (2.59821e-046) class: Pos. norm. non-zero
+; hwf : + 2176670858999042 -152 (2.59821e-046) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b01011010000 #b0001100110100001001101101011010000010110110001111010)))
+(assert (= r (fp #b0 #b01101100111 #b0111101110111010101110101101010101111111010100000010)))
+(assert (= (fp.sqrt roundTowardNegative x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-674.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-674.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..b8cbe44c7350658dd84280114f0cce995593dba9
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-674.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.1222315799318207663048951872042380273342132568359375p615 {+ 550482097833855 615 (1.52591e+185)}
+; 1.1222315799318207663048951872042380273342132568359375p615 S == 1.498153249792437247123189081321470439434051513671875p307
+; [HW: 1.498153249792437247123189081321470439434051513671875p307]
+
+; mpf : + 2243482790138622 307
+; mpfd: + 2243482790138622 307 (3.90629e+092) class: Pos. norm. non-zero
+; hwf : + 2243482790138622 307 (3.90629e+092) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11001100110 #b0001111101001010100100011001111001011000011101111111)))
+(assert (= r (fp #b0 #b10100110010 #b0111111110000110111110001010110001000001001011111110)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7134.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7134.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..fc751233d2281c3511d1741e9c67987145941063
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7134.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.3717148547829054461288933453033678233623504638671875p518 {+ 1674054881488371 518 (1.17707e+156)}
+; 1.3717148547829054461288933453033678233623504638671875p518 S == 1.1712023116365954944484428779105655848979949951171875p259
+; [HW: 1.1712023116365954944484428779105655848979949951171875p259]
+
+; mpf : + 771026666891539 259
+; mpfd: + 771026666891539 259 (1.08493e+078) class: Pos. norm. non-zero
+; hwf : + 771026666891539 259 (1.08493e+078) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11000000101 #b0101111100101000101101000110100010111010110111110011)))
+(assert (= r (fp #b0 #b10100000010 #b0010101111010011111010100010100101111010100100010011)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7164.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7164.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..6b44603013a232b356aae9d05aca2f2fc5e17159
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7164.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.568792356148156041939500937587581574916839599609375p-807 {+ 2561613043200022 -807 (1.83806e-243)}
+; 1.568792356148156041939500937587581574916839599609375p-807 S == 1.7713228707088701785465900684357620775699615478515625p-404
+; [HW: 1.7713228707088701785465900684357620775699615478515625p-404]
+
+; mpf : + 3473729393106809 -404
+; mpfd: + 3473729393106809 -404 (4.28726e-122) class: Pos. norm. non-zero
+; hwf : + 3473729393106809 -404 (4.28726e-122) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00011011000 #b1001000110011100011000000011011111011111000000010110)))
+(assert (= r (fp #b0 #b01001101011 #b1100010101110101011010100110100001011001111101111001)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7272.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7272.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..e73ccd439fd860b8d1f368e9a3aeae09f0942c0e
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-7272.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = -1.8297816762885050767550865202792920172214508056640625p-953 {- 3737004448131777 -953 (-2.40333e-287)}
+; -1.8297816762885050767550865202792920172214508056640625p-953 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b00001000110 #b1101010001101100100100100110101001111010101011000001)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8776.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8776.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..8dfec00730cb768743b62997911fabba65220d68
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8776.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to zero
+; Precision: double (11/53)
+; X = 1.8840795801424856659167517136665992438793182373046875p876 {+ 3981540467695563 876 (9.49239e+263)}
+; 1.8840795801424856659167517136665992438793182373046875p876 S == 1.3726177837047301988349090606789104640483856201171875p438
+; [HW: 1.3726177837047301988349090606789104640483856201171875p438]
+
+; mpf : + 1678121311844243 438
+; mpfd: + 1678121311844243 438 (9.74289e+131) class: Pos. norm. non-zero
+; hwf : + 1678121311844243 438 (9.74289e+131) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b11101101011 #b1110001001010011000010100001001111000101111111001011)))
+(assert (= r (fp #b0 #b10110110101 #b0101111101100011111000010000101011101011011110010011)))
+(assert (= (fp.sqrt roundTowardZero x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8940.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8940.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9454b0874fdb3ca8010d4c059bbbab97d685487c
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-8940.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = -1.31453747049236913113645641715265810489654541015625p842 {- 1416550834903492 842 (-3.85504e+253)}
+; -1.31453747049236913113645641715265810489654541015625p842 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b11101001001 #b0101000010000101100001110001010100100001100111000100)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9497.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9497.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..48fb2d06987221bc639877a2345a0f56980b3cd6
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9497.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: to positive
+; Precision: double (11/53)
+; X = 1.9000057718251930349850908896769396960735321044921875p-534 {+ 4053265658623235 -534 (3.3786e-161)}
+; 1.9000057718251930349850908896769396960735321044921875p-534 S == 1.378406968868481019541150089935399591922760009765625p-267
+; [HW: 1.378406968868481019541150089935399591922760009765625p-267]
+
+; mpf : + 1704193483990490 -267
+; mpfd: + 1704193483990490 -267 (5.81258e-081) class: Pos. norm. non-zero
+; hwf : + 1704193483990490 -267 (5.81258e-081) class: Pos. norm. non-zero
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b0 #b00111101001 #b1110011001100110110001110011110000110011010100000011)))
+(assert (= r (fp #b0 #b01011110100 #b0110000011011111010001110111001111011110010111011010)))
+(assert (= (fp.sqrt roundTowardPositive x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9896.smt2 b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9896.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..1fdce51e71d7e543532599ef836724ff931de144
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/sqrt-has-solution-9896.smt2
@@ -0,0 +1,24 @@
+(set-info :smt-lib-version 2.6)
+(set-info :category "crafted")
+(set-info :source |Christoph M. Wintersteiger (cwinter@microsoft.com). Randomly generated floating-point testcases.|)
+; Rounding mode: nearest, ties to even
+; Precision: double (11/53)
+; X = -1.7069910430387402744401015297626145184040069580078125p-428 {- 3184004597983549 -428 (-2.4626e-129)}
+; -1.7069910430387402744401015297626145184040069580078125p-428 S == NaN
+; [HW: NaN]
+
+; mpf : + 4503599627370495 1024
+; mpfd: + 4503599627370495 1024 (1.#QNAN) class: NaN
+; hwf : - 2251799813685248 1024 (-1.#IND) class: NaN
+
+(set-logic QF_FP)
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-sort FPN () (_ FloatingPoint 11 53))
+(declare-fun x () FPN)
+(declare-fun r () FPN)
+(assert (= x (fp #b1 #b01001010011 #b1011010011111101010111010111000001101010100100111101)))
+(assert (= r (_ NaN 11 53)))
+(assert (= (fp.sqrt roundNearestTiesToEven x) r))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/test-Top-Floor_ceil_invalid.smt2 b/src_colibri2/tests/solve/colibri/sat/test-Top-Floor_ceil_invalid.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..0636a400e15724c0ee00cf11cd87d7aed660dbf8
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/test-Top-Floor_ceil_invalid.smt2
@@ -0,0 +1,35 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+;;; SMT-LIB2: real arithmetic
+(declare-sort string 0)
+
+(declare-fun index_bool (Bool) Int)
+
+;; index_bool_True
+ (assert (= (index_bool true) 0))
+
+;; index_bool_False
+ (assert (= (index_bool false) 1))
+
+(declare-sort tuple0 0)
+
+(declare-fun Tuple0 () tuple0)
+
+(declare-fun x () Real)
+
+;; H
+ (assert (<= (- 1000000000.0) x))
+
+;; H
+ (assert (<= x 100000000.0))
+
+(assert
+;; Floor_ceil_invalid
+ ;; File "test.mlw", line 14, characters 5-23
+ (not (= (to_int x) (to_int (colibri_ceil x)))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/test-Top-G2_invalid.smt2 b/src_colibri2/tests/solve/colibri/sat/test-Top-G2_invalid.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..67bbcbb0f74c70382c59612ad916f23a624a2d97
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/test-Top-G2_invalid.smt2
@@ -0,0 +1,35 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+;;; SMT-LIB2: real arithmetic
+(declare-sort string 0)
+
+(declare-fun index_bool (Bool) Int)
+
+;; index_bool_True
+ (assert (= (index_bool true) 0))
+
+;; index_bool_False
+ (assert (= (index_bool false) 1))
+
+(declare-sort tuple0 0)
+
+(declare-fun Tuple0 () tuple0)
+
+(declare-fun x () Real)
+
+;; H
+ (assert (<= (- 1000000000.0) x))
+
+;; H
+ (assert (<= x 100000000.0))
+
+(assert
+;; G2_invalid
+ ;; File "test.mlw", line 13, characters 5-15
+ (not (= (to_int x) (to_int (colibri_ceil x)))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow2_invalid.smt2 b/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow2_invalid.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..70695602142e9d6d3f2361812a4f23a3aa87a150
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow2_invalid.smt2
@@ -0,0 +1,28 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+(declare-sort string 0)
+
+(declare-fun index_bool (Bool) Int)
+
+;; index_bool_True
+ (assert (= (index_bool true) 0))
+
+;; index_bool_False
+ (assert (= (index_bool false) 1))
+
+(declare-sort tuple0 0)
+
+(declare-fun Tuple0 () tuple0)
+
+(declare-fun x () Int)
+
+(assert
+;; Int_Pow2_invalid
+ ;; File "test.mlw", line 8, characters 5-21
+ (not (<= (colibri_pow_int_int 2 1025) x)))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow_invalid.smt2 b/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow_invalid.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..9417c3dc1cc8771d4ad075f93f23391109112f5d
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/test-Top-Int_Pow_invalid.smt2
@@ -0,0 +1,28 @@
+;; produced by colibri.drv ;;
+(set-logic ALL)
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 sat)
+;;; generated by SMT-LIB2 driver
+;;; SMT-LIB2 driver: bit-vectors, common part
+;;; SMT-LIB2: integer arithmetic
+(declare-sort string 0)
+
+(declare-fun index_bool (Bool) Int)
+
+;; index_bool_True
+ (assert (= (index_bool true) 0))
+
+;; index_bool_False
+ (assert (= (index_bool false) 1))
+
+(declare-sort tuple0 0)
+
+(declare-fun Tuple0 () tuple0)
+
+(declare-fun x () Int)
+
+(assert
+;; Int_Pow_invalid
+ ;; File "test.mlw", line 7, characters 5-20
+ (not (<= x (colibri_pow_int_int 2 1025))))
+(check-sat)
diff --git a/src_colibri2/tests/solve/colibri/sat/underflow_1.smt2 b/src_colibri2/tests/solve/colibri/sat/underflow_1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..269b8005e61781507383f78280f23004eb6e5b14
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/underflow_1.smt2
@@ -0,0 +1,18 @@
+(set-info :smt-lib-version 2.6)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda and Martin Brain|)
+(set-info :category "crafted")
+(set-info :status sat)
+(set-info :status-colibri2 steplimitreached)
+(define-fun is_finite ((f Float32)) Bool (or (fp.isNormal f) (fp.isZero f) (fp.isSubnormal f)))
+(define-fun f0 () Float32 ((_ to_fp 8 24) #x00000000))
+(declare-fun a () Float32)
+(declare-fun b () Float32)
+(assert (is_finite a))
+(assert (is_finite b))
+(assert (fp.gt a f0))
+(assert (fp.gt b f0))
+(assert (not (fp.gt (fp.mul RNE a b) f0)))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/sat/zeros_count_1.smt2 b/src_colibri2/tests/solve/colibri/sat/zeros_count_1.smt2
new file mode 100644
index 0000000000000000000000000000000000000000..7095aa9b3d4f904ad5f3a03444b03a4c61157371
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/sat/zeros_count_1.smt2
@@ -0,0 +1,14 @@
+(set-info :smt-lib-version 2.6)
+(set-info :status-colibri2 steplimitreached)
+;;; Processed by pysmt to remove constant-real bitvector literals
+(set-logic QF_FP)
+(set-info :source |SPARK inspired floating point problems by Florian Schanda|)
+(set-info :category "crafted")
+(set-info :status sat)
+(declare-fun a () Float32)
+(declare-fun b () Float32)
+(assert (fp.isZero a))
+(assert (fp.isZero b))
+(assert (distinct a b))
+(check-sat)
+(exit)
diff --git a/src_colibri2/tests/solve/colibri/unsat/dune b/src_colibri2/tests/solve/colibri/unsat/dune
new file mode 100644
index 0000000000000000000000000000000000000000..959922d115ac3b89aec38904a6221b2730b37e08
--- /dev/null
+++ b/src_colibri2/tests/solve/colibri/unsat/dune
@@ -0,0 +1,12 @@
+(include dune.inc)
+
+(rule
+ (alias runtest)
+ (deps
+ (glob_files *.cnf)
+ (glob_files *.smt2))
+ (action
+ (with-stdout-to
+ dune.inc
+ (run %{exe:../../../generate_tests/generate_dune_tests.exe} . unsat)))
+ (mode promote))
diff --git a/src_colibri2/tests/solve/colibri/unsat/dune.inc b/src_colibri2/tests/solve/colibri/unsat/dune.inc
new file mode 100644
index 0000000000000000000000000000000000000000..e69de29bb2d1d6434b8b29ae775ad8c2e48c5391
diff --git a/src_colibri2/theories/LRA/realValue.ml b/src_colibri2/theories/LRA/realValue.ml
index 7e052a91889923d473517631cbe39801937e42ee..063b2c090d09dad0f33c804f64fc58bf7d70dd7b 100644
--- a/src_colibri2/theories/LRA/realValue.ml
+++ b/src_colibri2/theories/LRA/realValue.ml
@@ -23,7 +23,17 @@ open Colibri2_popop_lib
open Colibri2_stdlib.Std
module Builtin = struct
- type _ Expr.t += BV2Nat of int | Pow_int_int
+ type _ Expr.t += BV2Nat of int | Pow_int_int | Int2BV of int
+
+ let parse_int _env _ast s =
+ match int_of_string s with
+ | i when i >= 0 -> i
+ | _ ->
+ invalid_arg "a positive integer"
+ (* Type._error env (Ast ast)
+ * (Type.Expected ("a positive integer", None)) *)
+ | exception Failure _ -> invalid_arg "a positive integer"
+ (* Type._error env (Ast ast) (Type.Expected ("a positive integer", None)) *)
let abs_real =
Expr.Id.mk ~name:"colibri_abs_real" ~builtin:Expr.Abs
@@ -38,7 +48,12 @@ module Builtin = struct
let colibri_ceil =
Expr.Id.mk ~name:"colibri_ceil" ~builtin:Expr.Ceiling
(Dolmen_std.Path.global "colibri_ceil")
- (Expr.Ty.arrow [ Expr.Ty.int ] Expr.Ty.int)
+ (Expr.Ty.arrow [ Expr.Ty.real ] Expr.Ty.real)
+
+ let colibri_floor =
+ Expr.Id.mk ~name:"colibri_floor" ~builtin:Expr.Floor
+ (Dolmen_std.Path.global "colibri_floor")
+ (Expr.Ty.arrow [ Expr.Ty.real ] Expr.Ty.real)
let colibri_pow_int_int =
Expr.Id.mk ~name:"colibri_pow_int_int" ~builtin:Pow_int_int
@@ -55,6 +70,11 @@ module Builtin = struct
(Dolmen_std.Path.global "colibri_crem")
(Expr.Ty.arrow [ Expr.Ty.int; Expr.Ty.int ] Expr.Ty.int)
+ let int2bv n =
+ Expr.Id.mk ~name:"int2bv" ~builtin:(Int2BV n)
+ (Dolmen_std.Path.global "int2bv")
+ (Expr.Ty.arrow [ Expr.Ty.int ] (Expr.Ty.bitv n))
+
let bv2nat =
Popop_stdlib.DInt.H.memo
(fun n ->
@@ -96,6 +116,8 @@ module Builtin = struct
app2 env s colibri_pow_int_int
| Dolmen_loop.Typer.T.Id { ns = Term; name = Simple "colibri_cdiv" } ->
app2 env s colibri_cdiv
+ | Dolmen_loop.Typer.T.Id { ns = Term; name = Simple "colibri_ceil" } ->
+ app1 env s colibri_ceil
| Dolmen_loop.Typer.T.Id { ns = Term; name = Simple "colibri_crem" } ->
app2 env s colibri_crem
| Dolmen_loop.Typer.T.Id { ns = Term; name = Simple "bv2nat" } ->
@@ -105,6 +127,13 @@ module Builtin = struct
env s
(fun a ->
Expr.Term.apply_cst (bv2nat (match_bitv_type a)) [] [ a ]))
+ | Dolmen_loop.Typer.T.Id
+ {
+ ns = Term;
+ name = Indexed { basename = "int2bv"; indexes = [ n ] };
+ } ->
+ let n = parse_int env s n in
+ app1 env s (int2bv n)
| _ -> `Not_found)
end
@@ -301,6 +330,12 @@ module Check = struct
| { app = { builtin = Expr.Abs }; tyargs = []; args; _ } ->
let a = IArray.extract1_exn args in
!<(Q.abs !>a)
+ | { app = { builtin = Expr.Ceiling }; tyargs = []; args; _ } ->
+ let a = IArray.extract1_exn args in
+ !<(Q.ceil !>a)
+ | { app = { builtin = Expr.Floor }; tyargs = []; args; _ } ->
+ let a = IArray.extract1_exn args in
+ !<(Q.floor !>a)
| { app = { builtin = Expr.Bitvec s }; tyargs = []; args; ty = _ } ->
assert (IArray.is_empty args);
from_bitv (String.length s) (Z.of_string_base 2 s)
@@ -450,6 +485,9 @@ module Check = struct
| { app = { builtin = Builtin.BV2Nat n }; tyargs = []; args; _ } ->
let a = IArray.extract1_exn args in
!<(Q.of_bigint (bitv n a))
+ | { app = { builtin = Builtin.Int2BV n }; tyargs = []; args; _ } ->
+ let a = IArray.extract1_exn args in
+ extract n !>a.num
| _ -> `None
let init d =