warning: Ignored call to f4/14 in equation f3/14 
warning: Ignored call to f4/14 in equation f3/14 
warning: Ignored call to loop_cont_f1/14 in equation f3/14 
Inferred cost of f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1): 
f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1):[10]: 1
  with precondition: [A=2,B=2,H=2,O=1,C=E,U=F,V=G,C=I,B1=M,C1=N,C=A1,W>=2,Q>=W] 

f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1):[[9],10]: 1+it1*(1)
  Such that:it1=<1*A+ -1*B,it1=<1*H+ -2,it1=<1*H+ -1*B,it1=<1*V+ -1
  with precondition: [O=1,C=E,A=H,A=V+1,M=B1,N=C1,B>=2,W>=2,A>=B+1,Q>=W] 

Inferred cost of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N): 
f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[12]: 1
  with precondition: [] 

f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[13]: 1
  with precondition: [] 

f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[14]: 2
  with precondition: [] 

f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[15]: inf
  with precondition: [] 

Solved cost expressions of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N): 
f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[12]: 1  with precondition: [] 
f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[13]: 1  with precondition: [] 
f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[14]: 2  with precondition: [] 
f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N):[15]: inf  with precondition: [] 
Maximum cost of f3(A,B,C,D,E,F,G,H,I,J,K,L,M,N): inf 
Asymptotic class: infinity 
Time statistics: 
Partial evaluation computed in 10 ms.
Invariants computed in 34 ms.
----Backward Invariants 12 ms.
----Transitive Invariants 7 ms.
Refinement performed in 27 ms.
Termination proved in 22 ms.
Upper bounds computed in 27 ms.
----Phase cost structures 5 ms.
--------Equation cost structures 5 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 18 ms.
----Solving cost expressions 1 ms.

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