Complexity_C_Integer 2019-03-21 04.38 pair #429989476

details

property	value
status	complete
benchmark	HeizmannHoenickeLeikePodelski-ATVA2013-Fig1_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n009.star.cs.uiowa.edu
space	Adapted_from_Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	1.46345 seconds
cpu usage	2.33799
user time	2.12575
system time	0.212237
max virtual memory	1.8434428E7
max residence set size	180072.0

stage attributes

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

output

2.28/1.42	WORST_CASE(?, O(n^1))
2.28/1.43	proof of /export/starexec/sandbox/output/output_files/bench.koat
2.28/1.43	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.28/1.43	
2.28/1.43	
2.28/1.43	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1).
2.28/1.43	
2.28/1.43	(0) CpxIntTrs
2.28/1.43	(1) Koat Proof [FINISHED, 182 ms]
2.28/1.43	(2) BOUNDS(1, n^1)
2.28/1.43	
2.28/1.43	
2.28/1.43	----------------------------------------
2.28/1.43	
2.28/1.43	(0)
2.28/1.43	Obligation:
2.28/1.43	Complexity Int TRS consisting of the following rules:
2.28/1.43	eval_foo_start(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_x, v_y)) :|: TRUE
2.28/1.43	eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, 23, v_x, v_y)) :|: TRUE
2.28/1.43	eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 >= 0
2.28/1.43	eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 < 0
2.28/1.43	eval_foo_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 - v_.01, v_.01 + 1, v_x, v_y)) :|: TRUE
2.28/1.43	eval_foo_bb3_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_x, v_y)) :|: TRUE
2.28/1.43	
2.28/1.43	The start-symbols are:[eval_foo_start_4]
2.28/1.43	
2.28/1.43	
2.28/1.43	----------------------------------------
2.28/1.43	
2.28/1.43	(1) Koat Proof (FINISHED)
2.28/1.43	YES(?, 4*ar_1 + 54)
2.28/1.43	
2.28/1.43	
2.28/1.43	
2.28/1.43	Initial complexity problem:
2.28/1.43	
2.28/1.43	1:	T:
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2))
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_1, ar_1, 23))
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2)) [ ar_0 >= 0 ]
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 + 1 ]
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0 - ar_2, ar_1, ar_2 + 1))
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2))
2.28/1.43	
2.28/1.43			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ]
2.28/1.43	
2.28/1.43		start location:	koat_start
2.28/1.43	
2.28/1.43		leaf cost:	0
2.28/1.43	
2.28/1.43	
2.28/1.43	
2.28/1.43	Repeatedly propagating knowledge in problem 1 produces the following problem:
2.28/1.43	
2.28/1.43	2:	T:
2.28/1.43	
2.28/1.43			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2))
2.28/1.43	
2.28/1.43			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_1, ar_1, 23))
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2)) [ ar_0 >= 0 ]
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 + 1 ]
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2) -> Com_1(evalfoobb1in(ar_0 - ar_2, ar_1, ar_2 + 1))
2.28/1.43	
2.28/1.43			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2) -> Com_1(evalfoostop(ar_0, ar_1, ar_2))
2.28/1.43	
2.28/1.43			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2) -> Com_1(evalfoostart(ar_0, ar_1, ar_2)) [ 0 <= 0 ]
2.28/1.43	
2.28/1.43		start location:	koat_start
2.28/1.43	
2.28/1.43		leaf cost:	0
2.28/1.43	
2.28/1.43	
2.28/1.43	
2.28/1.43	A polynomial rank function with
2.28/1.43	
2.28/1.43		Pol(evalfoostart) = 2
2.28/1.43	
2.28/1.43		Pol(evalfoobb0in) = 2
2.28/1.43	
2.28/1.43		Pol(evalfoobb1in) = 2
2.28/1.43	
2.28/1.43		Pol(evalfoobb2in) = 2
2.28/1.43	
2.28/1.43		Pol(evalfoobb3in) = 1
2.28/1.43	
2.28/1.43		Pol(evalfoostop) = 0
2.28/1.43	
2.28/1.43		Pol(koat_start) = 2
2.28/1.43	
2.28/1.43	orients all transitions weakly and the transitions
2.28/1.43

popout

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

job log

popout

actions all output return to Complexity_C_Integer 2019-03-21 04.38