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


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


WORST_CASE(?, O(1))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

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


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
start(A) -> Com_1(a(A)) :|: A >= 1
start(A) -> Com_1(a(A)) :|: A >= 2
start(A) -> Com_1(a(A)) :|: A >= 4
a(A) -> Com_1(a(A * B)) :|: 1 >= 2 * B && 3 * B >= 2 && A >= 2

The start-symbols are:[start_1]


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

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



Initial complexity problem:

1:	T:

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]

		(Comp: ?, Cost: 1)    a(Ar_0) -> Com_1(a(Ar_0*Fresh_0)) [ 1 >= 2*Fresh_0 /\ 3*Fresh_0 >= 2 /\ Ar_0 >= 2 ]

		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



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

	a(Ar_0) -> Com_1(a(Ar_0*Fresh_0)) [ 1 >= 2*Fresh_0 /\ 3*Fresh_0 >= 2 /\ Ar_0 >= 2 ]

We thus obtain the following problem:

2:	T:

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]

		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]

		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 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)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]

		(Comp: 1, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]

		(Comp: 1, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]

		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 0 <= 0 ]

	start location:	koat_start

	leaf cost:	0



Complexity upper bound 3



Time: 0.009 sec (SMT: 0.009 sec)


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

(2)
BOUNDS(1, 1)