/export/starexec/sandbox/solver/bin/starexec_run_Itrs /export/starexec/sandbox/benchmark/theBenchmark.itrs /export/starexec/sandbox/output/output_files


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


MAYBE

DP problem for innermost termination.
P =
  f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1]
  f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1]
R = 
  round(x) -> x + 1 
  round(I0) -> I0 
  f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1]

The dependency graph for this problem is:
  0 -> 0, 1
  1 -> 
Where:
  0) f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1]
  1) f#(I1, y) -> round#(I1) [I1 >= 1 && y = I1 - 1]

We have the following SCCs.
  { 0 }

DP problem for innermost termination.
P =
  f#(I1, y) -> f#(I1, round(I1)) [I1 >= 1 && y = I1 - 1]
R = 
  round(x) -> x + 1 
  round(I0) -> I0 
  f(I1, y) -> f(I1, round(I1)) [I1 >= 1 && y = I1 - 1]