Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745806
details
property
value
status
complete
benchmark
speedFails3.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.324998855591 seconds
cpu usage
0.244127536
max memory
8863744.0
stage attributes
key
value
output-size
5291
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_speedFails3_bb1_in/5,eval_speedFails3_bb2_in/5] 1. non_recursive : [eval_speedFails3_stop/1] 2. non_recursive : [eval_speedFails3_bb3_in/1] 3. non_recursive : [eval_speedFails3_bb1_in_loop_cont/2] 4. non_recursive : [eval_speedFails3_1/5] 5. non_recursive : [eval_speedFails3_0/4] 6. non_recursive : [eval_speedFails3_bb0_in/4] 7. non_recursive : [eval_speedFails3_start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_speedFails3_bb1_in/5 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_speedFails3_1/5 5. SCC is completely evaluated into other SCCs 6. SCC is completely evaluated into other SCCs 7. SCC is partially evaluated into eval_speedFails3_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_speedFails3_bb1_in/5 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] * CE 4 is refined into CE [9] * CE 3 is refined into CE [10] ### Cost equations --> "Loop" of eval_speedFails3_bb1_in/5 * CEs [9] --> Loop 7 * CEs [10] --> Loop 8 * CEs [7] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_speedFails3_bb1_in(V_n,V_t,V_0,V__0,B) #### Partial ranking functions of CR eval_speedFails3_bb1_in(V_n,V_t,V_0,V__0,B) ### Specialization of cost equations eval_speedFails3_1/5 * CE 2 is refined into CE [11,12,13,14,15,16,17,18] ### Cost equations --> "Loop" of eval_speedFails3_1/5 * CEs [17] --> Loop 11 * CEs [18] --> Loop 12 * CEs [16] --> Loop 13 * CEs [15] --> Loop 14 * CEs [13] --> Loop 15 * CEs [12] --> Loop 16 * CEs [11] --> Loop 17 * CEs [14] --> Loop 18 ### Ranking functions of CR eval_speedFails3_1(V_x,V_n,V_t,V_0,B) #### Partial ranking functions of CR eval_speedFails3_1(V_x,V_n,V_t,V_0,B) ### Specialization of cost equations eval_speedFails3_start/4 * CE 1 is refined into CE [19,20,21,22,23,24,25,26] ### Cost equations --> "Loop" of eval_speedFails3_start/4 * CEs [25,26] --> Loop 19 * CEs [24] --> Loop 20 * CEs [22,23] --> Loop 21 * CEs [20,21] --> Loop 22 * CEs [19] --> Loop 23 ### Ranking functions of CR eval_speedFails3_start(V_x,V_n,V_t,B) #### Partial ranking functions of CR eval_speedFails3_start(V_x,V_n,V_t,B) Computing Bounds ===================================== #### Cost of chains of eval_speedFails3_bb1_in(V_n,V_t,V_0,V__0,B): * Chain [[8]]...: 1*it(8)+0 with precondition: [V_n>=V__0,V__0>=0,0>=V_0,B=2] * Chain [[8],10]: 1*it(8)+0 with precondition: [B=2,0>=V_0,V_t>=1,V__0>=0,V_n>=V__0] * Chain [[8],9]: 1*it(8)+0 with precondition: [B=2,0>=V_t+1,0>=V_0,V__0>=0,V_n>=V__0]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445