details

property	value
status	complete
benchmark	Fibonacci.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n004.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.262952804565 seconds
cpu usage	0.151244047
max memory	8445952.0

stage attributes

key	value
output-size	3336
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE 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/2] 5. non_recursive : [eval_foo_start/5] #### 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/2 5. SCC is partially evaluated into eval_foo_start/5 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 [7] --> Loop 6 * CEs [8] --> Loop 7 * CEs [6] --> Loop 8 ### Ranking functions of CR eval_foo_bb1_in(V_n,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V_n,V__01,V__0,B) ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [9,10,11] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [11] --> Loop 9 * CEs [10] --> Loop 10 * CEs [9] --> Loop 11 ### Ranking functions of CR eval_foo_bb0_in(V_n,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_n,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [14] --> Loop 12 * CEs [13] --> Loop 13 * CEs [12] --> Loop 14 ### Ranking functions of CR eval_foo_start(V_n,V_i,V_j,V_t,B) #### Partial ranking functions of CR eval_foo_start(V_n,V_i,V_j,V_t,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_n,V__01,V__0,B): * Chain [[6,7]]...: 2*it(6)+0 with precondition: [B=2] * Chain [[6,7],8]: 2*it(6)+0 with precondition: [B=2] * Chain [8]: 0 with precondition: [B=2,V__01=V_n] #### Cost of chains of eval_foo_bb0_in(V_n,B): * Chain [11]: 2*s(1)+0 with precondition: [] * Chain [10]: 0 with precondition: [V_n=1] * Chain [9]...: 2*s(2)+0 with precondition: [] #### Cost of chains of eval_foo_start(V_n,V_i,V_j,V_t,B): popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl C Integ Progr 85445