details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	26.6542 seconds
cpu usage	64.9365
user time	63.0445
system time	1.89207
max virtual memory	1.8819036E7
max residence set size	243996.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

64.88/26.62 WORST_CASE(NON_POLY, ?) 64.88/26.62 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 64.88/26.62 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 64.88/26.62 64.88/26.62 64.88/26.62 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 64.88/26.62 64.88/26.62 (0) CpxIntTrs 64.88/26.62 (1) Loat Proof [FINISHED, 24.7 s] 64.88/26.62 (2) BOUNDS(INF, INF) 64.88/26.62 64.88/26.62 64.88/26.62 ---------------------------------------- 64.88/26.62 64.88/26.62 (0) 64.88/26.62 Obligation: 64.88/26.62 Complexity Int TRS consisting of the following rules: 64.88/26.62 f38(A, B, C, D, E, F, G) -> Com_1(f11(A, A, C, D, E, F, G)) :|: A >= B && A <= B 64.88/26.62 f0(A, B, C, D, E, F, G) -> Com_1(f11(0, 0, H, 0, 1, I, I)) :|: H >= 0 && I >= 1 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f34(0, H, C, D + 1, E, F, G)) :|: H >= 0 && 1 >= H && G >= 1 && 0 >= C && 0 >= D 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f34(1, H, C, D + 1, E, F, G)) :|: H >= 0 && 1 >= H && G >= 1 && 0 >= C && D >= 1 && D <= 1 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f34(0, H, C, D + 1, E, F, G)) :|: H >= 0 && 1 >= H && G >= 1 && 0 >= C && D >= 2 && D <= 2 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f34(I, J, H, 0, E + 1, F, G)) :|: J >= 0 && 1 >= J && I >= 0 && 1 >= I && H >= 0 && G >= 1 && 0 >= C && D >= 3 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f34(H, I, C - 1, D, E, F, G)) :|: I >= 0 && 1 >= I && H >= 0 && 1 >= H && C >= 1 && G >= 1 64.88/26.62 f34(A, B, C, D, E, F, G) -> Com_1(f38(A, B, C, D + 1, E, F, G)) :|: 0 >= B && 0 >= C && 0 >= D 64.88/26.62 f34(A, B, C, D, E, F, G) -> Com_1(f38(A, B, C, D + 1, E, F, G)) :|: B >= 1 && 0 >= C && D >= 1 && D <= 1 64.88/26.62 f34(A, B, C, D, E, F, G) -> Com_1(f38(A, B, C, D + 1, E, F, G)) :|: 0 >= B && 0 >= C && D >= 2 && D <= 2 64.88/26.62 f34(A, B, C, D, E, F, G) -> Com_1(f38(A, B, H, 0, E + 1, F, G)) :|: H >= 0 && 0 >= C && D >= 3 64.88/26.62 f34(A, B, C, D, E, F, G) -> Com_1(f38(A, B, C - 1, D, E, F, G)) :|: C >= 1 64.88/26.62 f38(A, B, C, D, E, F, G) -> Com_1(f11(A, B, C, D, E, F, G - 1)) :|: B >= A + 1 64.88/26.62 f38(A, B, C, D, E, F, G) -> Com_1(f11(A, B, C, D, E, F, G - 1)) :|: A >= 1 + B 64.88/26.62 f11(A, B, C, D, E, F, G) -> Com_1(f53(A, B, C, D, E, F, G)) :|: 0 >= G 64.88/26.62 64.88/26.62 The start-symbols are:[f0_7] 64.88/26.62 64.88/26.62 64.88/26.62 ---------------------------------------- 64.88/26.62 64.88/26.62 (1) Loat Proof (FINISHED) 64.88/26.62 64.88/26.62 64.88/26.62 ### Pre-processing the ITS problem ### 64.88/26.62 64.88/26.62 64.88/26.62 64.88/26.62 Initial linear ITS problem 64.88/26.62 64.88/26.62 Start location: f0 64.88/26.62 64.88/26.62 0: f38 -> f11 : B'=A, [ A==B ], cost: 1 64.88/26.62 64.88/26.62 12: f38 -> f11 : G'=-1+G, [ B>=1+A ], cost: 1 64.88/26.62 64.88/26.62 13: f38 -> f11 : G'=-1+G, [ A>=1+B ], cost: 1 64.88/26.62 64.88/26.62 1: f0 -> f11 : A'=0, B'=0, C'=free_1, D'=0, E'=1, F'=free, G'=free, [ free_1>=0 && free>=1 ], cost: 1 64.88/26.62 64.88/26.62 2: f11 -> f34 : A'=0, B'=free_2, D'=1+D, [ free_2>=0 && 1>=free_2 && G>=1 && 0>=C && 0>=D ], cost: 1 64.88/26.62 64.88/26.62 3: f11 -> f34 : A'=1, B'=free_3, D'=1+D, [ free_3>=0 && 1>=free_3 && G>=1 && 0>=C && D==1 ], cost: 1 64.88/26.62 64.88/26.62 4: f11 -> f34 : A'=0, B'=free_4, D'=1+D, [ free_4>=0 && 1>=free_4 && G>=1 && 0>=C && D==2 ], cost: 1 64.88/26.62 64.88/26.62 5: f11 -> f34 : A'=free_7, B'=free_5, C'=free_6, D'=0, E'=1+E, [ free_5>=0 && 1>=free_5 && free_7>=0 && 1>=free_7 && free_6>=0 && G>=1 && 0>=C && D>=3 ], cost: 1 64.88/26.62 64.88/26.62 6: f11 -> f34 : A'=free_9, B'=free_8, C'=-1+C, [ free_8>=0 && 1>=free_8 && free_9>=0 && 1>=free_9 && C>=1 && G>=1 ], cost: 1 64.88/26.62 64.88/26.62 14: f11 -> f53 : [ 0>=G ], cost: 1 64.88/26.62 64.88/26.62 7: f34 -> f38 : D'=1+D, [ 0>=B && 0>=C && 0>=D ], cost: 1 64.88/26.62 64.88/26.62 8: f34 -> f38 : D'=1+D, [ B>=1 && 0>=C && D==1 ], cost: 1 64.88/26.62 64.88/26.62 9: f34 -> f38 : D'=1+D, [ 0>=B && 0>=C && D==2 ], cost: 1 64.88/26.62 64.88/26.62 10: f34 -> f38 : C'=free_10, D'=0, E'=1+E, [ free_10>=0 && 0>=C && D>=3 ], cost: 1 64.88/26.62 64.88/26.62 11: f34 -> f38 : C'=-1+C, [ C>=1 ], cost: 1 64.88/26.62 64.88/26.62 64.88/26.62 64.88/26.62 Removed unreachable and leaf rules: 64.88/26.62 64.88/26.62 Start location: f0 64.88/26.62 64.88/26.62 0: f38 -> f11 : B'=A, [ A==B ], cost: 1 64.88/26.62 64.88/26.62 12: f38 -> f11 : G'=-1+G, [ B>=1+A ], cost: 1 64.88/26.62 64.88/26.62 13: f38 -> f11 : G'=-1+G, [ A>=1+B ], cost: 1 64.88/26.62 64.88/26.62 1: f0 -> f11 : A'=0, B'=0, C'=free_1, D'=0, E'=1, F'=free, G'=free, [ free_1>=0 && free>=1 ], cost: 1 64.88/26.62 64.88/26.62 2: f11 -> f34 : A'=0, B'=free_2, D'=1+D, [ free_2>=0 && 1>=free_2 && G>=1 && 0>=C && 0>=D ], cost: 1 64.88/26.62 64.88/26.62 3: f11 -> f34 : A'=1, B'=free_3, D'=1+D, [ free_3>=0 && 1>=free_3 && G>=1 && 0>=C && D==1 ], cost: 1 64.88/26.62 64.88/26.62 4: f11 -> f34 : A'=0, B'=free_4, D'=1+D, [ free_4>=0 && 1>=free_4 && G>=1 && 0>=C && D==2 ], cost: 1 64.88/26.62 64.88/26.62 5: f11 -> f34 : A'=free_7, B'=free_5, C'=free_6, D'=0, E'=1+E, [ free_5>=0 && 1>=free_5 && free_7>=0 && 1>=free_7 && free_6>=0 && G>=1 && 0>=C && D>=3 ], cost: 1 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