test/Merging/merge_fail.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

// RUN: %clang -emit-llvm -g -c -o %t.bc %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --search=bfs %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --search=dfs %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --search=nurs:covnew %t.bc 2>&1 | FileCheck %s
// RUN: rm -rf %t.klee-out
// RUN: %klee --output-dir=%t.klee-out --use-merge --debug-log-merge --search=random-path %t.bc 2>&1 | FileCheck %s

// CHECK: open merge:
// CHECK: generated tests = 2{{$}}

// This test will not merge because we cannot merge states when they allocated memory.

#include "klee/klee.h"

int main(int argc, char **args) {

  int* arr = 0;
  int a = 0;

  klee_make_symbolic(&a, sizeof(a), "a");

  klee_open_merge();
  if (a == 0) {
    arr = (int*) malloc(7 * sizeof(int));
    arr[0] = 7;
  } else {
    arr = (int*) malloc(8 * sizeof(int));
    arr[0] = 8;
  }
  klee_close_merge();
  a = arr[0];
  free(arr);

  return a;
}