details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.678982973099 seconds
cpu usage	0.593852689
max memory	9449472.0

stage attributes

key	value
output-size	6193
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f1/9] 1. non_recursive : [exit_location/1] 2. non_recursive : [f300/5] 3. non_recursive : [f1_loop_cont/6] 4. non_recursive : [f2/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f1/9 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f1_loop_cont/6 4. SCC is partially evaluated into f2/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f1/9 * CE 9 is refined into CE [12] * CE 8 is refined into CE [13] * CE 2 is refined into CE [14] * CE 3 is refined into CE [15] * CE 5 is refined into CE [16] * CE 6 is refined into CE [17] * CE 4 is refined into CE [18] * CE 7 is refined into CE [19] ### Cost equations --> "Loop" of f1/9 * CEs [14] --> Loop 12 * CEs [15] --> Loop 13 * CEs [16] --> Loop 14 * CEs [17] --> Loop 15 * CEs [18] --> Loop 16 * CEs [19] --> Loop 17 * CEs [12] --> Loop 18 * CEs [13] --> Loop 19 ### Ranking functions of CR f1(A,B,C,D,G,H,I,J,K) #### Partial ranking functions of CR f1(A,B,C,D,G,H,I,J,K) * Partial RF of phase [12,13,16]: - RF of loop [12:1,13:1]: -A+B ### Specialization of cost equations f1_loop_cont/6 * CE 11 is refined into CE [20] * CE 10 is refined into CE [21] ### Cost equations --> "Loop" of f1_loop_cont/6 * CEs [20] --> Loop 20 * CEs [21] --> Loop 21 ### Ranking functions of CR f1_loop_cont(A,B,C,D,E,F) #### Partial ranking functions of CR f1_loop_cont(A,B,C,D,E,F) ### Specialization of cost equations f2/5 * CE 1 is refined into CE [22,23,24,25,26,27,28,29,30,31,32,33] ### Cost equations --> "Loop" of f2/5 * CEs [32,33] --> Loop 22 * CEs [30,31] --> Loop 23 * CEs [24] --> Loop 24 * CEs [25,26,29] --> Loop 25 * CEs [22,23,28] --> Loop 26 * CEs [27] --> Loop 27 ### Ranking functions of CR f2(A,B,C,D,G) #### Partial ranking functions of CR f2(A,B,C,D,G) Computing Bounds ===================================== #### Cost of chains of f1(A,B,C,D,G,H,I,J,K): * Chain [[17]]...: 1*it(17)+0 with precondition: [A=B] * Chain [[17],18]: 1*it(17)+0 with precondition: [G=3,A=B] * Chain [[17],15,19]: 1*it(17)+1 with precondition: [G=2,A=B,A+1=H,A=I,0>=J+1] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843