warning: Ignored call to loop_cont_f3/2 in equation f1/2 
Inferred cost of f3(A,B,C,D,E): 
f3(A,B,C,D,E):[10]: 0
  with precondition: [C=1,A=B,A=D,A=E,A>=1] 

f3(A,B,C,D,E):[[8,9],10]: 0+it1*(1)+it2*(1)
  Such that:it1=<(1*A+ -1)* (1*A+ -1)+min([1*A,1*B]),it2=<1*A+ -1,it2=<1*A+ -1*D,it2=<(1*A+ -1)* (1*A+ -1)+min([1*A,1*B])+ (-1*B+1)
  with precondition: [C=1,D>=1,E>=0,A>=B,A>=D,A>=E+1] 

Inferred cost of f1(A,B): 
f1(A,B):[12]: 1
  with precondition: [A>=1] 

f1(A,B):[13]: 1+it1*(1)+it2*(1)
  Such that:it1=<(1*A+ -1)* (1*A+ -1)+min([1*A,1*A]),it2=<1*A+ -1,it2=<(1*A+ -1)* (1*A+ -1)+min([1*A,1*A])+min([0,-1*A+1])
  with precondition: [A>=1] 

Solved cost expressions of f1(A,B): 
f1(A,B):[12]: 1  with precondition: [A>=1] 
f1(A,B):[13]: nat((1*A+ -1)* (1*A+ -1)+1*A)+nat(min([1*A+ -1, (1*A+ -1)* (1*A+ -1)+1*A+ (-1*A+1)]))+1  with precondition: [A>=1] 
Maximum cost of f1(A,B): max([1,nat((1*A+ -1)* (1*A+ -1)+1*A)+nat(min([1*A+ -1, (1*A+ -1)* (1*A+ -1)+1*A+ (-1*A+1)]))+1]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 3 ms.
Invariants computed in 11 ms.
----Backward Invariants 4 ms.
----Transitive Invariants 2 ms.
Refinement performed in 9 ms.
Termination proved in 3 ms.
Upper bounds computed in 27 ms.
----Phase cost structures 8 ms.
--------Equation cost structures 6 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 14 ms.
----Solving cost expressions 0 ms.

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