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