/export/starexec/sandbox2/solver/bin/starexec_run_Transition /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

DP problem for innermost termination.
P =
  init#(x1, x2) -> f3#(rnd1, rnd2) 
  f6#(I0, I1) -> f6#(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  f3#(I2, I3) -> f6#(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  f5#(I5, I6) -> f5#(I5 - 1, I7) [0 <= I5 - 1]
  f4#(I8, I9) -> f4#(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  f4#(I11, I12) -> f5#(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  f2#(I15, I16) -> f4#(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  f3#(I19, I20) -> f2#(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  f1#(I23, I24) -> f2#(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]
R = 
  init(x1, x2) -> f3(rnd1, rnd2) 
  f6(I0, I1) -> f6(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  f3(I2, I3) -> f6(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  f5(I5, I6) -> f5(I5 - 1, I7) [0 <= I5 - 1]
  f4(I8, I9) -> f4(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  f4(I11, I12) -> f5(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  f2(I15, I16) -> f4(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  f3(I19, I20) -> f2(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  f1(I23, I24) -> f2(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]

The dependency graph for this problem is:
  0 -> 2, 7
  1 -> 1
  2 -> 1
  3 -> 3
  4 -> 4, 5
  5 -> 3
  6 -> 4, 5
  7 -> 6
  8 -> 6
Where:
  0) init#(x1, x2) -> f3#(rnd1, rnd2) 
  1) f6#(I0, I1) -> f6#(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  2) f3#(I2, I3) -> f6#(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  3) f5#(I5, I6) -> f5#(I5 - 1, I7) [0 <= I5 - 1]
  4) f4#(I8, I9) -> f4#(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  5) f4#(I11, I12) -> f5#(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  6) f2#(I15, I16) -> f4#(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  7) f3#(I19, I20) -> f2#(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  8) f1#(I23, I24) -> f2#(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]

We have the following SCCs.
  { 1 }
  { 4 }
  { 3 }

DP problem for innermost termination.
P =
  f5#(I5, I6) -> f5#(I5 - 1, I7) [0 <= I5 - 1]
R = 
  init(x1, x2) -> f3(rnd1, rnd2) 
  f6(I0, I1) -> f6(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  f3(I2, I3) -> f6(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  f5(I5, I6) -> f5(I5 - 1, I7) [0 <= I5 - 1]
  f4(I8, I9) -> f4(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  f4(I11, I12) -> f5(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  f2(I15, I16) -> f4(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  f3(I19, I20) -> f2(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  f1(I23, I24) -> f2(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]

We use the basic value criterion with the projection function NU:
  NU[f5#(z1,z2)] = z1

This gives the following inequalities:
  0 <= I5 - 1  ==>  I5 >! I5 - 1

All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed.

DP problem for innermost termination.
P =
  f4#(I8, I9) -> f4#(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
R = 
  init(x1, x2) -> f3(rnd1, rnd2) 
  f6(I0, I1) -> f6(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  f3(I2, I3) -> f6(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  f5(I5, I6) -> f5(I5 - 1, I7) [0 <= I5 - 1]
  f4(I8, I9) -> f4(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  f4(I11, I12) -> f5(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  f2(I15, I16) -> f4(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  f3(I19, I20) -> f2(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  f1(I23, I24) -> f2(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]

We use the basic value criterion with the projection function NU:
  NU[f4#(z1,z2)] = z2

This gives the following inequalities:
  -1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8  ==>  I9 >! I9 - 1

All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed.

DP problem for innermost termination.
P =
  f6#(I0, I1) -> f6#(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
R = 
  init(x1, x2) -> f3(rnd1, rnd2) 
  f6(I0, I1) -> f6(I0 - 1, I1 + 1) [0 <= I1 - 1 /\ 0 <= I0 - 1]
  f3(I2, I3) -> f6(I4, 1) [0 <= I2 - 1 /\ -1 <= I4 - 1 /\ -1 <= I3 - 1]
  f5(I5, I6) -> f5(I5 - 1, I7) [0 <= I5 - 1]
  f4(I8, I9) -> f4(I10, I9 - 1) [-1 <= I10 - 1 /\ 0 <= I8 - 1 /\ 1 <= I9 - 1 /\ I10 + 1 <= I8]
  f4(I11, I12) -> f5(I13, I14) [I13 + 2 <= I11 /\ I12 <= 1 /\ 0 <= I11 - 1]
  f2(I15, I16) -> f4(I17, I18) [-1 <= I18 - 1 /\ 0 <= y1 - 1 /\ I17 <= I15 /\ 0 <= I15 - 1 /\ 0 <= I17 - 1]
  f3(I19, I20) -> f2(I21, I22) [-1 <= I21 - 1 /\ 0 <= I19 - 1]
  f1(I23, I24) -> f2(I25, I26) [-1 <= I25 - 1 /\ -1 <= I23 - 1 /\ I25 <= I23]

We use the basic value criterion with the projection function NU:
  NU[f6#(z1,z2)] = z1

This gives the following inequalities:
  0 <= I1 - 1 /\ 0 <= I0 - 1  ==>  I0 >! I0 - 1

All dependency pairs are strictly oriented, so the entire dependency pair problem may be removed.