WARNING: Excluded non-linear constraints:[<=(A,0)] WARNING: Excluded non-linear constraints:[<=(B,0)] warning: Ignored call to loop_cont_i/3 in equation loop_cont_h/3 Inferred cost of g(A,B,C,D,E,F,G): g(A,B,C,D,E,F,G):[22]: 1 with precondition: [B=1,C=1,D=0,F=1,G=1,E=A] g(A,B,C,D,E,F,G):[23]: 0 with precondition: [B=1,C=1,D=1,F=1,G=1,E=A] g(A,B,C,D,E,F,G):[[21],22]: 1+it1*(1) Such that:it1=<1*A,it1=<1*A+ -1*E with precondition: [C=1,D=0,G=1,B>=1,E>=0,A>=E+1,F+2*E+2>=2*A+2*B] g(A,B,C,D,E,F,G):[[21],23]: 0+it1*(1) Such that:it1=<1*A,it1=<1*A+ -1*E with precondition: [C=1,D=1,G=1,B>=1,E>=0,F>=2*B,A>=E+1] Inferred cost of h(A,B,C,D,E,F,G): h(A,B,C,D,E,F,G):[26]: 1 with precondition: [D=0,E=A,F=B,G=C] h(A,B,C,D,E,F,G):[27]: 0 with precondition: [D=1,E=A,F=B,G=C] h(A,B,C,D,E,F,G):[[25],26]: 1+it1*(1) Such that:it1=<1*B,it1=<1*B+ -1*F with precondition: [D=0,A=E,F>=0,B>=F+1] h(A,B,C,D,E,F,G):[[25],27]: 0+it1*(1) Such that:it1=<1*B,it1=<1*B+ -1*F with precondition: [D=1,A=E,F>=0,B>=F+1] Inferred cost of i(A,B,C,D,E,F,G): i(A,B,C,D,E,F,G):[30]: 0 with precondition: [D=1,E=A,F=B,G=C] i(A,B,C,D,E,F,G):[[29],30]: 0+it1*(1) Such that:it1=<1*C,it1=<1*C+ -1*G with precondition: [D=1,A=E,B=F,G>=0,C>=G+1] Inferred cost of loop_cont_h(A,B,C): loop_cont_h(A,B,C):[32]: 0 with precondition: [] loop_cont_h(A,B,C):[33]: 0+it1*(1) Such that:it1=<1*C with precondition: [C>=1] Inferred cost of loop_cont_g(A,B,C): loop_cont_g(A,B,C):[35]: 1 with precondition: [] loop_cont_g(A,B,C):[36]: 1+it1*(1) Such that:it1=<1*C with precondition: [C>=1] loop_cont_g(A,B,C):[37]: 1+it1*(1) Such that:it1=<1*B with precondition: [B>=1] loop_cont_g(A,B,C):[38]: inf with precondition: [B>=1] loop_cont_g(A,B,C):[39]: 0 with precondition: [] loop_cont_g(A,B,C):[40]: 0+it1*(1) Such that:it1=<1*B with precondition: [B>=1] Inferred cost of f(A,B,C): f(A,B,C):[42]: 3 with precondition: [] f(A,B,C):[43]: 3+it1*(1) Such that:it1=<1 with precondition: [] f(A,B,C):[44]: 3+it1*(1) Such that:it1=<1 with precondition: [] f(A,B,C):[45]: inf with precondition: [] f(A,B,C):[46]: 2 with precondition: [] f(A,B,C):[47]: 2+it1*(1) Such that:it1=<1 with precondition: [] f(A,B,C):[48]: 3+it1*(1) Such that:it1=<1*A with precondition: [A>=1] f(A,B,C):[49]: 3+it1*(1)+it2*(1) Such that:it1=<1*A,it2=<1 with precondition: [A>=1] f(A,B,C):[50]: inf with precondition: [A>=1] f(A,B,C):[51]: inf with precondition: [A>=1] f(A,B,C):[52]: 2+it1*(1) Such that:it1=<1*A with precondition: [A>=1] f(A,B,C):[53]: inf with precondition: [A>=1] f(A,B,C):[54]: 1 with precondition: [] f(A,B,C):[55]: 1+it1*(1) Such that:it1=<1*A with precondition: [A>=1] Solved cost expressions of f(A,B,C): f(A,B,C):[42]: 3 with precondition: [] f(A,B,C):[43]: 4 with precondition: [] f(A,B,C):[44]: 4 with precondition: [] f(A,B,C):[45]: inf with precondition: [] f(A,B,C):[46]: 2 with precondition: [] f(A,B,C):[47]: 3 with precondition: [] f(A,B,C):[48]: 1*A+3 with precondition: [A>=1] f(A,B,C):[49]: 1*A+4 with precondition: [A>=1] f(A,B,C):[50]: inf with precondition: [A>=1] f(A,B,C):[51]: inf with precondition: [A>=1] f(A,B,C):[52]: 1*A+2 with precondition: [A>=1] f(A,B,C):[53]: inf with precondition: [A>=1] f(A,B,C):[54]: 1 with precondition: [] f(A,B,C):[55]: 1*A+1 with precondition: [A>=1] Maximum cost of f(A,B,C): inf Asymptotic class: infinity Time statistics: Partial evaluation computed in 7 ms. Invariants computed in 37 ms. ----Backward Invariants 21 ms. ----Transitive Invariants 3 ms. Refinement performed in 37 ms. Termination proved in 8 ms. Upper bounds computed in 54 ms. ----Phase cost structures 26 ms. --------Equation cost structures 22 ms. --------Inductive compression(1) 0 ms. --------Inductive compression(2) 0 ms. --------Black Cost 0 ms. ----Chain cost structures 20 ms. ----Solving cost expressions 1 ms. Compressed phase information: 3 Compressed Chains: 0 Compressed invariants: 0 Total analysis performed in 165 ms.