Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746307
details
property
value
status
complete
benchmark
DivWithoutMinus.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n021.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.31178689003 seconds
cpu usage
0.23185997
max memory
8675328.0
stage attributes
key
value
output-size
3860
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo__critedge5_in/4,eval_foo_bb1_in/4,eval_foo_bb2_in/4,eval_foo_bb3_in/4,eval_foo_bb4_in/4,eval_foo_bb5_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo__critedge_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/3] 5. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_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_foo_bb0_in/3 5. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 3 is refined into CE [8] * CE 4 is discarded (unfeasible) * CE 7 is refined into CE [9] * CE 5 is refined into CE [10] * CE 6 is refined into CE [11] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [10] --> Loop 8 * CEs [11] --> Loop 9 * CEs [8] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_foo_bb1_in(V_y,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V_y,V__01,V__0,B) * Partial RF of phase [8,9]: - RF of loop [8:1]: V__01 depends on loops [9:1] - RF of loop [9:1]: -V__01+1 depends on loops [8:1] ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [14] --> Loop 12 * CEs [12] --> Loop 13 * CEs [13] --> Loop 14 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [15,16,17] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [17] --> Loop 15 * CEs [16] --> Loop 16 * CEs [15] --> Loop 17 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,V_res,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,V_res,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_y,V__01,V__0,B): * Chain [[8,9]]...: 2*it(8)+0 with precondition: [V_y>=V__01,V_y>=1,V__01>=0,B=2] * Chain [[8,9],10]: 2*it(8)+0 with precondition: [V__01=0,B=2,0>=V__0,V_y>=1] * Chain [11]: 0 with precondition: [B=2,V__01=V_y,0>=V__01] * Chain [10]: 0 with precondition: [B=2,0>=V__0,V__01>=1,V_y>=V__01] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B):
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445