details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	10.586 seconds
cpu usage	35.1274
user time	33.638
system time	1.48941
max virtual memory	2.3194752E7
max residence set size	3504592.0

stage attributes

key	value
starexec-result	YES

output

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) CToLLVMProof [EQUIVALENT, 175 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 3806 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 147 ms] (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) RankingReductionPairProof [EQUIVALENT, 27 ms] (13) IntTRS (14) TerminationGraphProcessor [EQUIVALENT, 5 ms] (15) IntTRS (16) IntTRSCompressionProof [EQUIVALENT, 0 ms] (17) IntTRS (18) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (19) IntTRS (20) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (21) YES (22) LLVM Symbolic Execution SCC (23) SCC2IRS [SOUND, 109 ms] (24) IntTRS (25) IntTRSCompressionProof [EQUIVALENT, 0 ms] (26) IntTRS (27) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (28) YES (29) LLVM Symbolic Execution SCC (30) SCC2IRS [SOUND, 56 ms] (31) IntTRS (32) IntTRSCompressionProof [EQUIVALENT, 0 ms] (33) IntTRS (34) RankingReductionPairProof [EQUIVALENT, 0 ms] (35) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox2/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 %d = 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 %4 = call i32 @__VERIFIER_nondet_int() store %4, %d br %5 5: %6 = load %x %7 = icmp sgt %6 0 br %7, %8, %14 8: %9 = load %y %10 = icmp sgt %9 0 br %10, %11, %14 11: popout

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

job log

popout

actions

all output return to C