Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429989828
details
property
value
status
complete
benchmark
serpent.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n121.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
24.2431 seconds
cpu usage
35.1864
user time
34.2556
system time
0.930735
max virtual memory
1.8809584E7
max residence set size
241488.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^2), ?)
output
35.06/24.19 WORST_CASE(Omega(n^2), ?) 35.13/24.20 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 35.13/24.20 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 35.13/24.20 35.13/24.20 35.13/24.20 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^2, INF). 35.13/24.20 35.13/24.20 (0) CpxIntTrs 35.13/24.20 (1) Loat Proof [FINISHED, 2621 ms] 35.13/24.20 (2) BOUNDS(n^2, INF) 35.13/24.20 35.13/24.20 35.13/24.20 ---------------------------------------- 35.13/24.20 35.13/24.20 (0) 35.13/24.20 Obligation: 35.13/24.20 Complexity Int TRS consisting of the following rules: 35.13/24.20 eval_serpent_start(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb0_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_bb0_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_0(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_0(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_1(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_1(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb7_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_n <= 0 35.13/24.20 eval_serpent_1(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent__critedge1_in(v_3, v_6, v_8, v_n, v_n, v_n, v_y_1, v_y_2)) :|: v_n > 0 35.13/24.20 eval_serpent__critedge1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_0, v_y_2)) :|: v_x_0 >= 0 35.13/24.20 eval_serpent__critedge1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb7_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_x_0 < 0 35.13/24.20 eval_serpent_bb1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb2_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_y_1 >= 0 35.13/24.20 eval_serpent_bb1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent__critedge_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_y_1 < 0 35.13/24.20 eval_serpent_bb2_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_2(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_2(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_3(nondef_0, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_3(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb3_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_3 > 0 35.13/24.20 eval_serpent_3(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent__critedge_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_3 <= 0 35.13/24.20 eval_serpent_bb3_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb1_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1 - 1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent__critedge_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_7(v_3, v_x_0 - 1, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_7(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_8(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_8(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_9(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_9(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb4_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_1)) :|: TRUE 35.13/24.20 eval_serpent_bb4_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb5_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_y_2 <= v_n 35.13/24.20 eval_serpent_bb4_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent__critedge1_in(v_3, v_6, v_8, v_n, v_6, v_y_2, v_y_1, v_y_2)) :|: v_y_2 > v_n 35.13/24.20 eval_serpent_bb5_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_10(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_10(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_11(v_3, v_6, nondef_1, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 eval_serpent_11(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb6_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: v_8 > 0 35.13/24.20 eval_serpent_11(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent__critedge1_in(v_3, v_6, v_8, v_n, v_6, v_y_2, v_y_1, v_y_2)) :|: v_8 <= 0 35.13/24.20 eval_serpent_bb6_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_bb4_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2 + 1)) :|: TRUE 35.13/24.20 eval_serpent_bb7_in(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2) -> Com_1(eval_serpent_stop(v_3, v_6, v_8, v_n, v_x_0, v_y_0, v_y_1, v_y_2)) :|: TRUE 35.13/24.20 35.13/24.20 The start-symbols are:[eval_serpent_start_8] 35.13/24.20 35.13/24.20 35.13/24.20 ---------------------------------------- 35.13/24.20 35.13/24.20 (1) Loat Proof (FINISHED) 35.13/24.20 35.13/24.20 35.13/24.20 ### Pre-processing the ITS problem ### 35.13/24.20 35.13/24.20 35.13/24.20 35.13/24.20 Initial linear ITS problem 35.13/24.20 35.13/24.20 Start location: evalserpentstart 35.13/24.20 35.13/24.20 0: evalserpentstart -> evalserpentbb0in : [], cost: 1 35.13/24.20 35.13/24.20 1: evalserpentbb0in -> evalserpent0 : [], cost: 1 35.13/24.20 35.13/24.20 2: evalserpent0 -> evalserpent1 : [], cost: 1 35.13/24.20 35.13/24.20 3: evalserpent1 -> evalserpentbb7in : [ 0>=A ], cost: 1 35.13/24.20 35.13/24.20 4: evalserpent1 -> evalserpentcritedge1in : B'=A, C'=A, [ A>=1 ], cost: 1 35.13/24.20 35.13/24.20 5: evalserpentcritedge1in -> evalserpentbb1in : D'=C, [ B>=0 ], cost: 1 35.13/24.20 35.13/24.20 6: evalserpentcritedge1in -> evalserpentbb7in : [ 0>=1+B ], cost: 1 35.13/24.20 35.13/24.20 7: evalserpentbb1in -> evalserpentbb2in : [ D>=0 ], cost: 1 35.13/24.20 35.13/24.20 8: evalserpentbb1in -> evalserpentcritedgein : [ 0>=1+D ], cost: 1 35.13/24.20 35.13/24.20 9: evalserpentbb2in -> evalserpent2 : [], cost: 1 35.13/24.20 35.13/24.20 10: evalserpent2 -> evalserpent3 : E'=free, [], cost: 1 35.13/24.20 35.13/24.20 11: evalserpent3 -> evalserpentbb3in : [ E>=1 ], cost: 1 35.13/24.20 35.13/24.20 12: evalserpent3 -> evalserpentcritedgein : [ 0>=E ], cost: 1 35.13/24.20 35.13/24.20 13: evalserpentbb3in -> evalserpentbb1in : D'=-1+D, [], cost: 1 35.13/24.20 35.13/24.20 14: evalserpentcritedgein -> evalserpent7 : F'=-1+B, [], cost: 1 35.13/24.20 35.13/24.20 15: evalserpent7 -> evalserpent8 : [], cost: 1 35.13/24.20 35.13/24.20 16: evalserpent8 -> evalserpent9 : [], cost: 1 35.13/24.20 35.13/24.20 17: evalserpent9 -> evalserpentbb4in : G'=D, [], cost: 1 35.13/24.20 35.13/24.20 18: evalserpentbb4in -> evalserpentbb5in : [ A>=G ], cost: 1 35.13/24.20 35.13/24.20 19: evalserpentbb4in -> evalserpentcritedge1in : B'=F, C'=G, [ G>=1+A ], cost: 1 35.13/24.20
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_ITS 2019-03-21 04.46