NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToLLVMProof [EQUIVALENT, 122 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 661 ms]
(4) LLVM Symbolic Execution Graph
(5) LLVMNonterminationProof [COMPLETE, 626 ms]
(6) NO


----------------------------------------

(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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%i = alloca i32, align 4
		%j = alloca i32, align 4
		%k = alloca i32, align 4
		%l = alloca i32, align 4
		%m = alloca i32, align 4
		%a = alloca i32, align 4
		%b = alloca i32, align 4
		store 0, %1
		store 0, %i
		br %2
	2:
		%3 = load %i
		%4 = icmp slt %3 100
		br %4, %5, %58
	5:
		%6 = load %i
		%7 = add %6 2
		store %7, %a
		store 0, %j
		br %8
	8:
		%9 = load %j
		%10 = load %a
		%11 = icmp slt %9 %10
		br %11, %12, %55
	12:
		%13 = load %i
		%14 = load %j
		%15 = add %13 %14
		%16 = add %15 3
		store %16, %k
		br %17
	17:
		%18 = load %k
		%19 = icmp sge %18 0
		br %19, %20, %52
	20:
		%21 = load %i
		%22 = load %j
		%23 = add %21 %22
		%24 = load %k
		%25 = add %23 %24
		%26 = add %25 4
		store %26, %b
		store 0, %l
		br %27
	27:
		%28 = load %l
		%29 = load %b
		%30 = icmp slt %28 %29
		br %30, %31, %49
	31:
		%32 = load %i
		%33 = load %j
		%34 = add %32 %33
		%35 = load %k
		%36 = add %34 %35
		%37 = load %l
		%38 = add %36 %37
		%39 = add %38 1000
		store %39, %m
		br %40
	40:
		%41 = load %m
		%42 = icmp sge %41 0
		br %42, %43, %46
	43:
		%44 = load %m
		%45 = sub %44 0
		store %45, %m
		br %40
	46:
		%47 = load %l
		%48 = add %47 1
		store %48, %l
		br %27
	49:
		%50 = load %k
		%51 = sub %50 1
		store %51, %k
		br %17
	52:
		%53 = load %j
		%54 = add %53 1
		store %54, %j
		br %8
	55:
		%56 = load %i
		%57 = add %56 1
		store %57, %i
		br %2
	58:
		ret 0


Analyze Termination of all function calls matching the pattern:
main()
----------------------------------------

(3) LLVMToTerminationGraphProof (EQUIVALENT)
Constructed symbolic execution graph for LLVM program and proved memory safety.
----------------------------------------

(4)
Obligation:
SE Graph
----------------------------------------

(5) LLVMNonterminationProof (COMPLETE)
Proved nontermination with the following witness:

State #239 with references set to {}.
Nondeterministic instruction %1 = alloca i32, align 4 in node #239 yields value 17.
Nondeterministic instruction %i = alloca i32, align 4 in node #240 yields value 21.
Nondeterministic instruction %j = alloca i32, align 4 in node #241 yields value 1.
Nondeterministic instruction %k = alloca i32, align 4 in node #242 yields value 13.
Nondeterministic instruction %l = alloca i32, align 4 in node #243 yields value 29.
Nondeterministic instruction %m = alloca i32, align 4 in node #244 yields value 5.
Nondeterministic instruction %a = alloca i32, align 4 in node #245 yields value 25.
Nondeterministic instruction %b = alloca i32, align 4 in node #246 yields value 9.

----------------------------------------

(6)
NO