// RUN: %llvmgcc %s -emit-llvm -O0 -c -o %t.bc
// RUN: rm -rf %t.klee-out
// RUN: %klee --write-kqueries --output-dir=%t.klee-out --optimize-array=index %t.bc > %t.log 2>&1
// RUN: FileCheck %s -input-file=%t.log -check-prefix=CHECK-OPT_I
// RUN: test -f %t.klee-out/test000001.kquery
// RUN: test -f %t.klee-out/test000002.kquery

// CHECK-OPT_I: KLEE: WARNING: OPT_I: successful
// CHECK-CONST_ARR: const_arr

#include <stdio.h>
#include "klee/klee.h"

int array[10] = {1,2,3,-4,5,6,7,8,9,10};

int main() {
  char k;

  klee_make_symbolic(&k, sizeof(k), "k");
  klee_assume(k < 4);
  klee_assume(k >=0);

  // CHECK: Yes
  // CHECK-NEXT: No
  if (array[k*3] < 0)
    printf("Yes\n");
  else
    printf("No\n");

  // CHECK: KLEE: done: completed paths = 2

  return 0;
}