details

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

run statistics

property	value
solver	CoFloCo 2018
configuration	its
runtime (wallclock)	0.223788022995 seconds
cpu usage	0.137636279
max memory	8523776.0

stage attributes

key	value
output-size	2470
starexec-result	WORST_CASE(?,O(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(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. non_recursive : [f54/12] 1. non_recursive : [f11/12] 2. non_recursive : [f38/12] 3. non_recursive : [f0/12] #### Obtained direct recursion through partial evaluation 0. SCC is completely evaluated into other SCCs 1. SCC is partially evaluated into f11/12 2. SCC is partially evaluated into f38/12 3. SCC is partially evaluated into f0/12 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations f11/12 * CE 4 is refined into CE [6] * CE 5 is refined into CE [7] ### Cost equations --> "Loop" of f11/12 * CEs [6] --> Loop 6 * CEs [7] --> Loop 7 ### Ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,N) #### Partial ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,N) ### Specialization of cost equations f38/12 * CE 2 is discarded (unfeasible) * CE 3 is refined into CE [8,9] ### Cost equations --> "Loop" of f38/12 * CEs [8,9] --> Loop 8 ### Ranking functions of CR f38(A,B,C,D,E,F,G,H,I,J,K,N) #### Partial ranking functions of CR f38(A,B,C,D,E,F,G,H,I,J,K,N) ### Specialization of cost equations f0/12 * CE 1 is refined into CE [10] ### Cost equations --> "Loop" of f0/12 * CEs [10] --> Loop 9 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) Computing Bounds ===================================== #### Cost of chains of f11(A,B,C,D,E,F,G,H,I,J,K,N): * Chain [7]: 0 with precondition: [B=2,D=1,E=10,F=1,G=1,I=10,J=2,1>=A] * Chain [6]: 0 with precondition: [B=2,D=1,E=10,F=1,G=1,I=10,J=2,A>=2] #### Cost of chains of f38(A,B,C,D,E,F,G,H,I,J,K,N): * Chain [8]: 0 with precondition: [A=1,B=2,D=1,E=10,I=10,J=2] #### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,N): * Chain [9]: 0 with precondition: [] Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,N): ------------------------------------- * Chain [9] with precondition: [] - Upper bound: 0 - Complexity: constant ### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,N): 0 Asymptotic class: constant * Total analysis performed in 58 ms. popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843