Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745995
details
property
value
status
complete
benchmark
sipmamergesort2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n080.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
18.8892879486 seconds
cpu usage
18.835148777
max memory
3.5094528E7
stage attributes
key
value
output-size
205162
starexec-result
WORST_CASE(?,O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_sipmamergesort2_8/6,eval_sipmamergesort2_9/7,eval_sipmamergesort2_bb3_in/6,eval_sipmamergesort2_bb4_in/6,eval_sipmamergesort2_bb5_in/7,eval_sipmamergesort2_bb6_in/7] 1. recursive : [eval_sipmamergesort2_bb7_in/3,eval_sipmamergesort2_bb8_in/3] 2. recursive : [eval_sipmamergesort2_bb10_in/3,eval_sipmamergesort2_bb9_in/3] 3. recursive : [eval_sipmamergesort2_bb11_in/14,eval_sipmamergesort2_bb2_in/9,eval_sipmamergesort2_bb3_in_loop_cont/14,eval_sipmamergesort2_bb7_in_loop_cont/15,eval_sipmamergesort2_bb9_in_loop_cont/15] 4. recursive : [eval_sipmamergesort2_37/6,eval_sipmamergesort2_38/7,eval_sipmamergesort2_bb15_in/6,eval_sipmamergesort2_bb16_in/6,eval_sipmamergesort2_bb17_in/7,eval_sipmamergesort2_bb18_in/7] 5. recursive : [eval_sipmamergesort2_bb19_in/3,eval_sipmamergesort2_bb20_in/3] 6. recursive : [eval_sipmamergesort2_bb21_in/3,eval_sipmamergesort2_bb22_in/3] 7. recursive : [eval_sipmamergesort2_bb14_in/9,eval_sipmamergesort2_bb15_in_loop_cont/14,eval_sipmamergesort2_bb19_in_loop_cont/15,eval_sipmamergesort2_bb21_in_loop_cont/15,eval_sipmamergesort2_bb23_in/14] 8. recursive : [eval_sipmamergesort2_bb12_in/10,eval_sipmamergesort2_bb13_in/11,eval_sipmamergesort2_bb14_in_loop_cont/18,eval_sipmamergesort2_bb1_in/4,eval_sipmamergesort2_bb24_in/17,eval_sipmamergesort2_bb2_in_loop_cont/11] 9. recursive : [eval_sipmamergesort2_bb26_in/3,eval_sipmamergesort2_bb27_in/3] 10. non_recursive : [eval_sipmamergesort2_stop/1] 11. non_recursive : [eval_sipmamergesort2_bb28_in/1] 12. non_recursive : [eval_sipmamergesort2_bb26_in_loop_cont/2] 13. non_recursive : [eval_sipmamergesort2_bb25_in/3] 14. non_recursive : [eval_sipmamergesort2_bb1_in_loop_cont/4] 15. non_recursive : [eval_sipmamergesort2_bb0_in/2] 16. non_recursive : [eval_sipmamergesort2_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_sipmamergesort2_bb3_in/6 1. SCC is partially evaluated into eval_sipmamergesort2_bb7_in/3 2. SCC is partially evaluated into eval_sipmamergesort2_bb9_in/3 3. SCC is partially evaluated into eval_sipmamergesort2_bb2_in/9 4. SCC is partially evaluated into eval_sipmamergesort2_bb15_in/6 5. SCC is partially evaluated into eval_sipmamergesort2_bb19_in/3 6. SCC is partially evaluated into eval_sipmamergesort2_bb21_in/3 7. SCC is partially evaluated into eval_sipmamergesort2_bb14_in/9 8. SCC is partially evaluated into eval_sipmamergesort2_bb1_in/4 9. SCC is partially evaluated into eval_sipmamergesort2_bb26_in/3 10. SCC is completely evaluated into other SCCs 11. SCC is completely evaluated into other SCCs 12. SCC is completely evaluated into other SCCs 13. SCC is partially evaluated into eval_sipmamergesort2_bb25_in/3 14. SCC is completely evaluated into other SCCs 15. SCC is partially evaluated into eval_sipmamergesort2_bb0_in/2 16. SCC is partially evaluated into eval_sipmamergesort2_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_sipmamergesort2_bb3_in/6 * CE 25 is refined into CE [39] * CE 26 is refined into CE [40] * CE 24 is refined into CE [41] * CE 23 is refined into CE [42] ### Cost equations --> "Loop" of eval_sipmamergesort2_bb3_in/6 * CEs [41] --> Loop 39 * CEs [42] --> Loop 40 * CEs [39] --> Loop 41 * CEs [40] --> Loop 42 ### Ranking functions of CR eval_sipmamergesort2_bb3_in(V_r_1,V_q_1,B,C,D,E) * RF of phase [39,40]: [V_r_1+V_q_1-1] #### Partial ranking functions of CR eval_sipmamergesort2_bb3_in(V_r_1,V_q_1,B,C,D,E) * Partial RF of phase [39,40]: - RF of loop [39:1]: V_r_1 - RF of loop [40:1]: V_q_1 ### Specialization of cost equations eval_sipmamergesort2_bb7_in/3 * CE 28 is refined into CE [43] * CE 27 is refined into CE [44] ### Cost equations --> "Loop" of eval_sipmamergesort2_bb7_in/3 * CEs [44] --> Loop 43 * CEs [43] --> Loop 44 ### Ranking functions of CR eval_sipmamergesort2_bb7_in(V_r_3,B,C) * RF of phase [43]: [V_r_3] #### Partial ranking functions of CR eval_sipmamergesort2_bb7_in(V_r_3,B,C) * Partial RF of phase [43]: - RF of loop [43:1]: V_r_3 ### Specialization of cost equations eval_sipmamergesort2_bb9_in/3 * CE 30 is refined into CE [45] * CE 29 is refined into CE [46] ### Cost equations --> "Loop" of eval_sipmamergesort2_bb9_in/3
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445