details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.52948880196 seconds
cpu usage	11.07446944
max memory	1.050865664E9

stage attributes

key	value
output-size	6418
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: 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, 1849 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(i, x, n, b, t) -> f2(x_1, x, n, b, t) :|: TRUE f2(x1, x2, x3, x4, x5) -> f3(x1, x6, x3, x4, x5) :|: TRUE f3(x7, x8, x9, x10, x11) -> f4(x7, x8, x12, x10, x11) :|: TRUE f4(x13, x14, x15, x16, x17) -> f5(x13, x14, x15, x18, x17) :|: TRUE f6(x19, x20, x21, x22, x23) -> f9(x19, x20, x21, x22, 1) :|: TRUE f7(x24, x25, x26, x27, x28) -> f10(x24, x25, x26, x27, arith) :|: TRUE && arith = 0 - 1 f5(x29, x30, x31, x32, x33) -> f6(x29, x30, x31, x32, x33) :|: x32 >= 1 f5(x34, x35, x36, x37, x38) -> f7(x34, x35, x36, x37, x38) :|: x37 < 1 f9(x39, x40, x41, x42, x43) -> f8(x39, x40, x41, x42, x43) :|: TRUE f10(x44, x45, x46, x47, x48) -> f8(x44, x45, x46, x47, x48) :|: TRUE f12(x94, x95, x96, x97, x98) -> f15(x94, x99, x96, x97, x98) :|: TRUE && x99 = x95 + x98 f13(x100, x101, x102, x103, x104) -> f16(x100, x105, x102, x103, x104) :|: TRUE && x105 = x101 - x104 f11(x59, x60, x61, x62, x63) -> f12(x59, x60, x61, x62, x63) :|: x62 >= 1 f11(x64, x65, x66, x67, x68) -> f13(x64, x65, x66, x67, x68) :|: x67 < 1 f15(x69, x70, x71, x72, x73) -> f14(x69, x70, x71, x72, x73) :|: TRUE f16(x74, x75, x76, x77, x78) -> f14(x74, x75, x76, x77, x78) :|: TRUE f8(x79, x80, x81, x82, x83) -> f11(x79, x80, x81, x82, x83) :|: x80 <= x81 f14(x84, x85, x86, x87, x88) -> f8(x84, x85, x86, x87, x88) :|: TRUE f8(x89, x90, x91, x92, x93) -> f17(x89, x90, x91, x92, x93) :|: x90 > x91 Start term: f1(i, x, n, b, t) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_5,1) (f2_5,2) (f3_5,3) (f4_5,4) (f5_5,5) (f6_5,6) (f9_5,7) (f7_5,8) (f10_5,9) (f8_5,10) (f12_5,11) (f15_5,12) (f13_5,13) (f16_5,14) (f11_5,15) (f14_5,16) (f17_5,17) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := x4; oldX5 := nondet(); assume(0 = 0); x0 := oldX5; x1 := oldX1; x2 := oldX2; x3 := oldX3; x4 := oldX4; TO: 2; popout

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

job log

popout

actions

all output return to C Integer