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

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

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

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

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

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