0.04/0.48 WORST_CASE(?,O(n^1)) 0.04/0.48 0.04/0.48 Preprocessing Cost Relations 0.04/0.48 ===================================== 0.04/0.48 0.04/0.48 #### Computed strongly connected components 0.04/0.48 0. recursive : [eval_wcet0_4/10,eval_wcet0_5/10,eval_wcet0_bb1_in/10,eval_wcet0_bb2_in/10,eval_wcet0_bb3_in/10,eval_wcet0_bb4_in/10] 0.04/0.48 1. non_recursive : [eval_wcet0_stop/6] 0.04/0.48 2. non_recursive : [eval_wcet0_bb5_in/6] 0.04/0.48 3. non_recursive : [exit_location/1] 0.04/0.48 4. non_recursive : [eval_wcet0_bb1_in_loop_cont/7] 0.04/0.48 5. non_recursive : [eval_wcet0_3/6] 0.04/0.48 6. non_recursive : [eval_wcet0_2/6] 0.04/0.48 7. non_recursive : [eval_wcet0_1/6] 0.04/0.48 8. non_recursive : [eval_wcet0_0/6] 0.04/0.48 9. non_recursive : [eval_wcet0_bb0_in/6] 0.04/0.48 10. non_recursive : [eval_wcet0_start/6] 0.04/0.48 0.04/0.48 #### Obtained direct recursion through partial evaluation 0.04/0.48 0. SCC is partially evaluated into eval_wcet0_bb1_in/10 0.04/0.48 1. SCC is completely evaluated into other SCCs 0.04/0.48 2. SCC is completely evaluated into other SCCs 0.04/0.48 3. SCC is completely evaluated into other SCCs 0.04/0.48 4. SCC is partially evaluated into eval_wcet0_bb1_in_loop_cont/7 0.04/0.48 5. SCC is partially evaluated into eval_wcet0_3/6 0.04/0.48 6. SCC is completely evaluated into other SCCs 0.04/0.48 7. SCC is completely evaluated into other SCCs 0.04/0.48 8. SCC is completely evaluated into other SCCs 0.04/0.48 9. SCC is completely evaluated into other SCCs 0.04/0.48 10. SCC is partially evaluated into eval_wcet0_start/6 0.04/0.48 0.04/0.48 Control-Flow Refinement of Cost Relations 0.04/0.48 ===================================== 0.04/0.48 0.04/0.48 ### Specialization of cost equations eval_wcet0_bb1_in/10 0.04/0.48 * CE 11 is refined into CE [15] 0.04/0.48 * CE 7 is refined into CE [16] 0.04/0.48 * CE 6 is refined into CE [17] 0.04/0.48 * CE 10 is refined into CE [18] 0.04/0.48 * CE 12 is refined into CE [19] 0.04/0.48 * CE 5 is refined into CE [20] 0.04/0.48 * CE 9 is refined into CE [21] 0.04/0.48 * CE 4 is discarded (unfeasible) 0.04/0.48 * CE 8 is discarded (unfeasible) 0.04/0.48 0.04/0.48 0.04/0.48 ### Cost equations --> "Loop" of eval_wcet0_bb1_in/10 0.04/0.48 * CEs [20] --> Loop 15 0.04/0.48 * CEs [21] --> Loop 16 0.04/0.48 * CEs [19] --> Loop 17 0.04/0.48 * CEs [15] --> Loop 18 0.04/0.48 * CEs [16] --> Loop 19 0.04/0.48 * CEs [18] --> Loop 20 0.04/0.48 * CEs [17] --> Loop 21 0.04/0.48 0.04/0.48 ### Ranking functions of CR eval_wcet0_bb1_in(V_1,V_i_0,V_j_0,V_j_3,V_n,B,C,D,E,F) 0.04/0.48 * RF of phase [15,16]: [V_i_0-1] 0.04/0.48 0.04/0.48 #### Partial ranking functions of CR eval_wcet0_bb1_in(V_1,V_i_0,V_j_0,V_j_3,V_n,B,C,D,E,F) 0.04/0.48 * Partial RF of phase [15,16]: 0.04/0.48 - RF of loop [15:1]: 0.04/0.48 -V_j_0+V_n-1 depends on loops [16:1] 0.04/0.48 - RF of loop [15:1,16:1]: 0.04/0.48 V_i_0-1 0.04/0.48 - RF of loop [16:1]: 0.04/0.48 V_j_0+V_n-1 depends on loops [15:1] 0.04/0.48 0.04/0.48 0.04/0.48 ### Specialization of cost equations eval_wcet0_bb1_in_loop_cont/7 0.04/0.48 * CE 14 is refined into CE [22] 0.04/0.48 * CE 13 is refined into CE [23] 0.04/0.48 0.04/0.48 0.04/0.48 ### Cost equations --> "Loop" of eval_wcet0_bb1_in_loop_cont/7 0.04/0.48 * CEs [22] --> Loop 22 0.04/0.48 * CEs [23] --> Loop 23 0.04/0.48 0.04/0.48 ### Ranking functions of CR eval_wcet0_bb1_in_loop_cont(A,B,C,D,E,F,G) 0.04/0.48 0.04/0.48 #### Partial ranking functions of CR eval_wcet0_bb1_in_loop_cont(A,B,C,D,E,F,G) 0.04/0.48 0.04/0.48 0.04/0.48 ### Specialization of cost equations eval_wcet0_3/6 0.04/0.48 * CE 3 is refined into CE [24,25,26,27,28,29,30,31] 0.04/0.48 * CE 2 is refined into CE [32] 0.04/0.48 0.04/0.48 0.04/0.48 ### Cost equations --> "Loop" of eval_wcet0_3/6 0.04/0.48 * CEs [27,28,29,30,31] --> Loop 24 0.04/0.48 * CEs [26] --> Loop 25 0.04/0.48 * CEs [32] --> Loop 26 0.04/0.48 * CEs [24,25] --> Loop 27 0.04/0.48 0.04/0.48 ### Ranking functions of CR eval_wcet0_3(V_1,V_i_0,V_j_0,V_j_3,V_n,B) 0.04/0.48 0.04/0.48 #### Partial ranking functions of CR eval_wcet0_3(V_1,V_i_0,V_j_0,V_j_3,V_n,B) 0.04/0.48 0.04/0.48 0.04/0.48 ### Specialization of cost equations eval_wcet0_start/6 0.04/0.48 * CE 1 is refined into CE [33,34,35,36] 0.04/0.48 0.04/0.48 0.04/0.48 ### Cost equations --> "Loop" of eval_wcet0_start/6 0.04/0.48 * CEs [36] --> Loop 28 0.04/0.48 * CEs [35] --> Loop 29 0.04/0.48 * CEs [34] --> Loop 30 0.04/0.48 * CEs [33] --> Loop 31 0.04/0.48 0.04/0.48 ### Ranking functions of CR eval_wcet0_start(V_1,V_i_0,V_j_0,V_j_3,V_n,B) 0.04/0.48 0.04/0.48 #### Partial ranking functions of CR eval_wcet0_start(V_1,V_i_0,V_j_0,V_j_3,V_n,B) 0.04/0.48 0.04/0.48 0.04/0.48 Computing Bounds 0.04/0.48 ===================================== 0.04/0.48 0.04/0.48 #### Cost of chains of eval_wcet0_bb1_in(V_1,V_i_0,V_j_0,V_j_3,V_n,B,C,D,E,F): 0.04/0.48 * Chain [[15,16],21]: 2*it(15)+0 0.04/0.48 Such that:aux(7) =< V_i_0 0.04/0.48 it(15) =< aux(7) 0.04/0.48 0.04/0.48 with precondition: [B=3,D=1,F=0,V_i_0+V_j_0=V_n,V_i_0+V_j_0=E+1,V_i_0>=2,V_j_0>=0,C>=1] 0.04/0.48 0.04/0.48 * Chain [[15,16],20]: 2*it(15)+0 0.04/0.48 Such that:aux(8) =< V_i_0 0.04/0.48 it(15) =< aux(8) 0.04/0.48 0.04/0.48 with precondition: [B=3,D=1,F=0,V_i_0=V_j_0+V_n,V_i_0+E=V_j_0+1,0>=V_j_0,0>=C,V_i_0>=2] 0.04/0.48 0.04/0.48 * Chain [[15,16],19]: 2*it(15)+0 0.04/0.48 Such that:aux(9) =< V_i_0 0.04/0.48 it(15) =< aux(9) 0.04/0.48 0.04/0.48 with precondition: [B=3,D=1,E+1=F,V_i_0>=2,C>=1,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0,V_i_0+E>=V_j_0+1,V_i_0+V_j_0>=E+1,2*V_n>=V_i_0+V_j_0+E+3] 0.04/0.48 0.04/0.48 * Chain [[15,16],18]: 2*it(15)+0 0.04/0.48 Such that:aux(10) =< V_i_0 0.04/0.48 it(15) =< aux(10) 0.04/0.48 0.04/0.48 with precondition: [B=3,D=1,E=F+1,0>=C,V_i_0>=2,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0,V_i_0+E>=V_j_0+1,V_i_0+V_j_0>=E+1,V_j_0+E+2*V_n>=V_i_0+3] 0.04/0.48 0.04/0.48 * Chain [[15,16],17]: 2*it(15)+0 0.04/0.48 Such that:aux(11) =< V_i_0 0.04/0.48 it(15) =< aux(11) 0.04/0.48 0.04/0.48 with precondition: [B=2,V_i_0>=2,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0] 0.04/0.48 0.04/0.48 * Chain [21]: 0 0.04/0.48 with precondition: [V_i_0=1,B=3,D=1,F=0,V_n=V_j_0+1,V_n=E+1,V_n>=1,C>=1] 0.04/0.48 0.04/0.48 * Chain [20]: 0 0.04/0.48 with precondition: [V_i_0=1,B=3,D=1,F=0,V_j_0=E,V_j_0+V_n=1,0>=V_j_0,0>=C] 0.04/0.48 0.04/0.48 * Chain [17]: 0 0.04/0.48 with precondition: [B=2,V_i_0>=1,V_n>=V_i_0+V_j_0,V_j_0+V_n>=V_i_0] 0.04/0.48 0.04/0.48 0.04/0.48 #### Cost of chains of eval_wcet0_bb1_in_loop_cont(A,B,C,D,E,F,G): 0.04/0.48 * Chain [23]: 0 0.04/0.48 with precondition: [A=2,F>=1] 0.04/0.48 0.04/0.48 * Chain [22]: 0 0.04/0.48 with precondition: [A=3,F>=1] 0.04/0.48 0.04/0.48 0.04/0.48 #### Cost of chains of eval_wcet0_3(V_1,V_i_0,V_j_0,V_j_3,V_n,B): 0.04/0.48 * Chain [27]: 0 0.04/0.48 with precondition: [V_n=1] 0.04/0.48 0.04/0.48 * Chain [26]: 0 0.04/0.48 with precondition: [0>=V_n] 0.04/0.48 0.04/0.48 * Chain [25]: 0 0.04/0.48 with precondition: [V_n>=1] 0.04/0.48 0.04/0.48 * Chain [24]: 10*s(2)+0 0.04/0.48 Such that:aux(12) =< V_n 0.04/0.48 s(2) =< aux(12) 0.04/0.48 0.04/0.48 with precondition: [V_n>=2] 0.04/0.48 0.04/0.48 0.04/0.48 #### Cost of chains of eval_wcet0_start(V_1,V_i_0,V_j_0,V_j_3,V_n,B): 0.04/0.48 * Chain [31]: 0 0.04/0.48 with precondition: [V_n=1] 0.04/0.48 0.04/0.48 * Chain [30]: 0 0.04/0.48 with precondition: [0>=V_n] 0.04/0.48 0.04/0.48 * Chain [29]: 0 0.04/0.48 with precondition: [V_n>=1] 0.04/0.48 0.04/0.48 * Chain [28]: 10*s(12)+0 0.04/0.48 Such that:s(11) =< V_n 0.04/0.48 s(12) =< s(11) 0.04/0.48 0.04/0.48 with precondition: [V_n>=2] 0.04/0.48 0.04/0.48 0.04/0.48 Closed-form bounds of eval_wcet0_start(V_1,V_i_0,V_j_0,V_j_3,V_n,B): 0.04/0.48 ------------------------------------- 0.04/0.48 * Chain [31] with precondition: [V_n=1] 0.04/0.48 - Upper bound: 0 0.04/0.48 - Complexity: constant 0.04/0.48 * Chain [30] with precondition: [0>=V_n] 0.04/0.48 - Upper bound: 0 0.04/0.48 - Complexity: constant 0.04/0.48 * Chain [29] with precondition: [V_n>=1] 0.04/0.48 - Upper bound: 0 0.04/0.48 - Complexity: constant 0.04/0.48 * Chain [28] with precondition: [V_n>=2] 0.04/0.48 - Upper bound: 10*V_n 0.04/0.48 - Complexity: n 0.04/0.48 0.04/0.48 ### Maximum cost of eval_wcet0_start(V_1,V_i_0,V_j_0,V_j_3,V_n,B): nat(V_n)*10 0.04/0.48 Asymptotic class: n 0.04/0.48 * Total analysis performed in 396 ms. 0.04/0.48 0.04/0.58 EOF