details

property	value
status	complete
benchmark	easy1.c.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n035.star.cs.uiowa.edu
space	Flores-Montoya_16

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.71116399765 seconds
cpu usage	3.809548472
max memory	2.88428032E8

stage attributes

key	value
output-size	10520
starexec-result	WORST_CASE(?, O(1))

output

/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: 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, 19 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_easy1_start(v_0, v_x_0) -> Com_1(eval_easy1_bb0_in(v_0, v_x_0)) :|: TRUE eval_easy1_bb0_in(v_0, v_x_0) -> Com_1(eval_easy1_1(nondef_0, v_x_0)) :|: TRUE eval_easy1_1(v_0, v_x_0) -> Com_1(eval_easy1_2(v_0, v_x_0)) :|: TRUE eval_easy1_2(v_0, v_x_0) -> Com_1(eval_easy1_3(v_0, v_x_0)) :|: TRUE eval_easy1_3(v_0, v_x_0) -> Com_1(eval_easy1_4(v_0, v_x_0)) :|: TRUE eval_easy1_4(v_0, v_x_0) -> Com_1(eval_easy1_5(v_0, v_x_0)) :|: TRUE eval_easy1_5(v_0, v_x_0) -> Com_1(eval_easy1_6(v_0, v_x_0)) :|: TRUE eval_easy1_6(v_0, v_x_0) -> Com_1(eval_easy1_bb1_in(v_0, 0)) :|: TRUE eval_easy1_bb1_in(v_0, v_x_0) -> Com_1(eval_easy1_bb2_in(v_0, v_x_0)) :|: v_x_0 < 40 eval_easy1_bb1_in(v_0, v_x_0) -> Com_1(eval_easy1_bb3_in(v_0, v_x_0)) :|: v_x_0 >= 40 eval_easy1_bb2_in(v_0, v_x_0) -> Com_1(eval_easy1_bb1_in(v_0, v_x_0 + 1)) :|: v_0 >= 0 && v_0 <= 0 eval_easy1_bb2_in(v_0, v_x_0) -> Com_1(eval_easy1_bb1_in(v_0, v_x_0 + 2)) :|: v_0 < 0 eval_easy1_bb2_in(v_0, v_x_0) -> Com_1(eval_easy1_bb1_in(v_0, v_x_0 + 2)) :|: v_0 > 0 eval_easy1_bb3_in(v_0, v_x_0) -> Com_1(eval_easy1_stop(v_0, v_x_0)) :|: TRUE The start-symbols are:[eval_easy1_start_2] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 172) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evaleasy1start(ar_0, ar_1) -> Com_1(evaleasy1bb0in(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy1bb0in(ar_0, ar_1) -> Com_1(evaleasy11(c, ar_1)) (Comp: ?, Cost: 1) evaleasy11(ar_0, ar_1) -> Com_1(evaleasy12(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy12(ar_0, ar_1) -> Com_1(evaleasy13(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy13(ar_0, ar_1) -> Com_1(evaleasy14(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy14(ar_0, ar_1) -> Com_1(evaleasy15(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy15(ar_0, ar_1) -> Com_1(evaleasy16(ar_0, ar_1)) (Comp: ?, Cost: 1) evaleasy16(ar_0, ar_1) -> Com_1(evaleasy1bb1in(ar_0, 0)) (Comp: ?, Cost: 1) evaleasy1bb1in(ar_0, ar_1) -> Com_1(evaleasy1bb2in(ar_0, ar_1)) [ 39 >= ar_1 ] (Comp: ?, Cost: 1) evaleasy1bb1in(ar_0, ar_1) -> Com_1(evaleasy1bb3in(ar_0, ar_1)) [ ar_1 >= 40 ] (Comp: ?, Cost: 1) evaleasy1bb2in(ar_0, ar_1) -> Com_1(evaleasy1bb1in(ar_0, ar_1 + 1)) [ ar_0 = 0 ] (Comp: ?, Cost: 1) evaleasy1bb2in(ar_0, ar_1) -> Com_1(evaleasy1bb1in(ar_0, ar_1 + 2)) [ 0 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evaleasy1bb2in(ar_0, ar_1) -> Com_1(evaleasy1bb1in(ar_0, ar_1 + 2)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evaleasy1bb3in(ar_0, ar_1) -> Com_1(evaleasy1stop(ar_0, ar_1)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1) -> Com_1(evaleasy1start(ar_0, ar_1)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evaleasy1start(ar_0, ar_1) -> Com_1(evaleasy1bb0in(ar_0, ar_1)) (Comp: 1, Cost: 1) evaleasy1bb0in(ar_0, ar_1) -> Com_1(evaleasy11(c, ar_1)) (Comp: 1, Cost: 1) evaleasy11(ar_0, ar_1) -> Com_1(evaleasy12(ar_0, ar_1)) (Comp: 1, Cost: 1) evaleasy12(ar_0, ar_1) -> Com_1(evaleasy13(ar_0, ar_1)) popout

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

job log

popout

actions

all output return to Compl Integ Trans Syste 26843