1.13/1.13 MAYBE 1.13/1.13 1.13/1.13 Preprocessing Cost Relations 1.13/1.13 ===================================== 1.13/1.13 1.13/1.13 #### Computed strongly connected components 1.13/1.13 0. recursive : [f14/9] 1.13/1.13 1. recursive : [f10/9,f14_loop_cont/10] 1.13/1.13 2. recursive : [f10_loop_cont/10,f6/9] 1.13/1.13 3. non_recursive : [exit_location/1] 1.13/1.13 4. non_recursive : [f25/5] 1.13/1.13 5. non_recursive : [f6_loop_cont/6] 1.13/1.13 6. non_recursive : [f0/5] 1.13/1.13 1.13/1.13 #### Obtained direct recursion through partial evaluation 1.13/1.13 0. SCC is partially evaluated into f14/9 1.13/1.13 1. SCC is partially evaluated into f10/9 1.13/1.13 2. SCC is partially evaluated into f6/9 1.13/1.13 3. SCC is completely evaluated into other SCCs 1.13/1.13 4. SCC is completely evaluated into other SCCs 1.13/1.13 5. SCC is partially evaluated into f6_loop_cont/6 1.13/1.13 6. SCC is partially evaluated into f0/5 1.13/1.13 1.13/1.13 Control-Flow Refinement of Cost Relations 1.13/1.13 ===================================== 1.13/1.13 1.13/1.13 ### Specialization of cost equations f14/9 1.13/1.13 * CE 16 is refined into CE [17] 1.13/1.13 * CE 15 is refined into CE [18] 1.13/1.13 * CE 14 is refined into CE [19] 1.13/1.13 * CE 13 is refined into CE [20] 1.13/1.13 * CE 12 is refined into CE [21] 1.13/1.13 1.13/1.13 1.13/1.13 ### Cost equations --> "Loop" of f14/9 1.13/1.13 * CEs [19] --> Loop 17 1.13/1.13 * CEs [20] --> Loop 18 1.13/1.13 * CEs [21] --> Loop 19 1.13/1.13 * CEs [17] --> Loop 20 1.13/1.13 * CEs [18] --> Loop 21 1.13/1.13 1.13/1.13 ### Ranking functions of CR f14(A,B,C,D,F,G,H,I,J) 1.13/1.13 * RF of phase [17,18,19]: [C] 1.13/1.13 1.13/1.13 #### Partial ranking functions of CR f14(A,B,C,D,F,G,H,I,J) 1.13/1.13 * Partial RF of phase [17,18,19]: 1.13/1.13 - RF of loop [17:1,18:1]: 1.13/1.13 A-1 1.13/1.13 - RF of loop [17:1,18:1,19:1]: 1.13/1.13 C 1.13/1.13 1.13/1.13 1.13/1.13 ### Specialization of cost equations f10/9 1.13/1.13 * CE 10 is refined into CE [22] 1.13/1.13 * CE 8 is refined into CE [23,24] 1.13/1.13 * CE 11 is refined into CE [25] 1.13/1.13 * CE 9 is refined into CE [26,27] 1.13/1.13 1.13/1.13 1.13/1.13 ### Cost equations --> "Loop" of f10/9 1.13/1.14 * CEs [27] --> Loop 22 1.13/1.14 * CEs [26] --> Loop 23 1.13/1.14 * CEs [22] --> Loop 24 1.13/1.14 * CEs [24] --> Loop 25 1.13/1.14 * CEs [23] --> Loop 26 1.13/1.14 * CEs [25] --> Loop 27 1.13/1.14 1.13/1.14 ### Ranking functions of CR f10(A,B,C,D,F,G,H,I,J) 1.13/1.14 * RF of phase [22]: [B] 1.13/1.14 * RF of phase [23]: [A+B-2] 1.13/1.14 1.13/1.14 #### Partial ranking functions of CR f10(A,B,C,D,F,G,H,I,J) 1.13/1.14 * Partial RF of phase [22]: 1.13/1.14 - RF of loop [22:1]: 1.13/1.14 B 1.13/1.14 * Partial RF of phase [23]: 1.13/1.14 - RF of loop [23:1]: 1.13/1.14 A+B-2 1.13/1.14 1.13/1.14 1.13/1.14 ### Specialization of cost equations f6/9 1.13/1.14 * CE 4 is refined into CE [28] 1.13/1.14 * CE 2 is refined into CE [29,30,31,32,33,34] 1.13/1.14 * CE 5 is refined into CE [35] 1.13/1.14 * CE 3 is refined into CE [36,37,38,39] 1.13/1.14 1.13/1.14 1.13/1.14 ### Cost equations --> "Loop" of f6/9 1.13/1.14 * CEs [39] --> Loop 28 1.13/1.14 * CEs [38] --> Loop 29 1.13/1.14 * CEs [37] --> Loop 30 1.13/1.14 * CEs [36] --> Loop 31 1.13/1.14 * CEs [28] --> Loop 32 1.13/1.14 * CEs [34] --> Loop 33 1.13/1.14 * CEs [33] --> Loop 34 1.13/1.14 * CEs [32] --> Loop 35 1.13/1.14 * CEs [31] --> Loop 36 1.13/1.14 * CEs [30] --> Loop 37 1.13/1.14 * CEs [29] --> Loop 38 1.13/1.14 * CEs [35] --> Loop 39 1.13/1.14 1.13/1.14 ### Ranking functions of CR f6(A,B,C,D,F,G,H,I,J) 1.13/1.14 * RF of phase [29]: [A] 1.13/1.14 * RF of phase [30]: [A-2] 1.13/1.14 1.13/1.14 #### Partial ranking functions of CR f6(A,B,C,D,F,G,H,I,J) 1.13/1.14 * Partial RF of phase [29]: 1.13/1.14 - RF of loop [29:1]: 1.13/1.14 A 1.13/1.14 * Partial RF of phase [30]: 1.13/1.14 - RF of loop [30:1]: 1.13/1.14 A-2 1.13/1.14 1.13/1.14 1.13/1.14 ### Specialization of cost equations f6_loop_cont/6 1.13/1.14 * CE 6 is refined into CE [40] 1.13/1.14 * CE 7 is refined into CE [41] 1.13/1.14 1.13/1.14 1.13/1.14 ### Cost equations --> "Loop" of f6_loop_cont/6 1.13/1.14 * CEs [40] --> Loop 40 1.13/1.14 * CEs [41] --> Loop 41 1.13/1.14 1.13/1.14 ### Ranking functions of CR f6_loop_cont(A,B,C,D,E,F) 1.13/1.14 1.13/1.14 #### Partial ranking functions of CR f6_loop_cont(A,B,C,D,E,F) 1.13/1.14 1.13/1.14 1.13/1.14 ### Specialization of cost equations f0/5 1.13/1.14 * CE 1 is refined into CE [42,43,44,45,46,47,48,49,50,51,52] 1.13/1.14 1.13/1.14 1.13/1.14 ### Cost equations --> "Loop" of f0/5 1.13/1.14 * CEs [42,43,44,45,46,47,48,49,50,51,52] --> Loop 42 1.13/1.14 1.13/1.14 ### Ranking functions of CR f0(A,B,C,D,F) 1.13/1.14 1.13/1.14 #### Partial ranking functions of CR f0(A,B,C,D,F) 1.13/1.14 1.13/1.14 1.13/1.14 Computing Bounds 1.13/1.14 ===================================== 1.13/1.14 1.13/1.14 #### Cost of chains of f14(A,B,C,D,F,G,H,I,J): 1.13/1.14 * Chain [[17,18,19],21]: 2*it(17)+1*it(19)+0 1.13/1.14 Such that:aux(1) =< A 1.13/1.14 aux(2) =< A-G 1.13/1.14 aux(5) =< C 1.13/1.14 it(17) =< aux(1) 1.13/1.14 it(17) =< aux(2) 1.13/1.14 it(17) =< aux(5) 1.13/1.14 it(19) =< aux(5) 1.13/1.14 1.13/1.14 with precondition: [F=2,I=0,A+B=G+H,B>=0,C>=1,A>=C+1,A>=G,C+G>=A] 1.13/1.14 1.13/1.14 * Chain [[17,18,19],20]: 2*it(17)+1*it(19)+0 1.13/1.14 Such that:aux(1) =< A 1.13/1.14 aux(6) =< C 1.13/1.14 it(17) =< aux(1) 1.13/1.14 it(17) =< aux(6) 1.13/1.14 it(19) =< aux(6) 1.13/1.14 1.13/1.14 with precondition: [F=3,B>=0,C>=1,A>=C+1] 1.13/1.14 1.13/1.14 * Chain [21]: 0 1.13/1.14 with precondition: [F=2,J=D,A=G,B=H,C=I,0>=C,B>=0,A>=C+1] 1.13/1.14 1.13/1.14 * Chain [20]: 0 1.13/1.14 with precondition: [F=3,B>=0,A>=C+1] 1.13/1.14 1.13/1.14 1.13/1.14 #### Cost of chains of f10(A,B,C,D,F,G,H,I,J): 1.13/1.14 * Chain [[23],[22],27]: 2*it(22)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:aux(10) =< A 1.13/1.14 aux(11) =< A+B 1.13/1.14 it(22) =< aux(11) 1.13/1.14 s(12) =< it(22)*aux(10) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(10) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1] 1.13/1.14 1.13/1.14 * Chain [[23],[22],25]: 2*it(22)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:aux(12) =< A 1.13/1.14 aux(13) =< A+B 1.13/1.14 it(22) =< aux(13) 1.13/1.14 s(12) =< it(22)*aux(12) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(12) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1,A+B>=4] 1.13/1.14 1.13/1.14 * Chain [[23],[22],24]: 2*it(22)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:aux(14) =< A 1.13/1.14 aux(15) =< A+B 1.13/1.14 it(22) =< aux(15) 1.13/1.14 s(12) =< it(22)*aux(14) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(14) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=4,G=1,H=0,I=0,A>=2,B>=1] 1.13/1.14 1.13/1.14 * Chain [[23],27]: 1*it(23)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:it(23) =< A+B 1.13/1.14 aux(16) =< A 1.13/1.14 s(12) =< it(23)*aux(16) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(16) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1] 1.13/1.14 1.13/1.14 * Chain [[23],26]: 1*it(23)+2*s(10)+1*s(11)+3*s(16)+0 1.13/1.14 Such that:aux(18) =< A 1.13/1.14 aux(19) =< A+B 1.13/1.14 aux(17) =< aux(18) 1.13/1.14 aux(17) =< aux(19) 1.13/1.14 it(23) =< aux(19) 1.13/1.14 s(16) =< aux(17) 1.13/1.14 s(12) =< it(23)*aux(18) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(18) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1,A+B>=4] 1.13/1.14 1.13/1.14 * Chain [[23],25]: 1*it(23)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:it(23) =< A+B 1.13/1.14 aux(20) =< A 1.13/1.14 s(12) =< it(23)*aux(20) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< aux(20) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1] 1.13/1.14 1.13/1.14 * Chain [[23],24]: 1*it(23)+2*s(10)+1*s(11)+0 1.13/1.14 Such that:aux(9) =< A 1.13/1.14 it(23) =< A+B-G 1.13/1.14 s(13) =< A-G 1.13/1.14 s(13) =< aux(9) 1.13/1.14 s(12) =< it(23)*aux(9) 1.13/1.14 s(10) =< s(12) 1.13/1.14 s(10) =< s(13) 1.13/1.14 s(11) =< s(12) 1.13/1.14 1.13/1.14 with precondition: [F=4,H=0,I=0,B>=1,G>=2,A>=G] 1.13/1.14 1.13/1.14 * Chain [[22],27]: 1*it(22)+0 1.13/1.14 Such that:it(22) =< B 1.13/1.14 1.13/1.14 with precondition: [F=3,1>=A,A>=0,B>=1] 1.13/1.14 1.13/1.14 * Chain [[22],25]: 1*it(22)+0 1.13/1.14 Such that:it(22) =< B 1.13/1.14 1.13/1.14 with precondition: [F=3,1>=A,A>=0,B>=2] 1.13/1.14 1.13/1.14 * Chain [[22],24]: 1*it(22)+0 1.13/1.14 Such that:it(22) =< B 1.13/1.14 1.13/1.14 with precondition: [F=4,H=0,A=G,A=I+1,D=J,1>=A,A>=0,B>=1] 1.13/1.14 1.13/1.14 * Chain [27]: 0 1.13/1.14 with precondition: [F=3,A>=0] 1.13/1.14 1.13/1.14 * Chain [26]: 3*s(16)+0 1.13/1.14 Such that:aux(17) =< A 1.13/1.14 s(16) =< aux(17) 1.13/1.14 1.13/1.14 with precondition: [F=3,A>=2,B>=1] 1.13/1.14 1.13/1.14 * Chain [25]: 0 1.13/1.14 with precondition: [F=3,A>=0,B>=1] 1.13/1.14 1.13/1.14 * Chain [24]: 0 1.13/1.14 with precondition: [F=4,I=C,J=D,A=G,B=H,0>=B,A>=0] 1.13/1.14 1.13/1.14 1.13/1.14 #### Cost of chains of f6(A,B,C,D,F,G,H,I,J): 1.13/1.14 * Chain [[30],[29],39]: 2*it(29)+2*it(30)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(28) =< 2 1.13/1.14 aux(33) =< A 1.13/1.14 it(29) =< aux(28) 1.13/1.14 it(30) =< aux(33) 1.13/1.14 aux(30) =< aux(33) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(33) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(33) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],[29],38]: 1*it(29)+2*it(30)+1*s(52)+2*s(67)+1*s(68)+1*s(73)+0 1.13/1.14 Such that:aux(34) =< 1 1.13/1.14 aux(26) =< 2 1.13/1.14 aux(35) =< A 1.13/1.14 s(73) =< aux(34) 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(34) 1.13/1.14 it(29) =< aux(34) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 it(30) =< aux(35) 1.13/1.14 aux(30) =< aux(35) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(35) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(35) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],[29],36]: 1*it(29)+2*it(30)+1*s(52)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(27) =< 1 1.13/1.14 aux(26) =< 2 1.13/1.14 aux(36) =< A 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(27) 1.13/1.14 it(29) =< aux(27) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 it(30) =< aux(36) 1.13/1.14 aux(30) =< aux(36) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(36) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(36) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],[29],35]: 1*it(29)+2*it(30)+1*s(52)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(27) =< 1 1.13/1.14 aux(26) =< 2 1.13/1.14 aux(37) =< A 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(27) 1.13/1.14 it(29) =< aux(27) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 it(30) =< aux(37) 1.13/1.14 aux(30) =< aux(37) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(37) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(37) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],[29],32]: 2*it(29)+2*it(30)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(38) =< 2 1.13/1.14 aux(39) =< A 1.13/1.14 it(29) =< aux(38) 1.13/1.14 it(30) =< aux(39) 1.13/1.14 aux(30) =< aux(39) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(39) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(39) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=5,G=0,H=0,I+1=0,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],39]: 2*it(30)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(40) =< A 1.13/1.14 it(30) =< aux(40) 1.13/1.14 aux(30) =< aux(40) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(40) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(40) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],38]: 2*it(30)+2*s(67)+1*s(68)+1*s(73)+0 1.13/1.14 Such that:s(73) =< 1 1.13/1.14 aux(41) =< A 1.13/1.14 it(30) =< aux(41) 1.13/1.14 aux(30) =< aux(41) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(41) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(41) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],36]: 2*it(30)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(42) =< A 1.13/1.14 it(30) =< aux(42) 1.13/1.14 aux(30) =< aux(42) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(42) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(42) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],35]: 2*it(30)+2*s(67)+1*s(68)+0 1.13/1.14 Such that:aux(43) =< A 1.13/1.14 it(30) =< aux(43) 1.13/1.14 aux(30) =< aux(43) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(43) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(69) =< it(30)*aux(43) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 s(68) =< s(69) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [[30],34]: 9*it(30)+2*s(67)+4*s(68)+6*s(79)+0 1.13/1.14 Such that:aux(45) =< A 1.13/1.14 it(30) =< aux(45) 1.13/1.14 s(69) =< it(30)*aux(45) 1.13/1.14 s(79) =< s(69) 1.13/1.14 s(79) =< aux(45) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(45) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(45) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],33]: 8*it(30)+2*s(67)+3*s(68)+4*s(90)+0 1.13/1.14 Such that:aux(47) =< A 1.13/1.14 it(30) =< aux(47) 1.13/1.14 s(69) =< it(30)*aux(47) 1.13/1.14 s(90) =< s(69) 1.13/1.14 s(90) =< aux(47) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(47) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(47) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=5] 1.13/1.14 1.13/1.14 * Chain [[30],31,[29],39]: 2*it(29)+4*it(30)+2*s(67)+2*s(68)+2*s(96)+1 1.13/1.14 Such that:aux(28) =< 1 1.13/1.14 aux(49) =< A 1.13/1.14 it(29) =< aux(28) 1.13/1.14 it(30) =< aux(49) 1.13/1.14 s(69) =< it(30)*aux(49) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(49) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(49) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(49) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],31,[29],32]: 2*it(29)+4*it(30)+2*s(67)+2*s(68)+2*s(96)+1 1.13/1.14 Such that:aux(38) =< 1 1.13/1.14 aux(50) =< A 1.13/1.14 it(29) =< aux(38) 1.13/1.14 it(30) =< aux(50) 1.13/1.14 s(69) =< it(30)*aux(50) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(50) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(50) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(50) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=5,G=0,H=0,I+1=0,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],31,39]: 4*it(30)+2*s(67)+2*s(68)+2*s(96)+1 1.13/1.14 Such that:aux(51) =< A 1.13/1.14 it(30) =< aux(51) 1.13/1.14 s(69) =< it(30)*aux(51) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(51) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(51) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(51) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],31,38]: 4*it(30)+2*s(67)+2*s(68)+1*s(73)+2*s(96)+1 1.13/1.14 Such that:s(73) =< 1 1.13/1.14 aux(52) =< A 1.13/1.14 it(30) =< aux(52) 1.13/1.14 s(69) =< it(30)*aux(52) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(52) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(52) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(52) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],31,36]: 4*it(30)+2*s(67)+2*s(68)+2*s(96)+1 1.13/1.14 Such that:aux(53) =< A 1.13/1.14 it(30) =< aux(53) 1.13/1.14 s(69) =< it(30)*aux(53) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(53) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(53) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(53) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[30],31,35]: 4*it(30)+2*s(67)+2*s(68)+2*s(96)+1 1.13/1.14 Such that:aux(54) =< A 1.13/1.14 it(30) =< aux(54) 1.13/1.14 s(69) =< it(30)*aux(54) 1.13/1.14 s(96) =< s(69) 1.13/1.14 s(96) =< aux(54) 1.13/1.14 s(68) =< s(69) 1.13/1.14 aux(30) =< aux(54) 1.13/1.14 s(71) =< it(30)*aux(30) 1.13/1.14 s(70) =< aux(54) 1.13/1.14 s(70) =< s(71) 1.13/1.14 s(67) =< s(69) 1.13/1.14 s(67) =< s(70) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [[29],39]: 2*it(29)+0 1.13/1.14 Such that:aux(28) =< A 1.13/1.14 it(29) =< aux(28) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,2>=A,A>=1] 1.13/1.14 1.13/1.14 * Chain [[29],38]: 1*it(29)+1*s(52)+1*s(73)+0 1.13/1.14 Such that:aux(26) =< 2 1.13/1.14 aux(34) =< 1 1.13/1.14 s(73) =< aux(34) 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(34) 1.13/1.14 it(29) =< aux(34) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 1.13/1.14 with precondition: [A=2,B=0,F=3] 1.13/1.14 1.13/1.14 * Chain [[29],36]: 1*it(29)+1*s(52)+0 1.13/1.14 Such that:aux(27) =< 1 1.13/1.14 aux(26) =< 2 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(27) 1.13/1.14 it(29) =< aux(27) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 1.13/1.14 with precondition: [A=2,B=0,F=3] 1.13/1.14 1.13/1.14 * Chain [[29],35]: 1*it(29)+1*s(52)+0 1.13/1.14 Such that:aux(27) =< 1 1.13/1.14 aux(26) =< 2 1.13/1.14 aux(25) =< aux(26) 1.13/1.14 it(29) =< aux(26) 1.13/1.14 aux(25) =< aux(27) 1.13/1.14 it(29) =< aux(27) 1.13/1.14 s(52) =< aux(25) 1.13/1.14 1.13/1.14 with precondition: [A=2,B=0,F=3] 1.13/1.14 1.13/1.14 * Chain [[29],32]: 2*it(29)+0 1.13/1.14 Such that:aux(38) =< A 1.13/1.14 it(29) =< aux(38) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=5,G=0,H=0,I+1=0,D=J,2>=A,A>=1] 1.13/1.14 1.13/1.14 * Chain [39]: 0 1.13/1.14 with precondition: [B=0,F=3] 1.13/1.14 1.13/1.14 * Chain [38]: 1*s(73)+0 1.13/1.14 Such that:s(73) =< 1 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,2>=A,A>=1] 1.13/1.14 1.13/1.14 * Chain [36]: 0 1.13/1.14 with precondition: [B=0,F=3,A>=1] 1.13/1.14 1.13/1.14 * Chain [35]: 0 1.13/1.14 with precondition: [B=0,F=3,A>=1] 1.13/1.14 1.13/1.14 * Chain [34]: 7*s(76)+6*s(79)+3*s(80)+0 1.13/1.14 Such that:aux(44) =< A 1.13/1.14 s(76) =< aux(44) 1.13/1.14 s(78) =< s(76)*aux(44) 1.13/1.14 s(79) =< s(78) 1.13/1.14 s(79) =< aux(44) 1.13/1.14 s(80) =< s(78) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [33]: 6*s(87)+4*s(90)+2*s(91)+0 1.13/1.14 Such that:aux(46) =< A 1.13/1.14 s(87) =< aux(46) 1.13/1.14 s(89) =< s(87)*aux(46) 1.13/1.14 s(90) =< s(89) 1.13/1.14 s(90) =< aux(46) 1.13/1.14 s(91) =< s(89) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=4] 1.13/1.14 1.13/1.14 * Chain [32]: 0 1.13/1.14 with precondition: [B=0,F=5,H=0,I=C,J=D,A=G,0>=A] 1.13/1.14 1.13/1.14 * Chain [31,[29],39]: 2*it(29)+2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:aux(28) =< 1 1.13/1.14 aux(48) =< A 1.13/1.14 it(29) =< aux(28) 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [31,[29],32]: 2*it(29)+2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:aux(38) =< 1 1.13/1.14 aux(48) =< A 1.13/1.14 it(29) =< aux(38) 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=5,G=0,H=0,I+1=0,A>=3] 1.13/1.14 1.13/1.14 * Chain [31,39]: 2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:aux(48) =< A 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [31,38]: 1*s(73)+2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:s(73) =< 1 1.13/1.14 aux(48) =< A 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [31,36]: 2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:aux(48) =< A 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 * Chain [31,35]: 2*s(94)+2*s(96)+1*s(97)+1 1.13/1.14 Such that:aux(48) =< A 1.13/1.14 s(94) =< aux(48) 1.13/1.14 s(95) =< s(94)*aux(48) 1.13/1.14 s(96) =< s(95) 1.13/1.14 s(96) =< aux(48) 1.13/1.14 s(97) =< s(95) 1.13/1.14 1.13/1.14 with precondition: [B=0,F=3,A>=3] 1.13/1.14 1.13/1.14 1.13/1.14 #### Cost of chains of f6_loop_cont(A,B,C,D,E,F): 1.13/1.14 * Chain [41]: 0 1.13/1.14 with precondition: [A=3] 1.13/1.14 1.13/1.14 * Chain [40]: 0 1.13/1.14 with precondition: [A=5] 1.13/1.14 1.13/1.14 1.13/1.14 #### Cost of chains of f0(A,B,C,D,F): 1.13/1.14 * Chain [42]: 1*aux(65)+0 1.13/1.14 with precondition: [] 1.13/1.14 1.13/1.14 1.13/1.14 Closed-form bounds of f0(A,B,C,D,F): 1.13/1.14 ------------------------------------- 1.13/1.14 * Chain [42] with precondition: [] 1.13/1.14 - Upper bound: inf 1.13/1.14 - Complexity: infinity 1.13/1.14 1.13/1.14 ### Maximum cost of f0(A,B,C,D,F): inf 1.13/1.14 Asymptotic class: infinity 1.13/1.14 * Total analysis performed in 1020 ms. 1.13/1.14 1.14/1.24 EOF