Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989680
details
property
value
status
complete
benchmark
speedSimpleMultiple.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n169.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.48424 seconds
cpu usage
2.43881
user time
2.22382
system time
0.214988
max virtual memory
1.8273644E7
max residence set size
181120.0
stage attributes
key
value
starexec-result
WORST_CASE(?, O(n^1))
output
2.12/1.45 WORST_CASE(?, O(n^1)) 2.39/1.46 proof of /export/starexec/sandbox/output/output_files/bench.koat 2.39/1.46 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 2.39/1.46 2.39/1.46 2.39/1.46 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). 2.39/1.46 2.39/1.46 (0) CpxIntTrs 2.39/1.46 (1) Koat Proof [FINISHED, 188 ms] 2.39/1.46 (2) BOUNDS(1, n^1) 2.39/1.46 2.39/1.46 2.39/1.46 ---------------------------------------- 2.39/1.46 2.39/1.46 (0) 2.39/1.46 Obligation: 2.39/1.46 Complexity Int TRS consisting of the following rules: 2.39/1.46 eval_speedSimpleMultiple_start(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb0_in(v_m, v_n, v_x.0, v_y.0)) :|: TRUE 2.39/1.46 eval_speedSimpleMultiple_bb0_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, 0, 0)) :|: TRUE 2.39/1.46 eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 < v_n 2.39/1.46 eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb3_in(v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 >= v_n 2.39/1.46 eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0 + 1)) :|: v_y.0 < v_m 2.39/1.47 eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0 + 1, v_y.0 + 1)) :|: v_y.0 < v_m && v_y.0 >= v_m 2.39/1.47 eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0)) :|: v_y.0 >= v_m && v_y.0 < v_m 2.39/1.47 eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0 + 1, v_y.0)) :|: v_y.0 >= v_m 2.39/1.47 eval_speedSimpleMultiple_bb3_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_stop(v_m, v_n, v_x.0, v_y.0)) :|: TRUE 2.39/1.47 2.39/1.47 The start-symbols are:[eval_speedSimpleMultiple_start_4] 2.39/1.47 2.39/1.47 2.39/1.47 ---------------------------------------- 2.39/1.47 2.39/1.47 (1) Koat Proof (FINISHED) 2.39/1.47 YES(?, 2*ar_2 + 2*ar_3 + 7) 2.39/1.47 2.39/1.47 2.39/1.47 2.39/1.47 Initial complexity problem: 2.39/1.47 2.39/1.47 1: T: 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(ar_0, ar_1, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 + 1 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_3 >= ar_1 + 1 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0 + 1, ar_1 + 1, ar_2, ar_3)) [ ar_3 >= ar_1 + 1 /\ ar_1 >= ar_3 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_3 /\ ar_3 >= ar_1 + 1 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_1 >= ar_3 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplestop(ar_0, ar_1, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplestart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.39/1.47 2.39/1.47 start location: koat_start 2.39/1.47 2.39/1.47 leaf cost: 0 2.39/1.47 2.39/1.47 2.39/1.47 2.39/1.47 Testing for reachability in the complexity graph removes the following transitions from problem 1: 2.39/1.47 2.39/1.47 evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0 + 1, ar_1 + 1, ar_2, ar_3)) [ ar_3 >= ar_1 + 1 /\ ar_1 >= ar_3 ] 2.39/1.47 2.39/1.47 evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_3 /\ ar_3 >= ar_1 + 1 ] 2.39/1.47 2.39/1.47 We thus obtain the following problem: 2.39/1.47 2.39/1.47 2: T: 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplestop(ar_0, ar_1, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0 + 1, ar_1, ar_2, ar_3)) [ ar_1 >= ar_3 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_3 >= ar_1 + 1 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_2 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_0 + 1 ] 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: ?, Cost: 1) evalspeedSimpleMultiplestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(ar_0, ar_1, ar_2, ar_3)) 2.39/1.47 2.39/1.47 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedSimpleMultiplestart(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 2.39/1.47 2.39/1.47 start location: koat_start 2.39/1.47 2.39/1.47 leaf cost: 0 2.39/1.47 2.39/1.47 2.39/1.47 2.39/1.47 Repeatedly propagating knowledge in problem 2 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