details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.0849320888519 seconds
cpu usage	0.097125195
max memory	8175616.0

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [f2/4] 1. non_recursive : [exit_location/1] 2. non_recursive : [f2_loop_cont/2] 3. non_recursive : [f300/5] 4. non_recursive : [f1/5] Warning: the following predicates are never called:[f2/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into f2/4 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into f1/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f1/5 * CE 3 is refined into CE [4] * CE 2 is refined into CE [5] * CE 1 is refined into CE [6] ### Cost equations --> "Loop" of f1/5 * CEs [4] --> Loop 4 * CEs [5] --> Loop 5 * CEs [6] --> Loop 6 ### Ranking functions of CR f1(A,B,C,D,F) #### Partial ranking functions of CR f1(A,B,C,D,F) Computing Bounds ===================================== #### Cost of chains of f1(A,B,C,D,F): * Chain [6]: 0 with precondition: [B>=A+1,C>=B+1] * Chain [5]: 0 with precondition: [B>=A+1,B>=C] * Chain [4]: 0 with precondition: [A>=B] Closed-form bounds of f1(A,B,C,D,F): ------------------------------------- * Chain [6] with precondition: [B>=A+1,C>=B+1] - Upper bound: 0 - Complexity: constant * Chain [5] with precondition: [B>=A+1,B>=C] - Upper bound: 0 - Complexity: constant * Chain [4] with precondition: [A>=B] - Upper bound: 0 - Complexity: constant ### Maximum cost of f1(A,B,C,D,F): 0 Asymptotic class: constant * Total analysis performed in 17 ms. popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843