Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745845
details
property
value
status
complete
benchmark
aaron2.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n086.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.270901918411 seconds
cpu usage
0.190221643
max memory
8527872.0
stage attributes
key
value
output-size
4039
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_aaron2_0/4,eval_aaron2_1/5,eval_aaron2_bb1_in/4,eval_aaron2_bb2_in/4,eval_aaron2_bb3_in/5,eval_aaron2_bb4_in/5] 1. non_recursive : [eval_aaron2_stop/1] 2. non_recursive : [eval_aaron2_bb5_in/1] 3. non_recursive : [eval_aaron2_bb1_in_loop_cont/2] 4. non_recursive : [eval_aaron2_bb0_in/4] 5. non_recursive : [eval_aaron2_start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_aaron2_bb1_in/4 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_aaron2_bb0_in/4 5. SCC is partially evaluated into eval_aaron2_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_aaron2_bb1_in/4 * CE 6 is refined into CE [8] * CE 7 is discarded (unfeasible) * CE 5 is refined into CE [9] * CE 4 is refined into CE [10] ### Cost equations --> "Loop" of eval_aaron2_bb1_in/4 * CEs [9] --> Loop 8 * CEs [10] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) * RF of phase [8,9]: [-V__02+V__01+1] #### Partial ranking functions of CR eval_aaron2_bb1_in(V_tx,V__02,V__01,B) * Partial RF of phase [8,9]: - RF of loop [8:1,9:1]: -V__02+V__01+1 ### Specialization of cost equations eval_aaron2_bb0_in/4 * CE 3 is refined into CE [11,12] * CE 2 is refined into CE [13] ### Cost equations --> "Loop" of eval_aaron2_bb0_in/4 * CEs [11] --> Loop 11 * CEs [12] --> Loop 12 * CEs [13] --> Loop 13 ### Ranking functions of CR eval_aaron2_bb0_in(V_tx,V_x,V_y,B) #### Partial ranking functions of CR eval_aaron2_bb0_in(V_tx,V_x,V_y,B) ### Specialization of cost equations eval_aaron2_start/4 * CE 1 is refined into CE [14,15,16] ### Cost equations --> "Loop" of eval_aaron2_start/4 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 ### Ranking functions of CR eval_aaron2_start(V_tx,V_x,V_y,B) #### Partial ranking functions of CR eval_aaron2_start(V_tx,V_x,V_y,B) Computing Bounds ===================================== #### Cost of chains of eval_aaron2_bb1_in(V_tx,V__02,V__01,B): * Chain [[8,9],10]: 2*it(8)+0 Such that:aux(2) =< V_tx-V__02+V__01+1 aux(1) =< -V__02+V__01+1 it(8) =< aux(1) it(8) =< aux(2) with precondition: [B=2,V_tx>=0,V__01>=V__02] * Chain [10]: 0 with precondition: [B=2,V_tx>=0,V__02>=V__01+1] #### Cost of chains of eval_aaron2_bb0_in(V_tx,V_x,V_y,B): * Chain [13]: 0 with precondition: [0>=V_tx+1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445