warning: Ignored call to loop_cont_f2/3 in equation f3/3 
Inferred cost of f2(A,B,C,D,E,F,G): 
f2(A,B,C,D,E,F,G):[8]: 1
  with precondition: [D=1,B=F,A+B=E,0>=A+B+1] 

f2(A,B,C,D,E,F,G):[[7],8]: inf
  with precondition: [D=1,B=F,0>=E+1,E>=B,A+2*B>=E] 

f2(A,B,C,D,E,F,G):[[7],9]...: inf
  with precondition: [1>=D,D>=0,A+B>=0] 

Inferred cost of f3(A,B,C): 
f3(A,B,C):[10]: 2
  with precondition: [0>=A+B+1] 

f3(A,B,C):[11]: inf
  with precondition: [0>=B+1,A+B>=0] 

f3(A,B,C):[12]...: inf
  with precondition: [A+B>=0] 

f3(A,B,C):[13]...: inf
  with precondition: [A+B>=0] 

Solved cost expressions of f3(A,B,C): 
f3(A,B,C):[10]: 2  with precondition: [0>=A+B+1] 
f3(A,B,C):[11]: inf  with precondition: [0>=B+1,A+B>=0] 
f3(A,B,C):[12]...: inf  with precondition: [A+B>=0] 
f3(A,B,C):[13]...: inf  with precondition: [A+B>=0] 
Maximum cost of f3(A,B,C): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 2 ms.
Invariants computed in 10 ms.
----Backward Invariants 6 ms.
----Transitive Invariants 1 ms.
Refinement performed in 10 ms.
Termination proved in 2 ms.
Upper bounds computed in 10 ms.
----Phase cost structures 2 ms.
--------Equation cost structures 1 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 5 ms.
----Solving cost expressions 0 ms.

Compressed phase information: 1 
Compressed Chains: 0 
Compressed invariants: 0 
Total analysis performed in 40 ms.