warning: Ignored call to evalSimpleMultiplestop/4 in equation evalSimpleMultiplereturnin/4 
Inferred cost of evalSimpleMultiplebb3in(A,B,C,D,E,F,G,H,I): 
evalSimpleMultiplebb3in(A,B,C,D,E,F,G,H,I):[16]: 1
  with precondition: [A=0,B=0,E=0,F=0,G=0,I=D,C=H,0>=C] 

evalSimpleMultiplebb3in(A,B,C,D,E,F,G,H,I):[[14],[15],16]: 1+it1*(3)+it2*(3)
  Such that:it1=<1*C,it1=<1*G,it1=<1*H,it2=<1*D,it2=<1*F,it2=<1*I,it2=<1*I+ -1*A
  with precondition: [B=0,E=0,I=D,I=F,C=G,C=H,A>=0,C>=1,I>=A+1] 

evalSimpleMultiplebb3in(A,B,C,D,E,F,G,H,I):[[15],16]: 1+it1*(3)
  Such that:it1=<1*C,it1=<1*G,it1=<1*H,it1=<1*H+ -1*B
  with precondition: [A=0,E=0,F=0,H=C,H=G,D=I,0>=D,B>=0,H>=B+1] 

Inferred cost of evalSimpleMultiplereturnin(A,B,C,D): 
evalSimpleMultiplereturnin(A,B,C,D):[18]: 1
  with precondition: [] 

Inferred cost of loop_cont_evalSimpleMultiplebb3in(A,B,C,D): 
loop_cont_evalSimpleMultiplebb3in(A,B,C,D):[20]: 1
  with precondition: [] 

Inferred cost of evalSimpleMultipleentryin(A,B,C,D): 
evalSimpleMultipleentryin(A,B,C,D):[22]: 3
  with precondition: [0>=C] 

evalSimpleMultipleentryin(A,B,C,D):[23]: 3+it1*(3)+it2*(3)
  Such that:it1=<1*C,it2=<1*D
  with precondition: [C>=1,D>=1] 

evalSimpleMultipleentryin(A,B,C,D):[24]: 3+it1*(3)
  Such that:it1=<1*C
  with precondition: [0>=D,C>=1] 

Inferred cost of evalSimpleMultiplestart(A,B,C,D): 
evalSimpleMultiplestart(A,B,C,D):[26]: 4
  with precondition: [0>=C] 

evalSimpleMultiplestart(A,B,C,D):[27]: 4+it1*(3)+it2*(3)
  Such that:it1=<1*C,it2=<1*D
  with precondition: [C>=1,D>=1] 

evalSimpleMultiplestart(A,B,C,D):[28]: 4+it1*(3)
  Such that:it1=<1*C
  with precondition: [0>=D,C>=1] 

Solved cost expressions of evalSimpleMultiplestart(A,B,C,D): 
evalSimpleMultiplestart(A,B,C,D):[26]: 4  with precondition: [0>=C] 
evalSimpleMultiplestart(A,B,C,D):[27]: 3*C+3*D+4  with precondition: [C>=1,D>=1] 
evalSimpleMultiplestart(A,B,C,D):[28]: 3*C+4  with precondition: [0>=D,C>=1] 
Maximum cost of evalSimpleMultiplestart(A,B,C,D): max([3*C+3*D+4,4,3*C+4]) 
Asymptotic class: n 
Time statistics: 
Partial evaluation computed in 9 ms.
Invariants computed in 33 ms.
----Backward Invariants 13 ms.
----Transitive Invariants 3 ms.
Refinement performed in 21 ms.
Termination proved in 8 ms.
Upper bounds computed in 63 ms.
----Phase cost structures 13 ms.
--------Equation cost structures 11 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 46 ms.
----Solving cost expressions 1 ms.

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