details

property	value
status	complete
benchmark	sumit.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	T2

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.945149898529 seconds
cpu usage	0.859308541
max memory	1.0305536E7

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f4/7,f6/7,f7/7] 1. non_recursive : [exit_location/1] 2. non_recursive : [f14/5] 3. non_recursive : [f4_loop_cont/6] 4. non_recursive : [f0/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f4/7 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f4_loop_cont/6 4. SCC is partially evaluated into f0/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f4/7 * CE 13 is refined into CE [16] * CE 12 is refined into CE [17] * CE 3 is refined into CE [18] * CE 2 is refined into CE [19] * CE 7 is refined into CE [20] * CE 6 is refined into CE [21] * CE 5 is refined into CE [22] * CE 4 is refined into CE [23] * CE 11 is discarded (unfeasible) * CE 10 is refined into CE [24] * CE 9 is discarded (unfeasible) * CE 8 is refined into CE [25] ### Cost equations --> "Loop" of f4/7 * CEs [20] --> Loop 16 * CEs [21] --> Loop 17 * CEs [22] --> Loop 18 * CEs [23] --> Loop 19 * CEs [24] --> Loop 20 * CEs [25] --> Loop 21 * CEs [16] --> Loop 22 * CEs [17] --> Loop 23 * CEs [18] --> Loop 24 * CEs [19] --> Loop 25 ### Ranking functions of CR f4(A,B,C,D,F,G,H) * RF of phase [16,18]: [B-D,C-D] * RF of phase [17,19]: [C-D+1] #### Partial ranking functions of CR f4(A,B,C,D,F,G,H) * Partial RF of phase [16,18]: - RF of loop [16:1,18:1]: B-D C-D * Partial RF of phase [17,19]: - RF of loop [17:1,19:1]: C-D+1 ### Specialization of cost equations f4_loop_cont/6 * CE 15 is refined into CE [26] * CE 14 is refined into CE [27] ### Cost equations --> "Loop" of f4_loop_cont/6 * CEs [26] --> Loop 26 * CEs [27] --> Loop 27 ### Ranking functions of CR f4_loop_cont(A,B,C,D,E,F) #### Partial ranking functions of CR f4_loop_cont(A,B,C,D,E,F) ### Specialization of cost equations f0/5 * CE 1 is refined into CE [28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44] ### Cost equations --> "Loop" of f0/5 * CEs [37] --> Loop 28 * CEs [33,39,44] --> Loop 29 * CEs [36,43] --> Loop 30 * CEs [35,42] --> Loop 31 * CEs [34] --> Loop 32 * CEs [32,38,41] --> Loop 33 * CEs [40] --> Loop 34 * CEs [30,31] --> Loop 35 * CEs [28,29] --> Loop 36 ### Ranking functions of CR f0(A,B,C,D,F) popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843