details

property	value
status	complete
benchmark	ackermann.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n013.star.cs.uiowa.edu
space	SAS10

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.386263132095 seconds
cpu usage	0.30145224
max memory	9187328.0

stage attributes

key	value
output-size	4645
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 : [a/7,b/7,cont1/7,start/7] 1. non_recursive : [exit_location/1] 2. non_recursive : [stop1/5] 3. non_recursive : [stop2/5] 4. non_recursive : [stop3/5] 5. non_recursive : [start_loop_cont/6] 6. non_recursive : [start0/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into start/7 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 completely evaluated into other SCCs 5. SCC is partially evaluated into start_loop_cont/6 6. SCC is partially evaluated into start0/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations start/7 * CE 6 is refined into CE [11] * CE 2 is refined into CE [12] * CE 5 is refined into CE [13] * CE 4 is refined into CE [14] * CE 3 is refined into CE [15] ### Cost equations --> "Loop" of start/7 * CEs [15] --> Loop 11 * CEs [11] --> Loop 12 * CEs [12] --> Loop 13 * CEs [13] --> Loop 14 * CEs [14] --> Loop 15 ### Ranking functions of CR start(A,B,C,D,F,G,H) * RF of phase [11]: [D] #### Partial ranking functions of CR start(A,B,C,D,F,G,H) * Partial RF of phase [11]: - RF of loop [11:1]: D ### Specialization of cost equations start_loop_cont/6 * CE 10 is refined into CE [16] * CE 9 is refined into CE [17] * CE 8 is refined into CE [18] * CE 7 is refined into CE [19] ### Cost equations --> "Loop" of start_loop_cont/6 * CEs [16] --> Loop 16 * CEs [17] --> Loop 17 * CEs [18] --> Loop 18 * CEs [19] --> Loop 19 ### Ranking functions of CR start_loop_cont(A,B,C,D,E,F) #### Partial ranking functions of CR start_loop_cont(A,B,C,D,E,F) ### Specialization of cost equations start0/5 * CE 1 is refined into CE [20,21,22,23,24,25,26,27] ### Cost equations --> "Loop" of start0/5 * CEs [23,24] --> Loop 20 * CEs [22,25,26] --> Loop 21 * CEs [27] --> Loop 22 * CEs [20] --> Loop 23 * CEs [21] --> Loop 24 ### Ranking functions of CR start0(A,B,C,D,F) #### Partial ranking functions of CR start0(A,B,C,D,F) Computing Bounds ===================================== #### Cost of chains of start(A,B,C,D,F,G,H): * Chain [[11],15]: 1*it(11)+0 Such that:it(11) =< D-H with precondition: [F=3,G=1,B>=0,C>=1,H>=0,A>=D,D>=H+2] * Chain [[11],14]: 1*it(11)+0 popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843