Complexity_C_Integer 2019-03-21 04.38 pair #429989550

details
property	value
status	complete
benchmark	Loopus2014_ex2.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n087.star.cs.uiowa.edu
space	Loopus
run statistics
property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	2.71836 seconds
cpu usage	3.78058
user time	3.44722
system time	0.333366
max virtual memory	1.85114E7
max residence set size	185932.0
stage attributes
key	value
starexec-result	WORST_CASE(?, O(n^1))
output
3.59/2.68	WORST_CASE(?, O(n^1))
3.59/2.69	proof of /export/starexec/sandbox/output/output_files/bench.koat
3.59/2.69	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.59/2.69	
3.59/2.69	
3.59/2.69	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1).
3.59/2.69	
3.59/2.69	(0) CpxIntTrs
3.59/2.69	(1) Koat Proof [FINISHED, 1376 ms]
3.59/2.69	(2) BOUNDS(1, n^1)
3.59/2.69	
3.59/2.69	
3.59/2.69	----------------------------------------
3.59/2.69	
3.59/2.69	(0)
3.59/2.69	Obligation:
3.59/2.69	Complexity Int TRS consisting of the following rules:
3.59/2.69	eval_Loopus2014_ex2_start(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb0_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_bb0_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_m, v_m, 0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb1_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: v_i.0 > 0
3.59/2.69	eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb6_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: v_i.0 <= 0
3.59/2.69	eval_Loopus2014_ex2_bb1_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_1(v_i.0 - 1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_1(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_2(eval_nondet_start(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1), eval_Loopus2014_ex2_2(v_1, nondef.0, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_2(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb2_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: v_2 > 0
3.59/2.69	eval_Loopus2014_ex2_2(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb3_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.0)) :|: v_2 <= 0
3.59/2.69	eval_Loopus2014_ex2_bb2_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_1, v_m, v_n.0 + 1, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_bb3_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb4_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: v_n.1 > 0
3.59/2.69	eval_Loopus2014_ex2_bb3_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_1, v_m, v_n.1, v_n.1)) :|: v_n.1 <= 0
3.59/2.69	eval_Loopus2014_ex2_bb4_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_5(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_5(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_2(eval_nondet_start(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1), eval_Loopus2014_ex2_6(v_1, v_2, nondef.1, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_6(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb5_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: v_6 > 0
3.59/2.69	eval_Loopus2014_ex2_6(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_.critedge_in(v_1, v_2, v_6, v_1, v_m, v_n.1, v_n.1)) :|: v_6 <= 0
3.59/2.69	eval_Loopus2014_ex2_bb5_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_bb3_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1 - 1)) :|: TRUE
3.59/2.69	eval_Loopus2014_ex2_bb6_in(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1) -> Com_1(eval_Loopus2014_ex2_stop(v_1, v_2, v_6, v_i.0, v_m, v_n.0, v_n.1)) :|: TRUE
3.59/2.69	
3.59/2.69	The start-symbols are:[eval_Loopus2014_ex2_start_7]
3.59/2.69	
3.59/2.69	
3.59/2.69	----------------------------------------
3.59/2.69	
3.59/2.69	(1) Koat Proof (FINISHED)
3.59/2.69	YES(?, 238*ar_1 + 6)
3.59/2.69	
3.59/2.69	
3.59/2.69	
3.59/2.69	Initial complexity problem:
3.59/2.69	
3.59/2.69	1:	T:
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2critedgein(ar_1, ar_1, 0, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_0 >= 1 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2critedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_0 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex21(ar_0, ar_1, ar_2, ar_0 - 1, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex210(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex211(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex22(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex21(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalLoopus2014ex210(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7), evalLoopus2014ex211(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_4 >= 1 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex22(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_2, ar_7)) [ 0 >= ar_4 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2critedgein(ar_3, ar_1, ar_2 + 1, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_6 >= 1 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2critedgein(ar_3, ar_1, ar_6, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_6 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb4in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex25(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex250(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex251(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex26(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_5))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex25(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_2(evalLoopus2014ex250(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7), evalLoopus2014ex251(ar_0, ar_1, ar_2, ar_3, ar_4, i, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex26(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ ar_7 >= 1 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex26(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2critedgein(ar_3, ar_1, ar_6, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 >= ar_7 ]
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb5in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2bb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6 - 1, ar_7))
3.59/2.69	
3.59/2.69			(Comp: ?, Cost: 1)    evalLoopus2014ex2bb6in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2stop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7))
3.59/2.69	
3.59/2.69			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7) -> Com_1(evalLoopus2014ex2start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7)) [ 0 <= 0 ]
3.59/2.69	
3.59/2.69		start location:	koat_start
3.59/2.69	
3.59/2.69		leaf cost:	0
3.59/2.69	
3.59/2.69	
3.59/2.69	
3.59/2.69	Repeatedly propagating knowledge in problem 1 produces the following problem:
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