details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.64915585518 seconds
cpu usage	11.587471112
max memory	1.061748736E9

stage attributes

key	value
output-size	6045
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) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1914 ms] (6) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(r, x, y) -> f2(r, x_1, y) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f4(x5, x6, x7) -> f7(x5, arith, x7) :|: TRUE && arith = 0 - x6 f3(x8, x9, x10) -> f4(x8, x9, x10) :|: x9 < 0 f3(x11, x12, x13) -> f5(x11, x12, x13) :|: x12 >= 0 f7(x14, x15, x16) -> f6(x14, x15, x16) :|: TRUE f5(x17, x18, x19) -> f6(x17, x18, x19) :|: TRUE f8(x65, x66, x67) -> f11(x65, x66, x68) :|: TRUE && x68 = 0 - x67 f6(x23, x24, x25) -> f8(x23, x24, x25) :|: x25 < 0 f6(x26, x27, x28) -> f9(x26, x27, x28) :|: x28 >= 0 f11(x29, x30, x31) -> f10(x29, x30, x31) :|: TRUE f9(x32, x33, x34) -> f10(x32, x33, x34) :|: TRUE f12(x35, x36, x37) -> f13(x36, x36, x37) :|: TRUE f14(x69, x70, x71) -> f15(x72, x70, x71) :|: TRUE && x72 = x69 - x71 f13(x41, x42, x43) -> f14(x41, x42, x43) :|: x41 >= x43 f15(x44, x45, x46) -> f13(x44, x45, x46) :|: TRUE f13(x47, x48, x49) -> f16(x47, x48, x49) :|: x47 < x49 f16(x50, x51, x52) -> f17(x50, x52, x52) :|: TRUE f17(x53, x54, x55) -> f18(x53, x54, x53) :|: TRUE f10(x56, x57, x58) -> f12(x56, x57, x58) :|: x58 > 0 f18(x59, x60, x61) -> f10(x59, x60, x61) :|: TRUE f10(x62, x63, x64) -> f19(x62, x63, x64) :|: x64 <= 0 Start term: f1(r, x, y) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_3,1) (f2_3,2) (f3_3,3) (f4_3,4) (f7_3,5) (f5_3,6) (f6_3,7) (f8_3,8) (f11_3,9) (f9_3,10) (f10_3,11) (f12_3,12) (f13_3,13) (f14_3,14) (f15_3,15) (f16_3,16) (f17_3,17) (f18_3,18) (f19_3,19) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX3; x2 := oldX2; popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to C Integ Progr 58257