Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744717
details
property
value
status
complete
benchmark
speedFails4.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
3.15908789635 seconds
cpu usage
6.855021308
max memory
4.48049152E8
stage attributes
key
value
output-size
7836
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE 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, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 579 ms] (2) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedFails4_start(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb0_in(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_bb0_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_1(v__, v__0, nondef_0, v_n, v_x)) :|: TRUE eval_speedFails4_1(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_2(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_2(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_3(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_3(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_4(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_4(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_5(1, v__0, v_0, v_n, v_x)) :|: v_0 >= 1 eval_speedFails4_4(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_5(-(1), v__0, v_0, v_n, v_x)) :|: v_0 < 1 eval_speedFails4_5(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_6(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_6(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_7(v__, v__0, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_7(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v__, v_x, v_0, v_n, v_x)) :|: TRUE eval_speedFails4_bb1_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb2_in(v__, v__0, v_0, v_n, v_x)) :|: v__0 <= v_n eval_speedFails4_bb1_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb3_in(v__, v__0, v_0, v_n, v_x)) :|: v__0 > v_n eval_speedFails4_bb2_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v__, v__0 + v__, v_0, v_n, v_x)) :|: v_0 >= 1 eval_speedFails4_bb2_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v__, v__0 - v__, v_0, v_n, v_x)) :|: v_0 < 1 eval_speedFails4_bb3_in(v__, v__0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_stop(v__, v__0, v_0, v_n, v_x)) :|: TRUE The start-symbols are:[eval_speedFails4_start_5] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalspeedFails4start 0: evalspeedFails4start -> evalspeedFails4bb0in : [], cost: 1 1: evalspeedFails4bb0in -> evalspeedFails41 : A'=free, [], cost: 1 2: evalspeedFails41 -> evalspeedFails42 : [], cost: 1 3: evalspeedFails42 -> evalspeedFails43 : [], cost: 1 4: evalspeedFails43 -> evalspeedFails44 : [], cost: 1 5: evalspeedFails44 -> evalspeedFails45 : B'=1, [ A>=1 ], cost: 1 6: evalspeedFails44 -> evalspeedFails45 : B'=-1, [ 0>=A ], cost: 1 7: evalspeedFails45 -> evalspeedFails46 : [], cost: 1 8: evalspeedFails46 -> evalspeedFails47 : [], cost: 1 9: evalspeedFails47 -> evalspeedFails4bb1in : C'=D, [], cost: 1 10: evalspeedFails4bb1in -> evalspeedFails4bb2in : [ E>=C ], cost: 1 11: evalspeedFails4bb1in -> evalspeedFails4bb3in : [ C>=1+E ], cost: 1 12: evalspeedFails4bb2in -> evalspeedFails4bb1in : C'=C+B, [ A>=1 ], cost: 1 13: evalspeedFails4bb2in -> evalspeedFails4bb1in : C'=C-B, [ 0>=A ], cost: 1 14: evalspeedFails4bb3in -> evalspeedFails4stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalspeedFails4start 0: evalspeedFails4start -> evalspeedFails4bb0in : [], cost: 1 1: evalspeedFails4bb0in -> evalspeedFails41 : A'=free, [], cost: 1 2: evalspeedFails41 -> evalspeedFails42 : [], cost: 1 3: evalspeedFails42 -> evalspeedFails43 : [], cost: 1 4: evalspeedFails43 -> evalspeedFails44 : [], cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843