details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.0909481048584 seconds
cpu usage	0.104231854
max memory	8126464.0

stage attributes

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

output

/export/starexec/sandbox2/solver/bin/starexec_run_its /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f1/2] 1. non_recursive : [exit_location/1] 2. non_recursive : [f1_loop_cont/2] 3. non_recursive : [f3/2] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f1/2 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into f3/2 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f1/2 * CE 3 is refined into CE [4] * CE 2 is refined into CE [5] ### Cost equations --> "Loop" of f1/2 * CEs [5] --> Loop 4 * CEs [4] --> Loop 5 ### Ranking functions of CR f1(A,B) * RF of phase [4]: [A] #### Partial ranking functions of CR f1(A,B) * Partial RF of phase [4]: - RF of loop [4:1]: A ### Specialization of cost equations f3/2 * CE 1 is refined into CE [6,7] ### Cost equations --> "Loop" of f3/2 * CEs [7] --> Loop 6 * CEs [6] --> Loop 7 ### Ranking functions of CR f3(A,B) #### Partial ranking functions of CR f3(A,B) Computing Bounds ===================================== #### Cost of chains of f1(A,B): * Chain [[4],5]: 1*it(4)+0 Such that:it(4) =< A with precondition: [B=2,A>=1] * Chain [5]: 0 with precondition: [B=2,A>=0] #### Cost of chains of f3(A,B): * Chain [7]: 0 with precondition: [A>=0] * Chain [6]: 1*s(1)+0 Such that:s(1) =< A with precondition: [A>=1] Closed-form bounds of f3(A,B): ------------------------------------- * Chain [7] with precondition: [A>=0] - Upper bound: 0 - Complexity: constant * Chain [6] with precondition: [A>=1] - Upper bound: A - Complexity: n ### Maximum cost of f3(A,B): A Asymptotic class: n * Total analysis performed in 25 ms. popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843