details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.75827407837 seconds
cpu usage	13.049819662
max memory	5.17595136E8

stage attributes

key	value
output-size	26974
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 3144 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f63(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, D, E, F, G, H, I, J, K)) :|: A >= 1 + B f0(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, 10, 20, 1, 20, 0, 0, H, I, J, K)) :|: TRUE f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, D, E, F, 1, H, I, J, K)) :|: D >= E && G >= 0 && G <= 0 f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, D, E, F, 1, H, I, J, K)) :|: D + 1 >= E && E >= 2 + D && G >= 0 && G <= 0 f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, D, D + 1, F, 1, H, I, J, K)) :|: E >= D + 1 && E <= D + 1 && G >= 0 && G <= 0 f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, D, D + 1, F, 1, N, I, J, K)) :|: L >= M + 1 && E >= D + 1 && E <= D + 1 && G >= 0 && G <= 0 f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f40(E, B, C, D, E, F, 0, N, L, D + 1, M)) :|: E >= 2 + D && G >= 0 && G <= 0 f40(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: 0 >= F + 1 f40(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: F >= 1 f40(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f43(A, B, C, D, E, 0, G, H, I, J + 1, K)) :|: F >= 0 && F <= 0 f43(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f43(A, B, C, D, E, F, G, H, I, J + 1, K)) :|: K >= N + 1 f48(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f48(A - 1, B, C, D, E, F, G, H, I, J, K)) :|: TRUE f54(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f40(A, B, C, D, E, F, G, H, I, J, K)) :|: 0 >= F + 1 f54(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f40(A, B, C, D, E, F, G, H, I, J, K)) :|: F >= 1 f54(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f40(A, B, C, D, E, 0, G, N, I, J, K)) :|: F >= 0 && F <= 0 f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f63(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= A + 1 f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f63(A, B, C, D, A - 1, F, G, H, I, J, K)) :|: A >= B f63(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f11(A, B, C, J, E, F, G, H, I, J, K)) :|: B >= A f48(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f54(A, B, C, D, E, F, G, H, I, J, K)) :|: A >= J f48(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f54(A, B, C, D, E, 1, G, H, I, J, K)) :|: J >= A + 1 f43(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f48(A - 1, B, C, D, E, F, G, H, I, J, K)) :|: TRUE f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, K)) :|: 0 >= G + 1 f11(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, K)) :|: G >= 1 The start-symbols are:[f0_11] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f0 0: f63 -> f11 : [ A>=1+B ], cost: 1 17: f63 -> f11 : D'=J, [ B>=A ], cost: 1 1: f0 -> f11 : B'=10, C'=20, D'=1, E'=20, F'=0, G'=0, [], cost: 1 2: f11 -> f11 : G'=1, [ D>=E && G==0 ], cost: 1 3: f11 -> f11 : G'=1, [ 1+D>=E && E>=2+D && G==0 ], cost: 1 4: f11 -> f11 : E'=1+D, G'=1, [ E==1+D && G==0 ], cost: 1 5: f11 -> f11 : E'=1+D, G'=1, H'=free_2, [ free>=1+free_1 && E==1+D && G==0 ], cost: 1 6: f11 -> f40 : A'=E, G'=0, H'=free_5, Q'=free_3, J'=1+D, K'=free_4, [ E>=2+D && G==0 ], cost: 1 21: f11 -> f69 : [ 0>=1+G ], cost: 1 22: f11 -> f69 : [ G>=1 ], cost: 1 7: f40 -> f59 : [ 0>=1+F ], cost: 1 8: f40 -> f59 : [ F>=1 ], cost: 1 9: f40 -> f43 : F'=0, J'=1+J, [ F==0 ], cost: 1 10: f43 -> f43 : J'=1+J, [ K>=1+free_6 ], cost: 1 20: f43 -> f48 : A'=-1+A, [], cost: 1 11: f48 -> f48 : A'=-1+A, [], cost: 1 18: f48 -> f54 : [ A>=J ], cost: 1 19: f48 -> f54 : F'=1, [ J>=1+A ], cost: 1 12: f54 -> f40 : [ 0>=1+F ], cost: 1 popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843