0.65/0.65 MAYBE 0.65/0.65 WARNING: Excluded non-linear constraints:[B*B*B>=0,0>=B*B*B] 0.65/0.65 WARNING: Excluded non-linear constraints:[B*B*B>=1,B*B*B>=2*E,1+2*E>=B*B*B] 0.65/0.65 WARNING: Excluded non-linear constraints:[0>=B*B*B+1,2*E>=B*B*B,1+B*B*B>=2*E] 0.65/0.65 WARNING: Excluded non-linear constraints:[B*B*B>=0,0>=B*B*B] 0.65/0.65 WARNING: Excluded non-linear constraints:[B*B*B>=1,B*B*B>=2*L,1+2*L>=B*B*B] 0.65/0.65 WARNING: Excluded non-linear constraints:[0>=B*B*B+1,2*L>=B*B*B,1+B*B*B>=2*L] 0.65/0.65 WARNING: Excluded non-linear constraints:[F*F*F>=0,0>=F*F*F] 0.65/0.65 WARNING: Excluded non-linear constraints:[F*F*F>=1,F*F*F>=2*G,1+2*G>=F*F*F] 0.65/0.65 WARNING: Excluded non-linear constraints:[0>=F*F*F+1,2*G>=F*F*F,1+F*F*F>=2*G] 0.65/0.65 0.65/0.65 Preprocessing Cost Relations 0.65/0.65 ===================================== 0.65/0.65 0.65/0.65 #### Computed strongly connected components 0.65/0.65 0. recursive : [evalfbb2in/4,evalfbb3in/4] 0.65/0.65 1. recursive : [evalfbb3in_loop_cont/7,evalfbb4in/6,evalfbb5in/6] 0.65/0.65 2. recursive : [evalfbb5in_loop_cont/9,evalfbb6in/8,evalfbb7in/8] 0.65/0.65 3. non_recursive : [evalfstop/5] 0.65/0.65 4. non_recursive : [evalfreturnin/5] 0.65/0.65 5. non_recursive : [exit_location/1] 0.65/0.65 6. non_recursive : [evalfbb7in_loop_cont/6] 0.65/0.65 7. non_recursive : [evalfentryin/5] 0.65/0.65 8. non_recursive : [evalfstart/5] 0.65/0.65 0.65/0.65 #### Obtained direct recursion through partial evaluation 0.65/0.65 0. SCC is partially evaluated into evalfbb3in/4 0.65/0.65 1. SCC is partially evaluated into evalfbb5in/6 0.65/0.65 2. SCC is partially evaluated into evalfbb7in/8 0.65/0.65 3. SCC is completely evaluated into other SCCs 0.65/0.65 4. SCC is completely evaluated into other SCCs 0.65/0.65 5. SCC is completely evaluated into other SCCs 0.65/0.65 6. SCC is partially evaluated into evalfbb7in_loop_cont/6 0.65/0.65 7. SCC is partially evaluated into evalfentryin/5 0.65/0.65 8. SCC is partially evaluated into evalfstart/5 0.65/0.65 0.65/0.65 Control-Flow Refinement of Cost Relations 0.65/0.65 ===================================== 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfbb3in/4 0.65/0.65 * CE 15 is refined into CE [16] 0.65/0.65 * CE 14 is refined into CE [17] 0.65/0.65 * CE 13 is refined into CE [18] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfbb3in/4 0.65/0.65 * CEs [18] --> Loop 15 0.65/0.65 * CEs [16] --> Loop 16 0.65/0.65 * CEs [17] --> Loop 17 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfbb3in(C,D,F,G) 0.65/0.65 * RF of phase [15]: [C-D] 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfbb3in(C,D,F,G) 0.65/0.65 * Partial RF of phase [15]: 0.65/0.65 - RF of loop [15:1]: 0.65/0.65 C-D 0.65/0.65 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfbb5in/6 0.65/0.65 * CE 11 is refined into CE [19] 0.65/0.65 * CE 9 is refined into CE [20,21] 0.65/0.65 * CE 12 is refined into CE [22] 0.65/0.65 * CE 10 is refined into CE [23,24] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfbb5in/6 0.65/0.65 * CEs [24] --> Loop 18 0.65/0.65 * CEs [23] --> Loop 19 0.65/0.65 * CEs [19] --> Loop 20 0.65/0.65 * CEs [21] --> Loop 21 0.65/0.65 * CEs [20] --> Loop 22 0.65/0.65 * CEs [22] --> Loop 23 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfbb5in(B,C,D,F,G,H) 0.65/0.65 * RF of phase [18]: [B-C,B-D-1] 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfbb5in(B,C,D,F,G,H) 0.65/0.65 * Partial RF of phase [18]: 0.65/0.65 - RF of loop [18:1]: 0.65/0.65 B-C 0.65/0.65 B-D-1 0.65/0.65 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfbb7in/8 0.65/0.65 * CE 5 is refined into CE [25] 0.65/0.65 * CE 3 is refined into CE [26,27,28,29,30] 0.65/0.65 * CE 6 is refined into CE [31] 0.65/0.65 * CE 4 is refined into CE [32,33,34] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfbb7in/8 0.65/0.65 * CEs [33] --> Loop 24 0.65/0.65 * CEs [34] --> Loop 25 0.65/0.65 * CEs [32] --> Loop 26 0.65/0.65 * CEs [25] --> Loop 27 0.65/0.65 * CEs [28] --> Loop 28 0.65/0.65 * CEs [27] --> Loop 29 0.65/0.65 * CEs [26,30] --> Loop 30 0.65/0.65 * CEs [29,31] --> Loop 31 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfbb7in(A,B,C,D,F,G,H,I) 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfbb7in(A,B,C,D,F,G,H,I) 0.65/0.65 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfbb7in_loop_cont/6 0.65/0.65 * CE 7 is refined into CE [35] 0.65/0.65 * CE 8 is refined into CE [36] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfbb7in_loop_cont/6 0.65/0.65 * CEs [35] --> Loop 32 0.65/0.65 * CEs [36] --> Loop 33 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfbb7in_loop_cont(A,B,C,D,E,F) 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfbb7in_loop_cont(A,B,C,D,E,F) 0.65/0.65 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfentryin/5 0.65/0.65 * CE 2 is refined into CE [37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfentryin/5 0.65/0.65 * CEs [51,52] --> Loop 34 0.65/0.65 * CEs [49,50] --> Loop 35 0.65/0.65 * CEs [47,48] --> Loop 36 0.65/0.65 * CEs [43] --> Loop 37 0.65/0.65 * CEs [42,46] --> Loop 38 0.65/0.65 * CEs [41] --> Loop 39 0.65/0.65 * CEs [39,44] --> Loop 40 0.65/0.65 * CEs [37,38] --> Loop 41 0.65/0.65 * CEs [40,45] --> Loop 42 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfentryin(A,B,C,D,F) 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfentryin(A,B,C,D,F) 0.65/0.65 0.65/0.65 0.65/0.65 ### Specialization of cost equations evalfstart/5 0.65/0.65 * CE 1 is refined into CE [53,54,55,56,57,58,59,60,61] 0.65/0.65 0.65/0.65 0.65/0.65 ### Cost equations --> "Loop" of evalfstart/5 0.65/0.65 * CEs [61] --> Loop 43 0.65/0.65 * CEs [60] --> Loop 44 0.65/0.65 * CEs [59] --> Loop 45 0.65/0.65 * CEs [58] --> Loop 46 0.65/0.65 * CEs [57] --> Loop 47 0.65/0.65 * CEs [56] --> Loop 48 0.65/0.65 * CEs [55] --> Loop 49 0.65/0.65 * CEs [54] --> Loop 50 0.65/0.65 * CEs [53] --> Loop 51 0.65/0.65 0.65/0.65 ### Ranking functions of CR evalfstart(A,B,C,D,F) 0.65/0.65 0.65/0.65 #### Partial ranking functions of CR evalfstart(A,B,C,D,F) 0.65/0.65 0.65/0.65 0.65/0.65 Computing Bounds 0.65/0.65 ===================================== 0.65/0.65 0.65/0.65 #### Cost of chains of evalfbb3in(C,D,F,G): 0.65/0.65 * Chain [[15],17]: 1*it(15)+0 0.65/0.65 Such that:it(15) =< -D+G 0.65/0.65 0.65/0.65 with precondition: [F=2,C=G,D>=0,C>=D+1] 0.65/0.65 0.65/0.65 * Chain [[15],16]: 1*it(15)+0 0.65/0.65 Such that:it(15) =< C-D 0.65/0.65 0.65/0.65 with precondition: [F=3,D>=0,C>=D+1] 0.65/0.65 0.65/0.65 * Chain [17]: 0 0.65/0.65 with precondition: [F=2,D=C,D=G,D>=0] 0.65/0.65 0.65/0.65 * Chain [16]: 0 0.65/0.65 with precondition: [F=3,D>=0,C>=D] 0.65/0.65 0.65/0.65 0.65/0.65 #### Cost of chains of evalfbb5in(B,C,D,F,G,H): 0.65/0.65 * Chain [23]: 0 0.65/0.65 with precondition: [F=3,C>=0] 0.65/0.65 0.65/0.65 * Chain [22]: 0 0.65/0.65 with precondition: [F=3,C>=0,B>=C+1] 0.65/0.65 0.65/0.65 * Chain [20]: 0 0.65/0.65 with precondition: [F=4,H=D,C=G,C>=0,C>=B] 0.65/0.65 0.65/0.65 * Chain [19,[18],23]: 1*it(18)+1*s(3)+1 0.65/0.65 Such that:aux(2) =< 1 0.65/0.65 aux(3) =< B 0.65/0.65 aux(1) =< aux(3) 0.65/0.65 it(18) =< aux(3) 0.65/0.65 aux(1) =< aux(2)+it(18) 0.65/0.65 s(3) =< it(18)*aux(1) 0.65/0.65 0.65/0.65 with precondition: [C=0,F=3,B>=2] 0.65/0.65 0.65/0.65 * Chain [19,[18],22]: 1*it(18)+1*s(3)+1 0.65/0.65 Such that:aux(2) =< 1 0.65/0.65 aux(4) =< B 0.65/0.65 aux(1) =< aux(4) 0.65/0.65 it(18) =< aux(4) 0.65/0.65 aux(1) =< aux(2)+it(18) 0.65/0.65 s(3) =< it(18)*aux(1) 0.65/0.65 0.65/0.65 with precondition: [C=0,F=3,B>=3] 0.65/0.65 0.65/0.65 * Chain [19,[18],21]: 2*it(18)+1*s(3)+1 0.65/0.65 Such that:aux(2) =< 1 0.65/0.65 aux(6) =< B 0.65/0.65 it(18) =< aux(6) 0.65/0.65 aux(1) =< aux(6) 0.65/0.65 aux(1) =< aux(2)+it(18) 0.65/0.66 s(3) =< it(18)*aux(1) 0.65/0.66 0.65/0.66 with precondition: [C=0,F=3,B>=3] 0.65/0.66 0.65/0.66 * Chain [19,[18],20]: 1*it(18)+1*s(3)+1 0.65/0.66 Such that:aux(2) =< 1 0.65/0.66 aux(7) =< G 0.65/0.66 aux(1) =< aux(7) 0.65/0.66 it(18) =< aux(7) 0.65/0.66 aux(1) =< aux(2)+it(18) 0.65/0.66 s(3) =< it(18)*aux(1) 0.65/0.66 0.65/0.66 with precondition: [C=0,F=4,B=G,B=H+1,B>=2] 0.65/0.66 0.65/0.66 * Chain [19,23]: 1 0.65/0.66 with precondition: [C=0,F=3,B>=1] 0.65/0.66 0.65/0.66 * Chain [19,22]: 1 0.65/0.66 with precondition: [C=0,F=3,B>=2] 0.65/0.66 0.65/0.66 * Chain [19,21]: 1*s(4)+1 0.65/0.66 Such that:s(4) =< 1 0.65/0.66 0.65/0.66 with precondition: [C=0,F=3,B>=2] 0.65/0.66 0.65/0.66 * Chain [19,20]: 1 0.65/0.66 with precondition: [B=1,C=0,F=4,G=1,H=0] 0.65/0.66 0.65/0.66 0.65/0.66 #### Cost of chains of evalfbb7in(A,B,C,D,F,G,H,I): 0.65/0.66 * Chain [[26]]...: 2*it(26)+0 0.65/0.66 with precondition: [A>=0,B=1] 0.65/0.66 0.65/0.66 * Chain [[26],31]: 2*it(26)+0 0.65/0.66 with precondition: [B=1,F=3,A>=0] 0.65/0.66 0.65/0.66 * Chain [[26],30]: 2*it(26)+1 0.65/0.66 with precondition: [B=1,F=3,A>=0] 0.65/0.66 0.65/0.66 * Chain [[26],27]: 2*it(26)+0 0.65/0.66 with precondition: [B=1,F=5,H=1,I=0,A>=0,G>=A+1] 0.65/0.66 0.65/0.66 * Chain [[25]]...: 1*it(25)+0 0.65/0.66 with precondition: [A>=0,0>=B] 0.65/0.66 0.65/0.66 * Chain [[25],31]: 1*it(25)+0 0.65/0.66 with precondition: [F=3,0>=B,A>=0] 0.65/0.66 0.65/0.66 * Chain [[25],27]: 1*it(25)+0 0.65/0.66 with precondition: [F=5,H=0,D=I,0>=B,A>=0,G>=A+1] 0.65/0.66 0.65/0.66 * Chain [[24]]...: 4*it(24)+0 0.65/0.66 with precondition: [A>=0,B>=2] 0.65/0.66 0.65/0.66 * Chain [[24],31]: 4*it(24)+0 0.65/0.66 with precondition: [F=3,A>=0,B>=2] 0.65/0.66 0.65/0.66 * Chain [[24],30]: 4*it(24)+1 0.65/0.66 with precondition: [F=3,A>=0,B>=2] 0.65/0.66 0.65/0.66 * Chain [[24],29]: 4*it(24)+1*s(36)+1*s(38)+1*s(39)+1 0.65/0.66 Such that:s(35) =< 1 0.65/0.66 s(34) =< B 0.65/0.66 s(36) =< s(35) 0.65/0.66 s(37) =< s(34) 0.65/0.66 s(38) =< s(34) 0.65/0.66 s(37) =< s(35)+s(38) 0.65/0.66 s(39) =< s(38)*s(37) 0.65/0.66 0.65/0.66 with precondition: [F=3,A>=0,B>=2] 0.65/0.66 0.65/0.66 * Chain [[24],28]: 4*it(24)+3*s(42)+2*s(44)+1 0.65/0.66 Such that:s(40) =< 1 0.65/0.66 s(41) =< B 0.65/0.66 s(42) =< s(41) 0.65/0.66 s(43) =< s(41) 0.65/0.66 s(43) =< s(40)+s(42) 0.65/0.66 s(44) =< s(42)*s(43) 0.65/0.66 0.65/0.66 with precondition: [F=3,A>=0,B>=3] 0.65/0.66 0.65/0.66 * Chain [[24],27]: 4*it(24)+0 0.65/0.66 with precondition: [F=5,B=H,B=I+1,A>=0,B>=2,G>=A+1] 0.65/0.66 0.65/0.66 * Chain [31]: 0 0.65/0.66 with precondition: [F=3,A>=0] 0.65/0.66 0.65/0.66 * Chain [30]: 1 0.65/0.66 with precondition: [F=3,A>=0,B>=1] 0.65/0.66 0.65/0.66 * Chain [29]: 1*s(36)+1*s(38)+1*s(39)+1 0.65/0.66 Such that:s(35) =< 1 0.65/0.66 s(34) =< B 0.65/0.66 s(36) =< s(35) 0.65/0.66 s(37) =< s(34) 0.65/0.66 s(38) =< s(34) 0.65/0.66 s(37) =< s(35)+s(38) 0.65/0.66 s(39) =< s(38)*s(37) 0.65/0.66 0.65/0.66 with precondition: [F=3,A>=0,B>=2] 0.65/0.66 0.65/0.66 * Chain [28]: 3*s(42)+2*s(44)+1 0.65/0.66 Such that:s(40) =< 1 0.65/0.66 s(41) =< B 0.65/0.66 s(42) =< s(41) 0.65/0.66 s(43) =< s(41) 0.65/0.66 s(43) =< s(40)+s(42) 0.65/0.66 s(44) =< s(42)*s(43) 0.65/0.66 0.65/0.66 with precondition: [F=3,A>=0,B>=3] 0.65/0.66 0.65/0.66 * Chain [27]: 0 0.65/0.66 with precondition: [F=5,H=C,I=D,A=G,A>=0] 0.65/0.66 0.65/0.66 0.65/0.66 #### Cost of chains of evalfbb7in_loop_cont(A,B,C,D,E,F): 0.65/0.66 * Chain [33]: 0 0.65/0.66 with precondition: [A=3] 0.65/0.66 0.65/0.66 * Chain [32]: 0 0.65/0.66 with precondition: [A=5] 0.65/0.66 0.65/0.66 0.65/0.66 #### Cost of chains of evalfentryin(A,B,C,D,F): 0.65/0.66 * Chain [42]: 0 0.65/0.66 with precondition: [] 0.65/0.66 0.65/0.66 * Chain [41]: 1*aux(17)+0 0.65/0.66 with precondition: [B=1] 0.65/0.66 0.65/0.66 * Chain [40]: 1*aux(18)+0 0.65/0.66 with precondition: [0>=B] 0.65/0.66 0.65/0.66 * Chain [39]: 1 0.65/0.66 with precondition: [B>=1] 0.65/0.66 0.65/0.66 * Chain [38]: 2*s(79)+2*s(81)+2*s(82)+16*s(83)+1 0.65/0.66 Such that:s(77) =< 1 0.65/0.66 s(78) =< B 0.65/0.66 s(79) =< s(77) 0.65/0.66 s(80) =< s(78) 0.65/0.66 s(81) =< s(78) 0.65/0.66 s(80) =< s(77)+s(81) 0.65/0.66 s(82) =< s(81)*s(80) 0.65/0.66 0.65/0.66 with precondition: [B>=2] 0.65/0.66 0.65/0.66 * Chain [37]: 6*s(87)+4*s(89)+4*s(90)+1 0.65/0.66 Such that:s(85) =< 1 0.65/0.66 s(86) =< B 0.65/0.66 s(87) =< s(86) 0.65/0.66 s(88) =< s(86) 0.65/0.66 s(88) =< s(85)+s(87) 0.65/0.66 s(89) =< s(87)*s(88) 0.65/0.66 0.65/0.66 with precondition: [B>=3] 0.65/0.66 0.65/0.66 * Chain [36]...: 1*aux(19)+0 0.65/0.66 with precondition: [B=1] 0.65/0.66 0.65/0.66 * Chain [35]...: 1*aux(20)+0 0.65/0.66 with precondition: [0>=B] 0.65/0.66 0.65/0.66 * Chain [34]...: 1*aux(21)+0 0.65/0.66 with precondition: [B>=2] 0.65/0.66 0.65/0.66 0.65/0.66 #### Cost of chains of evalfstart(A,B,C,D,F): 0.65/0.66 * Chain [51]: 0 0.65/0.66 with precondition: [] 0.65/0.66 0.65/0.66 * Chain [50]: 1*s(97)+0 0.65/0.66 with precondition: [B=1] 0.65/0.66 0.65/0.66 * Chain [49]: 1*s(98)+0 0.65/0.66 with precondition: [0>=B] 0.65/0.66 0.65/0.66 * Chain [48]: 1 0.65/0.66 with precondition: [B>=1] 0.65/0.66 0.65/0.66 * Chain [47]: 2*s(101)+2*s(103)+2*s(104)+16*s(105)+1 0.65/0.66 Such that:s(99) =< 1 0.65/0.66 s(100) =< B 0.65/0.66 s(101) =< s(99) 0.65/0.66 s(102) =< s(100) 0.65/0.66 s(103) =< s(100) 0.65/0.66 s(102) =< s(99)+s(103) 0.65/0.66 s(104) =< s(103)*s(102) 0.65/0.66 0.65/0.66 with precondition: [B>=2] 0.65/0.66 0.65/0.66 * Chain [46]: 6*s(108)+4*s(110)+4*s(111)+1 0.65/0.66 Such that:s(106) =< 1 0.65/0.66 s(107) =< B 0.65/0.66 s(108) =< s(107) 0.65/0.66 s(109) =< s(107) 0.65/0.66 s(109) =< s(106)+s(108) 0.65/0.66 s(110) =< s(108)*s(109) 0.65/0.66 0.65/0.66 with precondition: [B>=3] 0.65/0.66 0.65/0.66 * Chain [45]...: 1*s(112)+0 0.65/0.66 with precondition: [B=1] 0.65/0.66 0.65/0.66 * Chain [44]...: 1*s(113)+0 0.65/0.66 with precondition: [0>=B] 0.65/0.66 0.65/0.66 * Chain [43]...: 1*s(114)+0 0.65/0.66 with precondition: [B>=2] 0.65/0.66 0.65/0.66 0.65/0.66 Closed-form bounds of evalfstart(A,B,C,D,F): 0.65/0.66 ------------------------------------- 0.65/0.66 * Chain [51] with precondition: [] 0.65/0.66 - Upper bound: 0 0.65/0.66 - Complexity: constant 0.65/0.66 * Chain [50] with precondition: [B=1] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [49] with precondition: [0>=B] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [48] with precondition: [B>=1] 0.65/0.66 - Upper bound: 1 0.65/0.66 - Complexity: constant 0.65/0.66 * Chain [47] with precondition: [B>=2] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [46] with precondition: [B>=3] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [45]... with precondition: [B=1] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [44]... with precondition: [0>=B] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 * Chain [43]... with precondition: [B>=2] 0.65/0.66 - Upper bound: inf 0.65/0.66 - Complexity: infinity 0.65/0.66 0.65/0.66 ### Maximum cost of evalfstart(A,B,C,D,F): inf 0.65/0.66 Asymptotic class: infinity 0.65/0.66 * Total analysis performed in 567 ms. 0.65/0.66 0.66/0.76 EOF