warning: Ignored call to evalloopsstop/2 in equation evalloopsreturnin/2 
Inferred cost of evalloopsbb4in(A,B,C,D,E): 
evalloopsbb4in(A,B,C,D,E):[[19],20]: 1+it1*(2)
  Such that:it1=<1*A+ -1*B,it1=<1*D+ -1,it1=<1*D+ -1*B,it1=<1*E+ -1,it1=<1*E+ -1*B,it1=<2*A+ -3,it1=<2*D+ -3
  with precondition: [C=0,A=D,B>=1,E>=2*B,E>=A,2*A>=E+2] 

Inferred cost of evalloopsbb6in(A,B,C,D,E): 
evalloopsbb6in(A,B,C,D,E):[[22],24]: 1+it1*(3)
  Such that:it1=<2,it1=<1*A+1
  with precondition: [C=0,D+1=0,1>=A,A>=0] 

evalloopsbb6in(A,B,C,D,E):[[23],[22],24]: 1+it1*(3)+it2*(4+it3*(2))
  Such that:it1=<2,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [C=0,D+1=0,A>=2] 

Inferred cost of evalloopsreturnin(A,B): 
evalloopsreturnin(A,B):[26]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalloopsbb6in(A,B): 
loop_cont_evalloopsbb6in(A,B):[28]: 1
  with precondition: [] 

Inferred cost of evalloopsentryin(A,B): 
evalloopsentryin(A,B):[30]: 2
  with precondition: [0>=A+1] 

evalloopsentryin(A,B):[31]: 3+it1*(3)
  Such that:it1=<2,it1=<1*A+1
  with precondition: [1>=A,A>=0] 

evalloopsentryin(A,B):[32]: 3+it1*(3)+it2*(4+it3*(2))
  Such that:it1=<2,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [A>=2] 

Inferred cost of evalloopsstart(A,B): 
evalloopsstart(A,B):[34]: 3
  with precondition: [0>=A+1] 

evalloopsstart(A,B):[35]: 4+it1*(3)
  Such that:it1=<2,it1=<1*A+1
  with precondition: [1>=A,A>=0] 

evalloopsstart(A,B):[36]: 4+it1*(3)+it2*(4+it3*(2))
  Such that:it1=<2,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [A>=2] 

Solved cost expressions of evalloopsstart(A,B): 
evalloopsstart(A,B):[34]: 3  with precondition: [0>=A+1] 
evalloopsstart(A,B):[35]: 3*A+7  with precondition: [1>=A,A>=0] 
evalloopsstart(A,B):[36]: (2*A+2)* (1*A+ -1)+6+4  with precondition: [A>=2] 
Maximum cost of evalloopsstart(A,B): max([3*A+7,3, (2*A+2)* (1*A+ -1)+6+4]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 10 ms.
Invariants computed in 24 ms.
----Backward Invariants 9 ms.
----Transitive Invariants 3 ms.
Refinement performed in 17 ms.
Termination proved in 5 ms.
Upper bounds computed in 41 ms.
----Phase cost structures 19 ms.
--------Equation cost structures 15 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 17 ms.
----Solving cost expressions 1 ms.

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