details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	49.905 seconds
cpu usage	115.092
user time	112.373
system time	2.71952
max virtual memory	4.3342104E7
max residence set size	5154596.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, 170 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 34.0 s] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 1 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 333 ms] (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) PolynomialOrderProcessor [EQUIVALENT, 25 ms] (13) IntTRS (14) TerminationGraphProcessor [EQUIVALENT, 0 ms] (15) YES (16) LLVM Symbolic Execution SCC (17) SCC2IRS [SOUND, 100 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (22) YES (23) LLVM Symbolic Execution SCC (24) SCC2IRS [SOUND, 114 ms] (25) IntTRS (26) IntTRSCompressionProof [EQUIVALENT, 0 ms] (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 7 ms] (29) YES (30) LLVM Symbolic Execution SCC (31) SCC2IRS [SOUND, 95 ms] (32) IntTRS (33) IntTRSCompressionProof [EQUIVALENT, 0 ms] (34) IntTRS (35) RankingReductionPairProof [EQUIVALENT, 0 ms] (36) YES (37) LLVM Symbolic Execution SCC (38) SCC2IRS [SOUND, 145 ms] (39) IntTRS (40) IntTRSCompressionProof [EQUIVALENT, 0 ms] (41) IntTRS (42) RankingReductionPairProof [EQUIVALENT, 0 ms] (43) 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 %z = 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 %y %6 = icmp sgt %5 0 popout

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

job log

popout

actions

all output return to C