/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 =
  cond#(true, I0) -> f91#(f91(I0 + 11)) 
  cond#(true, I0) -> f91#(I0 + 11) 
  f91#(I1) -> cond#(I1 <= 100, I1) 
R = 
  cond(false, n) -> n - 10 
  cond(true, I0) -> f91(f91(I0 + 11)) 
  f91(I1) -> cond(I1 <= 100, I1) 

This problem is converted using chaining, where edges between chained DPs are removed.

DP problem for innermost termination.
P =
  cond#(true, I0) -> f91#(f91(I0 + 11)) 
  cond#(true, I0) -> f91#(I0 + 11) 
  f91#(I1) -> cond#(I1 <= 100, I1) 
  f91#(I1) -> f91#(f91(I1 + 11)) [I1 <= 100]
  f91#(I1) -> f91#(I1 + 11) [I1 <= 100]
R = 
  cond(false, n) -> n - 10 
  cond(true, I0) -> f91(f91(I0 + 11)) 
  f91(I1) -> cond(I1 <= 100, I1) 

The dependency graph for this problem is:
  0 -> 4, 3, 2
  1 -> 4, 3, 2
  2 -> 
  3 -> 4, 3, 2
  4 -> 4, 2, 3
Where:
  0) cond#(true, I0) -> f91#(f91(I0 + 11)) 
  1) cond#(true, I0) -> f91#(I0 + 11) 
  2) f91#(I1) -> cond#(I1 <= 100, I1) 
  3) f91#(I1) -> f91#(f91(I1 + 11)) [I1 <= 100]
  4) f91#(I1) -> f91#(I1 + 11) [I1 <= 100]

We have the following SCCs.
  { 3, 4 }

DP problem for innermost termination.
P =
  f91#(I1) -> f91#(f91(I1 + 11)) [I1 <= 100]
  f91#(I1) -> f91#(I1 + 11) [I1 <= 100]
R = 
  cond(false, n) -> n - 10 
  cond(true, I0) -> f91(f91(I0 + 11)) 
  f91(I1) -> cond(I1 <= 100, I1)