details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.221358 seconds
cpu usage	0.139048
user time	0.120279
system time	0.018769
max virtual memory	113176.0
max residence set size	11152.0

stage attributes

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

output

0.03/0.11 WORST_CASE(?,O(n^1)) 0.03/0.11 0.03/0.11 Preprocessing Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Computed strongly connected components 0.03/0.11 0. recursive : [f2/3] 0.03/0.11 1. non_recursive : [exit_location/1] 0.03/0.11 2. non_recursive : [f2_loop_cont/2] 0.03/0.11 3. non_recursive : [f1/3] 0.03/0.11 0.03/0.11 #### Obtained direct recursion through partial evaluation 0.03/0.11 0. SCC is partially evaluated into f2/3 0.03/0.11 1. SCC is completely evaluated into other SCCs 0.03/0.11 2. SCC is completely evaluated into other SCCs 0.03/0.11 3. SCC is partially evaluated into f1/3 0.03/0.11 0.03/0.11 Control-Flow Refinement of Cost Relations 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 ### Specialization of cost equations f2/3 0.03/0.11 * CE 4 is refined into CE [5] 0.03/0.11 * CE 2 is refined into CE [6] 0.03/0.11 * CE 3 is refined into CE [7] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f2/3 0.03/0.11 * CEs [6] --> Loop 5 0.03/0.11 * CEs [7] --> Loop 6 0.03/0.11 * CEs [5] --> Loop 7 0.03/0.11 0.03/0.11 ### Ranking functions of CR f2(A,B,C) 0.03/0.11 * RF of phase [5,6]: [A+B-2] 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f2(A,B,C) 0.03/0.11 * Partial RF of phase [5,6]: 0.03/0.11 - RF of loop [5:1]: 0.03/0.11 A-1 0.03/0.11 - RF of loop [6:1]: 0.03/0.11 B-1 0.03/0.11 0.03/0.11 0.03/0.11 ### Specialization of cost equations f1/3 0.03/0.11 * CE 1 is refined into CE [8,9] 0.03/0.11 0.03/0.11 0.03/0.11 ### Cost equations --> "Loop" of f1/3 0.03/0.11 * CEs [9] --> Loop 8 0.03/0.11 * CEs [8] --> Loop 9 0.03/0.11 0.03/0.11 ### Ranking functions of CR f1(A,B,C) 0.03/0.11 0.03/0.11 #### Partial ranking functions of CR f1(A,B,C) 0.03/0.11 0.03/0.11 0.03/0.11 Computing Bounds 0.03/0.11 ===================================== 0.03/0.11 0.03/0.11 #### Cost of chains of f2(A,B,C): 0.03/0.11 * Chain [[5,6],7]: 1*it(5)+1*it(6)+0 0.03/0.11 Such that:it(5) =< A 0.03/0.11 it(6) =< B 0.03/0.11 aux(3) =< A+B 0.03/0.11 it(5) =< aux(3) 0.03/0.11 it(6) =< aux(3) 0.03/0.11 0.03/0.11 with precondition: [C=2,A>=1,B>=1,A+B>=3] 0.03/0.11 0.03/0.11 * Chain [7]: 0 0.03/0.11 with precondition: [C=2,A>=1,B>=1] 0.03/0.11 0.03/0.11 0.03/0.11 #### Cost of chains of f1(A,B,C): 0.03/0.11 * Chain [9]: 0 0.03/0.11 with precondition: [A>=1,B>=1] 0.03/0.11 0.03/0.11 * Chain [8]: 1*s(1)+1*s(2)+0 0.03/0.11 Such that:s(1) =< A 0.03/0.11 s(3) =< A+B 0.03/0.11 s(2) =< B 0.03/0.11 s(1) =< s(3) 0.03/0.11 s(2) =< s(3) 0.03/0.11 0.03/0.11 with precondition: [A>=1,B>=1,A+B>=3] 0.03/0.11 0.03/0.11 0.03/0.11 Closed-form bounds of f1(A,B,C): 0.03/0.11 ------------------------------------- 0.03/0.11 * Chain [9] with precondition: [A>=1,B>=1] 0.03/0.11 - Upper bound: 0 0.03/0.11 - Complexity: constant 0.03/0.11 * Chain [8] with precondition: [A>=1,B>=1,A+B>=3] 0.03/0.11 - Upper bound: A+B 0.03/0.11 - Complexity: n 0.03/0.11 0.03/0.11 ### Maximum cost of f1(A,B,C): A+B 0.03/0.11 Asymptotic class: n 0.03/0.11 * Total analysis performed in 59 ms. 0.03/0.11 0.03/0.22 EOF 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