Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487096035
details
property
value
status
complete
benchmark
ChenFlurMukhopadhyay-SAS2012-Ex2.16_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n141.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
2.58467 seconds
cpu usage
6.83106
user time
6.47782
system time
0.353238
max virtual memory
1.951032E7
max residence set size
549264.0
stage attributes
key
value
starexec-result
YES
output
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, 50 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 32 ms] (6) IntTRS (7) TerminationGraphProcessor [EQUIVALENT, 0 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) PolynomialOrderProcessor [EQUIVALENT, 3 ms] (12) 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, x3) :|: TRUE f4(x4, x5) -> f5(x5, x5) :|: TRUE f5(x6, x7) -> f6(x6, arith) :|: TRUE && arith = x7 - 1 f3(x8, x9) -> f4(x8, x9) :|: x8 > 0 f6(x10, x11) -> f3(x10, x11) :|: TRUE f3(x12, x13) -> f7(x12, x13) :|: x12 <= 0 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x8, x9) -> f4(x8, x9) :|: x8 > 0 f6(x10, x11) -> f3(x10, x11) :|: TRUE f5(x6, x7) -> f6(x6, arith) :|: TRUE && arith = x7 - 1 f4(x4, x5) -> f5(x5, x5) :|: TRUE ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x6:0, x7:0) -> f5(x7:0 - 1, x7:0 - 1) :|: x6:0 > 0 ---------------------------------------- (7) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f5(x6:0, x7:0) -> f5(x7:0 - 1, x7:0 - 1) :|: x6:0 > 0 has been transformed into f5(x6:0, x7:0) -> f5(x7:0 - 1, x7:0 - 1) :|: x6:0 > 0. f5(x6:0, x7:0) -> f5(x7:0 - 1, x7:0 - 1) :|: x6:0 > 0 and f5(x6:0, x7:0) -> f5(x7:0 - 1, x7:0 - 1) :|: x6:0 > 0 have been merged into the new rule f5(x10, x11) -> f5(x11 - 1 - 1, x11 - 1 - 1) :|: x10 > 0 && x11 - 1 > 0 ---------------------------------------- (8) Obligation: Rules: f5(x12, x13) -> f5(x13 + -2, x13 + -2) :|: TRUE && x12 >= 1 && x13 >= 2 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer