details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	1.18938 seconds
cpu usage	1.10898
user time	1.08784
system time	0.021148
max virtual memory	315956.0
max residence set size	13008.0

stage attributes

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

output

1.07/1.08 WORST_CASE(?,O(n^1)) 1.07/1.08 1.07/1.08 Preprocessing Cost Relations 1.07/1.08 ===================================== 1.07/1.08 1.07/1.08 #### Computed strongly connected components 1.07/1.08 0. recursive : [m1/7] 1.07/1.08 1. non_recursive : [exit_location/1] 1.07/1.08 2. non_recursive : [m1_loop_cont/2] 1.07/1.08 3. non_recursive : [start/7] 1.07/1.08 1.07/1.08 #### Obtained direct recursion through partial evaluation 1.07/1.08 0. SCC is partially evaluated into m1/7 1.07/1.08 1. SCC is completely evaluated into other SCCs 1.07/1.08 2. SCC is completely evaluated into other SCCs 1.07/1.08 3. SCC is partially evaluated into start/7 1.07/1.08 1.07/1.08 Control-Flow Refinement of Cost Relations 1.07/1.08 ===================================== 1.07/1.08 1.07/1.08 ### Specialization of cost equations m1/7 1.07/1.08 * CE 6 is refined into CE [7] 1.07/1.08 * CE 2 is refined into CE [8] 1.07/1.08 * CE 4 is refined into CE [9] 1.07/1.08 * CE 5 is refined into CE [10] 1.07/1.08 * CE 3 is refined into CE [11] 1.07/1.08 1.07/1.08 1.07/1.08 ### Cost equations --> "Loop" of m1/7 1.07/1.08 * CEs [8] --> Loop 7 1.07/1.08 * CEs [9] --> Loop 8 1.07/1.08 * CEs [10] --> Loop 9 1.07/1.08 * CEs [11] --> Loop 10 1.07/1.08 * CEs [7] --> Loop 11 1.07/1.08 1.07/1.08 ### Ranking functions of CR m1(A,B,C,D,E,F,I) 1.07/1.08 * RF of phase [7]: [-A+B-C+E+2,-A-C+3*E+4,2*A-C+1,2*A+2*C-3*F+1,2*A-F+1,B-C+1,B-F+1,-C+2*E+3,2*E-F+3] 1.07/1.08 * RF of phase [8,9]: [-A+B-C+E+1,-A+2*B-C,-A-C+3*E+3,2*A+2*C-3*F,B-F,2*E-F+2] 1.07/1.08 * RF of phase [10]: [-A+B,-A+B-C+E+2,-A+3*B-2*C+2,-A-C+3*E+4,-A+C-1,-A+E+1,2*A+2*C-3*F+1,B-F+1,C-F,2*E-F+3] 1.07/1.08 1.07/1.08 #### Partial ranking functions of CR m1(A,B,C,D,E,F,I) 1.07/1.08 * Partial RF of phase [7]: 1.07/1.08 - RF of loop [7:1]: 1.07/1.08 -A+B-C+E+2 1.07/1.08 -A-C+3*E+4 1.07/1.08 2*A-C+1 1.07/1.08 2*A+2*C-3*F+1 1.07/1.08 2*A-F+1 1.07/1.08 B-C+1 1.07/1.08 B-F+1 1.07/1.08 -C+2*E+3 1.07/1.08 2*E-F+3 1.07/1.08 * Partial RF of phase [8,9]: 1.07/1.08 - RF of loop [8:1]: 1.07/1.08 A+B-E-F 1.07/1.08 A+B/2-F+1/2 1.07/1.08 A+E-F+2 1.07/1.08 2*A+C-2*F+1 1.07/1.08 B-C+1 1.07/1.08 -C+2*E+3 1.07/1.08 - RF of loop [8:1,9:1]: 1.07/1.08 B-F 1.07/1.08 2*E-F+2 1.07/1.08 - RF of loop [9:1]: 1.07/1.08 -A+B 1.07/1.08 -A+C depends on loops [8:1] 1.07/1.08 -A+E+1 1.07/1.08 C-F 1.07/1.08 * Partial RF of phase [10]: 1.07/1.08 - RF of loop [10:1]: 1.07/1.08 -A+B 1.07/1.08 -A+B-C+E+2 1.07/1.08 -A+3*B-2*C+2 1.07/1.08 -A-C+3*E+4 1.07/1.08 -A+C-1 1.07/1.08 -A+E+1 1.07/1.08 2*A+2*C-3*F+1 1.07/1.08 B-F+1 1.07/1.08 C-F 1.07/1.08 2*E-F+3 1.07/1.08 1.07/1.08 1.07/1.08 ### Specialization of cost equations start/7 1.07/1.08 * CE 1 is refined into CE [12,13] 1.07/1.08 1.07/1.08 1.07/1.08 ### Cost equations --> "Loop" of start/7 1.07/1.08 * CEs [13] --> Loop 12 1.07/1.08 * CEs [12] --> Loop 13 1.07/1.08 1.07/1.08 ### Ranking functions of CR start(A,B,C,D,E,F,I) 1.07/1.08 1.07/1.08 #### Partial ranking functions of CR start(A,B,C,D,E,F,I) 1.07/1.08 1.07/1.08 1.07/1.08 Computing Bounds 1.07/1.08 ===================================== 1.07/1.08 1.07/1.08 #### Cost of chains of m1(A,B,C,D,E,F,I): 1.07/1.08 * Chain [[8,9],[10],11]: 1*it(8)+1*it(9)+1*it(10)+0 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