Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745618
details
property
value
status
complete
benchmark
Singapore_plus_false-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n114.star.cs.uiowa.edu
space
Adapted_from_Ton_Chanh_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.219483137131 seconds
cpu usage
0.1369052
max memory
8282112.0
stage attributes
key
value
output-size
3346
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/3,eval_foo_bb2_in/3] 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/3] 5. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/3 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/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 5 is refined into CE [6] * CE 4 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [7] --> Loop 6 * CEs [6] --> Loop 7 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) ### Specialization of cost equations eval_foo_bb0_in/3 * CE 3 is refined into CE [8,9] * CE 2 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [10] --> Loop 8 * CEs [8] --> Loop 9 * CEs [9] --> Loop 10 ### 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/3 * CE 1 is refined into CE [11,12,13] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [13] --> Loop 11 * CEs [12] --> Loop 12 * CEs [11] --> Loop 13 ### Ranking functions of CR eval_foo_start(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [[6]]...: 1*it(6)+0 with precondition: [V__0>=1,V__0+V__01>=0,B=2] * Chain [7]: 0 with precondition: [B=2,0>=V__0,V__0+V__01>=0] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): * Chain [10]...: 1*s(1)+0 with precondition: [V_x>=1,V_x+V_y>=0] * Chain [9]: 0 with precondition: [0>=V_x,V_x+V_y>=0] * Chain [8]: 0 with precondition: [0>=V_x+V_y+1] #### Cost of chains of eval_foo_start(V_x,V_y,B): * Chain [13]: 0 with precondition: [0>=V_x,V_x+V_y>=0] * Chain [12]: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445