details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.22228 seconds
cpu usage	0.140228
user time	0.117553
system time	0.022675
max virtual memory	113176.0
max residence set size	11028.0

stage attributes

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

output

0.03/0.12 WORST_CASE(?,O(1)) 0.03/0.12 0.03/0.12 Preprocessing Cost Relations 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 #### Computed strongly connected components 0.03/0.12 0. recursive : [evalndloopbbin/3] 0.03/0.12 1. non_recursive : [evalndloopstop/2] 0.03/0.12 2. non_recursive : [evalndloopreturnin/2] 0.03/0.12 3. non_recursive : [exit_location/1] 0.03/0.12 4. non_recursive : [evalndloopbbin_loop_cont/3] 0.03/0.12 5. non_recursive : [evalndloopentryin/2] 0.03/0.12 6. non_recursive : [evalndloopstart/2] 0.03/0.12 0.03/0.12 #### Obtained direct recursion through partial evaluation 0.03/0.12 0. SCC is partially evaluated into evalndloopbbin/3 0.03/0.12 1. SCC is completely evaluated into other SCCs 0.03/0.12 2. SCC is completely evaluated into other SCCs 0.03/0.12 3. SCC is completely evaluated into other SCCs 0.03/0.12 4. SCC is partially evaluated into evalndloopbbin_loop_cont/3 0.03/0.12 5. SCC is partially evaluated into evalndloopentryin/2 0.03/0.12 6. SCC is partially evaluated into evalndloopstart/2 0.03/0.12 0.03/0.12 Control-Flow Refinement of Cost Relations 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 ### Specialization of cost equations evalndloopbbin/3 0.03/0.12 * CE 5 is refined into CE [8] 0.03/0.12 * CE 4 is refined into CE [9] 0.03/0.12 * CE 3 is refined into CE [10] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of evalndloopbbin/3 0.03/0.12 * CEs [10] --> Loop 8 0.03/0.12 * CEs [8] --> Loop 9 0.03/0.12 * CEs [9] --> Loop 10 0.03/0.12 0.03/0.12 ### Ranking functions of CR evalndloopbbin(A,C,D) 0.03/0.12 * RF of phase [8]: [-A+9] 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR evalndloopbbin(A,C,D) 0.03/0.12 * Partial RF of phase [8]: 0.03/0.12 - RF of loop [8:1]: 0.03/0.12 -A+9 0.03/0.12 0.03/0.12 0.03/0.12 ### Specialization of cost equations evalndloopbbin_loop_cont/3 0.03/0.12 * CE 7 is refined into CE [11] 0.03/0.12 * CE 6 is refined into CE [12] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of evalndloopbbin_loop_cont/3 0.03/0.12 * CEs [11] --> Loop 11 0.03/0.12 * CEs [12] --> Loop 12 0.03/0.12 0.03/0.12 ### Ranking functions of CR evalndloopbbin_loop_cont(A,B,C) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR evalndloopbbin_loop_cont(A,B,C) 0.03/0.12 0.03/0.12 0.03/0.12 ### Specialization of cost equations evalndloopentryin/2 0.03/0.12 * CE 2 is refined into CE [13,14,15,16] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of evalndloopentryin/2 0.03/0.12 * CEs [13,14,15,16] --> Loop 13 0.03/0.12 0.03/0.12 ### Ranking functions of CR evalndloopentryin(A,C) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR evalndloopentryin(A,C) 0.03/0.12 0.03/0.12 0.03/0.12 ### Specialization of cost equations evalndloopstart/2 0.03/0.12 * CE 1 is refined into CE [17] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of evalndloopstart/2 0.03/0.12 * CEs [17] --> Loop 14 0.03/0.12 0.03/0.12 ### Ranking functions of CR evalndloopstart(A,C) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR evalndloopstart(A,C) 0.03/0.12 0.03/0.12 0.03/0.12 Computing Bounds 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 #### Cost of chains of evalndloopbbin(A,C,D): 0.03/0.12 * Chain [[8],10]: 1*it(8)+0 0.03/0.12 Such that:it(8) =< -A+D 0.03/0.12 0.03/0.12 with precondition: [C=2,9>=D,A>=0,D>=A+1] 0.03/0.12 0.03/0.12 * Chain [[8],9]: 1*it(8)+0 0.03/0.12 Such that:it(8) =< -A+9 0.03/0.12 0.03/0.12 with precondition: [C=3,8>=A,A>=0] 0.03/0.12 0.03/0.12 * Chain [10]: 0 0.03/0.12 with precondition: [C=2,A=D,A>=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