details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	22.1206 seconds
cpu usage	77.0018
user time	74.3071
system time	2.69466
max virtual memory	4.5628096E7
max residence set size	4066776.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, 175 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 7876 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 434 ms] (9) IntTRS (10) IRS2T2 [EQUIVALENT, 0 ms] (11) T2IntSys (12) T2 [EQUIVALENT, 1513 ms] (13) YES (14) LLVM Symbolic Execution SCC (15) SCC2IRS [SOUND, 128 ms] (16) IntTRS (17) IntTRSCompressionProof [EQUIVALENT, 0 ms] (18) IntTRS (19) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (20) IntTRS (21) RankingReductionPairProof [EQUIVALENT, 19 ms] (22) YES (23) LLVM Symbolic Execution SCC (24) SCC2IRS [SOUND, 122 ms] (25) IntTRS (26) IntTRSCompressionProof [EQUIVALENT, 0 ms] (27) IntTRS (28) RankingReductionPairProof [EQUIVALENT, 5 ms] (29) YES (30) LLVM Symbolic Execution SCC (31) SCC2IRS [SOUND, 102 ms] (32) IntTRS (33) IntTRSCompressionProof [EQUIVALENT, 0 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 4 ms] (36) 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: "malloc" returnParam: *i8 parameters: (i64) variableLength: false visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "__VERIFIER_nondet_String" linkageType: EXTERNALLY_VISIBLE returnParam: *i8 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %length = alloca i32, align 4 %nondetString = alloca *i8, align 8 %1 = call i32 @__VERIFIER_nondet_int() store %1, %length %2 = load %length %3 = icmp slt %2 1 br %3, %4, %5 4: store 1, %length br %5 5: %6 = load %length %7 = sext i32 %6 to i64 %8 = mul %7 1 %9 = call *i8 @malloc(i64 %8) store %9, %nondetString %10 = load %length %11 = sub %10 1 %12 = sext i32 %11 to i64 popout

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

job log

popout

actions

all output return to C