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