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


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


YES

DP problem for innermost termination.
P =
  f3#(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f1#(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) 
R = 
  f3(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f1(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) 
  f1(I0, I1, I2, I3, I4, I5, I6, I7, I8, I9, I10) -> f2(rnd1, I1, rnd3, rnd4, rnd5, rnd6, rnd7, I1, rnd9, rnd10, rnd11) [rnd1 = rnd1 /\ rnd3 = rnd3 /\ rnd11 = rnd11 /\ rnd9 = rnd9 /\ rnd10 = rnd10 /\ rnd5 = rnd5 /\ rnd4 = rnd4 /\ rnd7 = rnd7 /\ rnd6 = rnd6]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f3#(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) -> f1#(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) 

We have the following SCCs.