Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746459
details
property
value
status
complete
benchmark
svcomp_java_Break.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n093.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.202803850174 seconds
cpu usage
0.119521607
max memory
8228864.0
stage attributes
key
value
output-size
2791
starexec-result
WORST_CASE(?,O(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(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in/2] 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/1] 5. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/2 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/1 5. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/2 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [6] --> Loop 5 * CEs [5] --> Loop 6 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) * RF of phase [5]: [-V__0+11] #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) * Partial RF of phase [5]: - RF of loop [5:1]: -V__0+11 ### Specialization of cost equations eval_foo_bb0_in/1 * CE 2 is refined into CE [7] ### Cost equations --> "Loop" of eval_foo_bb0_in/1 * CEs [7] --> Loop 7 ### Ranking functions of CR eval_foo_bb0_in(B) #### Partial ranking functions of CR eval_foo_bb0_in(B) ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [8] --> Loop 8 ### Ranking functions of CR eval_foo_start(V_i,V_c,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_c,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__0,B): * Chain [[5],6]: 1*it(5)+0 Such that:it(5) =< -V__0+11 with precondition: [B=2,10>=V__0,V__0>=0] #### Cost of chains of eval_foo_bb0_in(B): * Chain [7]: 1*s(1)+0 Such that:s(1) =< 11 with precondition: [] #### Cost of chains of eval_foo_start(V_i,V_c,B): * Chain [8]: 1*s(2)+0 Such that:s(2) =< 11 with precondition: [] Closed-form bounds of eval_foo_start(V_i,V_c,B): ------------------------------------- * Chain [8] with precondition: [] - Upper bound: 11
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445