Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745587
details
property
value
status
complete
benchmark
Cairo_nondet_false-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
Adapted_from_Ton_Chanh_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.232141971588 seconds
cpu usage
0.150126622
max memory
8450048.0
stage attributes
key
value
output-size
3892
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/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_1/3] 5. non_recursive : [eval_foo_0/2] 6. non_recursive : [eval_foo_bb0_in/2] 7. non_recursive : [eval_foo_start/2] #### 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_1/3 5. SCC is completely evaluated into other SCCs 6. SCC is completely evaluated into other SCCs 7. SCC is partially evaluated into eval_foo_start/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/2 * CE 6 is refined into CE [7] * CE 4 is refined into CE [8] * CE 5 is refined into CE [9] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [8] --> Loop 7 * CEs [9] --> Loop 8 * CEs [7] --> Loop 9 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) * RF of phase [7]: [V__0] #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) * Partial RF of phase [7]: - RF of loop [7:1]: V__0 ### Specialization of cost equations eval_foo_1/3 * CE 3 is refined into CE [10,11,12] * CE 2 is refined into CE [13] ### Cost equations --> "Loop" of eval_foo_1/3 * CEs [13] --> Loop 10 * CEs [11] --> Loop 11 * CEs [10] --> Loop 12 * CEs [12] --> Loop 13 ### Ranking functions of CR eval_foo_1(V_x,V_0,B) #### Partial ranking functions of CR eval_foo_1(V_x,V_0,B) ### Specialization of cost equations eval_foo_start/2 * CE 1 is refined into CE [14,15,16,17] ### Cost equations --> "Loop" of eval_foo_start/2 * CEs [17] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 * CEs [16] --> Loop 17 ### Ranking functions of CR eval_foo_start(V_x,B) #### Partial ranking functions of CR eval_foo_start(V_x,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__0,B): * Chain [[8]]...: 1*it(8)+0 with precondition: [0>=V__0+1,B=2] * Chain [[7],9]: 1*it(7)+0 Such that:it(7) =< V__0 with precondition: [B=2,V__0>=1] * Chain [9]: 0 with precondition: [V__0=0,B=2]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445