details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.316584825516 seconds
cpu usage	0.229908181
max memory	8765440.0

stage attributes

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

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843