Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integer pair #487570007
details
property
value
status
complete
benchmark
HeizmannHoenickeLeikePodelski-ATVA2013-Fig4_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n022.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
2.04143691063 seconds
cpu usage
4.871506847
max memory
3.96107776E8
stage attributes
key
value
output-size
2158
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 43 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (8) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y) -> f2(x_1, y) :|: TRUE f2(x1, x2) -> f3(x1, 23) :|: TRUE f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - 1 f3(x5, x6) -> f4(x5, x6) :|: x5 >= x6 f5(x7, x8) -> f3(x7, x8) :|: TRUE f3(x9, x10) -> f6(x9, x10) :|: x9 < x10 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x5, x6) -> f4(x5, x6) :|: x5 >= x6 f5(x7, x8) -> f3(x7, x8) :|: TRUE f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x7:0, x8:0) -> f5(x7:0 - 1, x8:0) :|: x8:0 <= x7:0 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x, x1)] = x - x1 The following rules are decreasing: f5(x7:0, x8:0) -> f5(x7:0 - 1, x8:0) :|: x8:0 <= x7:0 The following rules are bounded: f5(x7:0, x8:0) -> f5(x7:0 - 1, x8:0) :|: x8:0 <= x7:0 ---------------------------------------- (8) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integer