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