details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.94434499741 seconds
cpu usage	8.874347997
max memory	6.46303744E8

stage attributes

key	value
output-size	2592
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be disproven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [COMPLETE, 1256 ms] (6) NO ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, j) -> f2(x_1, j) :|: TRUE f2(x, x1) -> f3(x, x2) :|: TRUE f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - 1 f5(x13, x14) -> f6(x13, x15) :|: TRUE && x15 = x14 + 1 f3(x7, x8) -> f4(x7, x8) :|: x7 < x8 f3(x16, x17) -> f4(x16, x17) :|: x16 > x17 f6(x9, x10) -> f3(x9, x10) :|: TRUE f3(x11, x12) -> f7(x11, x12) :|: x11 = x12 Start term: f1(i, j) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_2,1) (f2_2,2) (f3_2,3) (f4_2,4) (f5_2,5) (f6_2,6) (f7_2,7) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX2; TO: 3; FROM: 4; oldX0 := x0; oldX1 := x1; oldX2 := -(1 - oldX0); assume(0 = 0 && oldX2 = oldX0 - 1); x0 := -(1 - oldX0); x1 := oldX1; TO: 5; FROM: 5; oldX0 := x0; oldX1 := x1; oldX2 := -(-(oldX1 + 1)); assume(0 = 0 && oldX2 = oldX1 + 1); x0 := oldX0; x1 := -(-(oldX1 + 1)); TO: 6; popout

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

job log

popout

actions

all output return to C Integ Progr 58257