Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746185
details
property
value
status
complete
benchmark
Narrowing.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.85493016243 seconds
cpu usage
0.788950592
max memory
9973760.0
stage attributes
key
value
output-size
6050
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_bb1_in/4,eval_foo_bb2_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb3_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/2] 5. non_recursive : [eval_foo_start/4] #### 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/2 5. SCC is partially evaluated into eval_foo_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/4 * CE 20 is refined into CE [21] * CE 19 is refined into CE [22] * CE 17 is discarded (unfeasible) * CE 15 is discarded (unfeasible) * CE 14 is discarded (unfeasible) * CE 13 is discarded (unfeasible) * CE 18 is discarded (unfeasible) * CE 16 is discarded (unfeasible) * CE 7 is refined into CE [23] * CE 5 is refined into CE [24] * CE 6 is refined into CE [25] * CE 4 is discarded (unfeasible) * CE 3 is discarded (unfeasible) * CE 9 is refined into CE [26] * CE 10 is refined into CE [27] * CE 8 is refined into CE [28] * CE 12 is refined into CE [29] * CE 11 is refined into CE [30] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [23] --> Loop 21 * CEs [25] --> Loop 22 * CEs [27] --> Loop 23 * CEs [26] --> Loop 24 * CEs [28] --> Loop 25 * CEs [30] --> Loop 26 * CEs [29] --> Loop 27 * CEs [24] --> Loop 28 * CEs [21] --> Loop 29 * CEs [22] --> Loop 30 ### Ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) * RF of phase [24]: [-V__0+17] * RF of phase [27]: [V__0] #### Partial ranking functions of CR eval_foo_bb1_in(V__03,V__01,V__0,B) * Partial RF of phase [21,22,23,26]: - RF of loop [21:1]: -V__01+V__0+1 depends on loops [22:1,23:1] - RF of loop [21:1,26:1]: V__0 depends on loops [22:1,23:1] - RF of loop [22:1]: -V__0+1 depends on loops [21:1,26:1] - RF of loop [23:1]: -V__0+20 depends on loops [21:1,26:1] V__01-V__0 depends on loops [21:1] - RF of loop [26:1]: V__01-1 * Partial RF of phase [24]: - RF of loop [24:1]: -V__0+17 * Partial RF of phase [27]: - RF of loop [27:1]: V__0 ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [31,32,33,34,35] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [34] --> Loop 31 * CEs [35] --> Loop 32 * CEs [33] --> Loop 33 * CEs [32] --> Loop 34 * CEs [31] --> Loop 35 ### Ranking functions of CR eval_foo_bb0_in(V_i,B)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445