Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer 2019-03-28 22.15 pair #432271615
details
property
value
status
complete
benchmark
GulavaniGulwani-CAV2008-Fig1c_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
1.9723 seconds
cpu usage
4.5571
user time
4.32364
system time
0.233459
max virtual memory
1.9309064E7
max residence set size
380504.0
stage attributes
key
value
starexec-result
YES
output
4.46/1.92 YES 4.46/1.93 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 4.46/1.93 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.46/1.93 4.46/1.93 4.46/1.93 Termination of the given C Problem could be proven: 4.46/1.93 4.46/1.93 (0) C Problem 4.46/1.93 (1) CToIRSProof [EQUIVALENT, 0 ms] 4.46/1.93 (2) IntTRS 4.46/1.93 (3) TerminationGraphProcessor [SOUND, 24 ms] 4.46/1.93 (4) IntTRS 4.46/1.93 (5) IntTRSCompressionProof [EQUIVALENT, 10 ms] 4.46/1.93 (6) IntTRS 4.46/1.93 (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] 4.46/1.93 (8) IntTRS 4.46/1.93 (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 4.46/1.93 (10) YES 4.46/1.93 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (0) 4.46/1.93 Obligation: 4.46/1.93 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (1) CToIRSProof (EQUIVALENT) 4.46/1.93 Parsed C Integer Program as IRS. 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (2) 4.46/1.93 Obligation: 4.46/1.93 Rules: 4.46/1.93 f1(x, i, n) -> f2(x_1, i, n) :|: TRUE 4.46/1.93 f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE 4.46/1.93 f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE 4.46/1.93 f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 4.46/1.93 f6(x24, x25, x26) -> f7(x27, x25, x26) :|: TRUE && x27 = x24 + 1 4.46/1.93 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 < x17 4.46/1.93 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 4.46/1.93 f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 >= x23 4.46/1.93 Start term: f1(x, i, n) 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (3) TerminationGraphProcessor (SOUND) 4.46/1.93 Constructed the termination graph and obtained one non-trivial SCC. 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (4) 4.46/1.93 Obligation: 4.46/1.93 Rules: 4.46/1.93 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 < x17 4.46/1.93 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE 4.46/1.93 f6(x24, x25, x26) -> f7(x27, x25, x26) :|: TRUE && x27 = x24 + 1 4.46/1.93 f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (5) IntTRSCompressionProof (EQUIVALENT) 4.46/1.93 Compressed rules. 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (6) 4.46/1.93 Obligation: 4.46/1.93 Rules: 4.46/1.93 f6(x24:0, x25:0, x26:0) -> f6(x24:0 + 1, x25:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 4.46/1.93 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 4.46/1.93 4.46/1.93 f6(x1, x2, x3) -> f6(x1, x3) 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (8) 4.46/1.93 Obligation: 4.46/1.93 Rules: 4.46/1.93 f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (9) PolynomialOrderProcessor (EQUIVALENT) 4.46/1.93 Found the following polynomial interpretation: 4.46/1.93 [f6(x, x1)] = -x + x1 4.46/1.93 4.46/1.93 The following rules are decreasing: 4.46/1.93 f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 4.46/1.93 The following rules are bounded: 4.46/1.93 f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 4.46/1.93 4.46/1.93 ---------------------------------------- 4.46/1.93 4.46/1.93 (10) 4.46/1.93 YES 4.46/1.97 EOF
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer 2019-03-28 22.15