0.03/0.30 MAYBE 0.03/0.30 0.03/0.30 Preprocessing Cost Relations 0.03/0.30 ===================================== 0.03/0.30 0.03/0.30 #### Computed strongly connected components 0.03/0.30 0. recursive : [f16/8] 0.03/0.30 1. recursive : [f10/11,f16_loop_cont/12] 0.03/0.30 2. non_recursive : [exit_location/1] 0.03/0.30 3. recursive : [f25/1] 0.03/0.30 4. non_recursive : [f25_loop_cont/2] 0.03/0.30 5. non_recursive : [f10_loop_cont/7] 0.03/0.30 6. non_recursive : [f0/6] 0.03/0.30 0.03/0.30 #### Obtained direct recursion through partial evaluation 0.03/0.30 0. SCC is partially evaluated into f16/8 0.03/0.30 1. SCC is partially evaluated into f10/11 0.03/0.30 2. SCC is completely evaluated into other SCCs 0.03/0.30 3. SCC is partially evaluated into f25/1 0.03/0.30 4. SCC is completely evaluated into other SCCs 0.03/0.30 5. SCC is partially evaluated into f10_loop_cont/7 0.03/0.30 6. SCC is partially evaluated into f0/6 0.03/0.30 0.03/0.30 Control-Flow Refinement of Cost Relations 0.03/0.30 ===================================== 0.03/0.30 0.03/0.30 ### Specialization of cost equations f16/8 0.03/0.30 * CE 10 is refined into CE [13] 0.03/0.30 * CE 9 is refined into CE [14] 0.03/0.30 * CE 8 is refined into CE [15] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f16/8 0.03/0.30 * CEs [15] --> Loop 13 0.03/0.30 * CEs [13] --> Loop 14 0.03/0.30 * CEs [14] --> Loop 15 0.03/0.30 0.03/0.30 ### Ranking functions of CR f16(A,C,D,E,G,H,I,J) 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f16(A,C,D,E,G,H,I,J) 0.03/0.30 0.03/0.30 0.03/0.30 ### Specialization of cost equations f10/11 0.03/0.30 * CE 4 is refined into CE [16] 0.03/0.30 * CE 2 is refined into CE [17,18,19] 0.03/0.30 * CE 5 is refined into CE [20] 0.03/0.30 * CE 3 is refined into CE [21,22] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f10/11 0.03/0.30 * CEs [22] --> Loop 16 0.03/0.30 * CEs [21] --> Loop 17 0.03/0.30 * CEs [16] --> Loop 18 0.03/0.30 * CEs [17,18] --> Loop 19 0.03/0.30 * CEs [20] --> Loop 20 0.03/0.30 * CEs [19] --> Loop 21 0.03/0.30 0.03/0.30 ### Ranking functions of CR f10(A,B,C,D,E,G,H,I,J,K,L) 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f10(A,B,C,D,E,G,H,I,J,K,L) 0.03/0.30 0.03/0.30 0.03/0.30 ### Specialization of cost equations f25/1 0.03/0.30 * CE 12 is refined into CE [23] 0.03/0.30 * CE 11 is refined into CE [24] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f25/1 0.03/0.30 * CEs [24] --> Loop 22 0.03/0.30 * CEs [23] --> Loop 23 0.03/0.30 0.03/0.30 ### Ranking functions of CR f25(G) 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f25(G) 0.03/0.30 0.03/0.30 0.03/0.30 ### Specialization of cost equations f10_loop_cont/7 0.03/0.30 * CE 7 is refined into CE [25,26] 0.03/0.30 * CE 6 is refined into CE [27] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f10_loop_cont/7 0.03/0.30 * CEs [25] --> Loop 24 0.03/0.30 * CEs [27] --> Loop 25 0.03/0.30 * CEs [26] --> Loop 26 0.03/0.30 0.03/0.30 ### Ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G) 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f10_loop_cont(A,B,C,D,E,F,G) 0.03/0.30 0.03/0.30 0.03/0.30 ### Specialization of cost equations f0/6 0.03/0.30 * CE 1 is refined into CE [28,29,30,31,32,33,34,35,36,37] 0.03/0.30 0.03/0.30 0.03/0.30 ### Cost equations --> "Loop" of f0/6 0.03/0.30 * CEs [31,33,34,35,36,37] --> Loop 27 0.03/0.30 * CEs [28,29,30,32] --> Loop 28 0.03/0.30 0.03/0.30 ### Ranking functions of CR f0(A,B,C,D,E,G) 0.03/0.30 0.03/0.30 #### Partial ranking functions of CR f0(A,B,C,D,E,G) 0.03/0.30 0.03/0.30 0.03/0.30 Computing Bounds 0.03/0.30 ===================================== 0.03/0.30 0.03/0.30 #### Cost of chains of f16(A,C,D,E,G,H,I,J): 0.03/0.30 * Chain [[13]]...: 1*it(13)+0 0.03/0.30 with precondition: [C=D,0>=A,C>=1,G>=2,3>=G] 0.03/0.30 0.03/0.30 * Chain [[13],14]: 1*it(13)+0 0.03/0.30 with precondition: [G=3,C=D,0>=A,C>=1] 0.03/0.30 0.03/0.30 * Chain [15]: 0 0.03/0.30 with precondition: [G=2,J=0,D=C,I=H,0>=A,0>=D] 0.03/0.30 0.03/0.30 * Chain [14]: 0 0.03/0.30 with precondition: [G=3,D=C,0>=A] 0.03/0.30 0.03/0.30 0.03/0.30 #### Cost of chains of f10(A,B,C,D,E,G,H,I,J,K,L): 0.03/0.30 * Chain [[16,17]]...: 3*it(16)+0 0.03/0.30 with precondition: [0>=A,B=0] 0.03/0.30 0.03/0.30 * Chain [[16,17],21]...: 4*it(16)+0 0.03/0.30 with precondition: [B=0,G=3,0>=A] 0.03/0.30 0.03/0.30 * Chain [[16,17],20]: 3*it(16)+0 0.03/0.30 with precondition: [B=0,G=3,0>=A] 0.03/0.30 0.03/0.30 * Chain [[16,17],19]: 4*aux(1)+0 0.03/0.30 with precondition: [B=0,G=3,0>=A] 0.03/0.30 0.03/0.30 * Chain [[16,17],18]: 3*it(16)+0 0.03/0.30 with precondition: [B=0,G=4,I=0,0>=A,H>=1] 0.03/0.30 0.03/0.30 * Chain [21]...: 1*s(4)+0 0.03/0.30 with precondition: [B=0,G=3,0>=A] 0.03/0.30 0.03/0.30 * Chain [20]: 0 0.03/0.30 with precondition: [B=0,G=3] 0.03/0.30 0.03/0.30 * Chain [19]: 1*aux(1)+0 0.03/0.30 with precondition: [B=0,G=3,0>=A] 0.03/0.30 0.03/0.30 * Chain [18]: 0 0.03/0.30 with precondition: [B=0,G=4,I=0,J=C,K=D,L=E,A=H,A>=1] 0.03/0.30 0.03/0.30 0.03/0.30 #### Cost of chains of f25(G): 0.03/0.30 * Chain [[22]]...: 1*it(22)+0 0.03/0.30 with precondition: [G=3] 0.03/0.30 0.03/0.30 * Chain [[22],23]: 1*it(22)+0 0.03/0.30 with precondition: [G=3] 0.03/0.30 0.03/0.30 * Chain [23]: 0 0.03/0.30 with precondition: [G=3] 0.03/0.30 0.03/0.30 0.03/0.30 #### Cost of chains of f10_loop_cont(A,B,C,D,E,F,G): 0.03/0.30 * Chain [26]...: 1*s(12)+0 0.03/0.30 with precondition: [A=4] 0.03/0.30 0.03/0.30 * Chain [25]: 0 0.03/0.30 with precondition: [A=3] 0.03/0.30 0.03/0.30 * Chain [24]: 1*s(13)+0 0.03/0.30 with precondition: [A=4] 0.03/0.30 0.03/0.30 0.03/0.30 #### Cost of chains of f0(A,B,C,D,E,G): 0.03/0.30 * Chain [28]: 1*aux(5)+0 0.03/0.30 with precondition: [] 0.03/0.30 0.03/0.30 * Chain [27]...: 1*aux(6)+0 0.03/0.30 with precondition: [] 0.03/0.30 0.03/0.30 0.03/0.30 Closed-form bounds of f0(A,B,C,D,E,G): 0.03/0.30 ------------------------------------- 0.03/0.30 * Chain [28] with precondition: [] 0.03/0.30 - Upper bound: inf 0.03/0.30 - Complexity: infinity 0.03/0.30 * Chain [27]... with precondition: [] 0.03/0.30 - Upper bound: inf 0.03/0.30 - Complexity: infinity 0.03/0.30 0.03/0.30 ### Maximum cost of f0(A,B,C,D,E,G): inf 0.03/0.30 Asymptotic class: infinity 0.03/0.30 * Total analysis performed in 232 ms. 0.03/0.30 0.03/0.40 EOF