details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	C
runtime (wallclock)	0.281685113907 seconds
cpu usage	0.201398765
max memory	8421376.0

stage attributes

key	value
output-size	4350
starexec-result	WORST_CASE(?,O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_C /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_speedSimpleMultiple_bb1_in/5,eval_speedSimpleMultiple_bb2_in/5] 1. non_recursive : [eval_speedSimpleMultiple_stop/1] 2. non_recursive : [eval_speedSimpleMultiple_bb3_in/1] 3. non_recursive : [eval_speedSimpleMultiple_bb1_in_loop_cont/2] 4. non_recursive : [eval_speedSimpleMultiple_bb0_in/3] 5. non_recursive : [eval_speedSimpleMultiple_start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_speedSimpleMultiple_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_speedSimpleMultiple_bb0_in/3 5. SCC is partially evaluated into eval_speedSimpleMultiple_start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_speedSimpleMultiple_bb1_in/5 * CE 5 is refined into CE [6] * CE 3 is refined into CE [7] * CE 4 is refined into CE [8] ### Cost equations --> "Loop" of eval_speedSimpleMultiple_bb1_in/5 * CEs [7] --> Loop 6 * CEs [8] --> Loop 7 * CEs [6] --> Loop 8 ### Ranking functions of CR eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B) * RF of phase [6]: [V_n-V_x_0] * RF of phase [7]: [V_m-V_y_0] #### Partial ranking functions of CR eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B) * Partial RF of phase [6]: - RF of loop [6:1]: V_n-V_x_0 * Partial RF of phase [7]: - RF of loop [7:1]: V_m-V_y_0 ### Specialization of cost equations eval_speedSimpleMultiple_bb0_in/3 * CE 2 is refined into CE [9,10,11] ### Cost equations --> "Loop" of eval_speedSimpleMultiple_bb0_in/3 * CEs [9] --> Loop 9 * CEs [11] --> Loop 10 * CEs [10] --> Loop 11 ### Ranking functions of CR eval_speedSimpleMultiple_bb0_in(V_n,V_m,B) #### Partial ranking functions of CR eval_speedSimpleMultiple_bb0_in(V_n,V_m,B) ### Specialization of cost equations eval_speedSimpleMultiple_start/3 * CE 1 is refined into CE [12,13,14] ### Cost equations --> "Loop" of eval_speedSimpleMultiple_start/3 * CEs [14] --> Loop 12 * CEs [13] --> Loop 13 * CEs [12] --> Loop 14 ### Ranking functions of CR eval_speedSimpleMultiple_start(V_n,V_m,B) #### Partial ranking functions of CR eval_speedSimpleMultiple_start(V_n,V_m,B) Computing Bounds ===================================== #### Cost of chains of eval_speedSimpleMultiple_bb1_in(V_n,V_m,V_y_0,V_x_0,B): * Chain [[7],[6],8]: 1*it(6)+1*it(7)+0 Such that:it(6) =< V_n it(7) =< V_m-V_y_0 with precondition: [V_x_0=0,B=2,V_n>=1,V_y_0>=0,V_m>=V_y_0+1] * Chain [[6],8]: 1*it(6)+0 Such that:it(6) =< V_n-V_x_0 with precondition: [B=2,V_y_0>=0,V_x_0>=0,V_y_0>=V_m,V_n>=V_x_0+1] * Chain [8]: 0 with precondition: [B=2,V_y_0>=0,V_x_0>=0,V_x_0>=V_n] popout

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

job log

popout

actions

all output return to Compl C Integ Progr 85445