details

property	value
status	complete
benchmark	PodelskiRybalchenko-TACAS2011-Fig4_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	SV-COMP_Termination_Category

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	10.2406 seconds
cpu usage	35.6668
user time	33.9913
system time	1.67555
max virtual memory	4.5415656E7
max residence set size	3271360.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) CToLLVMProof [EQUIVALENT, 173 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 1490 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 137 ms] (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (13) AND (14) IntTRS (15) TerminationGraphProcessor [EQUIVALENT, 2 ms] (16) IntTRS (17) IntTRSCompressionProof [EQUIVALENT, 0 ms] (18) IntTRS (19) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (20) IntTRS (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (22) YES (23) IntTRS (24) TerminationGraphProcessor [EQUIVALENT, 0 ms] (25) IntTRS (26) IntTRSCompressionProof [EQUIVALENT, 0 ms] (27) IntTRS (28) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (29) IntTRS (30) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (31) YES (32) LLVM Symbolic Execution SCC (33) SCC2IRS [SOUND, 57 ms] (34) IntTRS (35) IntTRSCompressionProof [EQUIVALENT, 0 ms] (36) IntTRS (37) RankingReductionPairProof [EQUIVALENT, 0 ms] (38) YES (39) LLVM Symbolic Execution SCC (40) SCC2IRS [SOUND, 80 ms] (41) IntTRS (42) IntTRSCompressionProof [EQUIVALENT, 0 ms] (43) IntTRS (44) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (45) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM. ---------------------------------------- (2) Obligation: LLVM Problem Aliases: Data layout: "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" Machine: "x86_64-pc-linux-gnu" Type definitions: Global variables: Function declarations and definitions: *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %x = alloca i32, align 4 %y = alloca i32, align 4 store 0, %1 %2 = call i32 @__VERIFIER_nondet_int() store %2, %x %3 = call i32 @__VERIFIER_nondet_int() store %3, %y br %4 4: %5 = load %x popout

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

job log

popout

actions

all output return to C