Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745972
details
property
value
status
complete
benchmark
CookSeeZuleger-TACAS2013-Fig1_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.258285999298 seconds
cpu usage
0.177327454
max memory
8429568.0
stage attributes
key
value
output-size
3841
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_0/3,eval_foo_1/4,eval_foo_4/4,eval_foo_5/5,eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/4,eval_foo_bb4_in/4] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb5_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 [7] * CE 6 is refined into CE [8] * CE 4 is refined into CE [9] * CE 3 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [9] --> Loop 7 * CEs [10] --> Loop 8 * CEs [7] --> Loop 9 * CEs [8] --> Loop 10 ### 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) * Partial RF of phase [7,8]: - RF of loop [7:1]: V__01 - RF of loop [8:1]: V__0 depends on loops [7:1] ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [11,12,13] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [13] --> Loop 11 * CEs [11] --> Loop 12 * CEs [12] --> Loop 13 ### 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 [14,15,16] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 ### 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 [[7,8],10]: 1*it(7)+1*it(8)+0 Such that:it(7) =< V__01 with precondition: [B=2,V__01>=1,V__0>=1] * Chain [[7,8],9]: 1*it(7)+1*it(8)+0 Such that:it(7) =< V__01 with precondition: [B=2,V__01>=1,V__0>=1] * Chain [10]: 0 with precondition: [B=2,0>=V__01] * Chain [9]: 0 with precondition: [B=2,0>=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