C_Integer pair #487095711

details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.59026 seconds
cpu usage	11.2206
user time	10.7053
system time	0.515355
max virtual memory	1.9223504E7
max residence set size	960884.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox2/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) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 1737 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(x, y, n) -> f2(x, y, x_1) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
f3(x5, x6, x7) -> f4(x7, x6, x7) :|: TRUE
f8(x8, x9, x10) -> f9(x8, 1, x10) :|: TRUE
f13(x11, x12, x13) -> f14(x11, arith, x13) :|: TRUE && arith = 2 * x12
f10(x14, x15, x16) -> f13(x14, x15, x16) :|: x15 < x14
f14(x17, x18, x19) -> f10(x17, x18, x19) :|: TRUE
f10(x20, x21, x22) -> f15(x20, x21, x22) :|: x21 >= x20
f9(x23, x24, x25) -> f10(x23, x24, x25) :|: x24 < x23
f9(x26, x27, x28) -> f11(x26, x27, x28) :|: x27 >= x26
f15(x29, x30, x31) -> f12(x29, x30, x31) :|: TRUE
f11(x32, x33, x34) -> f12(x32, x33, x34) :|: TRUE
f12(x59, x60, x61) -> f16(x62, x60, x61) :|: TRUE && x62 = x59 - 1
f5(x38, x39, x40) -> f8(x38, x39, x40) :|: x38 >= 0
f16(x41, x42, x43) -> f5(x41, x42, x43) :|: TRUE
f5(x44, x45, x46) -> f17(x44, x45, x46) :|: x44 < 0
f4(x47, x48, x49) -> f5(x47, x48, x49) :|: x47 >= 0
f4(x50, x51, x52) -> f6(x50, x51, x52) :|: x50 < 0
f17(x53, x54, x55) -> f7(x53, x54, x55) :|: TRUE
f6(x56, x57, x58) -> f7(x56, x57, x58) :|: TRUE
Start term: f1(x, y, n)

----------------------------------------

(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)
   (f8_3,5)
   (f9_3,6)
   (f13_3,7)
   (f14_3,8)
   (f10_3,9)
   (f15_3,10)
   (f11_3,11)
   (f12_3,12)
   (f16_3,13)
   (f5_3,14)
   (f17_3,15)
   (f6_3,16)
   (f7_3,17)

----------------------------------------

(4)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX3;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX3;

popout

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

job log

popout

actions all output return to C_Integer