/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, 1).

(0) CpxIntTrs
(1) Koat Proof [FINISHED, 0 ms]
(2) BOUNDS(1, 1)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f12(A, B, C, D, E) -> Com_1(f11(A, B, C, D, E)) :|: TRUE
f28(A, B, C, D, E) -> Com_1(f20(A, 1, A, 1, A)) :|: A >= 1

The start-symbols are:[f28_5]


----------------------------------------

(1) Koat Proof (FINISHED)
YES(?, 1)



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    f12(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f11(ar_0, ar_1, ar_2, ar_3, ar_4))

		(Comp: ?, Cost: 1)    f28(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f20(ar_0, 1, ar_0, 1, ar_0)) [ ar_0 >= 1 ]

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f28(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Testing for reachability in the complexity graph removes the following transition from problem 1:

	f12(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f11(ar_0, ar_1, ar_2, ar_3, ar_4))

We thus obtain the following problem:

2:	T:

		(Comp: ?, Cost: 1)    f28(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f20(ar_0, 1, ar_0, 1, ar_0)) [ ar_0 >= 1 ]

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f28(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Repeatedly propagating knowledge in problem 2 produces the following problem:

3:	T:

		(Comp: 1, Cost: 1)    f28(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f20(ar_0, 1, ar_0, 1, ar_0)) [ ar_0 >= 1 ]

		(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(f28(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Complexity upper bound 1



Time: 0.011 sec (SMT: 0.010 sec)


----------------------------------------

(2)
BOUNDS(1, 1)