MAYBE

DP problem for innermost termination.
P =
  init#(x1, x2) -> f1#(rnd1, rnd2) 
  f2#(I0, I1) -> f2#(I0 + 1, I1 + 1) [I0 <= I1 - 1]
  f1#(I2, I3) -> f2#(0, 100) 
R = 
  init(x1, x2) -> f1(rnd1, rnd2) 
  f2(I0, I1) -> f2(I0 + 1, I1 + 1) [I0 <= I1 - 1]
  f1(I2, I3) -> f2(0, 100) 

The dependency graph for this problem is:
  0 -> 2
  1 -> 1
  2 -> 1
Where:
  0) init#(x1, x2) -> f1#(rnd1, rnd2) 
  1) f2#(I0, I1) -> f2#(I0 + 1, I1 + 1) [I0 <= I1 - 1]
  2) f1#(I2, I3) -> f2#(0, 100) 

We have the following SCCs.
  { 1 }

DP problem for innermost termination.
P =
  f2#(I0, I1) -> f2#(I0 + 1, I1 + 1) [I0 <= I1 - 1]
R = 
  init(x1, x2) -> f1(rnd1, rnd2) 
  f2(I0, I1) -> f2(I0 + 1, I1 + 1) [I0 <= I1 - 1]
  f1(I2, I3) -> f2(0, 100)