Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746027
details
property
value
status
complete
benchmark
svcomp_a.09_assume.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.232733011246 seconds
cpu usage
0.15012037
max memory
8462336.0
stage attributes
key
value
output-size
3604
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) 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/4] 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/4 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 5 is refined into CE [6] * CE 4 is refined into CE [7] * CE 3 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_bb1_in/4 * CEs [8] --> Loop 6 * CEs [6] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_foo_bb1_in(V_x,V_y,V__0,B) * RF of phase [6]: [V_x-V__0+1] #### Partial ranking functions of CR eval_foo_bb1_in(V_x,V_y,V__0,B) * Partial RF of phase [6]: - RF of loop [6:1]: V_x-V__0+1 ### Specialization of cost equations eval_foo_bb0_in/4 * CE 2 is refined into CE [9,10,11] ### Cost equations --> "Loop" of eval_foo_bb0_in/4 * CEs [11] --> Loop 9 * CEs [10] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,B) ### Specialization of cost equations eval_foo_start/4 * CE 1 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [14] --> Loop 12 * CEs [13] --> Loop 13 * CEs [12] --> Loop 14 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_x,V_y,V__0,B): * Chain [[6],7]: 1*it(6)+0 Such that:it(6) =< V_x-V__0+1 with precondition: [B=2,V_y>=1,V_x>=V__0] * Chain [8]: 0 with precondition: [B=2,0>=V_y] * Chain [7]: 0 with precondition: [B=2,V__0>=V_x+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,V_z,B): * Chain [11]: 0 with precondition: [0>=V_y] * Chain [10]: 1*s(1)+0 Such that:s(1) =< V_x-V_z+1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445