warning: Ignored call to stop/6 in equation start/6 
warning: Ignored call to loop_cont_lbl71/6 in equation start/6 
Inferred cost of cut(A,B,C,D,E,F,G,H,I,J,K,L,M): 
cut(A,B,C,D,E,F,G,H,I,J,K,L,M):[15]: 1
  with precondition: [G=0,J=1,A=B,A=C+1,K=D,M=F,A=H,A=I,E=L,E>=1,A>=E+2] 

cut(A,B,C,D,E,F,G,H,I,J,K,L,M):[16]: 0
  with precondition: [G=1,A=B,A=C+1,K=D,M=F,A=H,A=I,A=J+1,E=L,E>=1,A>=E+2] 

Inferred cost of lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M): 
lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M):[21]: 1
  with precondition: [A=2,B=2,C=1,E=0,G=1,H=2,I=2,J=1,L=1,K=D,M=F] 

lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M):[[18,19],20]: 1+it1*(1)+it2*(2)
  Such that:it1=<nat(min([1*A+ -1*E+ -2,1*B+ -1*E+ -2]))*min([1*A+ -2,1*B+ -2])+min([1*A+ -1*C+ -1,1*B+ -1*C+ -1]),it2=<-1*E+1*A+ -3,it2=<-1*E+1*B+ -3,it2=<1*A+ -1*E+ -2,it2=<1*B+ -1*E+ -2
  with precondition: [G=1,A=B,C>=1,E>=0,A>=C+1,A>=E+3] 

lbl71(A,B,C,D,E,F,G,H,I,J,K,L,M):[[18,19],21]: 1+it1*(1)+it2*(2)
  Such that:it1=<nat(min([1*H+ -2,1*I+ -2,1*J+ -1,1*L+ -1,1*A+ -1*E+ -2,1*B+ -1*E+ -2,1*I+ -1*E+ -2]))*min([1*A+ -2,1*B+ -2,1*H+ -2,1*I+ -2,1*J+ -1,1*L+ -1])+min([1*H+ -2,1*I+ -2,1*J+ -1,1*L+ -1,1*A+ -1*C+ -1,1*B+ -1*C+ -1,1*I+ -1*C+ -1]),it2=<1*H+ -2,it2=<1*I+ -2,it2=<1*J+ -1,it2=<1*L+ -1,it2=<1*A+ -1*E+ -2,it2=<1*B+ -1*E+ -2,it2=<1*I+ -1*E+ -2
  with precondition: [G=1,A=B,A=H,A=I,A=J+1,D=K,A=L+1,F=M,A>=3,C>=1,E>=0,A>=C+1,A>=E+2,2*A>=C+E+4] 

Inferred cost of start(A,B,C,D,E,F): 
start(A,B,C,D,E,F):[23]: 1
  with precondition: [B=A,D=C,F=E,1>=B] 

start(A,B,C,D,E,F):[24]: 2
  with precondition: [A=2,B=2,D=C,F=E] 

start(A,B,C,D,E,F):[25]: 2+it1*(1)+it2*(2)
  Such that:it1=<nat(min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])]))*min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])])+min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])]),it2=<1*A+ -3,it2=<1*A+ -2,it2=<1*B+ -3,it2=<1*B+ -2
  with precondition: [B=A,D=C,F=E,B>=3] 

start(A,B,C,D,E,F):[26]: 2+it1*(1)+it2*(2)
  Such that:it1=<nat(min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])]))*min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])])+min([min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2]),min([1*A+ -2,1*B+ -2])]),it2=<1*A+ -2,it2=<1*B+ -2
  with precondition: [B=A,D=C,F=E,B>=3] 

Inferred cost of start0(A,B,C,D,E,F): 
start0(A,B,C,D,E,F):[28]: 2
  with precondition: [1>=A] 

start0(A,B,C,D,E,F):[29]: 3
  with precondition: [A=2] 

start0(A,B,C,D,E,F):[30]: 3+it1*(1)+it2*(2)
  Such that:it1=<nat(min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])]))*min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])])+min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])]),it2=<1*A+ -3,it2=<1*A+ -2
  with precondition: [A>=3] 

start0(A,B,C,D,E,F):[31]: 3+it1*(1)+it2*(2)
  Such that:it1=<nat(min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])]))*min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])])+min([min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2]),min([1*A+ -2,1*A+ -2])]),it2=<1*A+ -2
  with precondition: [A>=3] 

Solved cost expressions of start0(A,B,C,D,E,F): 
start0(A,B,C,D,E,F):[28]: 2  with precondition: [1>=A] 
start0(A,B,C,D,E,F):[29]: 3  with precondition: [A=2] 
start0(A,B,C,D,E,F):[30]: 2*A+ -6+nat(1*A+ -2+ (1*A+ -2)* (1*A+ -2))+3  with precondition: [A>=3] 
start0(A,B,C,D,E,F):[31]: 2*A+ -4+nat(1*A+ -2+ (1*A+ -2)* (1*A+ -2))+3  with precondition: [A>=3] 
Maximum cost of start0(A,B,C,D,E,F): max([3,2*A+ -6+nat(1*A+ -2+ (1*A+ -2)* (1*A+ -2))+3,2*A+ -4+nat(1*A+ -2+ (1*A+ -2)* (1*A+ -2))+3]) 
Asymptotic class: n^2 
Time statistics: 
Partial evaluation computed in 12 ms.
Invariants computed in 42 ms.
----Backward Invariants 21 ms.
----Transitive Invariants 4 ms.
Refinement performed in 39 ms.
Termination proved in 16 ms.
Upper bounds computed in 140 ms.
----Phase cost structures 57 ms.
--------Equation cost structures 48 ms.
--------Inductive compression(1) 0 ms.
--------Inductive compression(2) 0 ms.
--------Black Cost 0 ms.
----Chain cost structures 76 ms.
----Solving cost expressions 1 ms.

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