/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) -> f1#(x1, x2, x3) 
R = 
  f3(x1, x2, x3) -> f1(x1, x2, x3) 
  f1(I0, I1, I2) -> f2(I1, I1, I2) [1 + I2 <= 0]
  f1(I3, I4, I5) -> f2(I4, I4, -1 + I5) [0 <= I5]

The dependency graph for this problem is:
  0 -> 
Where:
  0) f3#(x1, x2, x3) -> f1#(x1, x2, x3) 

We have the following SCCs.