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


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


MAYBE

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

The dependency graph for this problem is:
  0 -> 3
  1 -> 2
  2 -> 1
  3 -> 2
Where:
  0) f5#(x1, x2) -> f1#(x1, x2) 
  1) f3#(I2, I3) -> f2#(I2, I3) 
  2) f2#(I4, I5) -> f3#(1 + I4, I5) 
  3) f1#(I6, I7) -> f2#(1, 1) 

We have the following SCCs.
  { 1, 2 }

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