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