details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.75794 seconds
cpu usage	0.676834
user time	0.655025
system time	0.021809
max virtual memory	316900.0
max residence set size	13568.0

stage attributes

key	value
starexec-result	MAYBE

output

0.62/0.65 MAYBE 0.62/0.65 0.62/0.65 Preprocessing Cost Relations 0.62/0.65 ===================================== 0.62/0.65 0.62/0.65 #### Computed strongly connected components 0.62/0.65 0. recursive : [f2/25,f4/25] 0.62/0.65 1. recursive : [f1/14,f2_loop_cont/15] 0.62/0.65 2. non_recursive : [exit_location/1] 0.62/0.65 3. non_recursive : [f1_loop_cont/2] 0.62/0.65 4. non_recursive : [f0/14] 0.62/0.65 0.62/0.65 #### Obtained direct recursion through partial evaluation 0.62/0.65 0. SCC is partially evaluated into f2/25 0.62/0.65 1. SCC is partially evaluated into f1/14 0.62/0.65 2. SCC is completely evaluated into other SCCs 0.62/0.65 3. SCC is completely evaluated into other SCCs 0.62/0.65 4. SCC is partially evaluated into f0/14 0.62/0.65 0.62/0.65 Control-Flow Refinement of Cost Relations 0.62/0.65 ===================================== 0.62/0.65 0.62/0.65 ### Specialization of cost equations f2/25 0.62/0.65 * CE 8 is refined into CE [9] 0.62/0.65 * CE 6 is refined into CE [10] 0.62/0.65 * CE 7 is refined into CE [11] 0.62/0.65 0.62/0.65 0.62/0.65 ### Cost equations --> "Loop" of f2/25 0.62/0.65 * CEs [11] --> Loop 8 0.62/0.65 * CEs [9] --> Loop 9 0.62/0.65 * CEs [10] --> Loop 10 0.62/0.65 0.62/0.65 ### Ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1) 0.62/0.65 0.62/0.65 #### Partial ranking functions of CR f2(A,B,C,D,E,F,G,H,I,J,K,L,M,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1) 0.62/0.65 0.62/0.65 0.62/0.65 ### Specialization of cost equations f1/14 0.62/0.65 * CE 2 is refined into CE [12,13,14] 0.62/0.65 * CE 5 is refined into CE [15] 0.62/0.65 * CE 3 is refined into CE [16,17,18] 0.62/0.65 * CE 4 is refined into CE [19] 0.62/0.65 0.62/0.65 0.62/0.65 ### Cost equations --> "Loop" of f1/14 0.62/0.65 * CEs [16,19] --> Loop 11 0.62/0.65 * CEs [17] --> Loop 12 0.62/0.65 * CEs [18] --> Loop 13 0.62/0.65 * CEs [13] --> Loop 14 0.62/0.65 * CEs [12,15] --> Loop 15 0.62/0.65 * CEs [14] --> Loop 16 0.62/0.65 0.62/0.65 ### Ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,V) 0.62/0.65 0.62/0.65 #### Partial ranking functions of CR f1(A,B,C,D,E,F,G,H,I,J,K,L,M,V) 0.62/0.65 0.62/0.65 0.62/0.65 ### Specialization of cost equations f0/14 0.62/0.65 * CE 1 is refined into CE [20,21,22,23] 0.62/0.65 0.62/0.65 0.62/0.65 ### Cost equations --> "Loop" of f0/14 0.62/0.65 * CEs [23] --> Loop 17 0.62/0.65 * CEs [22] --> Loop 18 0.62/0.65 * CEs [21] --> Loop 19 0.62/0.65 * CEs [20] --> Loop 20 0.62/0.65 0.62/0.65 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,V) 0.62/0.65 0.62/0.65 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,L,M,V) 0.62/0.65 0.62/0.65 0.62/0.65 Computing Bounds 0.62/0.65 ===================================== 0.62/0.65 0.62/0.65 #### Cost of chains of f2(A,B,C,D,E,F,G,H,I,J,K,L,M,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1): 0.62/0.65 * Chain [[8]]...: 1*it(8)+0 0.62/0.65 with precondition: [E=J,D=I,C=H,B=G,A=0,D>=1,7>=D,E>=1,7>=E,F=0,K=2,L>=1,M>=1,V>=2,3>=V] 0.62/0.65 0.62/0.65 * Chain [[8],10]: 1*it(8)+0 0.62/0.65 with precondition: [A=0,F=0,K=2,V=2,Z=2,E1=2,G1=1,B=G,C=H,D=I,E=J,B1=W,X=C1,Y=D1,A1=F1,7>=D,7>=E,7>=A1,1>=B1,D>=1,E>=1,L>=1,M>=1,A1>=1,B1>=0] 0.62/0.65 0.62/0.65 * Chain [[8],9]: 1*it(8)+0 0.62/0.65 with precondition: [A=0,F=0,K=2,V=3,B=G,C=H,D=I,E=J,7>=D,7>=E,D>=1,E>=1,L>=1,M>=1] 0.62/0.65 0.62/0.65 * Chain [10]: 0 0.62/0.65 with precondition: [A=0,F=0,K=2,V=2,Z=2,E1=2,G1=1,G=B,H=C,I=D,J=E,C1=X,D1=Y,W=B1,A1=F1,7>=I,7>=J,1>=W,7>=A1,I>=1,J>=1,W>=0,A1>=1] 0.62/0.65 0.62/0.65 * Chain [9]: 0 0.62/0.65 with precondition: [A=0,F=0,K=2,V=3,G=B,H=C,I=D,J=E,7>=I,7>=J,I>=1,J>=1] 0.62/0.65 0.62/0.65 0.62/0.65 #### Cost of chains of f1(A,B,C,D,E,F,G,H,I,J,K,L,M,V): 0.62/0.65 * Chain [[11,12,13]]...: 5*it(11)+0 0.62/0.65 with precondition: [V=3] 0.62/0.65 0.62/0.65 * Chain [[11,12,13],16]...: 6*it(11)+0 0.62/0.65 with precondition: [V=3,L>=1,M>=1] 0.62/0.65 popout

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

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46