details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.29638910294 seconds
cpu usage	10.037586969
max memory	9.08906496E8

stage attributes

key	value
output-size	6140
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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, 1334 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(c, x, y, z) -> f2(c, x_1, y, z) :|: TRUE f2(x1, x2, x3, x4) -> f3(x1, x2, x5, x4) :|: TRUE f3(x6, x7, x8, x9) -> f4(x6, x7, x8, x10) :|: TRUE f4(x11, x12, x13, x14) -> f5(0, x12, x13, x14) :|: TRUE f7(x15, x16, x17, x18) -> f10(x15, arith, x17, x18) :|: TRUE && arith = x16 - 1 f11(x71, x72, x73, x74) -> f14(x71, x72, x75, x74) :|: TRUE && x75 = x73 - 1 f8(x23, x24, x25, x26) -> f11(x23, x24, x25, x26) :|: x25 > x26 f8(x27, x28, x29, x30) -> f12(x27, x28, x29, x30) :|: x29 <= x30 f14(x31, x32, x33, x34) -> f13(x31, x32, x33, x34) :|: TRUE f12(x35, x36, x37, x38) -> f13(x35, x36, x37, x38) :|: TRUE f6(x39, x40, x41, x42) -> f7(x39, x40, x41, x42) :|: x40 > x42 f6(x43, x44, x45, x46) -> f8(x43, x44, x45, x46) :|: x44 <= x46 f10(x47, x48, x49, x50) -> f9(x47, x48, x49, x50) :|: TRUE f13(x51, x52, x53, x54) -> f9(x51, x52, x53, x54) :|: TRUE f9(x76, x77, x78, x79) -> f15(x80, x77, x78, x79) :|: TRUE && x80 = x76 + 1 f5(x59, x60, x61, x62) -> f6(x59, x60, x61, x62) :|: x60 > x62 f5(x81, x82, x83, x84) -> f6(x81, x82, x83, x84) :|: x83 > x84 f15(x63, x64, x65, x66) -> f5(x63, x64, x65, x66) :|: TRUE f5(x67, x68, x69, x70) -> f16(x67, x68, x69, x70) :|: x68 <= x70 && x69 <= x70 Start term: f1(c, x, y, z) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_4,1) (f2_4,2) (f3_4,3) (f4_4,4) (f5_4,5) (f7_4,6) (f10_4,7) (f11_4,8) (f14_4,9) (f8_4,10) (f12_4,11) (f13_4,12) (f6_4,13) (f9_4,14) (f15_4,15) (f16_4,16) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX4; x2 := oldX2; x3 := oldX3; TO: 2; FROM: 2; oldX0 := x0; popout

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

job log

popout

actions

all output return to C Integer