Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095969
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-wise_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
5.59904 seconds
cpu usage
18.6879
user time
17.4542
system time
1.23366
max virtual memory
2.024342E7
max residence set size
2401012.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, 77 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 25 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 20 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 15 ms] (11) IntTRS (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] (13) IntTRS (14) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (15) AND (16) IntTRS (17) TerminationGraphProcessor [EQUIVALENT, 2 ms] (18) YES (19) IntTRS (20) IntTRSCompressionProof [EQUIVALENT, 0 ms] (21) IntTRS (22) RankingReductionPairProof [EQUIVALENT, 0 ms] (23) YES (24) IntTRS (25) TerminationGraphProcessor [EQUIVALENT, 12 ms] (26) IntTRS (27) IntTRSCompressionProof [EQUIVALENT, 1 ms] (28) IntTRS (29) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (30) 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 f8(x4, x5) -> f11(arith, x5) :|: TRUE && arith = x4 + 1 f9(x30, x31) -> f12(x30, x32) :|: TRUE && x32 = x31 + 1 f7(x8, x9) -> f8(x8, x9) :|: x8 < x9 f7(x10, x11) -> f9(x10, x11) :|: x10 >= x11 f11(x12, x13) -> f10(x12, x13) :|: TRUE f12(x14, x15) -> f10(x14, x15) :|: TRUE f4(x16, x17) -> f7(x16, x17) :|: x16 - x17 > 2 f4(x33, x34) -> f7(x33, x34) :|: x34 - x33 > 2 f10(x18, x19) -> f4(x18, x19) :|: TRUE f4(x20, x21) -> f13(x20, x21) :|: x20 - x21 <= 2 && x21 - x20 <= 2 f3(x22, x23) -> f4(x22, x23) :|: x22 >= 0 && x23 >= 0 f3(x24, x25) -> f5(x24, x25) :|: x24 < 0 f3(x35, x36) -> f5(x35, x36) :|: x36 < 0 f13(x26, x27) -> f6(x26, x27) :|: TRUE f5(x28, x29) -> f6(x28, x29) :|: TRUE Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x16, x17) -> f7(x16, x17) :|: x16 - x17 > 2 f10(x18, x19) -> f4(x18, x19) :|: TRUE f11(x12, x13) -> f10(x12, x13) :|: TRUE f8(x4, x5) -> f11(arith, x5) :|: TRUE && arith = x4 + 1 f7(x8, x9) -> f8(x8, x9) :|: x8 < x9 f4(x33, x34) -> f7(x33, x34) :|: x34 - x33 > 2 f12(x14, x15) -> f10(x14, x15) :|: TRUE f9(x30, x31) -> f12(x30, x32) :|: TRUE && x32 = x31 + 1 f7(x10, x11) -> f9(x10, x11) :|: x10 >= x11 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer