/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 =
  f6#(x1, x2) -> f5#(x1, x2) 
  f5#(I0, I1) -> f2#(0, 99) 
  f2#(I2, I3) -> f3#(I2, I3) 
  f3#(I4, I5) -> f1#(I4, I5) [1 + I4 <= I5]
  f1#(I8, I9) -> f2#(I8, rnd2) [rnd2 = rnd2]
  f1#(I10, I11) -> f2#(rnd1, I11) [rnd1 = rnd1]
R = 
  f6(x1, x2) -> f5(x1, x2) 
  f5(I0, I1) -> f2(0, 99) 
  f2(I2, I3) -> f3(I2, I3) 
  f3(I4, I5) -> f1(I4, I5) [1 + I4 <= I5]
  f3(I6, I7) -> f4(I6, I7) [I7 <= I6]
  f1(I8, I9) -> f2(I8, rnd2) [rnd2 = rnd2]
  f1(I10, I11) -> f2(rnd1, I11) [rnd1 = rnd1]

The dependency graph for this problem is:
  0 -> 1
  1 -> 2
  2 -> 3
  3 -> 4, 5
  4 -> 2
  5 -> 2
Where:
  0) f6#(x1, x2) -> f5#(x1, x2) 
  1) f5#(I0, I1) -> f2#(0, 99) 
  2) f2#(I2, I3) -> f3#(I2, I3) 
  3) f3#(I4, I5) -> f1#(I4, I5) [1 + I4 <= I5]
  4) f1#(I8, I9) -> f2#(I8, rnd2) [rnd2 = rnd2]
  5) f1#(I10, I11) -> f2#(rnd1, I11) [rnd1 = rnd1]

We have the following SCCs.
  { 2, 3, 4, 5 }

DP problem for innermost termination.
P =
  f2#(I2, I3) -> f3#(I2, I3) 
  f3#(I4, I5) -> f1#(I4, I5) [1 + I4 <= I5]
  f1#(I8, I9) -> f2#(I8, rnd2) [rnd2 = rnd2]
  f1#(I10, I11) -> f2#(rnd1, I11) [rnd1 = rnd1]
R = 
  f6(x1, x2) -> f5(x1, x2) 
  f5(I0, I1) -> f2(0, 99) 
  f2(I2, I3) -> f3(I2, I3) 
  f3(I4, I5) -> f1(I4, I5) [1 + I4 <= I5]
  f3(I6, I7) -> f4(I6, I7) [I7 <= I6]
  f1(I8, I9) -> f2(I8, rnd2) [rnd2 = rnd2]
  f1(I10, I11) -> f2(rnd1, I11) [rnd1 = rnd1]