0.03/0.24 MAYBE 0.03/0.24 0.03/0.24 Preprocessing Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Computed strongly connected components 0.03/0.24 0. recursive : [f18/7] 0.03/0.24 1. recursive : [f15/7,f18_loop_cont/8] 0.03/0.24 2. non_recursive : [exit_location/1] 0.03/0.24 3. non_recursive : [f28/4] 0.03/0.24 4. non_recursive : [f15_loop_cont/5] 0.03/0.24 5. non_recursive : [f0/4] 0.03/0.24 0.03/0.24 #### Obtained direct recursion through partial evaluation 0.03/0.24 0. SCC is partially evaluated into f18/7 0.03/0.24 1. SCC is partially evaluated into f15/7 0.03/0.24 2. SCC is completely evaluated into other SCCs 0.03/0.24 3. SCC is completely evaluated into other SCCs 0.03/0.24 4. SCC is partially evaluated into f15_loop_cont/5 0.03/0.24 5. SCC is partially evaluated into f0/4 0.03/0.24 0.03/0.24 Control-Flow Refinement of Cost Relations 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 ### Specialization of cost equations f18/7 0.03/0.24 * CE 10 is refined into CE [11] 0.03/0.24 * CE 9 is refined into CE [12] 0.03/0.24 * CE 8 is refined into CE [13] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f18/7 0.03/0.24 * CEs [13] --> Loop 11 0.03/0.24 * CEs [11] --> Loop 12 0.03/0.24 * CEs [12] --> Loop 13 0.03/0.24 0.03/0.24 ### Ranking functions of CR f18(A,B,C,G,H,I,J) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f18(A,B,C,G,H,I,J) 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f15/7 0.03/0.24 * CE 4 is refined into CE [14] 0.03/0.24 * CE 2 is refined into CE [15,16] 0.03/0.24 * CE 5 is refined into CE [17] 0.03/0.24 * CE 3 is refined into CE [18,19,20] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f15/7 0.03/0.24 * CEs [20] --> Loop 14 0.03/0.24 * CEs [19] --> Loop 15 0.03/0.24 * CEs [18] --> Loop 16 0.03/0.24 * CEs [14] --> Loop 17 0.03/0.24 * CEs [15] --> Loop 18 0.03/0.24 * CEs [17] --> Loop 19 0.03/0.24 * CEs [16] --> Loop 20 0.03/0.24 0.03/0.24 ### Ranking functions of CR f15(A,B,C,G,H,I,J) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f15(A,B,C,G,H,I,J) 0.03/0.24 * Partial RF of phase [14,15,16]: 0.03/0.24 - RF of loop [15:1,16:1]: 0.03/0.24 -A+11 depends on loops [14:1] 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f15_loop_cont/5 0.03/0.24 * CE 6 is refined into CE [21] 0.03/0.24 * CE 7 is refined into CE [22] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f15_loop_cont/5 0.03/0.24 * CEs [21] --> Loop 21 0.03/0.24 * CEs [22] --> Loop 22 0.03/0.24 0.03/0.24 ### Ranking functions of CR f15_loop_cont(A,B,C,D,E) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f15_loop_cont(A,B,C,D,E) 0.03/0.24 0.03/0.24 0.03/0.24 ### Specialization of cost equations f0/4 0.03/0.24 * CE 1 is refined into CE [23,24,25,26,27,28] 0.03/0.24 0.03/0.24 0.03/0.24 ### Cost equations --> "Loop" of f0/4 0.03/0.24 * CEs [26,27,28] --> Loop 23 0.03/0.24 * CEs [23,24,25] --> Loop 24 0.03/0.24 0.03/0.24 ### Ranking functions of CR f0(A,B,C,G) 0.03/0.24 0.03/0.24 #### Partial ranking functions of CR f0(A,B,C,G) 0.03/0.24 0.03/0.24 0.03/0.24 Computing Bounds 0.03/0.24 ===================================== 0.03/0.24 0.03/0.24 #### Cost of chains of f18(A,B,C,G,H,I,J): 0.03/0.24 * Chain [[11]]...: 1*it(11)+0 0.03/0.24 with precondition: [10>=A,A>=B,G>=2,3>=G] 0.03/0.24 0.03/0.24 * Chain [[11],13]: 1*it(11)+0 0.03/0.24 with precondition: [G=2,A+1=H,10>=A,A>=B,B>=I+1] 0.03/0.24 0.03/0.24 * Chain [[11],12]: 1*it(11)+0 0.03/0.24 with precondition: [G=3,10>=A,A>=B] 0.03/0.24 0.03/0.24 * Chain [13]: 0 0.03/0.24 with precondition: [G=2,J=C,A+1=H,B=I,10>=A,A>=B] 0.03/0.24 0.03/0.24 * Chain [12]: 0 0.03/0.24 with precondition: [G=3,10>=A,A>=B] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f15(A,B,C,G,H,I,J): 0.03/0.24 * Chain [[14,15,16]]...: 5*it(14)+0 0.03/0.24 with precondition: [10>=A] 0.03/0.24 0.03/0.24 * Chain [[14,15,16],20]...: 6*it(14)+0 0.03/0.24 with precondition: [G=3,10>=A] 0.03/0.24 0.03/0.24 * Chain [[14,15,16],19]: 5*it(14)+0 0.03/0.24 with precondition: [G=3,10>=A] 0.03/0.24 0.03/0.24 * Chain [[14,15,16],18]: 6*it(14)+0 0.03/0.24 with precondition: [G=3,10>=A] 0.03/0.24 0.03/0.24 * Chain [[14,15,16],17]: 5*it(14)+0 0.03/0.24 with precondition: [G=4,10>=A,H>=11] 0.03/0.24 0.03/0.24 * Chain [20]...: 1*s(8)+0 0.03/0.24 with precondition: [G=3,10>=A] 0.03/0.24 0.03/0.24 * Chain [19]: 0 0.03/0.24 with precondition: [G=3] 0.03/0.24 0.03/0.24 * Chain [18]: 1*s(9)+0 0.03/0.24 with precondition: [G=3,10>=A] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f15_loop_cont(A,B,C,D,E): 0.03/0.24 * Chain [22]: 0 0.03/0.24 with precondition: [A=3] 0.03/0.24 0.03/0.24 * Chain [21]: 0 0.03/0.24 with precondition: [A=4] 0.03/0.24 0.03/0.24 0.03/0.24 #### Cost of chains of f0(A,B,C,G): 0.03/0.24 * Chain [24]: 1*aux(4)+0 0.03/0.24 with precondition: [] 0.03/0.24 0.03/0.24 * Chain [23]...: 1*aux(5)+0 0.03/0.24 with precondition: [] 0.03/0.24 0.03/0.24 0.03/0.24 Closed-form bounds of f0(A,B,C,G): 0.03/0.24 ------------------------------------- 0.03/0.24 * Chain [24] with precondition: [] 0.03/0.24 - Upper bound: inf 0.03/0.24 - Complexity: infinity 0.03/0.24 * Chain [23]... with precondition: [] 0.03/0.24 - Upper bound: inf 0.03/0.24 - Complexity: infinity 0.03/0.24 0.03/0.24 ### Maximum cost of f0(A,B,C,G): inf 0.03/0.24 Asymptotic class: infinity 0.03/0.24 * Total analysis performed in 178 ms. 0.03/0.24 0.03/0.34 EOF