Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095570
details
property
value
status
complete
benchmark
ChenFlurMukhopadhyay-SAS2012-Ex4.01_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.80198 seconds
cpu usage
14.2846
user time
13.5002
system time
0.784402
max virtual memory
3.7637044E7
max residence set size
629208.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, 68 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 22 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 17 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (14) 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, z, n) -> f2(x_1, y, z, n) :|: TRUE f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE f3(x6, x7, x8, x9) -> f4(x6, x7, x10, x9) :|: TRUE f4(x11, x12, x13, x14) -> f5(x11, x12, x13, x15) :|: TRUE f6(x16, x17, x18, x19) -> f7(arith, x17, x18, x19) :|: TRUE && arith = 2 * x16 + x17 f7(x20, x21, x22, x23) -> f8(x20, x22, x22, x23) :|: TRUE f8(x24, x25, x26, x27) -> f9(x24, x25, x26, x27) :|: TRUE f9(x44, x45, x46, x47) -> f10(x44, x45, x48, x47) :|: TRUE && x48 = x46 + 1 f5(x32, x33, x34, x35) -> f6(x32, x33, x34, x35) :|: x32 + x33 >= 0 && x32 <= x35 f10(x36, x37, x38, x39) -> f5(x36, x37, x38, x39) :|: TRUE f5(x40, x41, x42, x43) -> f11(x40, x41, x42, x43) :|: x40 + x41 < 0 f5(x49, x50, x51, x52) -> f11(x49, x50, x51, x52) :|: x49 > x52 Start term: f1(x, y, z, n) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f5(x32, x33, x34, x35) -> f6(x32, x33, x34, x35) :|: x32 + x33 >= 0 && x32 <= x35 f10(x36, x37, x38, x39) -> f5(x36, x37, x38, x39) :|: TRUE f9(x44, x45, x46, x47) -> f10(x44, x45, x48, x47) :|: TRUE && x48 = x46 + 1 f8(x24, x25, x26, x27) -> f9(x24, x25, x26, x27) :|: TRUE f7(x20, x21, x22, x23) -> f8(x20, x22, x22, x23) :|: TRUE f6(x16, x17, x18, x19) -> f7(arith, x17, x18, x19) :|: TRUE && arith = 2 * x16 + x17 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f7(x20:0, x21:0, x22:0, x23:0) -> f7(2 * x20:0 + x22:0, x22:0, x22:0 + 1, x23:0) :|: x20:0 + x22:0 >= 0 && x23:0 >= x20:0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f7(x1, x2, x3, x4) -> f7(x1, x3, x4) ---------------------------------------- (8) Obligation: Rules: f7(x20:0, x22:0, x23:0) -> f7(2 * x20:0 + x22:0, x22:0 + 1, x23:0) :|: x20:0 + x22:0 >= 0 && x23:0 >= x20:0 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f7(x20:0, x22:0, x23:0) -> f7(2 * x20:0 + x22:0, x22:0 + 1, x23:0) :|: x20:0 + x22:0 >= 0 && x23:0 >= x20:0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer