details

property	value
status	complete
benchmark	byron-1.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.249700069427 seconds
cpu usage	0.159823383
max memory	8683520.0

stage attributes

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

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

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843