Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745729
details
property
value
status
complete
benchmark
cBench_noiseTickSize.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n095.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.290590047836 seconds
cpu usage
0.212285962
max memory
8515584.0
stage attributes
key
value
output-size
4731
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_noiseTickSize_0/4,eval_noiseTickSize_1/5,eval_noiseTickSize_bb1_in/4] 1. non_recursive : [eval_noiseTickSize_stop/1] 2. non_recursive : [eval_noiseTickSize_bb2_in/1] 3. non_recursive : [eval_noiseTickSize_bb1_in_loop_cont/2] 4. non_recursive : [eval_noiseTickSize_bb0_in/2] 5. non_recursive : [eval_noiseTickSize_start/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_noiseTickSize_bb1_in/4 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into eval_noiseTickSize_bb1_in_loop_cont/2 4. SCC is partially evaluated into eval_noiseTickSize_bb0_in/2 5. SCC is partially evaluated into eval_noiseTickSize_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_noiseTickSize_bb1_in/4 * CE 5 is refined into CE [8] * CE 6 is refined into CE [9] * CE 3 is refined into CE [10] * CE 4 is refined into CE [11] ### Cost equations --> "Loop" of eval_noiseTickSize_bb1_in/4 * CEs [10] --> Loop 8 * CEs [11] --> Loop 9 * CEs [8] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_noiseTickSize_bb1_in(V_DELTAS,V_j_0,V_i_0,B) #### Partial ranking functions of CR eval_noiseTickSize_bb1_in(V_DELTAS,V_j_0,V_i_0,B) * Partial RF of phase [10,11]: - RF of loop [10:1]: -V_j_0+10001 depends on loops [11:1] - RF of loop [11:1]: V_DELTAS-V_i_0-1 ### Specialization of cost equations eval_noiseTickSize_bb1_in_loop_cont/2 * CE 7 is refined into CE [12] ### Cost equations --> "Loop" of eval_noiseTickSize_bb1_in_loop_cont/2 * CEs [12] --> Loop 12 ### Ranking functions of CR eval_noiseTickSize_bb1_in_loop_cont(A,B) #### Partial ranking functions of CR eval_noiseTickSize_bb1_in_loop_cont(A,B) ### Specialization of cost equations eval_noiseTickSize_bb0_in/2 * CE 2 is refined into CE [13,14] ### Cost equations --> "Loop" of eval_noiseTickSize_bb0_in/2 * CEs [14] --> Loop 13 * CEs [13] --> Loop 14 ### Ranking functions of CR eval_noiseTickSize_bb0_in(V_DELTAS,B) #### Partial ranking functions of CR eval_noiseTickSize_bb0_in(V_DELTAS,B) ### Specialization of cost equations eval_noiseTickSize_start/2 * CE 1 is refined into CE [15,16] ### Cost equations --> "Loop" of eval_noiseTickSize_start/2 * CEs [16] --> Loop 15 * CEs [15] --> Loop 16 ### Ranking functions of CR eval_noiseTickSize_start(V_DELTAS,B) #### Partial ranking functions of CR eval_noiseTickSize_start(V_DELTAS,B) Computing Bounds ===================================== #### Cost of chains of eval_noiseTickSize_bb1_in(V_DELTAS,V_j_0,V_i_0,B): * Chain [[10,11],9]: 1*it(10)+1*it(11)+0 Such that:aux(2) =< -V_j_0+10001 aux(6) =< V_DELTAS-V_i_0 it(11) =< aux(6) aux(1) =< aux(6)*10000
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445