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


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


MAYBE

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

The dependency graph for this problem is:
  0 -> 1
  1 -> 8
  2 -> 4, 5
  3 -> 
  4 -> 6, 7
  5 -> 
  6 -> 
  7 -> 
  8 -> 9, 10, 11
  9 -> 2, 3
  10 -> 12
  11 -> 12
  12 -> 8
Where:
  0) f10#(x1, x2) -> f9#(x1, x2) 
  1) f9#(I0, I1) -> f2#(0, rnd2) [rnd2 = rnd2]
  2) f4#(I2, I3) -> f8#(I2, I3) [0 <= I3]
  3) f4#(I4, I5) -> f5#(I4, I5) [1 + I5 <= 0]
  4) f8#(I6, I7) -> f7#(I6, I7) [1 + I7 <= I6]
  5) f8#(I8, I9) -> f5#(I8, I9) [I8 <= I9]
  6) f7#(I12, I13) -> f5#(I12, I13) 
  7) f7#(I14, I15) -> f5#(I14, I15) 
  8) f2#(I18, I19) -> f3#(I18, I19) 
  9) f3#(I20, I21) -> f4#(I20, I21) 
  10) f3#(I22, I23) -> f1#(I22, I23) 
  11) f3#(I24, I25) -> f1#(I24, I25) 
  12) f1#(I26, I27) -> f2#(1 + I26, I27) 

We have the following SCCs.
  { 8, 10, 11, 12 }

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