details

property	value
status	complete
benchmark	AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n106.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.369560956955 seconds
cpu usage	0.271782823
max memory	8880128.0

stage attributes

key	value
output-size	3987
starexec-result	WORST_CASE(?,O(n^2))

output

/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/5,eval_foo_bb2_in/5] 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/3] 5. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/5 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/3 5. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/5 * CE 7 is refined into CE [8] * CE 6 is refined into CE [9] * CE 5 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb1_in/5 * CEs [9] --> Loop 8 * CEs [10] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_foo_bb1_in(V_m,V_n,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V_m,V_n,V__01,V__0,B) * Partial RF of phase [8,9]: - RF of loop [8:1]: V_m-V__01 depends on loops [9:1] V_n-V__01-1 depends on loops [9:1] - RF of loop [9:1]: V__01 depends on loops [8:1] -V_m+V__01+1 depends on loops [8:1] V_n-V__0 ### Specialization of cost equations eval_foo_bb0_in/3 * CE 3 is refined into CE [11] * CE 4 is refined into CE [12] * CE 2 is refined into CE [13] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [11] --> Loop 11 * CEs [12] --> Loop 12 * CEs [13] --> Loop 13 ### Ranking functions of CR eval_foo_bb0_in(V_m,V_n,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_m,V_n,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [14,15,16] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [16] --> Loop 14 * CEs [15] --> Loop 15 * CEs [14] --> Loop 16 ### Ranking functions of CR eval_foo_start(V_i,V_j,V_m,V_n,B) #### Partial ranking functions of CR eval_foo_start(V_i,V_j,V_m,V_n,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V_m,V_n,V__01,V__0,B): * Chain [[8,9],10]: 1*it(8)+1*it(9)+0 Such that:aux(19) =< V_n aux(4) =< V_n-V__01 it(9) =< V_n-V__0 aux(3) =< it(9)*aux(19) it(8) =< aux(3)+aux(4) with precondition: [B=2,V_m>=1,V__01>=0,V__0>=0,V_n>=V_m+1,V_n>=V__0+1] #### Cost of chains of eval_foo_bb0_in(V_m,V_n,B): * Chain [13]: 0 popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445