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