warning: Ignored call to f4/3 in equation f3/3 
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):[9]: 1
  with precondition: [D=1,A=E,B=F,0>=A,B>=1] 

f2(A,B,C,D,E,F,G):[[8],9]: 1+it1*(1)
  Such that:it1=<1*A,it1=<1*A+ -1*E
  with precondition: [D=1,0>=E,B>=1,F>=B+1,E+F>=2,A+B+2>=2*F+E] 

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

f3(A,B,C):[12]: 2
  with precondition: [0>=A,B>=1] 

f3(A,B,C):[13]: 2+it1*(1)
  Such that:it1=<1*A,it1=<1*B+2*A+ -2
  with precondition: [A>=1,B>=1] 

Solved cost expressions of f3(A,B,C): 
f3(A,B,C):[11]: 1  with precondition: [0>=B] 
f3(A,B,C):[12]: 2  with precondition: [0>=A,B>=1] 
f3(A,B,C):[13]: 1*A+2  with precondition: [A>=1,B>=1] 
Maximum cost of f3(A,B,C): max([1*A+2,2]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 2 ms.
Invariants computed in 9 ms.
----Backward Invariants 5 ms.
----Transitive Invariants 1 ms.
Refinement performed in 8 ms.
Termination proved in 3 ms.
Upper bounds computed in 11 ms.
----Phase cost structures 3 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: 0 
Compressed Chains: 0 
Compressed invariants: 0 
Total analysis performed in 41 ms.