0.00/0.41	MAYBE
0.00/0.41	
0.00/0.41	DP problem for innermost termination.
0.00/0.41	P =
0.00/0.41	  init#(x1, x2) -> f1#(rnd1, rnd2) 
0.00/0.41	  f2#(I0, I1) -> f2#(I0 - 1, I2) [10 <= I0 - 1]
0.00/0.41	  f2#(I3, I4) -> f2#(I3 - 1, I5) [I3 <= 9 /\ 5 <= I3 - 1]
0.00/0.41	  f2#(I6, I7) -> f2#(10, I8) [10 = I6]
0.00/0.41	  f1#(I9, I10) -> f2#(I10, I11) [-1 <= I10 - 1 /\ 0 <= I9 - 1]
0.00/0.41	R = 
0.00/0.41	  init(x1, x2) -> f1(rnd1, rnd2) 
0.00/0.41	  f2(I0, I1) -> f2(I0 - 1, I2) [10 <= I0 - 1]
0.00/0.41	  f2(I3, I4) -> f2(I3 - 1, I5) [I3 <= 9 /\ 5 <= I3 - 1]
0.00/0.41	  f2(I6, I7) -> f2(10, I8) [10 = I6]
0.00/0.41	  f1(I9, I10) -> f2(I10, I11) [-1 <= I10 - 1 /\ 0 <= I9 - 1]
0.00/0.41	
0.00/0.41	The dependency graph for this problem is:
0.00/0.41	  0 -> 4
0.00/0.41	  1 -> 1, 3
0.00/0.41	  2 -> 2
0.00/0.41	  3 -> 3
0.00/0.41	  4 -> 1, 2, 3
0.00/0.41	Where:
0.00/0.41	  0) init#(x1, x2) -> f1#(rnd1, rnd2) 
0.00/0.41	  1) f2#(I0, I1) -> f2#(I0 - 1, I2) [10 <= I0 - 1]
0.00/0.41	  2) f2#(I3, I4) -> f2#(I3 - 1, I5) [I3 <= 9 /\ 5 <= I3 - 1]
0.00/0.41	  3) f2#(I6, I7) -> f2#(10, I8) [10 = I6]
0.00/0.41	  4) f1#(I9, I10) -> f2#(I10, I11) [-1 <= I10 - 1 /\ 0 <= I9 - 1]
0.00/0.41	
0.00/0.41	We have the following SCCs.
0.00/0.41	  { 2 }
0.00/0.41	  { 1 }
0.00/0.41	  { 3 }
0.00/0.41	
0.00/0.41	DP problem for innermost termination.
0.00/0.41	P =
0.00/0.41	  f2#(I6, I7) -> f2#(10, I8) [10 = I6]
0.00/0.41	R = 
0.00/0.41	  init(x1, x2) -> f1(rnd1, rnd2) 
0.00/0.41	  f2(I0, I1) -> f2(I0 - 1, I2) [10 <= I0 - 1]
0.00/0.41	  f2(I3, I4) -> f2(I3 - 1, I5) [I3 <= 9 /\ 5 <= I3 - 1]
0.00/0.41	  f2(I6, I7) -> f2(10, I8) [10 = I6]
0.00/0.41	  f1(I9, I10) -> f2(I10, I11) [-1 <= I10 - 1 /\ 0 <= I9 - 1]
0.00/0.41	
0.00/3.39	EOF