details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.2408 seconds
cpu usage	9.89425
user time	9.34122
system time	0.55303
max virtual memory	1.9285764E7
max residence set size	960064.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) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1383 ms] (6) 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, n) -> f2(x, y, x_1) :|: TRUE f2(x1, x2, x3) -> f3(x4, x2, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x8, x7) :|: TRUE f6(x9, x10, x11) -> f7(x9, arith, x11) :|: TRUE && arith = x10 - 1 f5(x12, x13, x14) -> f6(x12, x13, x14) :|: x13 >= 0 && x15 < 0 f5(x49, x50, x51) -> f6(x49, x50, x51) :|: x50 >= 0 && x52 > 0 f7(x16, x17, x18) -> f5(x16, x17, x18) :|: TRUE f5(x19, x20, x21) -> f8(x19, x20, x21) :|: x20 < 0 f5(x53, x54, x55) -> f8(x53, x54, x55) :|: x56 = 0 f8(x57, x58, x59) -> f9(x60, x58, x59) :|: TRUE && x60 = x57 - 1 f10(x61, x62, x63) -> f11(x61, x64, x63) :|: TRUE && x64 = x62 + 1 f9(x29, x30, x31) -> f10(x29, x30, x31) :|: x30 <= x31 && x32 < 0 f9(x65, x66, x67) -> f10(x65, x66, x67) :|: x66 <= x67 && x68 > 0 f11(x33, x34, x35) -> f9(x33, x34, x35) :|: TRUE f9(x36, x37, x38) -> f12(x36, x37, x38) :|: x37 > x38 f9(x69, x70, x71) -> f12(x69, x70, x71) :|: x72 = 0 f4(x40, x41, x42) -> f5(x40, x41, x42) :|: x40 >= 0 f12(x43, x44, x45) -> f4(x43, x44, x45) :|: TRUE f4(x46, x47, x48) -> f13(x46, x47, x48) :|: x46 < 0 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) (f6_3,5) (f7_3,6) (f5_3,7) (f8_3,8) (f9_3,9) (f10_3,10) (f11_3,11) (f12_3,12) (f13_3,13) ---------------------------------------- (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 := oldX3; x1 := oldX1; x2 := oldX2; TO: 3; FROM: 3; oldX0 := x0; popout

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

job log

popout

actions

all output return to C_Integer