warning: Ignored call to f8/12 in equation f0/12 warning: Ignored call to f8/12 in equation f0/12 warning: Ignored call to f8/12 in equation f3/12 Inferred cost of f3(A,B,C,D,E,F,G,H,I,J,K,L): f3(A,B,C,D,E,F,G,H,I,J,K,L):[17]: 1 with precondition: [B=A] f3(A,B,C,D,E,F,G,H,I,J,K,L):[[15],17]: 1+it1*(2) Such that:it1=<1*A+ -1*B with precondition: [A>=B+1] f3(A,B,C,D,E,F,G,H,I,J,K,L):[[16],17]: 1+it1*(2) Such that:it1=<1*B+ -1*A with precondition: [B>=A+1] Inferred cost of f0(A,B,C,D,E,F,G,H,I,J,K,L): f0(A,B,C,D,E,F,G,H,I,J,K,L):[19]: 2 with precondition: [B=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[20]: 2+it1*(2) Such that:it1=<1*A+ -1*B with precondition: [A>=B+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[21]: 2+it1*(2) Such that:it1=<1*B+ -1*A with precondition: [B>=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[22]: 3 with precondition: [B=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[23]: 3+it1*(2) Such that:it1=<1*B+ -1*A+ -1 with precondition: [B>=A+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[24]: 3 with precondition: [B+1=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[25]: 3+it1*(2) Such that:it1=<1*A+ -1*B+ -1 with precondition: [A>=B+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[26]: 3+it1*(2) Such that:it1=<1 with precondition: [B=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[27]: 1 with precondition: [] f0(A,B,C,D,E,F,G,H,I,J,K,L):[28]: 2 with precondition: [F=D] f0(A,B,C,D,E,F,G,H,I,J,K,L):[29]: 2+it1*(2) Such that:it1=<1*F+ -1*D with precondition: [F>=D+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[30]: 2+it1*(2) Such that:it1=<1*D+ -1*F with precondition: [D>=F+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[31]: 2 with precondition: [F=D] f0(A,B,C,D,E,F,G,H,I,J,K,L):[32]: 2+it1*(2) Such that:it1=<1*F+ -1*D with precondition: [F>=D+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[33]: 2+it1*(2) Such that:it1=<1*D+ -1*F with precondition: [D>=F+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[34]: 1 with precondition: [] f0(A,B,C,D,E,F,G,H,I,J,K,L):[35]: 2 with precondition: [B=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[36]: 2+it1*(2) Such that:it1=<1*A+ -1*B+1 with precondition: [A>=B] f0(A,B,C,D,E,F,G,H,I,J,K,L):[37]: 2+it1*(2) Such that:it1=<1*B+ -1*A+ -1 with precondition: [B>=A+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[38]: 2 with precondition: [B+1=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[39]: 2+it1*(2) Such that:it1=<1*A+ -1*B+ -1 with precondition: [A>=B+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[40]: 2+it1*(2) Such that:it1=<1*B+ -1*A+1 with precondition: [B>=A] Solved cost expressions of f0(A,B,C,D,E,F,G,H,I,J,K,L): f0(A,B,C,D,E,F,G,H,I,J,K,L):[19]: 2 with precondition: [B=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[20]: 2*A+ -2*B+2 with precondition: [A>=B+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[21]: -2*A+2*B+2 with precondition: [B>=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[22]: 3 with precondition: [B=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[23]: -2*A+2*B+1 with precondition: [B>=A+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[24]: 3 with precondition: [B+1=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[25]: 2*A+ -2*B+1 with precondition: [A>=B+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[26]: 5 with precondition: [B=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[27]: 1 with precondition: [] f0(A,B,C,D,E,F,G,H,I,J,K,L):[28]: 2 with precondition: [F=D] f0(A,B,C,D,E,F,G,H,I,J,K,L):[29]: -2*D+2*F+2 with precondition: [F>=D+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[30]: 2*D+ -2*F+2 with precondition: [D>=F+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[31]: 2 with precondition: [F=D] f0(A,B,C,D,E,F,G,H,I,J,K,L):[32]: -2*D+2*F+2 with precondition: [F>=D+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[33]: 2*D+ -2*F+2 with precondition: [D>=F+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[34]: 1 with precondition: [] f0(A,B,C,D,E,F,G,H,I,J,K,L):[35]: 2 with precondition: [B=A+1] f0(A,B,C,D,E,F,G,H,I,J,K,L):[36]: 2*A+ -2*B+4 with precondition: [A>=B] f0(A,B,C,D,E,F,G,H,I,J,K,L):[37]: -2*A+2*B with precondition: [B>=A+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[38]: 2 with precondition: [B+1=A] f0(A,B,C,D,E,F,G,H,I,J,K,L):[39]: 2*A+ -2*B with precondition: [A>=B+2] f0(A,B,C,D,E,F,G,H,I,J,K,L):[40]: -2*A+2*B+4 with precondition: [B>=A] Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,L): max([2*D+ -2*F+2,-2*D+2*F+2,5,-2*A+2*B+4,2*A+ -2*B+4]) Asymptotic class: n Time statistics: Partial evaluation computed in 17 ms. Invariants computed in 21 ms. ----Backward Invariants 9 ms. ----Transitive Invariants 5 ms. Refinement performed in 30 ms. Termination proved in 8 ms. Upper bounds computed in 39 ms. ----Phase cost structures 14 ms. --------Equation cost structures 14 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 11 ms. ----Solving cost expressions 3 ms. Compressed phase information: 0 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 142 ms.