details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.249097824097 seconds
cpu usage	0.166967306
max memory	8499200.0

stage attributes

key	value
output-size	4132
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,eval_foo_bb3_in/2,eval_foo_bb4_in/2] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb5_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/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_bb0_in/2 5. 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 7 is refined into CE [8] * CE 4 is refined into CE [9] * CE 3 is refined into CE [10] * CE 6 is refined into CE [11] * CE 5 is refined into CE [12] ### Cost equations --> "Loop" of eval_foo_bb1_in/2 * CEs [9] --> Loop 8 * CEs [10] --> Loop 9 * CEs [11] --> Loop 10 * CEs [12] --> Loop 11 * CEs [8] --> Loop 12 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) ### Specialization of cost equations eval_foo_bb0_in/2 * CE 2 is refined into CE [13,14,15,16,17] ### Cost equations --> "Loop" of eval_foo_bb0_in/2 * CEs [17] --> Loop 13 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 * CEs [13] --> Loop 17 ### Ranking functions of CR eval_foo_bb0_in(V_i,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_i,B) ### Specialization of cost equations eval_foo_start/2 * CE 1 is refined into CE [18,19,20,21,22] ### Cost equations --> "Loop" of eval_foo_start/2 * CEs [22] --> Loop 18 * CEs [21] --> Loop 19 * CEs [20] --> Loop 20 * CEs [19] --> Loop 21 * CEs [18] --> Loop 22 ### Ranking functions of CR eval_foo_start(V_i,B) #### Partial ranking functions of CR eval_foo_start(V_i,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__0,B): * Chain [[9]]...: 1*it(9)+0 with precondition: [V__0>=6,B=2] * Chain [[8]]...: 1*it(8)+0 with precondition: [0>=V__0+6,B=2] * Chain [12]: 0 with precondition: [V__0=0,B=2] * Chain [11,12]: 1 with precondition: [B=2,5>=V__0,V__0>=1] * Chain [10,12]: 1 with precondition: [B=2,0>=V__0+1,V__0+5>=0] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445