details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	36.1567 seconds
cpu usage	83.3881
user time	80.5382
system time	2.84991
max virtual memory	1.9045928E7
max residence set size	409340.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), ?)

output

83.33/36.13 WORST_CASE(Omega(n^1), ?) 83.33/36.14 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 83.33/36.14 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 83.33/36.14 83.33/36.14 83.33/36.14 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). 83.33/36.14 83.33/36.14 (0) CpxIntTrs 83.33/36.14 (1) Loat Proof [FINISHED, 34.4 s] 83.33/36.14 (2) BOUNDS(n^1, INF) 83.33/36.14 83.33/36.14 83.33/36.14 ---------------------------------------- 83.33/36.14 83.33/36.14 (0) 83.33/36.14 Obligation: 83.33/36.14 Complexity Int TRS consisting of the following rules: 83.33/36.14 evalbinsearchStepSize2start(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I)) :|: TRUE 83.33/36.14 evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(0, 0, 4, A, E, F, G, H, I)) :|: TRUE 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: C >= 1 && C <= 1 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: 0 >= C 83.33/36.14 evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: C >= 2 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, C, G, H, I)) :|: B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, 0, G, H, I)) :|: C >= 0 && C <= 0 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: C >= 1 && J >= 0 && C >= 2 * J && 1 + 2 * J >= C 83.33/36.14 evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: 0 >= C + 1 && 0 >= J && 2 * J >= C && 1 + C >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I)) :|: E >= G + 1 83.33/36.14 evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I)) :|: G >= E 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I)) :|: A >= 1 && A <= 1 && B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= A 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: A >= 2 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F 83.33/36.14 evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: D + I >= 256 83.33/36.14 evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(2, H, I, D + I, E, F, G, H, I)) :|: 255 >= D + I 83.33/36.14 evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I)) :|: G >= E + 1 83.33/36.14 evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: E >= G 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I)) :|: A >= 2 && A <= 2 && B >= 0 && B <= 0 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 1 >= A 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: A >= 3 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1 83.33/36.14 evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: B >= 1 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F 83.33/36.14 evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J 83.33/36.14 evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: I >= D + 1 83.33/36.14 evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(1, H, I, D - I, E, F, G, H, I)) :|: D >= I 83.33/36.14 evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2stop(A, B, C, D, E, F, G, H, I)) :|: TRUE 83.33/36.14 83.33/36.14 The start-symbols are:[evalbinsearchStepSize2start_9] 83.33/36.14 83.33/36.14 83.33/36.14 ---------------------------------------- 83.33/36.14 83.33/36.14 (1) Loat Proof (FINISHED) 83.33/36.14 83.33/36.14 83.33/36.14 ### Pre-processing the ITS problem ### 83.33/36.14 83.33/36.14 83.33/36.14 83.33/36.14 Initial linear ITS problem 83.33/36.14 83.33/36.14 Start location: evalbinsearchStepSize2start 83.33/36.14 83.33/36.14 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2entryin : [], cost: 1 83.33/36.14 83.33/36.14 1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1 83.33/36.14 83.33/36.14 2: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2returnin : [ C==1 ], cost: 1 83.33/36.14 83.33/36.14 3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1 83.33/36.14 83.33/36.14 4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1 83.33/36.14 83.33/36.14 5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1 83.33/36.14 83.33/36.14 6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1 83.33/36.14 83.33/36.14 7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1 83.33/36.14 83.33/36.14 8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1 83.33/36.14 83.33/36.14 9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1 83.33/36.14 83.33/36.14 10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1 83.33/36.14 83.33/36.14 11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1 83.33/36.14 83.33/36.14 12: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb9in : [ G>=E ], cost: 1 83.33/36.14 83.33/36.14 13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1 83.33/36.14 83.33/36.14 14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1 83.33/36.14 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