details

property	value
status	complete
benchmark	sect5-sumSum.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n100.star.cs.uiowa.edu
space	KoAT-2013

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.316792964935 seconds
cpu usage	0.229697134
max memory	8806400.0

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^2)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [l2/9] 1. recursive : [l1/5,l2_loop_cont/6] 2. non_recursive : [exit_location/1] 3. non_recursive : [l1_loop_cont/2] 4. non_recursive : [l0/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into l2/9 1. SCC is partially evaluated into l1/5 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into l0/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations l2/9 * 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 l2/9 * CEs [10] --> Loop 8 * CEs [8] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR l2(A,B,C,D,E,F,G,H,I) * RF of phase [8]: [B-C] #### Partial ranking functions of CR l2(A,B,C,D,E,F,G,H,I) * Partial RF of phase [8]: - RF of loop [8:1]: B-C ### Specialization of cost equations l1/5 * CE 2 is refined into CE [11,12] * CE 4 is refined into CE [13] * CE 3 is refined into CE [14] ### Cost equations --> "Loop" of l1/5 * CEs [14] --> Loop 11 * CEs [11,12] --> Loop 12 * CEs [13] --> Loop 13 ### Ranking functions of CR l1(A,B,C,D,E) * RF of phase [11]: [B] #### Partial ranking functions of CR l1(A,B,C,D,E) * Partial RF of phase [11]: - RF of loop [11:1]: B ### Specialization of cost equations l0/5 * CE 1 is refined into CE [15,16,17] ### Cost equations --> "Loop" of l0/5 * CEs [17] --> Loop 14 * CEs [16] --> Loop 15 * CEs [15] --> Loop 16 ### Ranking functions of CR l0(A,B,C,D,E) #### Partial ranking functions of CR l0(A,B,C,D,E) Computing Bounds ===================================== #### Cost of chains of l2(A,B,C,D,E,F,G,H,I): * Chain [[8],10]: 1*it(8)+0 Such that:it(8) =< B-C with precondition: [E=2,B=G+1,B=H,A+I=F,B>=C+1] * Chain [[8],9]: 1*it(8)+0 Such that:it(8) =< B-C with precondition: [E=3,B>=C+1] * Chain [9]: 0 with precondition: [E=3,B>=C] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843