warning: Ignored call to loop_cont_eval1/2 in equation start/2 
Inferred cost of eval2(A,B,C,D,E): 
eval2(A,B,C,D,E):[13]: 1
  with precondition: [B=1,C=0,E=1,A=D+1,1>=A,A>=0] 

eval2(A,B,C,D,E):[14]: 0
  with precondition: [B=1,C=1,E=1,A=D,A>=0] 

eval2(A,B,C,D,E):[[12],13]: 1+it1*(1)
  Such that:it1=<1*D,it1=<1*A+ -1*B,it1=<1*E+ -1,it1=<1*E+ -1*B,it1=<2*A+ -3,it1=<2*D+ -1,it1=<1*D+ -1*B+1
  with precondition: [C=0,A=D+1,B>=1,E>=2*B,E>=A,2*A>=E+2] 

eval2(A,B,C,D,E):[[12],14]: 0+it1*(1)
  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=1,A=D,B>=1,E>=2*B,2*A>=E+2] 

Inferred cost of eval1(A,B,C,D,E): 
eval1(A,B,C,D,E):[18]: 1
  with precondition: [C=1,A>=0] 

eval1(A,B,C,D,E):[19]: 1+it1*(1)
  Such that:it1=<1*A+ -1,it1=<2*A+ -3
  with precondition: [C=1,A>=2] 

eval1(A,B,C,D,E):[20]: 0
  with precondition: [C=1,D=A,E=B] 

eval1(A,B,C,D,E):[[16],18]: 1+it1*(2)
  Such that:it1=<1,it1=<2
  with precondition: [A=1,C=1] 

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

eval1(A,B,C,D,E):[[17],[16],18]: 1+it1*(2)+it2*(2+it3*(1))
  Such that:it1=<1,it1=<2,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [C=1,A>=2] 

eval1(A,B,C,D,E):[[17],[16],20]: 0+it1*(2)+it2*(2+it3*(1))
  Such that:it1=<2,it1=<-1*D+1,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [C=1,E=1,0>=D,A>=2,D+1>=0] 

eval1(A,B,C,D,E):[[17],18]: 1+it1*(2+it2*(1))
  Such that:it1=<1*A+ -1
            it2=<4*A+ -7,it2=<2*A+ -3,it2=<1*A+ -1
  with precondition: [C=1,A>=2] 

eval1(A,B,C,D,E):[[17],19]: 1+it1*(1)+it2*(2+it3*(1))
  Such that:it1+it2=<1*A+ -1,it1+it2=<2*A+ -4,it2=<1*A+ -1
            it3=<4*A+ -7,it3=<2*A+ -3,it3=<1*A+ -1
  with precondition: [C=1,A>=3] 

eval1(A,B,C,D,E):[[17],20]: 0+it1*(2+it2*(1))
  Such that:it1=<1*A+ -1,it1=<1*A+ -1*D
            it2=<4*A+ -7,it2=<2*A+ -3,it2=<1*A+ -1
  with precondition: [C=1,A>=D+1,E>=D+1,2*D>=E] 

Inferred cost of start(A,B): 
start(A,B):[22]: 2
  with precondition: [A>=0] 

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

start(A,B):[24]: 1
  with precondition: [] 

start(A,B):[25]: 2+it1*(2)
  Such that:it1=<1,it1=<2
  with precondition: [A=1] 

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

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

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

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

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

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

Solved cost expressions of start(A,B): 
start(A,B):[22]: 2  with precondition: [A>=0] 
start(A,B):[23]: 1*A+1  with precondition: [A>=2] 
start(A,B):[24]: 1  with precondition: [] 
start(A,B):[25]: 4  with precondition: [A=1] 
start(A,B):[26]: 2*A+3  with precondition: [1>=A,A>=0] 
start(A,B):[27]: (1*A+1)* (1*A+ -1)+2+2  with precondition: [A>=2] 
start(A,B):[28]: (1*A+1)* (1*A+ -1)+4+1  with precondition: [A>=2] 
start(A,B):[29]: (1*A+1)* (1*A+ -1)+2  with precondition: [A>=2] 
start(A,B):[30]: max([1*A+ -1, (1*A+1)* (1*A+ -1)])+2  with precondition: [A>=3] 
start(A,B):[31]: (1*A+1)* (1*A+ -1)+1  with precondition: [A>=2] 
Maximum cost of start(A,B): max([2*A+3,4,1*A+1,max([1*A+ -1, (1*A+1)* (1*A+ -1)])+2, (1*A+1)* (1*A+ -1)+1, (1*A+1)* (1*A+ -1)+2, (1*A+1)* (1*A+ -1)+2+2, (1*A+1)* (1*A+ -1)+4+1]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 4 ms.
Invariants computed in 45 ms.
----Backward Invariants 24 ms.
----Transitive Invariants 3 ms.
Refinement performed in 22 ms.
Termination proved in 6 ms.
Upper bounds computed in 90 ms.
----Phase cost structures 34 ms.
--------Equation cost structures 25 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 47 ms.
----Solving cost expressions 4 ms.

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