dataset
stringclasses
1 value
file
stringlengths
27
83
fun_name
stringlengths
7
83
llvm_ir_function
stringlengths
61
8.29k
label
stringclasses
2 values
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memmove_05-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = ptrtoint i64* %sv_1 to i64 %4 = add i64 %3, add (i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_1 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 4095)), i64 15), i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_1 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 -4096)), i64 -416)) %5 = and i64 %4, -16 store i64 %5, i64* %sv_1, align 8 br label LBL_2 LBL_2: %6 = ptrtoint i64* %sv_2 to i64 store i64 0, i64* %storemerge1.reg2mem br label LBL_3 LBL_3: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %7 = mul i64 %storemerge1.reload, 8 %8 = add i64 %7, %6 %9 = add i64 %8, -816 %10 = inttoptr i64 %9 to i32* store i32 0, i32* %10, align 8 %11 = add i64 %8, -812 %12 = inttoptr i64 %11 to i32* store i32 0, i32* %12, align 4 %13 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %13, 100 store i64 %13, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_4, label LBL_3 LBL_4: %14 = load i64, i64* %sv_1, align 8 %15 = inttoptr i64 %14 to i64* %16 = call i64* @memmove(i64* %15, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_2 to i32)) %17 = load i64, i64* %sv_1, align 8 %18 = call i64 @FUNC(i64 %17) %19 = call i64 @FUNC(i64 40) %20 = icmp eq i64 %0, %19 store i64 0, i64* %rax.0.reg2mem br i1 %20, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder i64 (i64)* @printStructLine, { 1, 0 } uselistorder i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_1 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), { 1, 0 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__struct_array_declare_no_init_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %.reg2mem = alloca i32 %indvars.iv5.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_0 to i64 %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false store i64 0, i64* %indvars.iv5.reg2mem store i32 %2, i32* %.reg2mem br i1 %4, label LBL_3, label LBL_1 LBL_1: %indvars.iv5.reload = load i64, i64* %indvars.iv5.reg2mem %5 = mul i64 %indvars.iv5.reload, 8 %6 = add i64 %5, %1 %7 = inttoptr i64 %6 to i32* %8 = trunc i64 %indvars.iv5.reload to i32 store i32 %8, i32* %7, align 8 %9 = or i64 %6, 4 %10 = inttoptr i64 %9 to i32* store i32 %8, i32* %10, align 4 %indvars.iv.next6 = add nuw nsw i64 %indvars.iv5.reload, 1 %exitcond7 = icmp eq i64 %indvars.iv.next6, 10 store i64 %indvars.iv.next6, i64* %indvars.iv5.reg2mem br i1 %exitcond7, label LBL_2, label LBL_1 LBL_2: %.pre = load i32, i32* @gv_0, align 4 store i32 %.pre, i32* %.reg2mem br label LBL_3 LBL_3: %.reload = load i32, i32* %.reg2mem %11 = icmp eq i32 %.reload, 5 %12 = icmp eq i1 %11, false store i64 0, i64* %indvars.iv.reg2mem br i1 %12, label LBL_5, label LBL_4 LBL_4: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %13 = mul i64 %indvars.iv.reload, 8 %14 = add i64 %13, %1 %15 = inttoptr i64 %14 to i32* %16 = load i32, i32* %15, align 8 %17 = zext i32 %16 to i64 %18 = call i64 @FUNC(i64 %17) %19 = or i64 %14, 4 %20 = inttoptr i64 %19 to i32* %21 = load i32, i32* %20, align 4 %22 = zext i32 %21 to i64 %23 = call i64 @FUNC(i64 %22) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %0, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv5.reg2mem, { 2, 0, 1 } uselistorder i32* %.reg2mem, { 0, 2, 1 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder i64 (i64)* @printIntLine, { 7, 6, 5, 4, 3, 2, 1, 0 } uselistorder i64 10, { 1, 0, 3, 2, 5, 4, 7, 6 } uselistorder i32* @gv_0, { 0, 4, 3, 2, 1 } uselistorder label LBL_4, { 1, 0 } uselistorder label LBL_1, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__malloc_char_memmove_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64* null, i64** %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 100) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = ptrtoint i64* %4 to i64 %8 = call i64* @memset(i64* %4, i32 65, i32 99) %9 = add i64 %7, 99 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 store i64* %4, i64** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem %11 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %12 = bitcast i64* %sv_1 to i8* %13 = call i32 @strlen(i8* nonnull %12) %14 = call i64* @memmove(i64* nonnull %sv_1, i64* %sv_0.0.reload, i32 %13) %15 = ptrtoint i64* %sv_1 to i64 %16 = call i64 @FUNC(i64 %15) call void @free(i64* %sv_0.0.reload) %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %0, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 0, 1, 3, 2 } uselistorder i64* %sv_1, { 3, 0, 1, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 2, 3, 1, 0, 4 } uselistorder i32 99, { 0, 1, 3, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder i64* null, { 2, 0, 3, 1 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__int_fgets_sub_07-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i32 %1, i32* %.reg2mem store i32 0, i32* %sv_0.0.reg2mem br i1 %3, label LBL_5, label LBL_1 LBL_1: store i64 0, i64* %sv_1, align 8 %4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4) %7 = icmp eq i8* %6, null br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i32 @atoi(i8* nonnull %5) store i32 %8, i32* %sv_0.0.ph.reg2mem br label LBL_4 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) store i32 0, i32* %sv_0.0.ph.reg2mem br label LBL_4 LBL_4: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %.pr = load i32, i32* @gv_0, align 4 store i32 %.pr, i32* %.reg2mem store i32 %sv_0.0.ph.reload, i32* %sv_0.0.reg2mem br label LBL_5 LBL_5: %.reload = load i32, i32* %.reg2mem %10 = icmp eq i32 %.reload, 5 br i1 %10, label LBL_7, label LBL_6 LBL_6: %11 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64)) br label LBL_10 LBL_7: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %12 = icmp eq i32 %sv_0.0.reload, -2147483648 br i1 %12, label LBL_9, label LBL_8 LBL_8: %13 = add i32 %sv_0.0.reload, -1 %14 = zext i32 %13 to i64 %15 = call i64 @FUNC(i64 %14) br label LBL_10 LBL_9: %16 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_4 to i64)) br label LBL_10 LBL_10: %17 = call i64 @FUNC(i64 40) %18 = icmp eq i64 %0, %17 store i64 0, i64* %rax.0.reg2mem br i1 %18, label LBL_12, label LBL_11 LBL_11: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_12 LBL_12: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_fscanf_postinc_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 3) store i64 %4, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printLongLongLine, { 3, 2, 1, 0 } uselistorder i64 3, { 1, 0 } uselistorder i32* @gv_0, { 5, 0, 4, 1, 3, 2 } }
0
juliet-test-suite-c
CWE127_Buffer_Underread__malloc_char_memmove_13-bad
CWE127_Buffer_Underread__malloc_char_memmove_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64* null, i64** %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 100) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = ptrtoint i64* %4 to i64 %8 = call i64* @memset(i64* %4, i32 65, i32 99) %9 = add i64 %7, 99 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 %11 = add i64 %7, -8 %phitmp = inttoptr i64 %11 to i64* store i64* %phitmp, i64** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem %12 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %13 = call i64* @memmove(i64* nonnull %sv_1, i64* %sv_0.0.reload, i32 100) %14 = call i64 @FUNC(i64* nonnull %sv_1) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 0, 2, 1 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__char_type_overrun_memmove_14-bad
CWE121_Stack_Based_Buffer_Overflow__char_type_overrun_memmove_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint ([32 x i8]* @gv_0 to i64)) store i64 3978425819141910832, i64* %sv_0, align 8 %5 = ptrtoint i64* %sv_0 to i64 %6 = call i64 @FUNC(i64 %5) %7 = call i64 @FUNC(i64 3978425819141910832) br label LBL_2 LBL_2: %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE191_Integer_Underflow__int_connect_socket_multiply_11-bad
CWE191_Integer_Underflow__int_connect_socket_multiply_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.1.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i32 0, i32* %sv_0.1.reg2mem br i1 %3, label LBL_6, label LBL_1 LBL_1: %4 = call i32 @socket(i32 2, i32 1, i32 6) %5 = icmp eq i32 %4, -1 store i32 0, i32* %sv_0.1.reg2mem br i1 %5, label LBL_6, label LBL_2 LBL_2: %6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %7 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %8 = call i16 @htons(i16 27015) %9 = bitcast i64* %sv_2 to %sockaddr* %10 = call i32 @connect(i32 %4, %sockaddr* nonnull %9, i32 16) %11 = icmp eq i32 %10, -1 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %11, label LBL_5, label LBL_3 LBL_3: %12 = call i32 @recv(i32 %4, i64* nonnull %sv_1, i32 13, i32 0) %13 = add i32 %12, 1 %14 = icmp ult i32 %13, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %14, label LBL_5, label LBL_4 LBL_4: %15 = ptrtoint i64* %sv_3 to i64 %16 = sext i32 %12 to i64 %17 = add i64 %15, -22 %18 = add i64 %17, %16 %19 = inttoptr i64 %18 to i8* store i8 0, i8* %19, align 1 %20 = bitcast i64* %sv_1 to i8* %21 = call i32 @atoi(i8* nonnull %20) store i32 %21, i32* %sv_0.0.ph.reg2mem br label LBL_5 LBL_5: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %22 = call i32 @close(i32 %4) store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem br label LBL_6 LBL_6: %sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem %23 = call i64 @FUNC() %24 = trunc i64 %23 to i32 %25 = icmp eq i32 %24, 0 %26 = icmp slt i32 %sv_0.1.reload, 0 %27 = icmp eq i1 %26, false %or.cond = or i1 %27, %25 br i1 %or.cond, label LBL_8, label LBL_7 LBL_7: %28 = mul i32 %sv_0.1.reload, 2 %29 = zext i32 %28 to i64 %30 = call i64 @FUNC(i64 %29) br label LBL_8 LBL_8: %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %0, %31 store i64 0, i64* %rax.0.reg2mem br i1 %32, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.1.reload, { 1, 0 } uselistorder i32 %12, { 1, 0 } uselistorder i32 %4, { 2, 0, 1, 3 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 2, 1 } uselistorder i32* %sv_0.1.reg2mem, { 0, 2, 1, 3 } uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } uselistorder label LBL_6, { 1, 0, 2 } uselistorder label LBL_5, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE400_Resource_Exhaustion__connect_socket_fwrite_02-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge11.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i32 @socket(i32 2, i32 1, i32 6) %2 = icmp eq i32 %1, -1 br i1 %2, label LBL_12, label LBL_1 LBL_1: %3 = call i64* @memset(i64* nonnull %sv_1, i32 0, i32 16) store i64 2, i64* %sv_1, align 8 %4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %5 = call i16 @htons(i16 27015) %6 = bitcast i64* %sv_1 to %sockaddr* %7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16) %8 = icmp eq i32 %7, -1 br i1 %8, label LBL_3, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_0, i32 13, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 br i1 %11, label LBL_3, label LBL_4 LBL_3: %12 = call i32 @close(i32 %1) br label LBL_12 LBL_4: %13 = ptrtoint i64* %sv_2 to i64 %14 = sext i32 %9 to i64 %15 = add i64 %13, -22 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 %18 = bitcast i64* %sv_0 to i8* %19 = call i32 @atoi(i8* nonnull %18) %20 = call i32 @close(i32 %1) %sv_3.0.off = add i32 %19, -1 %21 = icmp ugt i32 %sv_3.0.off, 19 br i1 %21, label LBL_12, label LBL_5 LBL_5: %22 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0)) %23 = icmp eq %_IO_FILE* %22, null %24 = icmp eq i1 %23, false br i1 %24, label LBL_6, label LBL_7 LBL_6: %25 = sext i32 %19 to i64 store i64 0, i64* %storemerge11.reg2mem br label LBL_8 LBL_7: call void @exit(i32 1) unreachable LBL_8: %26 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_3 to i64*), i32 1, i32 50, %_IO_FILE* %22) %27 = icmp eq i32 %26, 50 br i1 %27, label LBL_10, label LBL_9 LBL_9: call void @exit(i32 1) unreachable LBL_10: %storemerge11.reload = load i64, i64* %storemerge11.reg2mem %28 = add nuw i64 %storemerge11.reload, 1 %29 = icmp ult i64 %28, %25 store i64 %28, i64* %storemerge11.reg2mem br i1 %29, label LBL_8, label LBL_11 LBL_11: %30 = call i32 @fclose(%_IO_FILE* nonnull %22) br label LBL_12 LBL_12: %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %0, %31 store i64 0, i64* %rax.0.reg2mem br i1 %32, label LBL_14, label LBL_13 LBL_13: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_14 LBL_14: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %22, { 1, 0, 2 } uselistorder i32 %19, { 1, 0 } uselistorder i32 %9, { 1, 0 } uselistorder i32 %1, { 3, 0, 1, 2, 4 } uselistorder i64* %sv_1, { 0, 2, 1 } uselistorder i64* %storemerge11.reg2mem, { 1, 0, 2 } uselistorder label LBL_12, { 2, 3, 1, 0 } uselistorder label LBL_8, { 1, 0 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_ncpy_12-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* %2 = call i64 @FUNC() %3 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %4 = ptrtoint i64* %sv_1 to i64 %5 = add i64 %4, 49 %6 = inttoptr i64 %5 to i8* store i8 0, i8* %6, align 1 store i64 0, i64* %sv_0, align 8 %7 = call i32 @strlen(i8* nonnull %1) %8 = bitcast i64* %sv_0 to i8* %9 = call i8* @strncpy(i8* nonnull %8, i8* nonnull %1, i32 %7) %10 = call i64 @FUNC(i64 %4) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %1, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_fscanf_sub_17-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0) %3 = load i8, i8* %sv_0, align 1 %4 = icmp eq i8 %3, -128 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i8 %3, -1 %6 = sext i8 %5 to i64 %7 = and i64 %6, 4294967295 %8 = call i64 @FUNC(i64 %7) br label LBL_3 LBL_2: %9 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %10 = call i64 @FUNC(i64 40) %11 = icmp eq i64 %0, %10 store i64 0, i64* %rax.0.reg2mem br i1 %11, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %sv_0, { 1, 0, 2 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE78_OS_Command_Injection__char_file_execl_32-bad
CWE78_OS_Command_Injection__char_file_execl_32_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = sext i32 %2 to i64 %4 = sub nsw i64 100, %3 %5 = icmp ult i64 %4, 2 br i1 %5, label LBL_5, label LBL_1 LBL_1: %6 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %7 = icmp eq %_IO_FILE* %6, null br i1 %7, label LBL_5, label LBL_2 LBL_2: %8 = ptrtoint i64* %sv_0 to i64 %9 = sub i32 100, %2 %10 = add i64 %3, %8 %11 = inttoptr i64 %10 to i8* %12 = call i8* @fgets(i8* %11, i32 %9, %_IO_FILE* nonnull %6) %13 = icmp eq i8* %12, null %14 = icmp eq i1 %13, false br i1 %14, label LBL_4, label LBL_3 LBL_3: %15 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %11, align 1 br label LBL_4 LBL_4: %16 = call i32 @fclose(%_IO_FILE* nonnull %6) br label LBL_5 LBL_5: %17 = call i32 (i8*, i8*, ...) @execl(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_3, i64 0, i64 0), i8* getelementptr inbounds ([8 x i8], [8 x i8]* @gv_3, i64 0, i64 0)) %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__char_realloc_08-bad
CWE690_NULL_Deref_From_Return__char_realloc_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @realloc(i64* null, i32 20) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = ptrtoint i64* %0 to i64 store i64 7596553777019711049, i64* %0, align 8 %5 = add i64 %4, 8 %6 = inttoptr i64 %5 to i16* store i16 25978, i16* %6, align 2 %7 = add i64 %4, 10 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 %9 = call i64 @FUNC(i64 %4) call void @free(i64* %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
1
juliet-test-suite-c
CWE617_Reachable_Assertion__fgets_10-bad
CWE617_Reachable_Assertion__fgets_10_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_4, label LBL_1 LBL_1: store i64 0, i64* %sv_0, align 8 %3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %4 = bitcast i64* %sv_0 to i8* %5 = call i8* @fgets(i8* nonnull %4, i32 14, %_IO_FILE* %3) %6 = icmp eq i8* %5, null br i1 %6, label LBL_3, label LBL_2 LBL_2: %7 = call i32 @atoi(i8* nonnull %4) %phitmp = icmp sgt i32 %7, 5 br i1 %phitmp, label LBL_5, label LBL_4 LBL_3: %8 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) br label LBL_4 LBL_4: call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_3, i64 0, i64 0), i8* getelementptr inbounds ([127 x i8], [127 x i8]* @gv_4, i64 0, i64 0), i32 49, i8* getelementptr inbounds ([41 x i8], [41 x i8]* @gv_5, i64 0, i64 0)) br label LBL_5 LBL_5: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder label LBL_4, { 1, 2, 0 } }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__connect_socket_malloc_31-bad
CWE194_Unexpected_Sign_Extension__connect_socket_malloc_31_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i32 %sv_0.0.ph.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i32 @socket(i32 2, i32 1, i32 6) %2 = icmp eq i32 %1, -1 store i32 0, i32* %.reg2mem br i1 %2, label LBL_6, label LBL_1 LBL_1: %3 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %4 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %5 = call i16 @htons(i16 27015) %6 = bitcast i64* %sv_2 to %sockaddr* %7 = call i32 @connect(i32 %1, %sockaddr* nonnull %6, i32 16) %8 = icmp eq i32 %7, -1 store i32 0, i32* %sv_0.0.ph.ph.reg2mem br i1 %8, label LBL_4, label LBL_2 LBL_2: %9 = call i32 @recv(i32 %1, i64* nonnull %sv_1, i32 7, i32 0) %10 = add i32 %9, 1 %11 = icmp ult i32 %10, 2 store i32 0, i32* %sv_0.0.ph.ph.reg2mem br i1 %11, label LBL_4, label LBL_3 LBL_3: %12 = ptrtoint i64* %sv_3 to i64 %13 = sext i32 %9 to i64 %14 = add i64 %12, -16 %15 = add i64 %14, %13 %16 = inttoptr i64 %15 to i8* store i8 0, i8* %16, align 1 %17 = bitcast i64* %sv_1 to i8* %18 = call i32 @atoi(i8* nonnull %17) %.off = add i32 %18, 32768 %19 = icmp ult i32 %.off, 65536 store i32 -1, i32* %sv_0.0.ph.ph.reg2mem br i1 %19, label LBL_5, label LBL_4 LBL_4: %sv_0.0.ph.ph.reload = load i32, i32* %sv_0.0.ph.ph.reg2mem %20 = call i32 @close(i32 %1) store i32 %sv_0.0.ph.ph.reload, i32* %.reg2mem br label LBL_6 LBL_5: %sext6 = mul i32 %18, 65536 %21 = ashr exact i32 %sext6, 16 %22 = call i32 @close(i32 %1) %23 = trunc i32 %21 to i16 %24 = icmp sgt i16 %23, 99 store i32 %21, i32* %.reg2mem br i1 %24, label LBL_9, label LBL_6 LBL_6: %.reload = load i32, i32* %.reg2mem %25 = call i64* @malloc(i32 %.reload) %26 = icmp eq i64* %25, null %27 = icmp eq i1 %26, false br i1 %27, label LBL_8, label LBL_7 LBL_7: call void @exit(i32 -1) unreachable LBL_8: %28 = ptrtoint i64* %25 to i64 %29 = add nsw i32 %.reload, -1 %30 = call i64* @memset(i64* %25, i32 65, i32 %29) %31 = zext i32 %.reload to i64 %sext5 = mul i64 %31, 281474976710656 %32 = ashr exact i64 %sext5, 48 %33 = add i64 %28, -1 %34 = add i64 %33, %32 %35 = inttoptr i64 %34 to i8* store i8 0, i8* %35, align 1 %36 = call i64 @FUNC(i64 %28) call void @free(i64* %25) br label LBL_9 LBL_9: %37 = call i64 @FUNC(i64 40) %38 = icmp eq i64 %0, %37 store i64 0, i64* %rax.0.reg2mem br i1 %38, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %28, { 1, 0 } uselistorder i64* %25, { 0, 1, 3, 2 } uselistorder i32 %.reload, { 1, 2, 0 } uselistorder i32 %9, { 1, 0 } uselistorder i32 %1, { 3, 0, 1, 2, 4 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %.reg2mem, { 0, 3, 1, 2 } uselistorder i32 (i32)* @close, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder i32 -1, { 1, 4, 0, 2, 3 } uselistorder label LBL_6, { 2, 0, 1 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__int_rand_sub_04-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i32 @rand() %1 = urem i32 %0, 2 %2 = icmp eq i32 %1, 0 %3 = call i32 @rand() %4 = mul i32 %3, 1073741824 %5 = call i32 @rand() %6 = mul i32 %5, 32768 %7 = xor i32 %6, %4 %8 = call i32 @rand() %9 = xor i32 %7, %8 %10 = sext i1 %2 to i32 %storemerge.in = xor i32 %9, %10 %11 = icmp eq i32 %storemerge.in, -2147483648 br i1 %11, label LBL_2, label LBL_1 LBL_1: %12 = add i32 %storemerge.in, -1 %13 = zext i32 %12 to i64 %14 = call i64 @FUNC(i64 %13) store i64 %14, i64* %rax.0.reg2mem br label LBL_3 LBL_2: %15 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_0 to i64)) store i64 %15, i64* %rax.0.reg2mem br label LBL_3 LBL_3: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %storemerge.in, { 1, 0 } uselistorder i64* %rax.0.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE806_char_ncat_13-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.pre-phi.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %5 = icmp eq i32 %4, 5 br i1 %5, label LBL_4, label LBL_3 LBL_3: %6 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) %.pre = ptrtoint i64* %1 to i64 store i64 %.pre, i64* %.pre-phi.reg2mem br label LBL_5 LBL_4: %7 = call i64* @memset(i64* %1, i32 65, i32 49) %8 = ptrtoint i64* %1 to i64 %9 = add i64 %8, 49 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 store i64 %8, i64* %.pre-phi.reg2mem br label LBL_5 LBL_5: %11 = bitcast i64* %1 to i8* %.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem store i64 0, i64* %sv_0, align 8 %12 = call i32 @strlen(i8* %11) %13 = bitcast i64* %sv_0 to i8* %14 = call i8* @strncat(i8* nonnull %13, i8* %11, i32 %12) %15 = call i64 @FUNC(i64 %.pre-phi.reload) call void @free(i64* %1) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %0, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %11, { 1, 0 } uselistorder i64* %1, { 2, 5, 1, 3, 0, 4 } uselistorder i64* %.pre-phi.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_declare_loop_13-bad
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_declare_loop_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i64 %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %storemerge13.reg2mem = alloca i64 %1 = load i64, i64* %0 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %2 = ptrtoint i64* %sv_1 to i64 %3 = call i64 @FUNC(i64 40) %4 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %5 = icmp eq i32 %4, 5 %6 = add i64 %2, -816 %7 = add i64 %2, -812 store i64 0, i64* %storemerge13.reg2mem br label LBL_1 LBL_1: %storemerge13.reload = load i64, i64* %storemerge13.reg2mem %8 = mul i64 %storemerge13.reload, 8 %9 = add i64 %8, %6 %10 = inttoptr i64 %9 to i32* store i32 0, i32* %10, align 8 %11 = add i64 %7, %8 %12 = inttoptr i64 %11 to i32* store i32 0, i32* %12, align 4 %13 = add nuw nsw i64 %storemerge13.reload, 1 %exitcond4 = icmp eq i64 %13, 100 store i64 %13, i64* %storemerge13.reg2mem br i1 %exitcond4, label LBL_2, label LBL_1 LBL_2: %14 = ptrtoint i64* %sv_0 to i64 %15 = icmp eq i1 %5, false %spec.select = select i1 %15, i64 %1, i64 %14 store i64 0, i64* %storemerge2.reg2mem br label LBL_3 LBL_3: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %16 = mul i64 %storemerge2.reload, 8 %17 = add i64 %16, %spec.select %18 = add i64 %16, %6 %19 = inttoptr i64 %18 to i64* %20 = load i64, i64* %19, align 8 %21 = inttoptr i64 %17 to i64* store i64 %20, i64* %21, align 8 %22 = add nuw nsw i64 %storemerge2.reload, 1 %exitcond = icmp eq i64 %22, 100 store i64 %22, i64* %storemerge2.reg2mem br i1 %exitcond, label LBL_4, label LBL_3 LBL_4: %23 = call i64 @FUNC(i64 %spec.select) %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %3, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %16, { 1, 0 } uselistorder i64 %spec.select, { 1, 0 } uselistorder i64 %8, { 1, 0 } uselistorder i64* %storemerge13.reg2mem, { 1, 0, 2 } uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } uselistorder i64 100, { 1, 0 } }
1
juliet-test-suite-c
CWE416_Use_After_Free__malloc_free_int64_t_07-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_5, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 ptrtoint (i32* @gv_1 to i32)) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 0, i64* %storemerge1.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %8 = mul i64 %storemerge1.reload, 8 %9 = add i64 %8, %5 %10 = inttoptr i64 %9 to i64* store i64 5, i64* %10, align 8 %11 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %11, 100 store i64 %11, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_4, label LBL_3 LBL_4: call void @free(i64* %4) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_fscanf_multiply_31-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* nonnull %sv_0) %3 = load i8, i8* %sv_0, align 1 %4 = icmp slt i8 %3, 0 %5 = icmp eq i1 %4, false br i1 %5, label LBL_4, label LBL_1 LBL_1: %6 = icmp slt i8 %3, -63 br i1 %6, label LBL_3, label LBL_2 LBL_2: %7 = zext i8 %3 to i32 %sext = mul i32 %7, 33554432 %8 = ashr exact i32 %sext, 24 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) br label LBL_4 LBL_3: %11 = call i64 @FUNC(i64 ptrtoint ([51 x i8]* @gv_2 to i64)) br label LBL_4 LBL_4: %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %sv_0, { 1, 0, 2 } uselistorder i64 (i64)* @printHexCharLine, { 1, 0 } uselistorder i8 0, { 1, 2, 0 } }
0
juliet-test-suite-c
CWE188_Reliance_on_Data_Memory_Layout__modify_local_17-bad
CWE188_Reliance_on_Data_Memory_Layout__modify_local_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i32 %rax.0.reg2mem = alloca i64 %1 = load i32, i32* %0 %sv_0 = alloca i32, align 4 %2 = call i64 @FUNC(i64 40) %3 = ptrtoint i32* %sv_0 to i64 %4 = add i64 %3, 4 %5 = inttoptr i64 %4 to i32* %6 = zext i32 %1 to i64 store i32 1, i32* %sv_0, align 4 store i32 5, i32* %5, align 4 %7 = load i32, i32* %sv_0, align 4 %sext = mul i32 %7, 16777216 %8 = ashr exact i32 %sext, 24 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) %11 = call i64 @FUNC(i64 %6) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %2, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 2, 0, 1 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
1
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__int_realloc_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @realloc(i64* null, i32 4) %1 = ptrtoint i64* %0 to i64 %2 = icmp eq i64* %0, null store i64 %1, i64* %rax.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = bitcast i64* %0 to i32* store i32 5, i32* %3, align 4 %4 = call i64 @FUNC(i64 5) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
0
juliet-test-suite-c
CWE590_Free_Memory_Not_on_Heap__free_int_static_15-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge1.reg2mem = alloca i64 %0 = call i64* @malloc(i32 400) %1 = ptrtoint i64* %0 to i64 %2 = icmp eq i64* %0, null %3 = icmp eq i1 %2, false store i64 0, i64* %storemerge1.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_0 to i64)) call void @exit(i32 1) unreachable LBL_2: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %5 = mul i64 %storemerge1.reload, 4 %6 = add i64 %5, %1 %7 = inttoptr i64 %6 to i32* store i32 5, i32* %7, align 4 %8 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %8, 100 store i64 %8, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_3, label LBL_2 LBL_3: %9 = bitcast i64* %0 to i32* %10 = load i32, i32* %9, align 4 %11 = zext i32 %10 to i64 %12 = call i64 @FUNC(i64 %11) call void @free(i64* %0) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__char_calloc_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @calloc(i32 20, i32 1) %1 = ptrtoint i64* %0 to i64 %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 %5 = icmp eq i64* %0, null br i1 %4, label LBL_3, label LBL_1 LBL_1: store i64 %2, i64* %rax.0.reg2mem br i1 %5, label LBL_5, label LBL_2 LBL_2: store i64 7596553777019711049, i64* %0, align 8 %6 = add i64 %1, 8 %7 = inttoptr i64 %6 to i16* store i16 25978, i16* %7, align 2 %8 = add i64 %1, 10 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 %10 = call i64 @FUNC(i64 %1) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_3: store i64 %2, i64* %rax.0.reg2mem br i1 %5, label LBL_5, label LBL_4 LBL_4: store i64 7596553777019711049, i64* %0, align 8 %11 = add i64 %1, 8 %12 = inttoptr i64 %11 to i16* store i16 25978, i16* %12, align 2 %13 = add i64 %1, 10 %14 = inttoptr i64 %13 to i8* store i8 0, i8* %14, align 1 %15 = call i64 @FUNC(i64 %1) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %2, { 1, 0, 2 } uselistorder i64 %1, { 1, 3, 2, 0, 5, 4 } uselistorder i64* %rax.0.reg2mem, { 0, 3, 4, 1, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_listen_socket_14-bad
CWE680_Integer_Overflow_to_Buffer_Overflow__malloc_listen_socket_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge8.reg2mem = alloca i64 %sv_0.1.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i32 -1, i32* %sv_0.1.reg2mem br i1 %3, label LBL_9, label LBL_1 LBL_1: %4 = call i32 @socket(i32 2, i32 1, i32 6) %5 = icmp eq i32 %4, -1 store i32 -1, i32* %sv_0.1.reg2mem br i1 %5, label LBL_9, label LBL_2 LBL_2: %6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %7 = call i16 @htons(i16 27015) %8 = bitcast i64* %sv_2 to %sockaddr* %9 = call i32 @bind(i32 %4, %sockaddr* nonnull %8, i32 16) %10 = icmp eq i32 %9, -1 br i1 %10, label LBL_7, label LBL_3 LBL_3: %11 = call i32 @listen(i32 %4, i32 5) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_7, label LBL_4 LBL_4: %13 = call i32 @accept(i32 %4, %sockaddr* null, i32* null) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_7, label LBL_5 LBL_5: %15 = call i32 @recv(i32 %13, i64* nonnull %sv_1, i32 13, i32 0) %16 = add i32 %15, 1 %17 = icmp ult i32 %16, 2 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %17, label LBL_8, label LBL_6 LBL_6: %18 = ptrtoint i64* %sv_3 to i64 %19 = sext i32 %15 to i64 %20 = add i64 %18, -22 %21 = add i64 %20, %19 %22 = inttoptr i64 %21 to i8* store i8 0, i8* %22, align 1 %23 = bitcast i64* %sv_1 to i8* %24 = call i32 @atoi(i8* nonnull %23) store i32 %24, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %25 = call i32 @close(i32 %4) store i32 -1, i32* %sv_0.1.reg2mem br label LBL_9 LBL_8: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %26 = call i32 @close(i32 %4) %27 = call i32 @close(i32 %13) store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem br label LBL_9 LBL_9: %sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem %28 = mul i32 %sv_0.1.reload, 4 %29 = call i64* @malloc(i32 %28) %30 = icmp eq i64* %29, null %31 = icmp eq i1 %30, false br i1 %31, label LBL_10, label LBL_11 LBL_10: %32 = ptrtoint i64* %29 to i64 %33 = sext i32 %sv_0.1.reload to i64 %34 = icmp eq i32 %sv_0.1.reload, 0 store i64 0, i64* %storemerge8.reg2mem br i1 %34, label LBL_13, label LBL_12 LBL_11: call void @exit(i32 -1) unreachable LBL_12: %storemerge8.reload = load i64, i64* %storemerge8.reg2mem %35 = mul i64 %storemerge8.reload, 4 %36 = add i64 %35, %32 %37 = inttoptr i64 %36 to i32* store i32 0, i32* %37, align 4 %38 = add nuw i64 %storemerge8.reload, 1 %39 = icmp ult i64 %38, %33 store i64 %38, i64* %storemerge8.reg2mem br i1 %39, label LBL_12, label LBL_13 LBL_13: %40 = bitcast i64* %29 to i32* %41 = load i32, i32* %40, align 4 %42 = zext i32 %41 to i64 %43 = call i64 @FUNC(i64 %42) call void @free(i64* %29) %44 = call i64 @FUNC(i64 40) %45 = icmp eq i64 %0, %44 store i64 0, i64* %rax.0.reg2mem br i1 %45, label LBL_15, label LBL_14 LBL_14: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_15 LBL_15: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %29, { 0, 1, 3, 2 } uselistorder i32 %sv_0.1.reload, { 1, 0, 2 } uselistorder i32 %15, { 1, 0 } uselistorder i32 %4, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.1.reg2mem, { 0, 3, 2, 1, 4 } uselistorder i64* %storemerge8.reg2mem, { 2, 0, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i32 -1, { 8, 1, 3, 4, 5, 6, 0, 7, 2 } uselistorder i32 5, { 1, 0 } uselistorder label LBL_12, { 1, 0 } uselistorder label LBL_9, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE563_Unused_Variable__unused_value_char_11-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 67) br label LBL_2 LBL_2: %4 = call i64 @FUNC() %5 = trunc i64 %4 to i32 %6 = icmp eq i32 %5, 0 store i64 %4, i64* %rax.0.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = call i64 @FUNC(i64 90) store i64 %7, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printHexCharLine, { 5, 4, 3, 2, 1, 0 } uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__int_array_alloca_no_init_02-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %indvars.iv4.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = ptrtoint i64* %sv_0 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -33 %3 = and i64 %2, -16 store i64 0, i64* %indvars.iv4.reg2mem br label LBL_1 LBL_1: %indvars.iv4.reload = load i64, i64* %indvars.iv4.reg2mem %4 = mul i64 %indvars.iv4.reload, 4 %5 = add i64 %4, %3 %6 = inttoptr i64 %5 to i32* %7 = trunc i64 %indvars.iv4.reload to i32 store i32 %7, i32* %6, align 4 %indvars.iv.next5 = add nuw nsw i64 %indvars.iv4.reload, 1 %exitcond6 = icmp eq i64 %indvars.iv.next5, 10 store i64 %indvars.iv.next5, i64* %indvars.iv4.reg2mem store i64 0, i64* %indvars.iv.reg2mem br i1 %exitcond6, label LBL_2, label LBL_1 LBL_2: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %8 = mul i64 %indvars.iv.reload, 4 %9 = add i64 %8, %3 %10 = inttoptr i64 %9 to i32* %11 = load i32, i32* %10, align 4 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_3, label LBL_2 LBL_3: %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %1, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv4.reg2mem, { 1, 0, 2 } uselistorder i64* %indvars.iv.reg2mem, { 2, 0, 1 } uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 } uselistorder i64 10, { 1, 0, 3, 2, 5, 4, 7, 6 } uselistorder label LBL_2, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_fscanf_postdec_07-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i32 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i32 %1, i32* %.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i8* nonnull %sv_0) %.pr = load i32, i32* @gv_0, align 4 store i32 %.pr, i32* %.reg2mem br label LBL_2 LBL_2: %.reload = load i32, i32* %.reg2mem %6 = icmp eq i32 %.reload, 5 br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_3 to i64)) br label LBL_7 LBL_4: %8 = load i8, i8* %sv_0, align 1 %9 = icmp eq i8 %8, -128 br i1 %9, label LBL_6, label LBL_5 LBL_5: %10 = add i8 %8, -1 store i8 %10, i8* %sv_0, align 1 %11 = sext i8 %10 to i64 %12 = and i64 %11, 4294967295 %13 = call i64 @FUNC(i64 %12) br label LBL_7 LBL_6: %14 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_4 to i64)) br label LBL_7 LBL_7: %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_9, label LBL_8 LBL_8: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_9 LBL_9: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8* %sv_0, { 1, 2, 0, 3 } uselistorder i32* %.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_negative_13-bad
CWE124_Buffer_Underwrite__CWE839_negative_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = ptrtoint i64* %sv_0 to i64 %1 = call i64 @FUNC(i64 40) %2 = load i32, i32* inttoptr (i64 8372 to i32*), align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false %5 = select i1 %4, i64 -4, i64 -20 %6 = add i64 %0, -48 %7 = add i64 %5, %6 %8 = inttoptr i64 %7 to i32* store i32 1, i32* %8, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_1 LBL_1: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %9 = mul i64 %indvars.iv.reload, 4 %10 = add i64 %9, %6 %11 = inttoptr i64 %10 to i32* %12 = load i32, i32* %11, align 4 %13 = zext i32 %12 to i64 %14 = call i64 @FUNC(i64 %13) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %1, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__unsigned_int_fscanf_sub_04-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 0, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i32 %3, -1 %6 = zext i32 %5 to i64 %7 = call i64 @FUNC(i64 %6) br label LBL_3 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 1, 2, 0 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__CWE170_char_loop_08-bad
CWE126_Buffer_Overread__CWE170_char_loop_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = ptrtoint i64* %sv_2 to i64 %5 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 149) store i64 0, i64* %indvars.iv.reg2mem br label LBL_2 LBL_2: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %6 = add i64 %indvars.iv.reload, %4 %7 = add i64 %6, -160 %8 = inttoptr i64 %7 to i8* %9 = load i8, i8* %8, align 1 %10 = add i64 %6, -272 %11 = inttoptr i64 %10 to i8* store i8 %9, i8* %11, align 1 %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 99 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_3, label LBL_2 LBL_3: %12 = call i64 @FUNC(i64* nonnull %sv_0) br label LBL_4 LBL_4: %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %0, %13 store i64 0, i64* %rax.0.reg2mem br i1 %14, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__fgets_memcpy_05-bad
CWE194_Unexpected_Sign_Extension__fgets_memcpy_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 store i32 0, i32* %sv_0.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: store i64 0, i64* %sv_2, align 8 %3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %4 = bitcast i64* %sv_2 to i8* %5 = call i8* @fgets(i8* nonnull %4, i32 8, %_IO_FILE* %3) %6 = icmp eq i8* %5, null br i1 %6, label LBL_3, label LBL_2 LBL_2: %7 = call i32 @atoi(i8* nonnull %4) %sext = mul i32 %7, 65536 %8 = ashr exact i32 %sext, 16 store i32 %8, i32* %sv_0.0.reg2mem br label LBL_4 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_2 to i64)) store i32 0, i32* %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem store i64 0, i64* %sv_2, align 8 %10 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %11 = trunc i32 %sv_0.0.reload to i16 %12 = icmp sgt i16 %11, 99 br i1 %12, label LBL_6, label LBL_5 LBL_5: %13 = ptrtoint i64* %sv_3 to i64 %14 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.0.reload) %15 = sext i32 %sv_0.0.reload to i64 %16 = add i64 %13, -112 %17 = add i64 %16, %15 %18 = inttoptr i64 %17 to i8* store i8 0, i8* %18, align 1 br label LBL_6 LBL_6: %19 = ptrtoint i64* %sv_2 to i64 %20 = call i64 @FUNC(i64 %19) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, label LBL_8, label LBL_7 LBL_7: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.0.reload, { 1, 2, 0 } uselistorder i64* %sv_2, { 2, 0, 3, 1, 4 } uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1, 3 } uselistorder i8 0, { 1, 2, 0 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__char_fscanf_multiply_10-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i8, align 1 %0 = call i64 @FUNC(i64 40) store i8 32, i8* %sv_0, align 1 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_5, label LBL_1 LBL_1: %3 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %4 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i8* nonnull %sv_0) %.pr = load i8, i8* %sv_0, align 1 %.pre = load i32, i32* @gv_0, align 4 %phitmp = icmp eq i32 %.pre, 0 %5 = icmp slt i8 %.pr, 1 %or.cond = or i1 %5, %phitmp br i1 %or.cond, label LBL_5, label LBL_2 LBL_2: %6 = icmp sgt i8 %.pr, 62 br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = mul i8 %.pr, 2 %8 = sext i8 %7 to i64 %9 = and i64 %8, 4294967294 %10 = call i64 @FUNC(i64 %9) br label LBL_5 LBL_4: %11 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_3 to i64)) br label LBL_5 LBL_5: %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i8 %.pr, { 0, 2, 1 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } uselistorder label LBL_5, { 1, 2, 3, 0 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__char_rand_add_12-bad
CWE190_Integer_Overflow__char_rand_add_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge4.reg2mem = alloca i32 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i32 2, i32* %storemerge4.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i32 @rand() %4 = urem i32 %3, 2 %5 = icmp eq i32 %4, 0 %6 = call i32 @rand() %7 = call i32 @rand() %8 = call i32 @rand() %9 = sext i1 %5 to i32 %storemerge = xor i32 %8, %9 %sext = mul i32 %storemerge, 16777216 %10 = ashr exact i32 %sext, 24 store i32 %10, i32* %storemerge4.reg2mem br label LBL_2 LBL_2: %storemerge4.reload = load i32, i32* %storemerge4.reg2mem %11 = call i64 @FUNC() %12 = trunc i64 %11 to i32 %13 = icmp eq i32 %12, 0 br i1 %13, label LBL_4, label LBL_3 LBL_3: %14 = mul i32 %storemerge4.reload, 16777216 %sext2 = add i32 %14, 16777216 %15 = ashr exact i32 %sext2, 24 %16 = zext i32 %15 to i64 %17 = call i64 @FUNC(i64 %16) store i64 %17, i64* %rax.0.reg2mem br label LBL_7 LBL_4: %18 = trunc i32 %storemerge4.reload to i8 %19 = icmp eq i8 %18, 127 br i1 %19, label LBL_6, label LBL_5 LBL_5: %20 = mul i32 %storemerge4.reload, 16777216 %sext3 = add i32 %20, 16777216 %21 = ashr exact i32 %sext3, 24 %22 = zext i32 %21 to i64 %23 = call i64 @FUNC(i64 %22) store i64 %23, i64* %rax.0.reg2mem br label LBL_7 LBL_6: %24 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) store i64 %24, i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %storemerge4.reload, { 2, 0, 1 } uselistorder i32* %storemerge4.reg2mem, { 0, 2, 1 } uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 } uselistorder i64 (i64)* @printHexCharLine, { 1, 0 } uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 } uselistorder label LBL_2, { 1, 0 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_fscanf_add_06-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) %3 = load i64, i64* %sv_0, align 8 %4 = icmp eq i64 %3, 9223372036854775807 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i64 %3, 1 %6 = call i64 @FUNC(i64 %5) br label LBL_3 LBL_2: %7 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_file_fprintf_12-bad
CWE134_Uncontrolled_Format_String__char_file_fprintf_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_6, label LBL_1 LBL_1: %5 = call i32 @strlen(i8* nonnull %1) %6 = sext i32 %5 to i64 %7 = sub nsw i64 100, %6 %8 = icmp ult i64 %7, 2 br i1 %8, label LBL_7, label LBL_2 LBL_2: %9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_1, i64 0, i64 0)) %10 = icmp eq %_IO_FILE* %9, null br i1 %10, label LBL_7, label LBL_3 LBL_3: %11 = sub i32 100, %5 %12 = ptrtoint i64* %sv_0 to i64 %13 = add i64 %6, %12 %14 = inttoptr i64 %13 to i8* %15 = call i8* @fgets(i8* %14, i32 %11, %_IO_FILE* nonnull %9) %16 = icmp eq i8* %15, null %17 = icmp eq i1 %16, false br i1 %17, label LBL_5, label LBL_4 LBL_4: %18 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %14, align 1 br label LBL_5 LBL_5: %19 = call i32 @fclose(%_IO_FILE* nonnull %9) br label LBL_7 LBL_6: %20 = ptrtoint i64* %sv_0 to i64 store i64 8247343692658534758, i64* %sv_0, align 8 %21 = add i64 %20, 8 %22 = inttoptr i64 %21 to i64* store i64 32777976880262761, i64* %22, align 8 br label LBL_7 LBL_7: %23 = call i64 @FUNC() %24 = trunc i64 %23 to i32 %25 = icmp eq i32 %24, 0 %26 = load %_IO_FILE*, %_IO_FILE** @gv_3, align 8 br i1 %25, label LBL_9, label LBL_8 LBL_8: %27 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %26, i8* nonnull %1) br label LBL_10 LBL_9: %28 = call i32 (%_IO_FILE*, i8*, ...) @fprintf(%_IO_FILE* %26, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_4, i64 0, i64 0), i64* nonnull %sv_0) br label LBL_10 LBL_10: %29 = call i64 @FUNC(i64 40) %30 = icmp eq i64 %0, %29 store i64 0, i64* %rax.0.reg2mem br i1 %30, label LBL_12, label LBL_11 LBL_11: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_12 LBL_12: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %26, { 1, 0 } uselistorder i64* %sv_0, { 2, 0, 1, 3, 4, 5 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fprintf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_3, { 1, 0 } uselistorder i8 0, { 1, 2, 0 } uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_declare_ncpy_14-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i8* %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %4 = bitcast i64* %sv_2 to i8* store i8 0, i8* %4, align 8 store i8* %4, i8** %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem %5 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %6 = bitcast i64* %sv_1 to i8* %7 = call i8* @strncpy(i8* %sv_0.0.reload, i8* nonnull %6, i32 99) %8 = ptrtoint i8* %sv_0.0.reload to i64 %9 = add i64 %8, 99 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 %11 = call i64 @FUNC(i64 %8) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload }
0
juliet-test-suite-c
CWE126_Buffer_Overread__CWE129_fgets_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = bitcast i64* %sv_0 to i8* %3 = call i8* @fgets(i8* nonnull %2, i32 14, %_IO_FILE* %1) %4 = icmp eq i8* %3, null br i1 %4, label LBL_1, label LBL_2 LBL_1: %5 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) br label LBL_4 LBL_2: %6 = call i32 @atoi(i8* nonnull %2) %7 = icmp ugt i32 %6, 9 br i1 %7, label LBL_4, label LBL_3 LBL_3: %8 = ptrtoint i64* %sv_1 to i64 %9 = sext i32 %6 to i64 %10 = mul i64 %9, 4 %11 = add i64 %8, -64 %12 = add i64 %11, %10 %13 = inttoptr i64 %12 to i32* %14 = load i32, i32* %13, align 4 %15 = zext i32 %14 to i64 %16 = call i64 @FUNC(i64 %15) br label LBL_5 LBL_4: %17 = call i64 @FUNC(i64 ptrtoint ([36 x i8]* @gv_2 to i64)) br label LBL_5 LBL_5: %18 = call i64 @FUNC(i64 40) %19 = icmp eq i64 %0, %18 store i64 0, i64* %rax.0.reg2mem br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %6, { 1, 0 } uselistorder i32 (i8*)* @atoi, { 1, 0, 2 } uselistorder i8* (i8*, i32, %_IO_FILE*)* @fgets, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE606_Unchecked_Loop_Condition__char_listen_socket_17-bad
CWE606_Unchecked_Loop_Condition__char_listen_socket_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.lcssa.reg2mem = alloca i64 %storemerge310.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_3, align 8 %1 = bitcast i64* %sv_3 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = call i32 @socket(i32 2, i32 1, i32 6) %4 = icmp eq i32 %3, -1 br i1 %4, label LBL_11, label LBL_1 LBL_1: %5 = bitcast i64* %sv_2 to %sockaddr* %6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %7 = call i16 @htons(i16 27015) %8 = call i32 @bind(i32 %3, %sockaddr* nonnull %5, i32 16) %9 = icmp eq i32 %8, -1 br i1 %9, label LBL_9, label LBL_2 LBL_2: %10 = call i32 @listen(i32 %3, i32 5) %11 = icmp eq i32 %10, -1 br i1 %11, label LBL_9, label LBL_3 LBL_3: %12 = call i32 @accept(i32 %3, %sockaddr* null, i32* null) %13 = icmp eq i32 %12, -1 br i1 %13, label LBL_9, label LBL_4 LBL_4: %14 = ptrtoint i64* %sv_3 to i64 %15 = sext i32 %2 to i64 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i64* %18 = sub i32 99, %2 %19 = call i32 @recv(i32 %12, i64* %17, i32 %18, i32 0) %20 = add i32 %19, 1 %21 = icmp ult i32 %20, 2 br i1 %21, label LBL_10, label LBL_5 LBL_5: %22 = sext i32 %19 to i64 %23 = add i64 %16, %22 %24 = inttoptr i64 %23 to i8* store i8 0, i8* %24, align 1 %25 = call i8* @strchr(i8* nonnull %1, i32 13) %26 = icmp eq i8* %25, null br i1 %26, label LBL_7, label LBL_6 LBL_6: store i8 0, i8* %25, align 1 br label LBL_7 LBL_7: %27 = call i8* @strchr(i8* nonnull %1, i32 10) %28 = icmp eq i8* %27, null br i1 %28, label LBL_10, label LBL_8 LBL_8: store i8 0, i8* %27, align 1 br label LBL_10 LBL_9: %29 = call i32 @close(i32 %3) br label LBL_11 LBL_10: %30 = call i32 @close(i32 %3) %31 = call i32 @close(i32 %12) br label LBL_11 LBL_11: %32 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_1) %33 = icmp eq i32 %32, 1 %34 = icmp eq i1 %33, false br i1 %34, label LBL_16, label LBL_12 LBL_12: %35 = load i64, i64* %sv_1, align 8 %36 = and i64 %35, 4294967295 %37 = icmp eq i64 %36, 0 store i32 0, i32* %storemerge310.reg2mem store i64 0, i64* %sv_0.0.lcssa.reg2mem br i1 %37, label LBL_15, label LBL_13 LBL_13: %storemerge310.reload = load i32, i32* %storemerge310.reg2mem %38 = add i32 %storemerge310.reload, 1 %39 = sext i32 %38 to i64 %40 = icmp sgt i64 %36, %39 store i32 %38, i32* %storemerge310.reg2mem br i1 %40, label LBL_13, label LBL_14 LBL_14: %phitmp = zext i32 %38 to i64 store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem br label LBL_15 LBL_15: %sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem %41 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload) br label LBL_16 LBL_16: %42 = call i64 @FUNC(i64 40) %43 = icmp eq i64 %0, %42 store i64 0, i64* %rax.0.reg2mem br i1 %43, label LBL_18, label LBL_17 LBL_17: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_18 LBL_18: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %38, { 1, 0, 2 } uselistorder i32 %19, { 1, 0 } uselistorder i32 %3, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_2, { 2, 1, 0 } uselistorder i32* %storemerge310.reg2mem, { 2, 0, 1 } uselistorder i32 (i32)* @close, { 2, 1, 0, 3 } uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 } uselistorder label LBL_16, { 1, 0 } uselistorder label LBL_13, { 1, 0 } uselistorder label LBL_11, { 2, 1, 0 } }
1
juliet-test-suite-c
CWE457_Use_of_Uninitialized_Variable__struct_pointer_08-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 8) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = bitcast i64* %4 to i32* store i32 5, i32* %7, align 4 %8 = ptrtoint i64* %4 to i64 %9 = add i64 %8, 4 %10 = inttoptr i64 %9 to i32* store i32 6, i32* %10, align 4 %11 = load i32, i32* %7, align 4 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) %14 = load i32, i32* %10, align 4 %15 = zext i32 %14 to i64 %16 = call i64 @FUNC(i64 %15) store i64 %16, i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE789_Uncontrolled_Mem_Alloc__malloc_char_rand_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8484 to i32*), align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false br i1 %2, label LBL_5, label LBL_1 LBL_1: %3 = call i32 @rand() %sv_0.0.off = add i32 %3, -6 %4 = icmp ult i32 %sv_0.0.off, 94 br i1 %4, label LBL_2, label LBL_5 LBL_2: %5 = call i64* @malloc(i32 %3) %6 = icmp eq i64* %5, null %7 = icmp eq i1 %6, false br i1 %7, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %8 = ptrtoint i64* %5 to i64 %9 = bitcast i64* %5 to i32* store i32 1819043176, i32* %9, align 4 %10 = add i64 %8, 4 %11 = inttoptr i64 %10 to i16* store i16 111, i16* %11, align 2 %12 = call i64 @FUNC(i64 %8) call void @free(i64* %5) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_5: %13 = call i64 @FUNC(i64 ptrtoint ([64 x i8]* @gv_0 to i64)) store i64 %13, i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %5, { 0, 1, 3, 2 } uselistorder i32 %3, { 1, 0 } uselistorder label LBL_5, { 1, 0 } }
0
juliet-test-suite-c
CWE126_Buffer_Overread__char_declare_loop_13-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @memset(i64* nonnull %sv_3, i32 65, i32 49) %2 = call i64* @memset(i64* nonnull %sv_2, i32 65, i32 99) %3 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %4 = icmp eq i32 %3, 5 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_3 LBL_2: %6 = ptrtoint i64* %sv_2 to i64 store i64 %6, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %7 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %8 = bitcast i64* %sv_1 to i8* %9 = call i32 @strlen(i8* nonnull %8) %10 = sext i32 %9 to i64 %11 = icmp eq i32 %9, 0 %.pre = ptrtoint i64* %sv_1 to i64 store i64 0, i64* %storemerge1.reg2mem br i1 %11, label LBL_5, label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %12 = add i64 %storemerge1.reload, %sv_0.0.reload %13 = inttoptr i64 %12 to i8* %14 = load i8, i8* %13, align 1 %15 = add i64 %storemerge1.reload, %.pre %16 = inttoptr i64 %15 to i8* store i8 %14, i8* %16, align 1 %17 = add nuw i64 %storemerge1.reload, 1 %18 = icmp ult i64 %17, %10 store i64 %17, i64* %storemerge1.reg2mem br i1 %18, label LBL_4, label LBL_5 LBL_5: %19 = call i64 @FUNC(i64 %.pre) %20 = call i64 @FUNC(i64 40) %21 = icmp eq i64 %0, %20 store i64 0, i64* %rax.0.reg2mem br i1 %21, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %storemerge1.reload, { 0, 2, 1 } uselistorder i64 %.pre, { 1, 0 } uselistorder i64* %sv_2, { 1, 0 } uselistorder i64* %storemerge1.reg2mem, { 2, 0, 1 } uselistorder label LBL_4, { 1, 0 } }
0
juliet-test-suite-c
CWE78_OS_Command_Injection__char_console_execlp_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_0, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = bitcast i64* %sv_0 to i8* %5 = call i32 @strlen(i8* nonnull %4) %6 = sext i32 %5 to i64 %7 = ptrtoint i64* %sv_0 to i64 %8 = add i64 %6, %7 %9 = inttoptr i64 %8 to i32* store i32 2764330, i32* %9, align 4 br label LBL_2 LBL_2: %10 = call i32 (i8*, i8*, ...) @execlp(i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0)) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 (i8*, i8*, ...)* @execlp, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i32* @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE690_NULL_Deref_From_Return__int_calloc_09-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64* @calloc(i32 1, i32 4) %1 = icmp eq i64* %0, null store i64 1, i64* %rax.0.reg2mem br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = bitcast i64* %0 to i32* store i32 5, i32* %2, align 4 %3 = call i64 @FUNC(i64 5) call void @free(i64* nonnull %0) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
0
juliet-test-suite-c
CWE401_Memory_Leak__char_calloc_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = ptrtoint i64* %sv_0 to i64 %5 = add i64 %4, -97 %6 = and i64 %5, -16 store i64 %6, i64* %sv_0, align 8 %7 = inttoptr i64 %6 to i64* store i64 7453010373643542593, i64* %7, align 16 %8 = or i64 %6, 8 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 8 %10 = load i64, i64* %sv_0, align 8 %11 = call i64 @FUNC(i64 %10) br label LBL_2 LBL_2: %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 0, 1, 3, 2 } uselistorder i32* @gv_0, { 4, 3, 0, 2, 1 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__CWE839_fgets_17-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %indvars.iv.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_0 to i64 %2 = add i64 %1, -48 %3 = add i64 %1, -20 %4 = inttoptr i64 %3 to i32* store i32 1, i32* %4, align 4 store i64 0, i64* %indvars.iv.reg2mem br label LBL_1 LBL_1: %indvars.iv.reload = load i64, i64* %indvars.iv.reg2mem %5 = mul i64 %indvars.iv.reload, 4 %6 = add i64 %2, %5 %7 = inttoptr i64 %6 to i32* %8 = load i32, i32* %7, align 4 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) %indvars.iv.next = add nuw nsw i64 %indvars.iv.reload, 1 %exitcond = icmp eq i64 %indvars.iv.next, 10 store i64 %indvars.iv.next, i64* %indvars.iv.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %indvars.iv.reg2mem, { 1, 0, 2 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } }
0
juliet-test-suite-c
CWE197_Numeric_Truncation_Error__short_fgets_17-bad
CWE197_Numeric_Truncation_Error__short_fgets_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = bitcast i64* %sv_1 to i8* store i64 0, i64* %sv_1, align 8 %2 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %3 = call i8* @fgets(i8* nonnull %1, i32 8, %_IO_FILE* %2) %4 = icmp eq i8* %3, null br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = call i32 @atoi(i8* nonnull %1) %phitmp = mul i32 %5, 16777216 %phitmp5 = ashr exact i32 %phitmp, 24 %phitmp6 = zext i32 %phitmp5 to i64 store i64 %phitmp6, i64* %sv_0.0.reg2mem br label LBL_3 LBL_2: %6 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i64 4294967295, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %7 = call i64 @FUNC(i64 %sv_0.0.reload) %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_1, { 1, 0 } uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder label LBL_3, { 1, 0 } }
1
juliet-test-suite-c
CWE127_Buffer_Underread__char_alloca_ncpy_12-bad
CWE127_Buffer_Underread__char_alloca_ncpy_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i8*, align 8 %sv_2 = alloca i8*, align 8 %0 = ptrtoint i8** %sv_2 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -97 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i8* store i8* %4, i8** %sv_1, align 8 %5 = inttoptr i64 %3 to i64* %6 = call i64* @memset(i64* %5, i32 65, i32 99) %7 = add i64 %3, 99 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 %9 = call i64 @FUNC() %10 = trunc i64 %9 to i32 %11 = icmp eq i32 %10, 0 br i1 %11, label LBL_2, label LBL_1 LBL_1: %12 = load i8*, i8** %sv_1, align 8 %13 = ptrtoint i8* %12 to i64 %14 = add i64 %13, -8 %15 = inttoptr i64 %14 to i8* store i8* %15, i8** %sv_2, align 8 br label LBL_3 LBL_2: %16 = load i8*, i8** %sv_1, align 8 %17 = ptrtoint i8* %16 to i64 %18 = bitcast i8** %sv_2 to i64* store i64 %17, i64* %18, align 8 br label LBL_3 LBL_3: %19 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %20 = bitcast i64* %sv_0 to i8* %21 = call i32 @strlen(i8* nonnull %20) %22 = load i8*, i8** %sv_2, align 8 %23 = call i8* @strncpy(i8* nonnull %20, i8* %22, i32 %21) %24 = call i64 @FUNC(i64* nonnull %sv_0) %25 = call i64 @FUNC(i64 40) %26 = icmp eq i64 %1, %25 store i64 0, i64* %rax.0.reg2mem br i1 %26, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %3, { 1, 0, 2 } uselistorder i8** %sv_2, { 3, 0, 2, 1 } uselistorder i8** %sv_1, { 0, 2, 1 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE563_Unused_Variable__unused_init_variable_int64_t_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8360 to i32*), align 8 %1 = icmp eq i32 %0, 5 br i1 %1, label LBL_2, label LBL_1 LBL_1: %2 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) store i64 %2, i64* %storemerge.reg2mem br label LBL_3 LBL_2: %3 = call i64 @FUNC(i64 5) store i64 %3, i64* %storemerge.reg2mem br label LBL_3 LBL_3: %storemerge.reload = load i64, i64* %storemerge.reg2mem ret i64 %storemerge.reload uselistorder i64* %storemerge.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE617_Reachable_Assertion__zero_04-bad
CWE617_Reachable_Assertion__zero_04_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: call void @__assert_fail(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_0, i64 0, i64 0), i8* getelementptr inbounds ([126 x i8], [126 x i8]* @gv_1, i64 0, i64 0), i32 33, i8* getelementptr inbounds ([40 x i8], [40 x i8]* @gv_2, i64 0, i64 0)) ret i64 ptrtoint (i32* @1 to i64) }
1
juliet-test-suite-c
CWE127_Buffer_Underread__char_alloca_ncpy_07-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i8*, align 8 %sv_2 = alloca i8*, align 8 %0 = ptrtoint i8** %sv_2 to i64 %1 = call i64 @FUNC(i64 40) %2 = add i64 %0, -97 %3 = and i64 %2, -16 %4 = inttoptr i64 %3 to i8* store i8* %4, i8** %sv_1, align 8 %5 = inttoptr i64 %3 to i64* %6 = call i64* @memset(i64* %5, i32 65, i32 99) %7 = add i64 %3, 99 %8 = inttoptr i64 %7 to i8* store i8 0, i8* %8, align 1 %9 = load i32, i32* @gv_0, align 4 %10 = icmp eq i32 %9, 5 %11 = icmp eq i1 %10, false br i1 %11, label LBL_2, label LBL_1 LBL_1: %12 = load i8*, i8** %sv_1, align 8 %13 = ptrtoint i8* %12 to i64 %14 = bitcast i8** %sv_2 to i64* store i64 %13, i64* %14, align 8 br label LBL_2 LBL_2: %15 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %16 = bitcast i64* %sv_0 to i8* %17 = call i32 @strlen(i8* nonnull %16) %18 = load i8*, i8** %sv_2, align 8 %19 = call i8* @strncpy(i8* nonnull %16, i8* %18, i32 %17) %20 = ptrtoint i64* %sv_0 to i64 %21 = call i64 @FUNC(i64 %20) %22 = call i64 @FUNC(i64 40) %23 = icmp eq i64 %1, %22 store i64 0, i64* %rax.0.reg2mem br i1 %23, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %3, { 1, 0, 2 } uselistorder i8** %sv_2, { 2, 0, 1 } uselistorder i64* %sv_0, { 2, 0, 1 } uselistorder i8* (i8*, i8*, i32)* @strncpy, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder i32* @gv_0, { 1, 0 } uselistorder i64* (i64*, i32, i32)* @memset, { 3, 2, 1, 0, 4 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int_alloca_memcpy_05-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = alloca i64 %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %1 = load i64, i64* %0 %sv_1 = alloca i64, align 8 %2 = ptrtoint i64* %sv_1 to i64 %3 = call i64 @FUNC(i64 40) %4 = load i32, i32* @gv_0, align 4 %5 = icmp eq i32 %4, 0 %6 = add i64 %2, -609 %7 = and i64 %6, -16 %sv_2.0 = select i1 %5, i64 %1, i64 %7 %8 = bitcast i64* %sv_0 to i8* call void @FUNC(i8* nonnull %8, i64 0, i64 50) %9 = inttoptr i64 %sv_2.0 to i64* %10 = call i64* @memcpy(i64* %9, i64* nonnull %sv_0, i32 400) %11 = inttoptr i64 %sv_2.0 to i32* %12 = load i32, i32* %11, align 4 %13 = zext i32 %12 to i64 %14 = call i64 @FUNC(i64 %13) %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %3, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_2, label LBL_1 LBL_1: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64* (i64*, i64*, i32)* @memcpy, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE773_Missing_Reference_to_Active_File_Descriptor_or_Handle__open_14-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([19 x i8], [19 x i8]* @gv_0, i64 0, i64 0), i32 66) %1 = load i32, i32* @gv_1, align 4 %2 = zext i32 %1 to i64 %3 = icmp eq i32 %1, 5 %4 = icmp eq i1 %3, false store i64 %2, i64* %rax.0.reg2mem br i1 %4, label LBL_5, label LBL_1 LBL_1: %5 = icmp eq i32 %0, -1 br i1 %5, label LBL_3, label LBL_2 LBL_2: %6 = call i32 @close(i32 %0) br label LBL_3 LBL_3: %7 = call i32 (i8*, i32, ...) @open(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @gv_2, i64 0, i64 0), i32 66) %8 = icmp eq i32 %7, -1 store i64 -1, i64* %rax.0.reg2mem br i1 %8, label LBL_5, label LBL_4 LBL_4: %9 = call i32 @close(i32 %7) %10 = sext i32 %9 to i64 store i64 %10, i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %0, { 1, 0 } uselistorder i32 (i32)* @close, { 2, 0, 1, 3, 4 } uselistorder i32 (i8*, i32, ...)* @open, { 3, 2, 0, 1, 4 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__fgets_fwrite_11-bad
CWE400_Resource_Exhaustion__fgets_fwrite_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 -1, i64* %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: store i64 0, i64* %sv_1, align 8 %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i8* @fgets(i8* nonnull %5, i32 14, %_IO_FILE* %4) %7 = icmp eq i8* %6, null br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i32 @atoi(i8* nonnull %5) %phitmp = sext i32 %8 to i64 store i64 %phitmp, i64* %sv_0.0.reg2mem br label LBL_4 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i64 -1, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %10 = call i64 @FUNC() %11 = trunc i64 %10 to i32 %12 = icmp eq i32 %11, 0 br i1 %12, label LBL_12, label LBL_5 LBL_5: %13 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0)) %14 = icmp eq %_IO_FILE* %13, null %15 = icmp eq i1 %14, false br i1 %15, label LBL_6, label LBL_7 LBL_6: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %16 = icmp eq i64 %sv_0.0.reload, 0 store i64 0, i64* %storemerge2.reg2mem br i1 %16, label LBL_11, label LBL_8 LBL_7: call void @exit(i32 1) unreachable LBL_8: %17 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_4 to i64*), i32 1, i32 50, %_IO_FILE* %13) %18 = icmp eq i32 %17, 50 br i1 %18, label LBL_10, label LBL_9 LBL_9: call void @exit(i32 1) unreachable LBL_10: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %19 = add nuw i64 %storemerge2.reload, 1 %20 = icmp ult i64 %19, %sv_0.0.reload store i64 %19, i64* %storemerge2.reg2mem br i1 %20, label LBL_8, label LBL_11 LBL_11: %21 = call i32 @fclose(%_IO_FILE* nonnull %13) br label LBL_12 LBL_12: %22 = call i64 @FUNC(i64 40) %23 = icmp eq i64 %0, %22 store i64 0, i64* %rax.0.reg2mem br i1 %23, label LBL_14, label LBL_13 LBL_13: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_14 LBL_14: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %13, { 1, 0, 2 } uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1, 3 } uselistorder i64* %storemerge2.reg2mem, { 2, 0, 1 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } uselistorder label LBL_8, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_loop_11-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 ptrtoint (i32* @gv_0 to i32)) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %8 = ptrtoint i64* %sv_2 to i64 %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %9 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %9, i64 0, i64 100) %10 = add i64 %8, -816 store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = mul i64 %storemerge1.reload, 8 %12 = add i64 %11, %sv_0.0.reload %13 = add i64 %10, %11 %14 = inttoptr i64 %13 to i64* %15 = load i64, i64* %14, align 8 %16 = inttoptr i64 %12 to i64* store i64 %15, i64* %16, align 8 %17 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %17, 100 store i64 %17, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %18 = inttoptr i64 %sv_0.0.reload to i64* %19 = load i64, i64* %18, align 8 %20 = call i64 @FUNC(i64 %19) call void @free(i64* %18) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder void (i64*)* @free, { 1, 0, 2 } uselistorder i64 (i64)* @printLongLongLine, { 1, 0 } uselistorder i64 100, { 0, 2, 1, 3 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i64* (i32)* @malloc, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE78_OS_Command_Injection__char_console_popen_05-bad
CWE78_OS_Command_Injection__char_console_popen_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_7, label LBL_1 LBL_1: %4 = call i32 @strlen(i8* nonnull %1) %5 = sext i32 %4 to i64 %6 = sub nsw i64 100, %5 %7 = icmp ult i64 %6, 2 br i1 %7, label LBL_7, label LBL_2 LBL_2: %8 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %9 = sub i32 100, %4 %10 = ptrtoint i64* %sv_0 to i64 %11 = add i64 %5, %10 %12 = inttoptr i64 %11 to i8* %13 = call i8* @fgets(i8* %12, i32 %9, %_IO_FILE* %8) %14 = icmp eq i8* %13, null br i1 %14, label LBL_6, label LBL_3 LBL_3: %15 = call i32 @strlen(i8* nonnull %1) %16 = icmp eq i32 %15, 0 br i1 %16, label LBL_7, label LBL_4 LBL_4: %17 = sext i32 %15 to i64 %18 = add i64 %10, -1 %19 = add i64 %18, %17 %20 = inttoptr i64 %19 to i8* %21 = load i8, i8* %20, align 1 %22 = icmp eq i8 %21, 10 %23 = icmp eq i1 %22, false br i1 %23, label LBL_7, label LBL_5 LBL_5: store i8 0, i8* %20, align 1 br label LBL_7 LBL_6: %24 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %12, align 1 br label LBL_7 LBL_7: %25 = call %_IO_FILE* @popen(i8* nonnull %1, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_3, i64 0, i64 0)) %26 = icmp eq %_IO_FILE* %25, null br i1 %26, label LBL_9, label LBL_8 LBL_8: %27 = call i32 @pclose(%_IO_FILE* nonnull %25) br label LBL_9 LBL_9: %28 = call i64 @FUNC(i64 40) %29 = icmp eq i64 %0, %28 store i64 0, i64* %rax.0.reg2mem br i1 %29, label LBL_11, label LBL_10 LBL_10: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_11 LBL_11: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %10, { 1, 0 } uselistorder i8* %1, { 1, 0, 2 } uselistorder i8 0, { 1, 2, 3, 0 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE190_Integer_Overflow__char_rand_square_06-bad
CWE190_Integer_Overflow__char_rand_square_06_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i32 @rand() %1 = urem i32 %0, 2 %2 = icmp eq i32 %1, 0 %3 = call i32 @rand() %4 = call i32 @rand() %5 = call i32 @rand() %6 = sext i1 %2 to i32 %storemerge = xor i32 %5, %6 %7 = urem i32 %storemerge, 256 %narrow = mul i32 %storemerge, 16777216 %sext2 = mul i32 %narrow, %7 %8 = ashr exact i32 %sext2, 24 %9 = zext i32 %8 to i64 %10 = call i64 @FUNC(i64 %9) ret i64 %10 }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_13-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_loop_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 50) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = ptrtoint i64* %4 to i64 %8 = bitcast i64* %4 to i8* store i8 0, i8* %8, align 1 store i64 %7, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %9 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %10 = ptrtoint i64* %sv_1 to i64 store i64 0, i64* %storemerge1.reg2mem br label LBL_5 LBL_5: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = add i64 %storemerge1.reload, %sv_0.0.reload %12 = add i64 %storemerge1.reload, %10 %13 = inttoptr i64 %12 to i8* %14 = load i8, i8* %13, align 1 %15 = inttoptr i64 %11 to i8* store i8 %14, i8* %15, align 1 %16 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %16, 100 store i64 %16, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_6, label LBL_5 LBL_6: %17 = add i64 %sv_0.0.reload, 99 %18 = inttoptr i64 %17 to i8* store i8 0, i8* %18, align 1 %19 = call i64 @FUNC(i64 %sv_0.0.reload) %20 = inttoptr i64 %sv_0.0.reload to i64* call void @free(i64* %20) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, label LBL_8, label LBL_7 LBL_7: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %storemerge1.reload, { 0, 2, 1 } uselistorder i64 %sv_0.0.reload, { 1, 2, 0, 3 } uselistorder i64* %4, { 0, 2, 1 } uselistorder i64* %sv_1, { 1, 0 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE197_Numeric_Truncation_Error__short_fgets_08-bad
CWE197_Numeric_Truncation_Error__short_fgets_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i64 4294967295, i64* %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: store i64 0, i64* %sv_1, align 8 %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = bitcast i64* %sv_1 to i8* %6 = call i8* @fgets(i8* nonnull %5, i32 8, %_IO_FILE* %4) %7 = icmp eq i8* %6, null br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = call i32 @atoi(i8* nonnull %5) %phitmp = mul i32 %8, 16777216 %phitmp3 = ashr exact i32 %phitmp, 24 %phitmp4 = zext i32 %phitmp3 to i64 store i64 %phitmp4, i64* %sv_0.0.reg2mem br label LBL_4 LBL_3: %9 = call i64 @FUNC(i64 ptrtoint ([16 x i8]* @gv_1 to i64)) store i64 4294967295, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %10 = call i64 @FUNC(i64 %sv_0.0.reload) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0.0.reg2mem, { 0, 2, 1, 3 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_loop_13-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_int64_t_loop_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 0, i64* %sv_0.0.reg2mem br i1 %3, label LBL_3, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 400) %5 = ptrtoint i64* %4 to i64 %6 = icmp eq i64* %4, null %7 = icmp eq i1 %6, false store i64 %5, i64* %sv_0.0.reg2mem br i1 %7, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %8 = ptrtoint i64* %sv_2 to i64 %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %9 = bitcast i64* %sv_1 to i8* call void @FUNC(i8* nonnull %9, i64 0, i64 100) %10 = add i64 %8, -816 store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %11 = mul i64 %storemerge1.reload, 8 %12 = add i64 %11, %sv_0.0.reload %13 = add i64 %10, %11 %14 = inttoptr i64 %13 to i64* %15 = load i64, i64* %14, align 8 %16 = inttoptr i64 %12 to i64* store i64 %15, i64* %16, align 8 %17 = add nuw nsw i64 %storemerge1.reload, 1 %exitcond = icmp eq i64 %17, 100 store i64 %17, i64* %storemerge1.reg2mem br i1 %exitcond, label LBL_5, label LBL_4 LBL_5: %18 = inttoptr i64 %sv_0.0.reload to i64* %19 = load i64, i64* %18, align 8 %20 = call i64 @FUNC(i64 %19) call void @free(i64* %18) %21 = call i64 @FUNC(i64 40) %22 = icmp eq i64 %0, %21 store i64 0, i64* %rax.0.reg2mem br i1 %22, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE377_Insecure_Temporary_File__char_tempnam_03-bad
CWE377_Insecure_Temporary_File__char_tempnam_03_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i8* @tempnam(i8* null, i8* null) %1 = icmp eq i8* %0, null %2 = icmp eq i1 %1, false br i1 %2, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 1) unreachable LBL_2: %3 = ptrtoint i8* %0 to i64 %4 = call i64 @FUNC(i64 %3) %5 = call i32 (i8*, i32, ...) @open(i8* %0, i32 66) %6 = icmp eq i32 %5, -1 br i1 %6, label LBL_4, label LBL_3 LBL_3: %7 = call i64 @FUNC(i64 ptrtoint ([45 x i8]* @gv_0 to i64)) %8 = call i32 @close(i32 %5) br label LBL_4 LBL_4: %9 = bitcast i8* %0 to i64* call void @free(i64* %9) ret i64 ptrtoint (i32* @1 to i64) uselistorder i8* %0, { 0, 2, 1, 3 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_char_alloca_memmove_07-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) br label LBL_3 LBL_2: %4 = ptrtoint i64* %sv_2 to i64 %5 = add i64 %4, -161 %6 = and i64 %5, -16 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 16 store i64 %6, i64* %sv_0.0.reg2mem br label LBL_3 LBL_3: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %9 = inttoptr i64 %sv_0.0.reload to i64* %10 = call i64* @memmove(i64* %9, i64* nonnull %sv_1, i32 100) %11 = add i64 %sv_0.0.reload, 99 %12 = inttoptr i64 %11 to i8* store i8 0, i8* %12, align 1 %13 = call i64 @FUNC(i64 %sv_0.0.reload) %14 = call i64 @FUNC(i64 40) %15 = icmp eq i64 %0, %14 store i64 0, i64* %rax.0.reg2mem br i1 %15, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %sv_0.0.reload, { 2, 0, 1 } }
0
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_console_printf_04-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = bitcast i64* %sv_0 to i8* %2 = call i32 @strlen(i8* nonnull %1) %3 = sext i32 %2 to i64 %4 = sub nsw i64 100, %3 %5 = icmp ult i64 %4, 2 br i1 %5, label LBL_6, label LBL_1 LBL_1: %6 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %7 = sub i32 100, %2 %8 = ptrtoint i64* %sv_0 to i64 %9 = add i64 %3, %8 %10 = inttoptr i64 %9 to i8* %11 = call i8* @fgets(i8* %10, i32 %7, %_IO_FILE* %6) %12 = icmp eq i8* %11, null br i1 %12, label LBL_5, label LBL_2 LBL_2: %13 = call i32 @strlen(i8* nonnull %1) %14 = icmp eq i32 %13, 0 br i1 %14, label LBL_6, label LBL_3 LBL_3: %15 = sext i32 %13 to i64 %16 = add i64 %8, -1 %17 = add i64 %16, %15 %18 = inttoptr i64 %17 to i8* %19 = load i8, i8* %18, align 1 %20 = icmp eq i8 %19, 10 %21 = icmp eq i1 %20, false br i1 %21, label LBL_6, label LBL_4 LBL_4: store i8 0, i8* %18, align 1 br label LBL_6 LBL_5: %22 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_1 to i64)) store i8 0, i8* %10, align 1 br label LBL_6 LBL_6: %23 = call i32 @puts(i8* nonnull %1) %24 = call i64 @FUNC(i64 40) %25 = icmp eq i64 %0, %24 store i64 0, i64* %rax.0.reg2mem br i1 %25, label LBL_8, label LBL_7 LBL_7: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %8, { 1, 0 } uselistorder i8* %1, { 1, 0, 2 } uselistorder label LBL_6, { 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_04-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = bitcast i64* %1 to i8* store i8 0, i8* %4, align 1 %5 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %6 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %4, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_0) %7 = ptrtoint i64* %1 to i64 %8 = call i64 @FUNC(i64 %7) call void @free(i64* %1) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 0, 1, 3, 2 } }
0
juliet-test-suite-c
CWE415_Double_Free__malloc_free_int_13-bad
CWE415_Double_Free__malloc_free_int_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %sv_0.0.reg2mem = alloca i64* %0 = load i32, i32* inttoptr (i64 8336 to i32*), align 16 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i64* null, i64** %sv_0.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 400) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: call void @free(i64* %3) store i64* %3, i64** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem call void @free(i64* %sv_0.0.reload) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* null, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__CWE135_17-bad
CWE122_Heap_Based_Buffer_Overflow__CWE135_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i64* @malloc(i32 200) %1 = icmp eq i64* %0, null %2 = icmp eq i1 %1, false br i1 %2, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %3 = bitcast i64* %0 to i32* %4 = call i32* @wmemset(i32* %3, i32 65, i32 49) %5 = ptrtoint i64* %0 to i64 %6 = add i64 %5, 196 %7 = inttoptr i64 %6 to i32* store i32 0, i32* %7, align 4 %8 = bitcast i64* %0 to i8* %9 = call i32 @strlen(i8* %8) %10 = add i32 %9, 1 %11 = call i64* @calloc(i32 %10, i32 4) %12 = icmp eq i64* %11, null %13 = icmp eq i1 %12, false br i1 %13, label LBL_4, label LBL_3 LBL_3: call void @exit(i32 -1) unreachable LBL_4: %14 = bitcast i64* %11 to i32* %15 = call i32* @wcscpy(i32* %14, i32* %3) %16 = ptrtoint i64* %11 to i64 %17 = call i64 @FUNC(i64 %16) call void @free(i64* %11) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %11, { 1, 0, 3, 2 } uselistorder i64* %0, { 0, 1, 3, 2 } uselistorder void (i32)* @exit, { 1, 0, 2 } uselistorder i32 -1, { 1, 0 } uselistorder i64* null, { 1, 0 } }
1
juliet-test-suite-c
CWE400_Resource_Exhaustion__rand_for_loop_12-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge111.reg2mem = alloca i64 %storemerge12.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = call i32 @rand() %2 = urem i32 %1, 2 %3 = icmp eq i32 %2, 0 %4 = call i32 @rand() %5 = mul i32 %4, 1073741824 %6 = call i32 @rand() %7 = mul i32 %6, 32768 %8 = xor i32 %7, %5 %9 = call i32 @rand() %10 = xor i32 %8, %9 %11 = sext i1 %3 to i32 %storemerge4.in = xor i32 %10, %11 %12 = call i64 @FUNC() %13 = trunc i64 %12 to i32 %14 = icmp eq i32 %13, 0 %storemerge4.in.off = add i32 %storemerge4.in, -1 %15 = icmp ugt i32 %storemerge4.in.off, 19 br i1 %14, label LBL_4, label LBL_1 LBL_1: store i64 %12, i64* %rax.0.reg2mem br i1 %15, label LBL_7, label LBL_2 LBL_2: %16 = sext i32 %storemerge4.in to i64 store i64 0, i64* %storemerge12.reg2mem br label LBL_3 LBL_3: %storemerge12.reload = load i64, i64* %storemerge12.reg2mem %17 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_0 to i64)) %18 = add nuw i64 %storemerge12.reload, 1 %19 = icmp ult i64 %18, %16 store i64 %18, i64* %storemerge12.reg2mem store i64 %16, i64* %rax.0.reg2mem br i1 %19, label LBL_3, label LBL_7 LBL_4: store i64 %12, i64* %rax.0.reg2mem br i1 %15, label LBL_7, label LBL_5 LBL_5: %20 = sext i32 %storemerge4.in to i64 store i64 0, i64* %storemerge111.reg2mem br label LBL_6 LBL_6: %storemerge111.reload = load i64, i64* %storemerge111.reg2mem %21 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_0 to i64)) %22 = add nuw i64 %storemerge111.reload, 1 %23 = icmp ult i64 %22, %20 store i64 %22, i64* %storemerge111.reg2mem store i64 %20, i64* %rax.0.reg2mem br i1 %23, label LBL_6, label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i1 %15, { 1, 0 } uselistorder i64 %12, { 1, 0, 2 } uselistorder i32 %storemerge4.in, { 1, 2, 0 } uselistorder i64* %storemerge12.reg2mem, { 1, 0, 2 } uselistorder i64* %storemerge111.reg2mem, { 1, 0, 2 } uselistorder i64* %rax.0.reg2mem, { 0, 2, 4, 1, 3 } uselistorder label LBL_7, { 1, 2, 0, 3 } uselistorder label LBL_6, { 1, 0 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__char_rand_postdec_17-good
goodB2G
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge2.reg2mem = alloca i64 %0 = call i32 @rand() %1 = call i32 @rand() %2 = call i32 @rand() %3 = call i32 @rand() %4 = urem i32 %0, 2 %5 = icmp eq i32 %4, 0 %6 = sext i1 %5 to i32 %storemerge4.le = xor i32 %3, %6 %7 = trunc i32 %storemerge4.le to i8 %8 = icmp eq i8 %7, -128 br i1 %8, label LBL_2, label LBL_1 LBL_1: %9 = add i8 %7, -1 %10 = sext i8 %9 to i64 %11 = and i64 %10, 4294967295 %12 = call i64 @FUNC(i64 %11) store i64 %12, i64* %storemerge2.reg2mem br label LBL_3 LBL_2: %13 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_0 to i64)) store i64 %13, i64* %storemerge2.reg2mem br label LBL_3 LBL_3: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem ret i64 %storemerge2.reload uselistorder i64* %storemerge2.reg2mem, { 0, 2, 1 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE400_Resource_Exhaustion__fscanf_sleep_15-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i32 @usleep(i32 20) %1 = call i64 @FUNC(i64 ptrtoint ([29 x i8]* @gv_0 to i64)) ret i64 %1 uselistorder i32 (i32)* @usleep, { 0, 2, 1, 3, 4 } }
0
juliet-test-suite-c
CWE617_Reachable_Assertion__fscanf_16-bad
CWE617_Reachable_Assertion__fscanf_16_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %4 = icmp sgt i32 %3, 5 br i1 %4, label LBL_2, label LBL_1 LBL_1: call void @__assert_fail(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @gv_2, i64 0, i64 0), i8* getelementptr inbounds ([128 x i8], [128 x i8]* @gv_3, i64 0, i64 0), i32 37, i8* getelementptr inbounds ([42 x i8], [42 x i8]* @gv_4, i64 0, i64 0)) br label LBL_2 LBL_2: %5 = call i64 @FUNC(i64 40) %6 = icmp eq i64 %0, %5 store i64 0, i64* %rax.0.reg2mem br i1 %6, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE400_Resource_Exhaustion__rand_for_loop_13-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge4.reg2mem = alloca i64 %0 = load i32, i32* inttoptr (i64 8368 to i32*), align 16 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i64 5, i64* %rax.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i32 @rand() %4 = urem i32 %3, 2 %5 = icmp eq i32 %4, 0 %6 = call i32 @rand() %7 = mul i32 %6, 1073741824 %8 = call i32 @rand() %9 = mul i32 %8, 32768 %10 = xor i32 %9, %7 %11 = call i32 @rand() %12 = xor i32 %10, %11 %13 = sext i1 %5 to i32 %storemerge1.in = xor i32 %12, %13 %sv_0.0.off = add i32 %storemerge1.in, -1 %14 = icmp ugt i32 %sv_0.0.off, 19 store i64 5, i64* %rax.0.reg2mem br i1 %14, label LBL_4, label LBL_2 LBL_2: %15 = sext i32 %storemerge1.in to i64 store i64 0, i64* %storemerge4.reg2mem br label LBL_3 LBL_3: %storemerge4.reload = load i64, i64* %storemerge4.reg2mem %16 = call i64 @FUNC(i64 ptrtoint ([6 x i8]* @gv_0 to i64)) %17 = add nuw i64 %storemerge4.reload, 1 %18 = icmp ult i64 %17, %15 store i64 %17, i64* %storemerge4.reg2mem store i64 %15, i64* %rax.0.reg2mem br i1 %18, label LBL_3, label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %storemerge1.in, { 1, 0 } uselistorder i64* %storemerge4.reg2mem, { 1, 0, 2 } uselistorder i64* %rax.0.reg2mem, { 0, 1, 3, 2 } uselistorder label LBL_4, { 0, 2, 1 } uselistorder label LBL_3, { 1, 0 } }
0
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__CWE135_11-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i8* %sv_0 = alloca i8*, align 8 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i8* null, i8** %.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 50) %4 = bitcast i64* %3 to i8* store i8* %4, i8** %sv_0, align 8 %5 = icmp eq i64* %3, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = call i64* @memset(i64* %3, i32 65, i32 49) %8 = ptrtoint i64* %3 to i64 %9 = add i64 %8, 49 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 %11 = load i8*, i8** %sv_0, align 8 store i8* %11, i8** %.reg2mem br label LBL_4 LBL_4: %12 = call i64 @FUNC() %13 = trunc i64 %12 to i32 %14 = icmp eq i32 %13, 0 store i64 %12, i64* %rax.0.reg2mem br i1 %14, label LBL_8, label LBL_5 LBL_5: %.reload = load i8*, i8** %.reg2mem %15 = call i32 @strlen(i8* %.reload) %16 = add i32 %15, 1 %17 = call i64* @calloc(i32 %16, i32 1) %18 = icmp eq i64* %17, null %19 = icmp eq i1 %18, false br i1 %19, label LBL_7, label LBL_6 LBL_6: call void @exit(i32 -1) unreachable LBL_7: %20 = bitcast i64* %17 to i8* %21 = call i8* @strcpy(i8* %20, i8* %.reload) %22 = ptrtoint i64* %17 to i64 %23 = call i64 @FUNC(i64 %22) call void @free(i64* %17) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %17, { 1, 0, 3, 2 } uselistorder i8** %.reg2mem, { 0, 2, 1 } uselistorder void (i64*)* @free, { 3, 2, 1, 0, 4 } uselistorder i64* (i32, i32)* @calloc, { 0, 1, 3, 2, 4 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder void (i32)* @exit, { 7, 6, 5, 4, 3, 2, 1, 0, 8 } uselistorder i32 -1, { 0, 1, 3, 2, 4, 5, 6, 7 } uselistorder i64* null, { 0, 1, 3, 2, 4, 5, 6, 7 } uselistorder i64* (i32)* @malloc, { 3, 0, 1, 2, 4 } uselistorder i64 ()* @globalReturnsTrue, { 5, 4, 3, 2, 1, 0 } }
0
juliet-test-suite-c
CWE124_Buffer_Underwrite__malloc_char_memmove_06-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 100) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = ptrtoint i64* %1 to i64 %5 = call i64* @memset(i64* %1, i32 65, i32 99) %6 = add i64 %4, 99 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 %8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %9 = call i64* @memmove(i64* %1, i64* nonnull %sv_0, i32 100) store i8 0, i8* %7, align 1 %10 = call i64 @FUNC(i64 %4) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 0, 1, 3, 2 } uselistorder i64* (i64*, i64*, i32)* @memmove, { 1, 0, 2 } uselistorder i64* (i64*, i32, i32)* @memset, { 2, 1, 0, 3, 4 } uselistorder void (i32)* @exit, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int_fscanf_multiply_11-bad
CWE190_Integer_Overflow__int_fscanf_multiply_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) br label LBL_2 LBL_2: %6 = call i64 @FUNC() %7 = trunc i64 %6 to i32 %8 = icmp eq i32 %7, 0 br i1 %8, label LBL_5, label LBL_3 LBL_3: %9 = load i64, i64* %sv_0, align 8 %10 = trunc i64 %9 to i32 %11 = icmp slt i32 %10, 1 br i1 %11, label LBL_5, label LBL_4 LBL_4: %12 = mul i64 %9, 2 %13 = and i64 %12, 4294967294 %14 = call i64 @FUNC(i64 %13) br label LBL_5 LBL_5: %15 = call i64 @FUNC(i64 40) %16 = icmp eq i64 %0, %15 store i64 0, i64* %rax.0.reg2mem br i1 %16, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2 } uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_08-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE805_char_snprintf_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i8* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i8* null, i8** %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 50) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = bitcast i64* %4 to i8* store i8 0, i8* %7, align 1 store i8* %7, i8** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i8*, i8** %sv_0.0.reg2mem %8 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %9 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* %sv_0.0.reload, i32 100, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_0, i64 0, i64 0), i64* nonnull %sv_1) %10 = ptrtoint i8* %sv_0.0.reload to i64 %11 = call i64 @FUNC(i64 %10) %12 = bitcast i8* %sv_0.0.reload to i64* call void @free(i64* %12) %13 = call i64 @FUNC(i64 40) %14 = icmp eq i64 %0, %13 store i64 0, i64* %rax.0.reg2mem br i1 %14, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 1, 0 } }
1
juliet-test-suite-c
CWE134_Uncontrolled_Format_String__char_file_snprintf_14-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_1, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_6, label LBL_1 LBL_1: %4 = bitcast i64* %sv_1 to i8* %5 = call i32 @strlen(i8* nonnull %4) %6 = sext i32 %5 to i64 %7 = sub nsw i64 100, %6 %8 = icmp ult i64 %7, 2 br i1 %8, label LBL_6, label LBL_2 LBL_2: %9 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_2, i64 0, i64 0)) %10 = icmp eq %_IO_FILE* %9, null br i1 %10, label LBL_6, label LBL_3 LBL_3: %11 = sub i32 100, %5 %12 = ptrtoint i64* %sv_1 to i64 %13 = add i64 %6, %12 %14 = inttoptr i64 %13 to i8* %15 = call i8* @fgets(i8* %14, i32 %11, %_IO_FILE* nonnull %9) %16 = icmp eq i8* %15, null %17 = icmp eq i1 %16, false br i1 %17, label LBL_5, label LBL_4 LBL_4: %18 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_3 to i64)) store i8 0, i8* %14, align 1 br label LBL_5 LBL_5: %19 = call i32 @fclose(%_IO_FILE* nonnull %9) br label LBL_6 LBL_6: %20 = load i32, i32* @gv_0, align 4 %21 = icmp eq i32 %20, 5 %22 = icmp eq i1 %21, false br i1 %22, label LBL_8, label LBL_7 LBL_7: store i64 0, i64* %sv_0, align 8 %23 = bitcast i64* %sv_0 to i8* %24 = call i32 (i8*, i32, i8*, ...) @snprintf(i8* nonnull %23, i32 99, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_4, i64 0, i64 0), i64* nonnull %sv_1) %25 = ptrtoint i64* %sv_0 to i64 %26 = call i64 @FUNC(i64 %25) br label LBL_8 LBL_8: %27 = call i64 @FUNC(i64 40) %28 = icmp eq i64 %0, %27 store i64 0, i64* %rax.0.reg2mem br i1 %28, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 0, 2 } uselistorder i32 (%_IO_FILE*)* @fclose, { 1, 0, 2 } uselistorder i8* (i8*, i32, %_IO_FILE*)* @fgets, { 1, 0, 2 } uselistorder %_IO_FILE* (i8*, i8*)* @fopen, { 1, 0, 2 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } }
0
juliet-test-suite-c
CWE197_Numeric_Truncation_Error__int_fscanf_to_char_13-bad
CWE197_Numeric_Truncation_Error__int_fscanf_to_char_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_0, align 4 %1 = load i32, i32* inttoptr (i64 8340 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64 4294967295, i64* %.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %.pre = load i32, i32* %sv_0, align 4 %phitmp = mul i32 %.pre, 16777216 %phitmp1 = ashr exact i32 %phitmp, 24 %phitmp2 = zext i32 %phitmp1 to i64 store i64 %phitmp2, i64* %.reg2mem br label LBL_2 LBL_2: %.reload = load i64, i64* %.reg2mem %6 = call i64 @FUNC(i64 %.reload) %7 = call i64 @FUNC(i64 40) %8 = icmp eq i64 %0, %7 store i64 0, i64* %rax.0.reg2mem br i1 %8, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %.reg2mem, { 0, 2, 1 } }
1
juliet-test-suite-c
CWE400_Resource_Exhaustion__listen_socket_fwrite_08-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge11.reg2mem = alloca i64 %sv_0.1.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 store i32 -1, i32* %sv_0.1.reg2mem br i1 %3, label LBL_9, label LBL_1 LBL_1: %4 = call i32 @socket(i32 2, i32 1, i32 6) %5 = icmp eq i32 %4, -1 store i32 -1, i32* %sv_0.1.reg2mem br i1 %5, label LBL_9, label LBL_2 LBL_2: %6 = call i64* @memset(i64* nonnull %sv_2, i32 0, i32 16) store i64 2, i64* %sv_2, align 8 %7 = call i16 @htons(i16 27015) %8 = bitcast i64* %sv_2 to %sockaddr* %9 = call i32 @bind(i32 %4, %sockaddr* nonnull %8, i32 16) %10 = icmp eq i32 %9, -1 br i1 %10, label LBL_7, label LBL_3 LBL_3: %11 = call i32 @listen(i32 %4, i32 5) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_7, label LBL_4 LBL_4: %13 = call i32 @accept(i32 %4, %sockaddr* null, i32* null) %14 = icmp eq i32 %13, -1 br i1 %14, label LBL_7, label LBL_5 LBL_5: %15 = call i32 @recv(i32 %13, i64* nonnull %sv_1, i32 13, i32 0) %16 = add i32 %15, 1 %17 = icmp ult i32 %16, 2 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %17, label LBL_8, label LBL_6 LBL_6: %18 = ptrtoint i64* %sv_3 to i64 %19 = sext i32 %15 to i64 %20 = add i64 %18, -22 %21 = add i64 %20, %19 %22 = inttoptr i64 %21 to i8* store i8 0, i8* %22, align 1 %23 = bitcast i64* %sv_1 to i8* %24 = call i32 @atoi(i8* nonnull %23) store i32 %24, i32* %sv_0.0.ph.reg2mem br label LBL_8 LBL_7: %25 = call i32 @close(i32 %4) store i32 -1, i32* %sv_0.1.reg2mem br label LBL_9 LBL_8: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %26 = call i32 @close(i32 %4) %27 = call i32 @close(i32 %13) store i32 %sv_0.0.ph.reload, i32* %sv_0.1.reg2mem br label LBL_9 LBL_9: %28 = call i64 @FUNC() %29 = trunc i64 %28 to i32 %30 = icmp eq i32 %29, 0 br i1 %30, label LBL_11, label LBL_10 LBL_10: %31 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) br label LBL_19 LBL_11: %sv_0.1.reload = load i32, i32* %sv_0.1.reg2mem %sv_0.1.off = add i32 %sv_0.1.reload, -1 %32 = icmp ugt i32 %sv_0.1.off, 19 br i1 %32, label LBL_19, label LBL_12 LBL_12: %33 = call %_IO_FILE* @fopen(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @gv_1, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0)) %34 = icmp eq %_IO_FILE* %33, null %35 = icmp eq i1 %34, false br i1 %35, label LBL_13, label LBL_14 LBL_13: %36 = sext i32 %sv_0.1.reload to i64 store i64 0, i64* %storemerge11.reg2mem br label LBL_15 LBL_14: call void @exit(i32 1) unreachable LBL_15: %37 = call i32 @fwrite(i64* bitcast ([51 x i8]* @gv_3 to i64*), i32 1, i32 50, %_IO_FILE* %33) %38 = icmp eq i32 %37, 50 br i1 %38, label LBL_17, label LBL_16 LBL_16: call void @exit(i32 1) unreachable LBL_17: %storemerge11.reload = load i64, i64* %storemerge11.reg2mem %39 = add nuw i64 %storemerge11.reload, 1 %40 = icmp ult i64 %39, %36 store i64 %39, i64* %storemerge11.reg2mem br i1 %40, label LBL_15, label LBL_18 LBL_18: %41 = call i32 @fclose(%_IO_FILE* nonnull %33) br label LBL_19 LBL_19: %42 = call i64 @FUNC(i64 40) %43 = icmp eq i64 %0, %42 store i64 0, i64* %rax.0.reg2mem br i1 %43, label LBL_21, label LBL_20 LBL_20: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_21 LBL_21: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %33, { 1, 0, 2 } uselistorder i32 %15, { 1, 0 } uselistorder i32 %4, { 4, 0, 1, 2, 3, 5 } uselistorder i64* %sv_2, { 0, 2, 1 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.1.reg2mem, { 0, 3, 2, 1, 4 } uselistorder i64* %storemerge11.reg2mem, { 1, 0, 2 } uselistorder label LBL_15, { 1, 0 } uselistorder label LBL_9, { 2, 1, 0, 3 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE806_char_declare_memcpy_14-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %.pre-phi.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_0 to i64)) %.pre = ptrtoint i64* %sv_1 to i64 store i64 %.pre, i64* %.pre-phi.reg2mem br label LBL_3 LBL_2: %4 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 49) %5 = ptrtoint i64* %sv_1 to i64 %6 = add i64 %5, 49 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 store i64 %5, i64* %.pre-phi.reg2mem br label LBL_3 LBL_3: %8 = bitcast i64* %sv_1 to i8* %.pre-phi.reload = load i64, i64* %.pre-phi.reg2mem store i64 0, i64* %sv_0, align 8 %9 = call i32 @strlen(i8* nonnull %8) %10 = call i64* @memcpy(i64* nonnull %sv_0, i64* nonnull %sv_1, i32 %9) %11 = call i64 @FUNC(i64 %.pre-phi.reload) %12 = call i64 @FUNC(i64 40) %13 = icmp eq i64 %0, %12 store i64 0, i64* %rax.0.reg2mem br i1 %13, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_1, { 2, 4, 1, 3, 0 } uselistorder i64* %.pre-phi.reg2mem, { 0, 2, 1 } }
0
juliet-test-suite-c
CWE369_Divide_by_Zero__int_rand_divide_07-good
goodB2G1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i32 %.reg2mem = alloca i32 %0 = load i32, i32* @gv_0, align 4 %1 = icmp eq i32 %0, 5 %2 = icmp eq i1 %1, false store i32 %0, i32* %.reg2mem store i32 -1, i32* %sv_0.0.reg2mem br i1 %2, label LBL_2, label LBL_1 LBL_1: %3 = call i32 @rand() %4 = urem i32 %3, 2 %5 = icmp eq i32 %4, 0 %6 = call i32 @rand() %7 = mul i32 %6, 1073741824 %8 = call i32 @rand() %9 = mul i32 %8, 32768 %10 = xor i32 %9, %7 %11 = call i32 @rand() %12 = xor i32 %10, %11 %13 = sext i1 %5 to i32 %storemerge.in = xor i32 %12, %13 %.pr = load i32, i32* @gv_0, align 4 store i32 %.pr, i32* %.reg2mem store i32 %storemerge.in, i32* %sv_0.0.reg2mem br label LBL_2 LBL_2: %.reload = load i32, i32* %.reg2mem %14 = icmp eq i32 %.reload, 5 br i1 %14, label LBL_4, label LBL_3 LBL_3: %15 = call i64 @FUNC(i64 ptrtoint ([21 x i8]* @gv_1 to i64)) store i64 %15, i64* %rax.0.reg2mem br label LBL_7 LBL_4: %sv_0.0.reload = load i32, i32* %sv_0.0.reg2mem %16 = icmp eq i32 %sv_0.0.reload, 0 br i1 %16, label LBL_6, label LBL_5 LBL_5: %17 = udiv i32 100, %sv_0.0.reload %18 = zext i32 %17 to i64 %19 = call i64 @FUNC(i64 %18) store i64 %19, i64* %rax.0.reg2mem br label LBL_7 LBL_6: %20 = call i64 @FUNC(i64 ptrtoint ([38 x i8]* @gv_2 to i64)) store i64 %20, i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %.reg2mem, { 0, 2, 1 } uselistorder i32* %sv_0.0.reg2mem, { 0, 2, 1 } uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 } }
0
juliet-test-suite-c
CWE190_Integer_Overflow__int64_t_fscanf_postinc_03-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_0, align 8 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0), i64* nonnull %sv_0) %3 = load i64, i64* %sv_0, align 8 %4 = icmp eq i64 %3, 9223372036854775807 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i64 %3, 1 store i64 %5, i64* %sv_0, align 8 %6 = call i64 @FUNC(i64 %5) br label LBL_3 LBL_2: %7 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %8 = call i64 @FUNC(i64 40) %9 = icmp eq i64 %0, %8 store i64 0, i64* %rax.0.reg2mem br i1 %9, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %sv_0, { 1, 2, 0, 3 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE459_Incomplete_Cleanup__char_14-bad
CWE459_Incomplete_Cleanup__char_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false br i1 %3, label LBL_4, label LBL_1 LBL_1: store i64 6365935209751535970, i64* %sv_0, align 8 %4 = bitcast i64* %sv_0 to i8* %5 = call i32 @mkstemp(i8* nonnull %4) %6 = icmp eq i32 %5, -1 br i1 %6, label LBL_4, label LBL_2 LBL_2: %7 = call %_IO_FILE* @fdopen(i32 %5, i8* getelementptr inbounds ([2 x i8], [2 x i8]* @gv_0, i64 0, i64 0)) %8 = icmp eq %_IO_FILE* %7, null br i1 %8, label LBL_4, label LBL_3 LBL_3: %9 = call i32 @fwrite(i64* bitcast ([15 x i8]* @gv_1 to i64*), i32 1, i32 14, %_IO_FILE* nonnull %7) %10 = call i32 @fclose(%_IO_FILE* nonnull %7) br label LBL_4 LBL_4: %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder %_IO_FILE* %7, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE191_Integer_Underflow__unsigned_int_fscanf_postdec_02-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i32, align 4 %0 = call i64 @FUNC(i64 40) store i32 0, i32* %sv_0, align 4 %1 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %2 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_0) %3 = load i32, i32* %sv_0, align 4 %4 = icmp eq i32 %3, 0 br i1 %4, label LBL_2, label LBL_1 LBL_1: %5 = add i32 %3, -1 store i32 %5, i32* %sv_0, align 4 %6 = zext i32 %5 to i64 %7 = call i64 @FUNC(i64 %6) br label LBL_3 LBL_2: %8 = call i64 @FUNC(i64 ptrtoint ([54 x i8]* @gv_2 to i64)) br label LBL_3 LBL_3: %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_5, label LBL_4 LBL_4: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_0, { 2, 1, 3, 0 } uselistorder i32 (%_IO_FILE*, i8*, ...)* @fscanf, { 1, 0, 2 } uselistorder %_IO_FILE** @gv_0, { 1, 0 } }
0
juliet-test-suite-c
CWE398_Poor_Code_Quality__empty_case_01-bad
CWE398_Poor_Code_Quality__empty_case_01_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %0 = call i32 @rand() %1 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64)) ret i64 %1 }
1
juliet-test-suite-c
CWE606_Unchecked_Loop_Condition__char_environment_14-good
goodB2G2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.lcssa.reg2mem = alloca i64 %storemerge4.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_2, align 8 %1 = bitcast i64* %sv_2 to i8* %2 = load i32, i32* @gv_0, align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false br i1 %4, label LBL_3, label LBL_1 LBL_1: %5 = call i32 @strlen(i8* nonnull %1) %6 = call i8* @getenv(i8* getelementptr inbounds ([4 x i8], [4 x i8]* @gv_1, i64 0, i64 0)) %7 = icmp eq i8* %6, null br i1 %7, label LBL_3, label LBL_2 LBL_2: %8 = sext i32 %5 to i64 %9 = ptrtoint i64* %sv_2 to i64 %10 = add i64 %8, %9 %11 = inttoptr i64 %10 to i8* %12 = sub i32 99, %5 %13 = call i8* @strncat(i8* %11, i8* nonnull %6, i32 %12) br label LBL_3 LBL_3: %14 = load i32, i32* @gv_0, align 4 %15 = icmp eq i32 %14, 5 %16 = icmp eq i1 %15, false br i1 %16, label LBL_10, label LBL_4 LBL_4: %17 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %1, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_2, i64 0, i64 0), i64* nonnull %sv_1) %18 = icmp eq i32 %17, 1 %19 = icmp eq i1 %18, false br i1 %19, label LBL_10, label LBL_5 LBL_5: %20 = load i64, i64* %sv_1, align 8 %21 = trunc i64 %20 to i32 %22 = icmp sgt i32 %21, ptrtoint (i1* @gv_3 to i32) br i1 %22, label LBL_10, label LBL_6 LBL_6: %23 = and i64 %20, 4294967295 %24 = icmp eq i64 %23, 0 store i32 0, i32* %storemerge4.reg2mem store i64 0, i64* %sv_0.0.lcssa.reg2mem br i1 %24, label LBL_9, label LBL_7 LBL_7: %storemerge4.reload = load i32, i32* %storemerge4.reg2mem %25 = add i32 %storemerge4.reload, 1 %26 = sext i32 %25 to i64 %27 = icmp sgt i64 %23, %26 store i32 %25, i32* %storemerge4.reg2mem br i1 %27, label LBL_7, label LBL_8 LBL_8: %phitmp = zext i32 %25 to i64 store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem br label LBL_9 LBL_9: %sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem %28 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload) br label LBL_10 LBL_10: %29 = call i64 @FUNC(i64 40) %30 = icmp eq i64 %0, %29 store i64 0, i64* %rax.0.reg2mem br i1 %30, label LBL_12, label LBL_11 LBL_11: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_12 LBL_12: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %25, { 1, 0, 2 } uselistorder i64* %sv_1, { 1, 0 } uselistorder i32* %storemerge4.reg2mem, { 2, 0, 1 } uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 } uselistorder i32 ptrtoint (i1* @gv_3 to i32), { 1, 0 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder label LBL_9, { 1, 0 } uselistorder label LBL_7, { 1, 0 } }
0
juliet-test-suite-c
CWE606_Unchecked_Loop_Condition__char_console_05-bad
CWE606_Unchecked_Loop_Condition__char_console_05_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.lcssa.reg2mem = alloca i64 %storemerge4.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 0, i64* %sv_2, align 8 %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 0 br i1 %2, label LBL_13, label LBL_1 LBL_1: %3 = bitcast i64* %sv_2 to i8* %4 = call i32 @strlen(i8* nonnull %3) %5 = sext i32 %4 to i64 %6 = sub nsw i64 100, %5 %7 = icmp ult i64 %6, 2 br i1 %7, label LBL_7, label LBL_2 LBL_2: %8 = load %_IO_FILE*, %_IO_FILE** @gv_1, align 8 %9 = sub i32 100, %4 %10 = ptrtoint i64* %sv_2 to i64 %11 = add i64 %5, %10 %12 = inttoptr i64 %11 to i8* %13 = call i8* @fgets(i8* %12, i32 %9, %_IO_FILE* %8) %14 = icmp eq i8* %13, null br i1 %14, label LBL_6, label LBL_3 LBL_3: %15 = call i32 @strlen(i8* nonnull %3) %16 = icmp eq i32 %15, 0 br i1 %16, label LBL_7, label LBL_4 LBL_4: %17 = sext i32 %15 to i64 %18 = add i64 %10, -1 %19 = add i64 %18, %17 %20 = inttoptr i64 %19 to i8* %21 = load i8, i8* %20, align 1 %22 = icmp eq i8 %21, 10 %23 = icmp eq i1 %22, false br i1 %23, label LBL_7, label LBL_5 LBL_5: store i8 0, i8* %20, align 1 br label LBL_7 LBL_6: %24 = call i64 @FUNC(i64 ptrtoint ([15 x i8]* @gv_2 to i64)) store i8 0, i8* %12, align 1 br label LBL_7 LBL_7: %.pr = load i32, i32* @gv_0, align 4 %25 = icmp eq i32 %.pr, 0 br i1 %25, label LBL_13, label LBL_8 LBL_8: %26 = call i32 (i8*, i8*, ...) @sscanf(i8* nonnull %3, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_3, i64 0, i64 0), i64* nonnull %sv_1) %27 = icmp eq i32 %26, 1 %28 = icmp eq i1 %27, false br i1 %28, label LBL_13, label LBL_9 LBL_9: %29 = load i64, i64* %sv_1, align 8 %30 = and i64 %29, 4294967295 %31 = icmp eq i64 %30, 0 store i32 0, i32* %storemerge4.reg2mem store i64 0, i64* %sv_0.0.lcssa.reg2mem br i1 %31, label LBL_12, label LBL_10 LBL_10: %storemerge4.reload = load i32, i32* %storemerge4.reg2mem %32 = add i32 %storemerge4.reload, 1 %33 = sext i32 %32 to i64 %34 = icmp sgt i64 %30, %33 store i32 %32, i32* %storemerge4.reg2mem br i1 %34, label LBL_10, label LBL_11 LBL_11: %phitmp = zext i32 %32 to i64 store i64 %phitmp, i64* %sv_0.0.lcssa.reg2mem br label LBL_12 LBL_12: %sv_0.0.lcssa.reload = load i64, i64* %sv_0.0.lcssa.reg2mem %35 = call i64 @FUNC(i64 %sv_0.0.lcssa.reload) br label LBL_13 LBL_13: %36 = call i64 @FUNC(i64 40) %37 = icmp eq i64 %0, %36 store i64 0, i64* %rax.0.reg2mem br i1 %37, label LBL_15, label LBL_14 LBL_14: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_15 LBL_15: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %32, { 1, 0, 2 } uselistorder i64 %10, { 1, 0 } uselistorder i8* %3, { 1, 0, 2 } uselistorder i32* %storemerge4.reg2mem, { 2, 0, 1 } uselistorder i64* %sv_0.0.lcssa.reg2mem, { 0, 2, 1 } uselistorder i8 0, { 1, 2, 3, 0 } uselistorder %_IO_FILE** @gv_1, { 1, 0 } uselistorder i32 (i8*)* @strlen, { 1, 0, 2 } uselistorder label LBL_13, { 1, 2, 3, 0 } uselistorder label LBL_12, { 1, 0 } uselistorder label LBL_10, { 1, 0 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_ncpy_31-bad
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_ncpy_31_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 10) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = bitcast i64* %1 to i8* %5 = ptrtoint i64* %1 to i64 store i64 4702111234474983745, i64* %sv_0, align 8 %6 = bitcast i64* %sv_0 to i8* %7 = call i32 @strlen(i8* nonnull %6) %8 = add i32 %7, 1 %9 = call i8* @strncpy(i8* %4, i8* nonnull %6, i32 %8) %10 = call i64 @FUNC(i64 %5) call void @free(i64* %1) %11 = call i64 @FUNC(i64 40) %12 = icmp eq i64 %0, %11 store i64 0, i64* %rax.0.reg2mem br i1 %12, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 1, 0, 3, 2 } }
1
juliet-test-suite-c
CWE126_Buffer_Overread__malloc_char_loop_18-bad
CWE126_Buffer_Overread__malloc_char_loop_18_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 50) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = ptrtoint i64* %1 to i64 %5 = call i64* @memset(i64* %1, i32 65, i32 49) %6 = add i64 %4, 49 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 %8 = call i64* @memset(i64* nonnull %sv_0, i32 67, i32 99) %9 = bitcast i64* %sv_0 to i8* %10 = call i32 @strlen(i8* nonnull %9) %11 = icmp eq i32 %10, 0 br i1 %11, label LBL_5, label LBL_3 LBL_3: %12 = sext i32 %10 to i64 %13 = ptrtoint i64* %sv_0 to i64 store i64 0, i64* %storemerge1.reg2mem br label LBL_4 LBL_4: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %14 = add i64 %storemerge1.reload, %4 %15 = inttoptr i64 %14 to i8* %16 = load i8, i8* %15, align 1 %17 = add i64 %storemerge1.reload, %13 %18 = inttoptr i64 %17 to i8* store i8 %16, i8* %18, align 1 %19 = add nuw i64 %storemerge1.reload, 1 %20 = icmp ult i64 %19, %12 store i64 %19, i64* %storemerge1.reg2mem br i1 %20, label LBL_4, label LBL_5 LBL_5: %21 = call i64 @FUNC(i64* nonnull %sv_0) call void @free(i64* %1) %22 = call i64 @FUNC(i64 40) %23 = icmp eq i64 %0, %22 store i64 0, i64* %rax.0.reg2mem br i1 %23, label LBL_7, label LBL_6 LBL_6: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_7 LBL_7: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %storemerge1.reload, { 0, 2, 1 } uselistorder i32 %10, { 1, 0 } uselistorder i64* %1, { 0, 1, 3, 2 } uselistorder i64* %sv_0, { 0, 3, 1, 2 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder label LBL_4, { 1, 0 } }
1
juliet-test-suite-c
CWE416_Use_After_Free__malloc_free_char_11-bad
CWE416_Use_After_Free__malloc_free_char_11_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 store i64 0, i64* %sv_0.0.reg2mem br i1 %2, label LBL_4, label LBL_1 LBL_1: %3 = call i64* @malloc(i32 100) %4 = icmp eq i64* %3, null %5 = icmp eq i1 %4, false br i1 %5, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %6 = ptrtoint i64* %3 to i64 %7 = call i64* @memset(i64* %3, i32 65, i32 99) %8 = add i64 %6, 99 %9 = inttoptr i64 %8 to i8* store i8 0, i8* %9, align 1 call void @free(i64* %3) store i64 %6, i64* %sv_0.0.reg2mem br label LBL_4 LBL_4: %10 = call i64 @FUNC() %11 = trunc i64 %10 to i32 %12 = icmp eq i32 %11, 0 store i64 %10, i64* %rax.0.reg2mem br i1 %12, label LBL_6, label LBL_5 LBL_5: %sv_0.0.reload = load i64, i64* %sv_0.0.reg2mem %13 = call i64 @FUNC(i64 %sv_0.0.reload) store i64 %13, i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %3, { 0, 1, 3, 2 } uselistorder i64 ()* @globalReturnsTrue, { 1, 0 } }
1
juliet-test-suite-c
CWE195_Signed_to_Unsigned_Conversion_Error__fscanf_strncpy_08-bad
CWE195_Signed_to_Unsigned_Conversion_Error__fscanf_strncpy_08_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i32, align 4 %sv_3 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i32 -1, i32* %sv_2, align 4 %1 = call i64 @FUNC() %2 = trunc i64 %1 to i32 %3 = icmp eq i32 %2, 0 br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = load %_IO_FILE*, %_IO_FILE** @gv_0, align 8 %5 = call i32 (%_IO_FILE*, i8*, ...) @fscanf(%_IO_FILE* %4, i8* getelementptr inbounds ([3 x i8], [3 x i8]* @gv_1, i64 0, i64 0), i32* nonnull %sv_2) br label LBL_2 LBL_2: store i64 0, i64* %sv_1, align 8 %6 = call i64* @memset(i64* nonnull %sv_0, i32 65, i32 99) %7 = load i32, i32* %sv_2, align 4 %8 = icmp sgt i32 %7, 99 br i1 %8, label LBL_4, label LBL_3 LBL_3: %9 = ptrtoint i64* %sv_3 to i64 %10 = bitcast i64* %sv_1 to i8* %11 = bitcast i64* %sv_0 to i8* %12 = call i8* @strncpy(i8* nonnull %10, i8* nonnull %11, i32 %7) %13 = load i32, i32* %sv_2, align 4 %14 = sext i32 %13 to i64 %15 = add i64 %9, -112 %16 = add i64 %15, %14 %17 = inttoptr i64 %16 to i8* store i8 0, i8* %17, align 1 br label LBL_4 LBL_4: %18 = call i64 @FUNC(i64* nonnull %sv_1) %19 = call i64 @FUNC(i64 40) %20 = icmp eq i64 %0, %19 store i64 0, i64* %rax.0.reg2mem br i1 %20, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32* %sv_2, { 1, 2, 0, 3 } uselistorder i8 0, { 1, 2, 0 } uselistorder i32 99, { 1, 0 } }
1
juliet-test-suite-c
CWE194_Unexpected_Sign_Extension__connect_socket_memcpy_01-bad
CWE194_Unexpected_Sign_Extension__connect_socket_memcpy_01_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.08.reg2mem = alloca i32 %sv_0.0.ph.reg2mem = alloca i32 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %sv_4 = alloca i64, align 8 %0 = ptrtoint i64* %sv_4 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i32 @socket(i32 2, i32 1, i32 6) %3 = icmp eq i32 %2, -1 store i32 0, i32* %sv_0.08.reg2mem br i1 %3, label LBL_6, label LBL_1 LBL_1: %4 = call i64* @memset(i64* nonnull %sv_3, i32 0, i32 16) store i64 2, i64* %sv_3, align 8 %5 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %6 = call i16 @htons(i16 27015) %7 = bitcast i64* %sv_3 to %sockaddr* %8 = call i32 @connect(i32 %2, %sockaddr* nonnull %7, i32 16) %9 = icmp eq i32 %8, -1 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %9, label LBL_5, label LBL_2 LBL_2: %10 = call i32 @recv(i32 %2, i64* nonnull %sv_2, i32 7, i32 0) %11 = add i32 %10, 1 %12 = icmp ult i32 %11, 2 store i32 0, i32* %sv_0.0.ph.reg2mem br i1 %12, label LBL_5, label LBL_3 LBL_3: %13 = sext i32 %10 to i64 %14 = add i64 %0, -112 %15 = add i64 %14, %13 %16 = inttoptr i64 %15 to i8* store i8 0, i8* %16, align 1 %17 = bitcast i64* %sv_2 to i8* %18 = call i32 @atoi(i8* nonnull %17) %.off = add i32 %18, 32768 %19 = icmp ult i32 %.off, 65536 store i32 -1, i32* %sv_0.0.ph.reg2mem br i1 %19, label LBL_4, label LBL_5 LBL_4: %sext3 = mul i32 %18, 65536 %20 = ashr exact i32 %sext3, 16 store i32 %20, i32* %sv_0.0.ph.reg2mem br label LBL_5 LBL_5: %sv_0.0.ph.reload = load i32, i32* %sv_0.0.ph.reg2mem %21 = call i32 @close(i32 %2) store i32 %sv_0.0.ph.reload, i32* %sv_0.08.reg2mem br label LBL_6 LBL_6: %sv_0.08.reload = load i32, i32* %sv_0.08.reg2mem store i64 0, i64* %sv_2, align 8 %22 = call i64* @memset(i64* nonnull %sv_1, i32 65, i32 99) %23 = trunc i32 %sv_0.08.reload to i16 %24 = icmp sgt i16 %23, 99 br i1 %24, label LBL_8, label LBL_7 LBL_7: %25 = call i64* @memcpy(i64* nonnull %sv_2, i64* nonnull %sv_1, i32 %sv_0.08.reload) %26 = sext i32 %sv_0.08.reload to i64 %27 = add i64 %0, -112 %28 = add i64 %27, %26 %29 = inttoptr i64 %28 to i8* store i8 0, i8* %29, align 1 br label LBL_8 LBL_8: %30 = call i64 @FUNC(i64* nonnull %sv_2) %31 = call i64 @FUNC(i64 40) %32 = icmp eq i64 %1, %31 store i64 0, i64* %rax.0.reg2mem br i1 %32, label LBL_10, label LBL_9 LBL_9: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_10 LBL_10: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %sv_0.08.reload, { 1, 2, 0 } uselistorder i32 %10, { 1, 0 } uselistorder i32 %2, { 2, 0, 1, 3 } uselistorder i64 %0, { 1, 0 } uselistorder i64* %sv_3, { 0, 2, 1 } uselistorder i64* %sv_2, { 0, 1, 4, 2, 3 } uselistorder i32* %sv_0.0.ph.reg2mem, { 0, 3, 4, 2, 1 } uselistorder i32* %sv_0.08.reg2mem, { 0, 2, 1 } uselistorder i64* (i64*, i32, i32)* @memset, { 1, 0, 2 } uselistorder label LBL_6, { 1, 0 } uselistorder label LBL_5, { 2, 0, 3, 1 } }
1
juliet-test-suite-c
CWE78_OS_Command_Injection__char_connect_socket_system_14-bad
CWE78_OS_Command_Injection__char_connect_socket_system_14_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) store i64 2126700, i64* %sv_1, align 8 %1 = bitcast i64* %sv_1 to i8* %2 = load i32, i32* inttoptr (i64 16404 to i32*), align 4 %3 = icmp eq i32 %2, 5 %4 = icmp eq i1 %3, false br i1 %4, label LBL_9, label LBL_1 LBL_1: %5 = call i32 @strlen(i8* nonnull %1) %6 = call i32 @socket(i32 2, i32 1, i32 6) %cond = icmp eq i32 %6, -1 br i1 %cond, label LBL_9, label LBL_2 LBL_2: %7 = call i64* @memset(i64* nonnull %sv_0, i32 0, i32 16) store i64 2, i64* %sv_0, align 8 %8 = call i32 @inet_addr(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @gv_0, i64 0, i64 0)) %9 = call i16 @htons(i16 27015) %10 = bitcast i64* %sv_0 to %sockaddr* %11 = call i32 @connect(i32 %6, %sockaddr* nonnull %10, i32 16) %12 = icmp eq i32 %11, -1 br i1 %12, label LBL_8, label LBL_3 LBL_3: %13 = sext i32 %5 to i64 %14 = ptrtoint i64* %sv_1 to i64 %15 = add i64 %13, %14 %16 = inttoptr i64 %15 to i64* %17 = sub i32 99, %5 %18 = call i32 @recv(i32 %6, i64* %16, i32 %17, i32 0) %19 = add i32 %18, 1 %20 = icmp ult i32 %19, 2 br i1 %20, label LBL_8, label LBL_4 LBL_4: %21 = sext i32 %18 to i64 %22 = add i64 %15, %21 %23 = inttoptr i64 %22 to i8* store i8 0, i8* %23, align 1 %24 = call i8* @strchr(i8* nonnull %1, i32 13) %25 = icmp eq i8* %24, null br i1 %25, label LBL_6, label LBL_5 LBL_5: store i8 0, i8* %24, align 1 br label LBL_6 LBL_6: %26 = call i8* @strchr(i8* nonnull %1, i32 10) %27 = icmp eq i8* %26, null br i1 %27, label LBL_8, label LBL_7 LBL_7: store i8 0, i8* %26, align 1 br label LBL_8 LBL_8: %28 = call i32 @close(i32 %6) br label LBL_9 LBL_9: %29 = call i32 @system(i8* nonnull %1) %30 = icmp eq i32 %29, 0 br i1 %30, label LBL_11, label LBL_10 LBL_10: %31 = call i64 @FUNC(i64 ptrtoint ([26 x i8]* @gv_1 to i64)) call void @exit(i32 1) unreachable LBL_11: %32 = call i64 @FUNC(i64 40) %33 = icmp eq i64 %0, %32 store i64 0, i64* %rax.0.reg2mem br i1 %33, label LBL_13, label LBL_12 LBL_12: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_13 LBL_13: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i32 %18, { 1, 0 } uselistorder i32 %6, { 3, 1, 2, 0 } uselistorder i8* %1, { 3, 0, 1, 2 } uselistorder i64* %sv_0, { 0, 2, 1 } uselistorder i8* (i8*, i32)* @strchr, { 1, 0, 2 } uselistorder i32 -1, { 1, 0 } uselistorder label LBL_9, { 1, 0, 2 } uselistorder label LBL_8, { 2, 1, 0, 3 } }
1
juliet-test-suite-c
CWE122_Heap_Based_Buffer_Overflow__c_CWE193_char_cpy_31-good
goodG2B
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = call i64* @malloc(i32 11) %2 = icmp eq i64* %1, null %3 = icmp eq i1 %2, false br i1 %3, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %4 = bitcast i64* %1 to i8* %5 = ptrtoint i64* %1 to i64 store i64 4702111234474983745, i64* %sv_0, align 8 %6 = bitcast i64* %sv_0 to i8* %7 = call i8* @strcpy(i8* %4, i8* nonnull %6) %8 = call i64 @FUNC(i64 %5) call void @free(i64* %1) %9 = call i64 @FUNC(i64 40) %10 = icmp eq i64 %0, %9 store i64 0, i64* %rax.0.reg2mem br i1 %10, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %1, { 1, 0, 3, 2 } }
0
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_declare_loop_12-bad
CWE121_Stack_Based_Buffer_Overflow__CWE805_int64_t_declare_loop_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge2.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %sv_3 = alloca i64, align 8 %0 = ptrtoint i64* %sv_3 to i64 %1 = call i64 @FUNC(i64 40) %2 = call i64 @FUNC() %3 = trunc i64 %2 to i32 %4 = icmp eq i32 %3, 0 %sv_1.stack_var_-2024 = select i1 %4, i64* %sv_1, i64* %sv_2 %storemerge1 = ptrtoint i64* %sv_1.stack_var_-2024 to i64 %5 = bitcast i64* %sv_0 to i8* call void @FUNC(i8* nonnull %5, i64 0, i64 100) %6 = add i64 %0, -816 store i64 0, i64* %storemerge2.reg2mem br label LBL_1 LBL_1: %storemerge2.reload = load i64, i64* %storemerge2.reg2mem %7 = mul i64 %storemerge2.reload, 8 %8 = add i64 %7, %storemerge1 %9 = add i64 %6, %7 %10 = inttoptr i64 %9 to i64* %11 = load i64, i64* %10, align 8 %12 = inttoptr i64 %8 to i64* store i64 %11, i64* %12, align 8 %13 = add nuw nsw i64 %storemerge2.reload, 1 %exitcond = icmp eq i64 %13, 100 store i64 %13, i64* %storemerge2.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %14 = load i64, i64* %sv_1.stack_var_-2024, align 8 %15 = call i64 @FUNC(i64 %14) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %1, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %storemerge2.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE121_Stack_Based_Buffer_Overflow__CWE805_struct_alloca_memcpy_02-good
goodG2B1
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %storemerge1.reg2mem = alloca i64 %sv_0 = alloca i64, align 8 %sv_1 = alloca i64, align 8 %sv_2 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = ptrtoint i64* %sv_2 to i64 store i64 0, i64* %sv_1, align 8 %2 = add i64 %1, -816 %3 = add i64 %1, -812 store i64 0, i64* %storemerge1.reg2mem br label LBL_1 LBL_1: %storemerge1.reload = load i64, i64* %storemerge1.reg2mem %4 = mul i64 %storemerge1.reload, 8 %5 = add i64 %2, %4 %6 = inttoptr i64 %5 to i32* store i32 0, i32* %6, align 8 %7 = load i64, i64* %sv_1, align 8 %8 = mul i64 %7, 8 %9 = add i64 %3, %8 %10 = inttoptr i64 %9 to i32* store i32 0, i32* %10, align 4 %11 = load i64, i64* %sv_1, align 8 %12 = add i64 %11, 1 store i64 %12, i64* %sv_1, align 8 %13 = icmp ult i64 %12, 100 store i64 %12, i64* %storemerge1.reg2mem br i1 %13, label LBL_1, label LBL_2 LBL_2: %14 = ptrtoint i64* %sv_1 to i64 %15 = add i64 %14, add (i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_0 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 4095)), i64 15), i64 add (i64 sub (i64 0, i64 and (i64 trunc (i128 mul (i128 sext (i64 trunc (i128 udiv (i128 zext (i64 add (i64 ptrtoint ([12 x i8]* @gv_0 to i64), i64 15) to i128), i128 16) to i64) to i128), i128 16) to i64), i64 -4096)), i64 -416)) %16 = and i64 %15, -16 %17 = inttoptr i64 %16 to i64* %18 = call i64* @memcpy(i64* %17, i64* nonnull %sv_0, i32 ptrtoint (i32* @gv_1 to i32)) %19 = call i64 @FUNC(i64 %16) %20 = call i64 @FUNC(i64 40) %21 = icmp eq i64 %0, %20 store i64 0, i64* %rax.0.reg2mem br i1 %21, label LBL_4, label LBL_3 LBL_3: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_4 LBL_4: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %16, { 1, 0 } uselistorder i64 %12, { 0, 2, 1 } uselistorder i64* %sv_1, { 4, 1, 2, 3, 0 } uselistorder i64* %storemerge1.reg2mem, { 1, 0, 2 } uselistorder label LBL_1, { 1, 0 } }
0
juliet-test-suite-c
CWE191_Integer_Underflow__short_min_sub_12-bad
CWE191_Integer_Underflow__short_min_sub_12_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = call i64 @FUNC() %1 = trunc i64 %0 to i32 %2 = icmp eq i32 %1, 0 %. = select i1 %2, i32 -2, i32 -32768 %3 = call i64 @FUNC() %4 = trunc i64 %3 to i32 %5 = icmp eq i32 %4, 0 br i1 %5, label LBL_2, label LBL_1 LBL_1: %6 = mul i32 %., 65536 %sext = add i32 %6, -65536 %7 = ashr exact i32 %sext, 16 %8 = zext i32 %7 to i64 %9 = call i64 @FUNC(i64 %8) store i64 %9, i64* %rax.0.reg2mem br label LBL_5 LBL_2: br i1 %2, label LBL_3, label LBL_4 LBL_3: %10 = mul i32 %., 65536 %sext2 = add i32 %10, -65536 %11 = ashr exact i32 %sext2, 16 %12 = zext i32 %11 to i64 %13 = call i64 @FUNC(i64 %12) store i64 %13, i64* %rax.0.reg2mem br label LBL_5 LBL_4: %14 = call i64 @FUNC(i64 ptrtoint ([48 x i8]* @gv_0 to i64)) store i64 %14, i64* %rax.0.reg2mem br label LBL_5 LBL_5: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %rax.0.reg2mem, { 0, 3, 2, 1 } uselistorder i64 (i64)* @printIntLine, { 1, 0 } uselistorder i64 ()* @globalReturnsTrueOrFalse, { 1, 0 } }
1
juliet-test-suite-c
CWE590_Free_Memory_Not_on_Heap__free_int_static_17-bad
CWE590_Free_Memory_Not_on_Heap__free_int_static_17_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %storemerge12.reg2mem = alloca i64 store i64 0, i64* %storemerge12.reg2mem br label LBL_1 LBL_1: %storemerge12.reload = load i64, i64* %storemerge12.reg2mem %0 = mul i64 %storemerge12.reload, 4 %1 = add i64 %0, ptrtoint (i64* @gv_0 to i64) %2 = inttoptr i64 %1 to i32* store i32 5, i32* %2, align 4 %3 = add nuw nsw i64 %storemerge12.reload, 1 %exitcond = icmp eq i64 %3, 100 store i64 %3, i64* %storemerge12.reg2mem br i1 %exitcond, label LBL_2, label LBL_1 LBL_2: %4 = load i32, i32* bitcast (i64* @gv_0 to i32*), align 8 %5 = zext i32 %4 to i64 %6 = call i64 @FUNC(i64 %5) call void @free(i64* nonnull @gv_0) ret i64 ptrtoint (i32* @1 to i64) uselistorder i64* %storemerge12.reg2mem, { 1, 0, 2 } }
1
juliet-test-suite-c
CWE126_Buffer_Overread__malloc_char_memcpy_07-bad
CWE126_Buffer_Overread__malloc_char_memcpy_07_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.0.reg2mem = alloca i64* %sv_1 = alloca i64, align 8 %0 = call i64 @FUNC(i64 40) %1 = load i32, i32* @gv_0, align 4 %2 = icmp eq i32 %1, 5 %3 = icmp eq i1 %2, false store i64* null, i64** %sv_0.0.reg2mem br i1 %3, label LBL_4, label LBL_1 LBL_1: %4 = call i64* @malloc(i32 50) %5 = icmp eq i64* %4, null %6 = icmp eq i1 %5, false br i1 %6, label LBL_3, label LBL_2 LBL_2: call void @exit(i32 -1) unreachable LBL_3: %7 = ptrtoint i64* %4 to i64 %8 = call i64* @memset(i64* %4, i32 65, i32 49) %9 = add i64 %7, 49 %10 = inttoptr i64 %9 to i8* store i8 0, i8* %10, align 1 store i64* %4, i64** %sv_0.0.reg2mem br label LBL_4 LBL_4: %sv_0.0.reload = load i64*, i64** %sv_0.0.reg2mem %11 = call i64* @memset(i64* nonnull %sv_1, i32 67, i32 99) %12 = bitcast i64* %sv_1 to i8* %13 = call i32 @strlen(i8* nonnull %12) %14 = call i64* @memcpy(i64* nonnull %sv_1, i64* %sv_0.0.reload, i32 %13) %15 = call i64 @FUNC(i64* nonnull %sv_1) call void @free(i64* %sv_0.0.reload) %16 = call i64 @FUNC(i64 40) %17 = icmp eq i64 %0, %16 store i64 0, i64* %rax.0.reg2mem br i1 %17, label LBL_6, label LBL_5 LBL_5: call void @__stack_chk_fail() store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_6 LBL_6: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64* %4, { 0, 1, 3, 2 } }
1
juliet-test-suite-c
CWE369_Divide_by_Zero__int_connect_socket_modulo_14-good
goodG2B2
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %0 = load i32, i32* @gv_0, align 4 %1 = zext i32 %0 to i64 %2 = icmp eq i32 %0, 5 %3 = icmp eq i1 %2, false store i64 %1, i64* %rax.0.reg2mem br i1 %3, label LBL_2, label LBL_1 LBL_1: %4 = call i64 @FUNC(i64 2) store i64 %4, i64* %rax.0.reg2mem br label LBL_2 LBL_2: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 (i64)* @printIntLine, { 3, 2, 1, 0 } uselistorder i32* @gv_0, { 5, 0, 4, 3, 2, 1 } }
0
juliet-test-suite-c
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_fixed_string_13-bad
CWE761_Free_Pointer_Not_at_Start_of_Buffer__char_fixed_string_13_bad
define i64 @FUNC() local_unnamed_addr { LBL_0: %rax.0.reg2mem = alloca i64 %sv_0.02.reg2mem = alloca i64 %sv_0.03.reg2mem = alloca i64 %.reg2mem = alloca i8 %0 = call i64* @malloc(i32 100) %1 = icmp eq i64* %0, null %2 = icmp eq i1 %1, false br i1 %2, label LBL_2, label LBL_1 LBL_1: call void @exit(i32 -1) unreachable LBL_2: %3 = ptrtoint i64* %0 to i64 store i64 8382078947037833542, i64* %0, align 8 %4 = add i64 %3, 8 %5 = inttoptr i64 %4 to i32* store i32 1735289202, i32* %5, align 4 %6 = add i64 %3, 12 %7 = inttoptr i64 %6 to i8* store i8 0, i8* %7, align 1 %8 = load i32, i32* inttoptr (i64 8356 to i32*), align 4 %9 = zext i32 %8 to i64 %10 = icmp eq i32 %8, 5 %11 = icmp eq i1 %10, false store i64 %9, i64* %rax.0.reg2mem br i1 %11, label LBL_8, label LBL_3 LBL_3: %12 = bitcast i64* %0 to i8* %13 = load i8, i8* %12, align 1 %14 = icmp eq i8 %13, 0 %15 = icmp eq i1 %14, false store i8 %13, i8* %.reg2mem store i64 %3, i64* %sv_0.03.reg2mem store i64 %3, i64* %sv_0.02.reg2mem br i1 %15, label LBL_4, label LBL_7 LBL_4: %sv_0.03.reload = load i64, i64* %sv_0.03.reg2mem %.reload = load i8, i8* %.reg2mem %16 = icmp eq i8 %.reload, 83 %17 = icmp eq i1 %16, false br i1 %17, label LBL_6, label LBL_5 LBL_5: %18 = call i64 @FUNC(i64 ptrtoint ([17 x i8]* @gv_0 to i64)) store i64 %sv_0.03.reload, i64* %sv_0.02.reg2mem br label LBL_7 LBL_6: %19 = add i64 %sv_0.03.reload, 1 %20 = inttoptr i64 %19 to i8* %21 = load i8, i8* %20, align 1 %22 = icmp eq i8 %21, 0 %23 = icmp eq i1 %22, false store i8 %21, i8* %.reg2mem store i64 %19, i64* %sv_0.03.reg2mem store i64 %19, i64* %sv_0.02.reg2mem br i1 %23, label LBL_4, label LBL_7 LBL_7: %sv_0.02.reload = load i64, i64* %sv_0.02.reg2mem %24 = inttoptr i64 %sv_0.02.reload to i64* call void @free(i64* %24) store i64 ptrtoint (i32* @1 to i64), i64* %rax.0.reg2mem br label LBL_8 LBL_8: %rax.0.reload = load i64, i64* %rax.0.reg2mem ret i64 %rax.0.reload uselistorder i64 %sv_0.03.reload, { 1, 0 } uselistorder i64* %0, { 1, 0, 3, 2 } uselistorder i8* %.reg2mem, { 2, 0, 1 } uselistorder i64* %sv_0.03.reg2mem, { 2, 0, 1 } uselistorder i64* %sv_0.02.reg2mem, { 0, 1, 3, 2 } uselistorder i8 0, { 1, 0, 2, 3 } uselistorder label LBL_7, { 0, 2, 1 } uselistorder label LBL_4, { 1, 0 } }
1