Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745651
details
property
value
status
complete
benchmark
cBench_cryptRandWriteFile.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
Sinn_2016
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
1.62378191948 seconds
cpu usage
2.640327397
max memory
2.99220992E8
stage attributes
key
value
output-size
38666
starexec-result
WORST_CASE(?, O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 476 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_cryptRandWriteFile_start(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb0_in(v_.0, v_.0., v_bytes, v_i.0)) :|: TRUE eval_cryptRandWriteFile_bb0_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb1_in(v_bytes, v_.0., v_bytes, v_i.0)) :|: TRUE eval_cryptRandWriteFile_bb1_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_.0 > 0 eval_cryptRandWriteFile_bb1_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb6_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_.0 <= 0 eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, v_.0, v_bytes, 0)) :|: v_.0 < 256 eval_cryptRandWriteFile_bb2_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, 256, v_bytes, 0)) :|: v_.0 >= 256 eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb4_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_i.0 < v_.0. eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb5_in(v_.0, v_.0., v_bytes, v_i.0)) :|: v_i.0 >= v_.0. eval_cryptRandWriteFile_bb4_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb3_in(v_.0, v_.0., v_bytes, v_i.0 + 1)) :|: TRUE eval_cryptRandWriteFile_bb5_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_bb1_in(v_.0 - v_.0., v_.0., v_bytes, v_i.0)) :|: TRUE eval_cryptRandWriteFile_bb6_in(v_.0, v_.0., v_bytes, v_i.0) -> Com_1(eval_cryptRandWriteFile_stop(v_.0, v_.0., v_bytes, v_i.0)) :|: TRUE The start-symbols are:[eval_cryptRandWriteFile_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 8212*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_0, 0)) [ 255 >= ar_0 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, 256, 0)) [ ar_0 >= 256 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3 + 1)) (Comp: ?, Cost: 1) evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_0 - ar_2, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3)) [ 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) evalcryptRandWriteFilestart(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 1) evalcryptRandWriteFilebb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb1in(ar_1, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb6in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_0, 0)) [ 255 >= ar_0 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, 256, 0)) [ ar_0 >= 256 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 >= ar_2 ] (Comp: ?, Cost: 1) evalcryptRandWriteFilebb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcryptRandWriteFilebb3in(ar_0, ar_1, ar_2, ar_3 + 1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445