Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736696
details
property
value
status
complete
benchmark
HeizmannHoenickeLeikePodelski-ATVA2013-Fig6_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
2.08959794044 seconds
cpu usage
5.422632905
max memory
4.00912384E8
stage attributes
key
value
output-size
2753
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 49 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 31 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/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(arith, x5) :|: TRUE && arith = x4 - x5 f5(x6, x7) -> f6(x6, x8) :|: TRUE f3(x9, x10) -> f4(x9, x10) :|: x9 >= 0 && x10 >= 1 f6(x11, x12) -> f3(x11, x12) :|: TRUE f3(x13, x14) -> f7(x13, x14) :|: x13 < 0 f3(x15, x16) -> f7(x15, x16) :|: x16 < 1 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x9, x10) -> f4(x9, x10) :|: x9 >= 0 && x10 >= 1 f6(x11, x12) -> f3(x11, x12) :|: TRUE f5(x6, x7) -> f6(x6, x8) :|: TRUE f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x4 - x5 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x6:0, x7:0) -> f5(x6:0 - x8:0, x8:0) :|: x6:0 > -1 && x8:0 > 0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2) -> f5(x1) ---------------------------------------- (8) Obligation: Rules: f5(x6:0) -> f5(x6:0 - x8:0) :|: x6:0 > -1 && x8:0 > 0 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x)] = x The following rules are decreasing: f5(x6:0) -> f5(x6:0 - x8:0) :|: x6:0 > -1 && x8:0 > 0 The following rules are bounded: f5(x6:0) -> f5(x6:0 - x8:0) :|: x6:0 > -1 && x8:0 > 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257