Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745602
details
property
value
status
complete
benchmark
heapsort.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n087.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.466596841812 seconds
cpu usage
0.391453727
max memory
9433088.0
stage attributes
key
value
output-size
6693
starexec-result
WORST_CASE(?,O(n^1))
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^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_heapsort_4/5,eval_heapsort_5/6,eval_heapsort_7/6,eval_heapsort_8/7,eval_heapsort_bb10_in/7,eval_heapsort_bb1_in/3,eval_heapsort_bb2_in/3,eval_heapsort_bb3_in/5,eval_heapsort_bb4_in/5,eval_heapsort_bb5_in/6,eval_heapsort_bb6_in/6,eval_heapsort_bb7_in/6,eval_heapsort_bb8_in/7,eval_heapsort_bb9_in/7] 1. non_recursive : [eval_heapsort_stop/1] 2. non_recursive : [eval_heapsort_bb11_in/1] 3. non_recursive : [eval_heapsort_bb1_in_loop_cont/2] 4. non_recursive : [eval_heapsort_bb0_in/2] 5. non_recursive : [eval_heapsort_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_heapsort_bb1_in/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_heapsort_bb0_in/2 5. SCC is partially evaluated into eval_heapsort_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_heapsort_bb1_in/3 * CE 7 is refined into CE [11] * CE 3 is refined into CE [12] * CE 10 is discarded (unfeasible) * CE 9 is refined into CE [13] * CE 5 is refined into CE [14] * CE 6 is refined into CE [15] * CE 8 is refined into CE [16] * CE 4 is refined into CE [17] ### Cost equations --> "Loop" of eval_heapsort_bb1_in/3 * CEs [15] --> Loop 11 * CEs [16] --> Loop 12 * CEs [17] --> Loop 13 * CEs [11] --> Loop 14 * CEs [12] --> Loop 15 * CEs [14] --> Loop 16 * CEs [13] --> Loop 17 ### Ranking functions of CR eval_heapsort_bb1_in(V_size,V_i_0,B) * RF of phase [11,12]: [V_size/2-V_i_0] #### Partial ranking functions of CR eval_heapsort_bb1_in(V_size,V_i_0,B) * Partial RF of phase [11,12]: - RF of loop [11:1]: V_size/4-V_i_0/2 - RF of loop [12:1]: V_size/2-V_i_0 ### Specialization of cost equations eval_heapsort_bb0_in/2 * CE 2 is refined into CE [18,19,20,21,22,23,24] ### Cost equations --> "Loop" of eval_heapsort_bb0_in/2 * CEs [23] --> Loop 18 * CEs [22] --> Loop 19 * CEs [24] --> Loop 20 * CEs [18] --> Loop 21 * CEs [19,20] --> Loop 22 * CEs [21] --> Loop 23 ### Ranking functions of CR eval_heapsort_bb0_in(V_size,B) #### Partial ranking functions of CR eval_heapsort_bb0_in(V_size,B) ### Specialization of cost equations eval_heapsort_start/2 * CE 1 is refined into CE [25,26,27,28,29,30] ### Cost equations --> "Loop" of eval_heapsort_start/2 * CEs [30] --> Loop 24 * CEs [29] --> Loop 25 * CEs [28] --> Loop 26 * CEs [27] --> Loop 27 * CEs [26] --> Loop 28 * CEs [25] --> Loop 29 ### Ranking functions of CR eval_heapsort_start(V_size,B) #### Partial ranking functions of CR eval_heapsort_start(V_size,B) Computing Bounds ===================================== #### Cost of chains of eval_heapsort_bb1_in(V_size,V_i_0,B): * Chain [[11,12],16]: 1*it(11)+1*it(12)+0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445