Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744853
details
property
value
status
complete
benchmark
speedpldi3.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.42569303513 seconds
cpu usage
5.484989037
max memory
3.35167488E8
stage attributes
key
value
output-size
55606
starexec-result
WORST_CASE(Omega(n^2), O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), O(n^2)) 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(n^2, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 342 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 826 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedpldi3_start(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb0_in(v_i_0, v_j_0, v_m, v_n)) :|: TRUE eval_speedpldi3_bb0_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_0(v_i_0, v_j_0, v_m, v_n)) :|: TRUE eval_speedpldi3_0(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_1(v_i_0, v_j_0, v_m, v_n)) :|: TRUE eval_speedpldi3_1(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_2(v_i_0, v_j_0, v_m, v_n)) :|: TRUE eval_speedpldi3_2(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i_0, v_j_0, v_m, v_n)) :|: v_m <= 0 eval_speedpldi3_2(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i_0, v_j_0, v_m, v_n)) :|: v_n <= v_m eval_speedpldi3_2(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(0, 0, v_m, v_n)) :|: v_m > 0 && v_n > v_m eval_speedpldi3_bb1_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb2_in(v_i_0, v_j_0, v_m, v_n)) :|: v_i_0 < v_n eval_speedpldi3_bb1_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb3_in(v_i_0, v_j_0, v_m, v_n)) :|: v_i_0 >= v_n eval_speedpldi3_bb2_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i_0, v_j_0 + 1, v_m, v_n)) :|: v_j_0 < v_m eval_speedpldi3_bb2_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i_0 + 1, v_j_0 + 1, v_m, v_n)) :|: v_j_0 < v_m && v_j_0 >= v_m eval_speedpldi3_bb2_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i_0, 0, v_m, v_n)) :|: v_j_0 >= v_m && v_j_0 < v_m eval_speedpldi3_bb2_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_bb1_in(v_i_0 + 1, 0, v_m, v_n)) :|: v_j_0 >= v_m eval_speedpldi3_bb3_in(v_i_0, v_j_0, v_m, v_n) -> Com_1(eval_speedpldi3_stop(v_i_0, v_j_0, v_m, v_n)) :|: TRUE The start-symbols are:[eval_speedpldi3_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_1 + 2*ar_0*ar_1 + 2*ar_0 + 12) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedpldi3start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi3bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi30(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi30(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi31(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi31(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi32(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalspeedpldi32(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi32(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi32(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, 0, 0)) [ ar_0 >= 1 /\ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= ar_2 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, ar_3 + 1)) [ ar_0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_0 >= ar_3 + 1 /\ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 /\ ar_0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, 0)) [ ar_3 >= ar_0 ] (Comp: ?, Cost: 1) evalspeedpldi3bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2 + 1, ar_3 + 1)) [ ar_0 >= ar_3 + 1 /\ ar_3 >= ar_0 ] evalspeedpldi3bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalspeedpldi3bb1in(ar_0, ar_1, ar_2, 0)) [ ar_3 >= ar_0 /\ ar_0 >= ar_3 + 1 ] We thus obtain the following problem: 2: T:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843