details

property	value
status	complete
benchmark	NO_03.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_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.214411020279 seconds
cpu usage	0.132219425
max memory	8298496.0

stage attributes

key	value
output-size	3309
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_bb2_in/3,eval_foo_bb3_in/3] 1. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in_loop_cont/4,eval_foo_bb4_in/3] 2. non_recursive : [eval_foo_stop/1] 3. non_recursive : [eval_foo_bb5_in/1] 4. non_recursive : [eval_foo_bb1_in_loop_cont/2] 5. non_recursive : [eval_foo_bb0_in/1] 6. non_recursive : [eval_foo_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb2_in/3 1. SCC is partially evaluated into eval_foo_bb1_in/2 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is completely evaluated into other SCCs 5. SCC is partially evaluated into eval_foo_bb0_in/1 6. SCC is partially evaluated into eval_foo_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb2_in/3 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] ### Cost equations --> "Loop" of eval_foo_bb2_in/3 * CEs [8] --> Loop 7 * CEs [7] --> Loop 8 ### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) #### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) ### Specialization of cost equations eval_foo_bb1_in/2 * CE 4 is discarded (unfeasible) * CE 3 is refined into CE [9] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [9] --> Loop 9 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_bb0_in/1 * CE 2 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb0_in/1 * CEs [10] --> Loop 10 ### Ranking functions of CR eval_foo_bb0_in(B) #### Partial ranking functions of CR eval_foo_bb0_in(B) Warning: no base case found for predicate ### Specialization of cost equations eval_foo_start/3 * CE 1 is refined into CE [11] ### Cost equations --> "Loop" of eval_foo_start/3 * CEs [11] --> Loop 11 ### Ranking functions of CR eval_foo_start(V_i,V_j,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_j,B) Warning: no base case found for predicate Computing Bounds ===================================== #### Cost of chains of eval_foo_bb2_in(V__01,B,C): * Chain [7,8]: 1 with precondition: [V__01=0,B=2,C=1] #### Cost of chains of eval_foo_bb1_in(V__0,B): * Chain [[9]]...: 2*it(9)+0 with precondition: [V__0=0,B=3] #### Cost of chains of eval_foo_bb0_in(B): popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445