/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE DP problem for innermost termination. P = init#(x1, x2) -> f1#(rnd1, rnd2) f3#(I0, I1) -> f3#(I0 - 1, I0 - 1) [I0 = I1] f2#(I2, I3) -> f3#(0, 1) [-1 <= y1 - 1 /\ 0 <= I3 - 1 /\ y1 - 2 * y2 = 0 /\ 0 <= I2 - 1 /\ y1 - 2 * y2 <= 1 /\ 0 <= y1 - 2 * y2] f1#(I4, I5) -> f2#(I4, I5) [-1 <= I6 - 1 /\ 0 <= I5 - 1 /\ I6 - 2 * I7 = 0 /\ 0 <= I4 - 1] f2#(I8, I9) -> f3#(1, 0) [-1 <= I10 - 1 /\ 0 <= I9 - 1 /\ I10 - 2 * I11 = 1 /\ 0 <= I8 - 1 /\ I10 - 2 * I11 <= 1 /\ 0 <= I10 - 2 * I11] f1#(I12, I13) -> f2#(I12, I13) [-1 <= I14 - 1 /\ 0 <= I13 - 1 /\ I14 - 2 * I15 = 1 /\ 0 <= I12 - 1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 - 1, I0 - 1) [I0 = I1] f2(I2, I3) -> f3(0, 1) [-1 <= y1 - 1 /\ 0 <= I3 - 1 /\ y1 - 2 * y2 = 0 /\ 0 <= I2 - 1 /\ y1 - 2 * y2 <= 1 /\ 0 <= y1 - 2 * y2] f1(I4, I5) -> f2(I4, I5) [-1 <= I6 - 1 /\ 0 <= I5 - 1 /\ I6 - 2 * I7 = 0 /\ 0 <= I4 - 1] f2(I8, I9) -> f3(1, 0) [-1 <= I10 - 1 /\ 0 <= I9 - 1 /\ I10 - 2 * I11 = 1 /\ 0 <= I8 - 1 /\ I10 - 2 * I11 <= 1 /\ 0 <= I10 - 2 * I11] f1(I12, I13) -> f2(I12, I13) [-1 <= I14 - 1 /\ 0 <= I13 - 1 /\ I14 - 2 * I15 = 1 /\ 0 <= I12 - 1] The dependency graph for this problem is: 0 -> 3, 5 1 -> 1 2 -> 3 -> 2, 4 4 -> 5 -> 2, 4 Where: 0) init#(x1, x2) -> f1#(rnd1, rnd2) 1) f3#(I0, I1) -> f3#(I0 - 1, I0 - 1) [I0 = I1] 2) f2#(I2, I3) -> f3#(0, 1) [-1 <= y1 - 1 /\ 0 <= I3 - 1 /\ y1 - 2 * y2 = 0 /\ 0 <= I2 - 1 /\ y1 - 2 * y2 <= 1 /\ 0 <= y1 - 2 * y2] 3) f1#(I4, I5) -> f2#(I4, I5) [-1 <= I6 - 1 /\ 0 <= I5 - 1 /\ I6 - 2 * I7 = 0 /\ 0 <= I4 - 1] 4) f2#(I8, I9) -> f3#(1, 0) [-1 <= I10 - 1 /\ 0 <= I9 - 1 /\ I10 - 2 * I11 = 1 /\ 0 <= I8 - 1 /\ I10 - 2 * I11 <= 1 /\ 0 <= I10 - 2 * I11] 5) f1#(I12, I13) -> f2#(I12, I13) [-1 <= I14 - 1 /\ 0 <= I13 - 1 /\ I14 - 2 * I15 = 1 /\ 0 <= I12 - 1] We have the following SCCs. { 1 } DP problem for innermost termination. P = f3#(I0, I1) -> f3#(I0 - 1, I0 - 1) [I0 = I1] R = init(x1, x2) -> f1(rnd1, rnd2) f3(I0, I1) -> f3(I0 - 1, I0 - 1) [I0 = I1] f2(I2, I3) -> f3(0, 1) [-1 <= y1 - 1 /\ 0 <= I3 - 1 /\ y1 - 2 * y2 = 0 /\ 0 <= I2 - 1 /\ y1 - 2 * y2 <= 1 /\ 0 <= y1 - 2 * y2] f1(I4, I5) -> f2(I4, I5) [-1 <= I6 - 1 /\ 0 <= I5 - 1 /\ I6 - 2 * I7 = 0 /\ 0 <= I4 - 1] f2(I8, I9) -> f3(1, 0) [-1 <= I10 - 1 /\ 0 <= I9 - 1 /\ I10 - 2 * I11 = 1 /\ 0 <= I8 - 1 /\ I10 - 2 * I11 <= 1 /\ 0 <= I10 - 2 * I11] f1(I12, I13) -> f2(I12, I13) [-1 <= I14 - 1 /\ 0 <= I13 - 1 /\ I14 - 2 * I15 = 1 /\ 0 <= I12 - 1]