C_Integer 2019-03-28 22.15 pair #432271678

details

property	value
status	complete
benchmark	CookSeeZuleger-TACAS2013-Fig1_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n091.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.7321 seconds
cpu usage	7.10638
user time	6.75935
system time	0.347031
max virtual memory	1.9535132E7
max residence set size	577184.0

stage attributes

key	value
starexec-result	YES

output

6.86/2.67	YES
6.86/2.68	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
6.86/2.68	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.86/2.68	
6.86/2.68	
6.86/2.68	Termination of the given C Problem could be proven:
6.86/2.68	
6.86/2.68	(0) C Problem
6.86/2.68	(1) CToIRSProof [EQUIVALENT, 0 ms]
6.86/2.68	(2) IntTRS
6.86/2.68	(3) TerminationGraphProcessor [SOUND, 53 ms]
6.86/2.68	(4) IntTRS
6.86/2.68	(5) IntTRSCompressionProof [EQUIVALENT, 34 ms]
6.86/2.68	(6) IntTRS
6.86/2.68	(7) PolynomialOrderProcessor [EQUIVALENT, 11 ms]
6.86/2.68	(8) IntTRS
6.86/2.68	(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.86/2.68	(10) IntTRS
6.86/2.68	(11) PolynomialOrderProcessor [EQUIVALENT, 5 ms]
6.86/2.68	(12) YES
6.86/2.68	
6.86/2.68	
6.86/2.68	----------------------------------------
6.86/2.68	
6.86/2.68	(0)
6.86/2.68	Obligation:
6.86/2.68	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
6.86/2.68	----------------------------------------
6.86/2.68	
6.86/2.68	(1) CToIRSProof (EQUIVALENT)
6.86/2.68	Parsed C Integer Program as IRS.
6.86/2.68	----------------------------------------
6.86/2.68	
6.86/2.68	(2)
6.86/2.68	Obligation:
6.86/2.68	Rules:
6.86/2.68	f1(x, y) -> f2(x_1, y) :|: TRUE
6.86/2.68	f2(x1, x2) -> f3(x1, x3) :|: TRUE
6.86/2.68	f5(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 - 1
6.86/2.68	f6(x6, x7) -> f9(x8, x7) :|: TRUE
6.86/2.68	f9(x27, x28) -> f10(x27, x29) :|: TRUE && x29 = x28 - 1
6.86/2.69	f4(x11, x12) -> f5(x11, x12) :|: x13 < 0
6.86/2.69	f4(x30, x31) -> f5(x30, x31) :|: x32 > 0
6.86/2.69	f4(x14, x15) -> f6(x14, x15) :|: x16 = 0
6.86/2.69	f8(x17, x18) -> f7(x17, x18) :|: TRUE
6.86/2.69	f10(x19, x20) -> f7(x19, x20) :|: TRUE
6.86/2.69	f3(x21, x22) -> f4(x21, x22) :|: x21 > 0 && x22 > 0
6.86/2.69	f7(x23, x24) -> f3(x23, x24) :|: TRUE
6.86/2.69	f3(x25, x26) -> f11(x25, x26) :|: x25 <= 0
6.86/2.69	f3(x33, x34) -> f11(x33, x34) :|: x34 <= 0
6.86/2.69	Start term: f1(x, y)
6.86/2.69	
6.86/2.69	----------------------------------------
6.86/2.69	
6.86/2.69	(3) TerminationGraphProcessor (SOUND)
6.86/2.69	Constructed the termination graph and obtained one non-trivial SCC.
6.86/2.69	
6.86/2.69	----------------------------------------
6.86/2.69	
6.86/2.69	(4)
6.86/2.69	Obligation:
6.86/2.69	Rules:
6.86/2.69	f3(x21, x22) -> f4(x21, x22) :|: x21 > 0 && x22 > 0
6.86/2.69	f7(x23, x24) -> f3(x23, x24) :|: TRUE
6.86/2.69	f8(x17, x18) -> f7(x17, x18) :|: TRUE
6.86/2.69	f5(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 - 1
6.86/2.69	f4(x11, x12) -> f5(x11, x12) :|: x13 < 0
6.86/2.69	f4(x30, x31) -> f5(x30, x31) :|: x32 > 0
6.86/2.69	f10(x19, x20) -> f7(x19, x20) :|: TRUE
6.86/2.69	f9(x27, x28) -> f10(x27, x29) :|: TRUE && x29 = x28 - 1
6.86/2.69	f6(x6, x7) -> f9(x8, x7) :|: TRUE
6.86/2.69	f4(x14, x15) -> f6(x14, x15) :|: x16 = 0
6.86/2.69	
6.86/2.69	----------------------------------------
6.86/2.69	
6.86/2.69	(5) IntTRSCompressionProof (EQUIVALENT)
6.86/2.69	Compressed rules.
6.86/2.69	----------------------------------------
6.86/2.69	
6.86/2.69	(6)
6.86/2.69	Obligation:
6.86/2.69	Rules:
6.86/2.69	f7(x23:0, x24:0) -> f7(x23:0 - 1, x24:0) :|: x23:0 > 0 && x24:0 > 0 && x32:0 > 0
6.86/2.69	f7(x, x1) -> f7(x - 1, x1) :|: x > 0 && x1 > 0 && x2 < 0
6.86/2.69	f7(x3, x4) -> f7(x5, x4 - 1) :|: x3 > 0 && x4 > 0
6.86/2.69	
6.86/2.69	----------------------------------------
6.86/2.69	
6.86/2.69	(7) PolynomialOrderProcessor (EQUIVALENT)
6.86/2.69	Found the following polynomial interpretation:
6.86/2.69	[f7(x, x1)] = -1 + x1
6.86/2.69	
6.86/2.69	The following rules are decreasing:
6.86/2.69	f7(x3, x4) -> f7(x5, x4 - 1) :|: x3 > 0 && x4 > 0
6.86/2.69	The following rules are bounded:
6.86/2.69	f7(x23:0, x24:0) -> f7(x23:0 - 1, x24:0) :|: x23:0 > 0 && x24:0 > 0 && x32:0 > 0
6.86/2.69	f7(x, x1) -> f7(x - 1, x1) :|: x > 0 && x1 > 0 && x2 < 0
6.86/2.69	f7(x3, x4) -> f7(x5, x4 - 1) :|: x3 > 0 && x4 > 0
6.86/2.69	
6.86/2.69	----------------------------------------

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