details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.345942974091 seconds
cpu usage	0.259696442
max memory	8904704.0

stage attributes

key	value
output-size	3489
starexec-result	WORST_CASE(?,O(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(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f5/12] 1. non_recursive : [exit_location/1] 2. non_recursive : [f10/7] 3. non_recursive : [f11/7] 4. non_recursive : [f5_loop_cont/8] 5. non_recursive : [f12/7] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f5/12 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 partially evaluated into f5_loop_cont/8 5. SCC is partially evaluated into f12/7 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f5/12 * CE 6 is refined into CE [10] * CE 3 is refined into CE [11] * CE 4 is refined into CE [12] * CE 2 is refined into CE [13] * CE 5 is refined into CE [14] ### Cost equations --> "Loop" of f5/12 * CEs [14] --> Loop 10 * CEs [10] --> Loop 11 * CEs [11] --> Loop 12 * CEs [12] --> Loop 13 * CEs [13] --> Loop 14 ### Ranking functions of CR f5(A,B,C,D,E,F,I,J,K,L,M,N) * RF of phase [10]: [-B+400] #### Partial ranking functions of CR f5(A,B,C,D,E,F,I,J,K,L,M,N) * Partial RF of phase [10]: - RF of loop [10:1]: -B+400 ### Specialization of cost equations f5_loop_cont/8 * CE 9 is refined into CE [15] * CE 8 is refined into CE [16] * CE 7 is refined into CE [17] ### Cost equations --> "Loop" of f5_loop_cont/8 * CEs [15] --> Loop 15 * CEs [16] --> Loop 16 * CEs [17] --> Loop 17 ### Ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H) #### Partial ranking functions of CR f5_loop_cont(A,B,C,D,E,F,G,H) ### Specialization of cost equations f12/7 * CE 1 is refined into CE [18,19,20,21,22] ### Cost equations --> "Loop" of f12/7 * CEs [18,19,20,21,22] --> Loop 18 ### Ranking functions of CR f12(A,B,C,D,E,F,I) #### Partial ranking functions of CR f12(A,B,C,D,E,F,I) Computing Bounds ===================================== #### Cost of chains of f5(A,B,C,D,E,F,I,J,K,L,M,N): * Chain [[10],14]: 1*it(10)+0 Such that:it(10) =< -B+400 with precondition: [A=400,C=0,I=2,J=400,K=0,L=0,M=0,N=0,399>=B,B>=0] * Chain [[10],13]: 1*it(10)+0 Such that:it(10) =< -B+J with precondition: [A=400,C=0,I=3,K=L,K=M,K=N,400>=J,0>=K+1,B>=0,J>=B+1] * Chain [[10],12]: 1*it(10)+0 Such that:it(10) =< -B+J with precondition: [A=400,C=0,I=3,K=L,K=M,K=N,400>=J,B>=0,K>=1,J>=B+1] popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843