details

property	value
status	complete
benchmark	ex_paper1.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n150.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	1.42752 seconds
cpu usage	1.34845
user time	1.32249
system time	0.025954
max virtual memory	318484.0
max residence set size	15312.0

stage attributes

key	value
starexec-result	WORST_CASE(?,O(n^2))

output

1.31/1.32 WORST_CASE(?,O(n^2)) 1.31/1.32 1.31/1.32 Preprocessing Cost Relations 1.31/1.32 ===================================== 1.31/1.32 1.31/1.32 #### Computed strongly connected components 1.31/1.32 0. non_recursive : [eval_p1_stop/13] 1.31/1.32 1. non_recursive : [eval_p1_20/13] 1.31/1.32 2. non_recursive : [eval_p1_19/13] 1.31/1.32 3. non_recursive : [eval_p1_bb12_in/13] 1.31/1.32 4. recursive : [eval_p1_10/10,eval_p1_11/10,eval_p1_7/10,eval_p1_8/10,eval_p1_bb3_in/10,eval_p1_bb4_in/10,eval_p1_bb5_in/10] 1.31/1.32 5. recursive : [eval_p1__critedge_in/15,eval_p1_bb2_in/15,eval_p1_bb3_in_loop_cont/16] 1.31/1.32 6. recursive : [eval_p1_14/5,eval_p1_15/5,eval_p1_bb8_in/5,eval_p1_bb9_in/5] 1.31/1.32 7. recursive : [eval_p1_bb6_in/8,eval_p1_bb7_in/8,eval_p1_bb8_in_loop_cont/9] 1.31/1.32 8. non_recursive : [eval_p1_bb10_in/13] 1.31/1.32 9. non_recursive : [exit_location/1] 1.31/1.32 10. non_recursive : [eval_p1_bb6_in_loop_cont/14] 1.31/1.32 11. non_recursive : [eval_p1__critedge_in_loop_cont/14] 1.31/1.32 12. non_recursive : [eval_p1_18/13] 1.31/1.32 13. non_recursive : [eval_p1_17/13] 1.31/1.32 14. non_recursive : [eval_p1_bb11_in/13] 1.31/1.32 15. non_recursive : [eval_p1_bb1_in/13] 1.31/1.32 16. non_recursive : [eval_p1_3/13] 1.31/1.32 17. non_recursive : [eval_p1_2/13] 1.31/1.32 18. non_recursive : [eval_p1_1/13] 1.31/1.32 19. non_recursive : [eval_p1_0/13] 1.31/1.32 20. non_recursive : [eval_p1_bb0_in/13] 1.31/1.32 21. non_recursive : [eval_p1_start/13] 1.31/1.32 1.31/1.32 #### Obtained direct recursion through partial evaluation 1.31/1.32 0. SCC is completely evaluated into other SCCs 1.31/1.32 1. SCC is completely evaluated into other SCCs 1.31/1.32 2. SCC is completely evaluated into other SCCs 1.31/1.32 3. SCC is completely evaluated into other SCCs 1.31/1.32 4. SCC is partially evaluated into eval_p1_bb3_in/10 1.31/1.32 5. SCC is partially evaluated into eval_p1__critedge_in/15 1.31/1.32 6. SCC is partially evaluated into eval_p1_bb8_in/5 1.31/1.32 7. SCC is partially evaluated into eval_p1_bb6_in/8 1.31/1.32 8. SCC is completely evaluated into other SCCs 1.31/1.32 9. SCC is completely evaluated into other SCCs 1.31/1.32 10. SCC is partially evaluated into eval_p1_bb6_in_loop_cont/14 1.31/1.32 11. SCC is partially evaluated into eval_p1__critedge_in_loop_cont/14 1.31/1.32 12. SCC is completely evaluated into other SCCs 1.31/1.32 13. SCC is completely evaluated into other SCCs 1.31/1.32 14. SCC is completely evaluated into other SCCs 1.31/1.32 15. SCC is partially evaluated into eval_p1_bb1_in/13 1.31/1.32 16. SCC is partially evaluated into eval_p1_3/13 1.31/1.32 17. SCC is completely evaluated into other SCCs 1.31/1.32 18. SCC is completely evaluated into other SCCs 1.31/1.32 19. SCC is completely evaluated into other SCCs 1.31/1.32 20. SCC is completely evaluated into other SCCs 1.31/1.32 21. SCC is partially evaluated into eval_p1_start/13 1.31/1.32 1.31/1.32 Control-Flow Refinement of Cost Relations 1.31/1.32 ===================================== 1.31/1.32 1.31/1.32 ### Specialization of cost equations eval_p1_bb3_in/10 1.31/1.32 * CE 15 is refined into CE [26] 1.31/1.32 * CE 12 is refined into CE [27] 1.31/1.32 * CE 16 is refined into CE [28] 1.31/1.32 * CE 14 is refined into CE [29] 1.31/1.32 * CE 13 is refined into CE [30] 1.31/1.32 1.31/1.32 1.31/1.32 ### Cost equations --> "Loop" of eval_p1_bb3_in/10 1.31/1.32 * CEs [29] --> Loop 26 1.31/1.32 * CEs [30] --> Loop 27 1.31/1.32 * CEs [26] --> Loop 28 1.31/1.32 * CEs [27] --> Loop 29 1.31/1.32 * CEs [28] --> Loop 30 1.31/1.32 1.31/1.32 ### Ranking functions of CR eval_p1_bb3_in(V__0,V__01,V__1,V_6,V_8,B,C,D,E,F) 1.31/1.32 * RF of phase [26,27]: [V__1] 1.31/1.32 1.31/1.32 #### Partial ranking functions of CR eval_p1_bb3_in(V__0,V__01,V__1,V_6,V_8,B,C,D,E,F) 1.31/1.32 * Partial RF of phase [26,27]: 1.31/1.32 - RF of loop [26:1,27:1]: 1.31/1.32 V__1 1.31/1.32 1.31/1.32 1.31/1.32 ### Specialization of cost equations eval_p1__critedge_in/15 1.31/1.32 * CE 6 is refined into CE [31,32] 1.31/1.32 * CE 9 is refined into CE [33] 1.31/1.32 * CE 8 is refined into CE [34] 1.31/1.32 * CE 7 is refined into CE [35,36,37,38] 1.31/1.32 1.31/1.32 1.31/1.32 ### Cost equations --> "Loop" of eval_p1__critedge_in/15 1.31/1.32 * CEs [38] --> Loop 31 1.31/1.32 * CEs [37] --> Loop 32 1.31/1.32 * CEs [36] --> Loop 33 1.31/1.32 * CEs [35] --> Loop 34 1.31/1.32 * CEs [31] --> Loop 35 1.31/1.32 * CEs [32] --> Loop 36 1.31/1.32 * CEs [33] --> Loop 37 1.31/1.32 * CEs [34] --> Loop 38 1.31/1.32 1.31/1.32 ### Ranking functions of CR eval_p1__critedge_in(V__0,V__01,V__1,V__2,V_3,V_6,V_8,B,C,D,E,F,G,H,I) 1.31/1.32 * RF of phase [32,33,34]: [V__0] 1.31/1.32 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46