details

property	value
status	complete
benchmark	LarrazOliverasRodriguez-CarbonellRubio-FMCAD2013-Fig1_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n002.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	4.04915118217 seconds
cpu usage	12.822343435
max memory	8.60688384E8

stage attributes

key	value
output-size	5695
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 2177 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, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f8(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1 f10(x51, x52, x53) -> f11(x54, x52, x53) :|: TRUE && x54 = x51 + 1 f11(x55, x56, x57) -> f12(x55, x56, x58) :|: TRUE && x58 = x57 - 1 f9(x18, x19, x20) -> f10(x18, x19, x20) :|: x19 < x20 f12(x21, x22, x23) -> f9(x21, x22, x23) :|: TRUE f9(x24, x25, x26) -> f13(x24, x25, x26) :|: x25 >= x26 f13(x59, x60, x61) -> f14(x59, x62, x61) :|: TRUE && x62 = x59 + x60 f5(x30, x31, x32) -> f8(x30, x31, x32) :|: x31 >= 1 f14(x33, x34, x35) -> f5(x33, x34, x35) :|: TRUE f5(x36, x37, x38) -> f15(x36, x37, x38) :|: x37 < 1 f4(x39, x40, x41) -> f5(x39, x40, x41) :|: x39 <= 10000 && x39 >= 0 - 10000 && x40 <= 10000 && x41 <= 10000 f4(x42, x43, x44) -> f6(x42, x43, x44) :|: x44 > 10000 f4(x63, x64, x65) -> f6(x63, x64, x65) :|: x64 > 10000 f4(x66, x67, x68) -> f6(x66, x67, x68) :|: x66 > 10000 f4(x69, x70, x71) -> f6(x69, x70, x71) :|: x69 < 0 - 10000 f15(x45, x46, x47) -> f7(x45, x46, x47) :|: TRUE f6(x48, x49, x50) -> f7(x48, x49, x50) :|: TRUE Start term: f1(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_3,1) (f2_3,2) (f3_3,3) (f4_3,4) (f8_3,5) (f9_3,6) (f10_3,7) (f11_3,8) (f12_3,9) (f13_3,10) (f14_3,11) (f5_3,12) (f15_3,13) (f6_3,14) (f7_3,15) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX3; x1 := oldX1; x2 := oldX2; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; popout

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

job log

popout

actions

all output return to C Integ Progr 58257