; LLVM IR from MostafaTwfiq/C-DataStructures-And-Algorithms :: Unit Test/Tests/DataStructuresTests/TreesTest/RedBlackTreeTest (RedBlackTreeTest)

; Unoptimized IR (clang -disable-llvm-passes):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

%struct.ErrorTestStruct = type { i32 }
%struct.RBTree = type { ptr, i32, ptr, ptr }

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local global ptr, align 8
@__const.testRBTreeInsertAll.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) #0

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: nounwind allocsize(0)
declare noalias ptr @malloc(i64 noundef) #2

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @compareIntPointersRBTT(ptr noundef, ptr noundef) #0

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) #3

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) #3

; Function Attrs: nounwind
declare void @free(ptr noundef) #4

declare void @destroyRBTree(ptr noundef) #3

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidRBTree(ptr noundef, ptr noundef, i32 noundef) #0

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidBinaryTreeRBTT(ptr noundef, ptr noundef) #0

; Function Attrs: nocallback nofree nounwind willreturn memory(argmem: readwrite)
declare void @llvm.memcpy.p0.p0.i64(ptr noalias nocapture writeonly, ptr noalias nocapture readonly, i64, i1 immarg) #5

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeInsertAll(ptr noundef %0) #0 {
  %2 = alloca ptr, align 8
  %3 = alloca ptr, align 8
  %4 = alloca [13 x i32], align 16
  %5 = alloca ptr, align 8
  %6 = alloca i32, align 4
  %7 = alloca i32, align 4
  store ptr %0, ptr %2, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %3) #6
  %8 = call ptr @redBlackTreeInitialization(ptr noundef @free, ptr noundef @compareIntPointersRBTT)
  store ptr %8, ptr %3, align 8, !tbaa !5
  call void @rBInsertAll(ptr noundef null, ptr noundef null, i32 noundef 0)
  %9 = load ptr, ptr %2, align 8, !tbaa !5
  %10 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %11 = getelementptr inbounds %struct.ErrorTestStruct, ptr %10, i32 0, i32 0
  %12 = load i32, ptr %11, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %9, ptr noundef @.str, i32 noundef 191, ptr noundef null, i32 noundef -83386157, i32 noundef %12)
  %13 = load ptr, ptr %3, align 8, !tbaa !5
  call void @rBInsertAll(ptr noundef %13, ptr noundef null, i32 noundef 0)
  %14 = load ptr, ptr %2, align 8, !tbaa !5
  %15 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %16 = getelementptr inbounds %struct.ErrorTestStruct, ptr %15, i32 0, i32 0
  %17 = load i32, ptr %16, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %14, ptr noundef @.str, i32 noundef 194, ptr noundef null, i32 noundef -83384987, i32 noundef %17)
  call void @llvm.lifetime.start.p0(i64 52, ptr %4) #6
  call void @llvm.memcpy.p0.p0.i64(ptr align 16 %4, ptr align 16 @__const.testRBTreeInsertAll.valuesArr, i64 52, i1 false)
  call void @llvm.lifetime.start.p0(i64 8, ptr %5) #6
  %18 = call noalias ptr @malloc(i64 noundef 104) #7
  store ptr %18, ptr %5, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #6
  store i32 0, ptr %6, align 4, !tbaa !12
  br label %19

19:                                               ; preds = %33, %1
  %20 = load i32, ptr %6, align 4, !tbaa !12
  %21 = icmp slt i32 %20, 13
  br i1 %21, label %23, label %22

22:                                               ; preds = %19
  call void @llvm.lifetime.end.p0(i64 4, ptr %6) #6
  br label %36

23:                                               ; preds = %19
  %24 = load i32, ptr %6, align 4, !tbaa !12
  %25 = sext i32 %24 to i64
  %26 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 %25
  %27 = load i32, ptr %26, align 4, !tbaa !12
  %28 = call ptr @generateIntPointerRBTT(i32 noundef %27)
  %29 = load ptr, ptr %5, align 8, !tbaa !5
  %30 = load i32, ptr %6, align 4, !tbaa !12
  %31 = sext i32 %30 to i64
  %32 = getelementptr inbounds ptr, ptr %29, i64 %31
  store ptr %28, ptr %32, align 8, !tbaa !5
  br label %33

33:                                               ; preds = %23
  %34 = load i32, ptr %6, align 4, !tbaa !12
  %35 = add nsw i32 %34, 1
  store i32 %35, ptr %6, align 4, !tbaa !12
  br label %19, !llvm.loop !13

36:                                               ; preds = %22
  %37 = load ptr, ptr %3, align 8, !tbaa !5
  %38 = load ptr, ptr %5, align 8, !tbaa !5
  call void @rBInsertAll(ptr noundef %37, ptr noundef %38, i32 noundef 13)
  %39 = load ptr, ptr %2, align 8, !tbaa !5
  %40 = load ptr, ptr %3, align 8, !tbaa !5
  %41 = getelementptr inbounds %struct.RBTree, ptr %40, i32 0, i32 0
  %42 = load ptr, ptr %41, align 8, !tbaa !15
  %43 = call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %42, ptr noundef null)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %39, ptr noundef @.str, i32 noundef 205, ptr noundef null, i32 noundef 1, i32 noundef %43)
  %44 = load ptr, ptr %2, align 8, !tbaa !5
  %45 = load ptr, ptr %3, align 8, !tbaa !5
  %46 = getelementptr inbounds %struct.RBTree, ptr %45, i32 0, i32 0
  %47 = load ptr, ptr %46, align 8, !tbaa !15
  %48 = call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %47, i32 noundef 0)
  %49 = icmp eq i32 %48, -1
  %50 = zext i1 %49 to i64
  %51 = select i1 %49, i32 0, i32 1
  call void @CuAssertIntEquals_LineMsg(ptr noundef %44, ptr noundef @.str, i32 noundef 206, ptr noundef null, i32 noundef 1, i32 noundef %51)
  call void @llvm.lifetime.start.p0(i64 4, ptr %7) #6
  store i32 0, ptr %7, align 4, !tbaa !12
  br label %52

52:                                               ; preds = %65, %36
  %53 = load i32, ptr %7, align 4, !tbaa !12
  %54 = icmp slt i32 %53, 13
  br i1 %54, label %56, label %55

55:                                               ; preds = %52
  call void @llvm.lifetime.end.p0(i64 4, ptr %7) #6
  br label %68

56:                                               ; preds = %52
  %57 = load ptr, ptr %2, align 8, !tbaa !5
  %58 = load ptr, ptr %3, align 8, !tbaa !5
  %59 = load ptr, ptr %5, align 8, !tbaa !5
  %60 = load i32, ptr %7, align 4, !tbaa !12
  %61 = sext i32 %60 to i64
  %62 = getelementptr inbounds ptr, ptr %59, i64 %61
  %63 = load ptr, ptr %62, align 8, !tbaa !5
  %64 = call i32 @rBTreeContains(ptr noundef %58, ptr noundef %63)
  call void @CuAssertIntEquals_LineMsg(ptr noundef %57, ptr noundef @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %64)
  br label %65

65:                                               ; preds = %56
  %66 = load i32, ptr %7, align 4, !tbaa !12
  %67 = add nsw i32 %66, 1
  store i32 %67, ptr %7, align 4, !tbaa !12
  br label %52, !llvm.loop !17

68:                                               ; preds = %55
  %69 = load ptr, ptr %5, align 8, !tbaa !5
  call void @free(ptr noundef %69) #6
  %70 = load ptr, ptr %3, align 8, !tbaa !5
  call void @destroyRBTree(ptr noundef %70)
  call void @llvm.lifetime.end.p0(i64 8, ptr %5) #6
  call void @llvm.lifetime.end.p0(i64 52, ptr %4) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %3) #6
  ret void
}

declare void @rBInsertAll(ptr noundef, ptr noundef, i32 noundef) #3

declare i32 @rBTreeContains(ptr noundef, ptr noundef) #3

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { nounwind allocsize(0) "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #4 = { nounwind "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #5 = { nocallback nofree nounwind willreturn memory(argmem: readwrite) }
attributes #6 = { nounwind }
attributes #7 = { nounwind allocsize(0) }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"any pointer", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}
!13 = distinct !{!13, !14}
!14 = !{!"llvm.loop.mustprogress"}
!15 = !{!16, !6, i64 0}
!16 = !{!"RBTree", !6, i64 0, !11, i64 8, !6, i64 16, !6, i64 24}
!17 = distinct !{!17, !14}


; Optimized IR (opt -passes='default<O3>'):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local local_unnamed_addr global ptr, align 8
@__const.testRBTreeInsertAll.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) local_unnamed_addr #0

; Function Attrs: mustprogress nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(inaccessiblemem: readwrite)
declare noalias noundef ptr @malloc(i64 noundef) local_unnamed_addr #1

; Function Attrs: nounwind uwtable
declare dso_local i32 @compareIntPointersRBTT(ptr noundef, ptr noundef) #0

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) local_unnamed_addr #2

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite)
declare void @free(ptr allocptr nocapture noundef) #3

declare void @destroyRBTree(ptr noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidRBTree(ptr noundef, ptr noundef, i32 noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
declare dso_local i32 @checkIfValidBinaryTreeRBTT(ptr noundef, ptr noundef) local_unnamed_addr #0

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreeInsertAll(ptr noundef %0) local_unnamed_addr #0 {
  %2 = tail call ptr @redBlackTreeInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersRBTT) #4
  tail call void @rBInsertAll(ptr noundef null, ptr noundef null, i32 noundef 0) #4
  %3 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %4 = load i32, ptr %3, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 191, ptr noundef null, i32 noundef -83386157, i32 noundef %4) #4
  tail call void @rBInsertAll(ptr noundef %2, ptr noundef null, i32 noundef 0) #4
  %5 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %6 = load i32, ptr %5, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 194, ptr noundef null, i32 noundef -83384987, i32 noundef %6) #4
  %7 = tail call noalias dereferenceable_or_null(104) ptr @malloc(i64 noundef 104) #5
  %8 = load i32, ptr @__const.testRBTreeInsertAll.valuesArr, align 16, !tbaa !12
  %9 = tail call ptr @generateIntPointerRBTT(i32 noundef %8)
  store ptr %9, ptr %7, align 8, !tbaa !5
  %10 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 4), align 4, !tbaa !12
  %11 = tail call ptr @generateIntPointerRBTT(i32 noundef %10)
  %12 = getelementptr inbounds i8, ptr %7, i64 8
  store ptr %11, ptr %12, align 8, !tbaa !5
  %13 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 8), align 8, !tbaa !12
  %14 = tail call ptr @generateIntPointerRBTT(i32 noundef %13)
  %15 = getelementptr inbounds i8, ptr %7, i64 16
  store ptr %14, ptr %15, align 8, !tbaa !5
  %16 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 12), align 4, !tbaa !12
  %17 = tail call ptr @generateIntPointerRBTT(i32 noundef %16)
  %18 = getelementptr inbounds i8, ptr %7, i64 24
  store ptr %17, ptr %18, align 8, !tbaa !5
  %19 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 16), align 16, !tbaa !12
  %20 = tail call ptr @generateIntPointerRBTT(i32 noundef %19)
  %21 = getelementptr inbounds i8, ptr %7, i64 32
  store ptr %20, ptr %21, align 8, !tbaa !5
  %22 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 20), align 4, !tbaa !12
  %23 = tail call ptr @generateIntPointerRBTT(i32 noundef %22)
  %24 = getelementptr inbounds i8, ptr %7, i64 40
  store ptr %23, ptr %24, align 8, !tbaa !5
  %25 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 24), align 8, !tbaa !12
  %26 = tail call ptr @generateIntPointerRBTT(i32 noundef %25)
  %27 = getelementptr inbounds i8, ptr %7, i64 48
  store ptr %26, ptr %27, align 8, !tbaa !5
  %28 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 28), align 4, !tbaa !12
  %29 = tail call ptr @generateIntPointerRBTT(i32 noundef %28)
  %30 = getelementptr inbounds i8, ptr %7, i64 56
  store ptr %29, ptr %30, align 8, !tbaa !5
  %31 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 32), align 16, !tbaa !12
  %32 = tail call ptr @generateIntPointerRBTT(i32 noundef %31)
  %33 = getelementptr inbounds i8, ptr %7, i64 64
  store ptr %32, ptr %33, align 8, !tbaa !5
  %34 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 36), align 4, !tbaa !12
  %35 = tail call ptr @generateIntPointerRBTT(i32 noundef %34)
  %36 = getelementptr inbounds i8, ptr %7, i64 72
  store ptr %35, ptr %36, align 8, !tbaa !5
  %37 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 40), align 8, !tbaa !12
  %38 = tail call ptr @generateIntPointerRBTT(i32 noundef %37)
  %39 = getelementptr inbounds i8, ptr %7, i64 80
  store ptr %38, ptr %39, align 8, !tbaa !5
  %40 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 44), align 4, !tbaa !12
  %41 = tail call ptr @generateIntPointerRBTT(i32 noundef %40)
  %42 = getelementptr inbounds i8, ptr %7, i64 88
  store ptr %41, ptr %42, align 8, !tbaa !5
  %43 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreeInsertAll.valuesArr, i64 48), align 16, !tbaa !12
  %44 = tail call ptr @generateIntPointerRBTT(i32 noundef %43)
  %45 = getelementptr inbounds i8, ptr %7, i64 96
  store ptr %44, ptr %45, align 8, !tbaa !5
  tail call void @rBInsertAll(ptr noundef %2, ptr noundef nonnull %7, i32 noundef 13) #4
  %46 = load ptr, ptr %2, align 8, !tbaa !13
  %47 = tail call i32 @checkIfValidBinaryTreeRBTT(ptr noundef %46, ptr noundef null)
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 205, ptr noundef null, i32 noundef 1, i32 noundef %47) #4
  %48 = load ptr, ptr %2, align 8, !tbaa !13
  %49 = tail call i32 @checkIfValidRBTree(ptr noundef null, ptr noundef %48, i32 noundef 0)
  %50 = icmp ne i32 %49, -1
  %51 = zext i1 %50 to i32
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 206, ptr noundef null, i32 noundef 1, i32 noundef %51) #4
  %52 = load ptr, ptr %7, align 8, !tbaa !5
  %53 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %52) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %53) #4
  %54 = load ptr, ptr %12, align 8, !tbaa !5
  %55 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %54) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %55) #4
  %56 = load ptr, ptr %15, align 8, !tbaa !5
  %57 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %56) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %57) #4
  %58 = load ptr, ptr %18, align 8, !tbaa !5
  %59 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %58) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %59) #4
  %60 = load ptr, ptr %21, align 8, !tbaa !5
  %61 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %60) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %61) #4
  %62 = load ptr, ptr %24, align 8, !tbaa !5
  %63 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %62) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %63) #4
  %64 = load ptr, ptr %27, align 8, !tbaa !5
  %65 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %64) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %65) #4
  %66 = load ptr, ptr %30, align 8, !tbaa !5
  %67 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %66) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %67) #4
  %68 = load ptr, ptr %33, align 8, !tbaa !5
  %69 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %68) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %69) #4
  %70 = load ptr, ptr %36, align 8, !tbaa !5
  %71 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %70) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %71) #4
  %72 = load ptr, ptr %39, align 8, !tbaa !5
  %73 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %72) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %73) #4
  %74 = load ptr, ptr %42, align 8, !tbaa !5
  %75 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %74) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %75) #4
  %76 = load ptr, ptr %45, align 8, !tbaa !5
  %77 = tail call i32 @rBTreeContains(ptr noundef nonnull %2, ptr noundef %76) #4
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 209, ptr noundef null, i32 noundef 1, i32 noundef %77) #4
  tail call void @free(ptr noundef %7) #4
  tail call void @destroyRBTree(ptr noundef nonnull %2) #4
  ret void
}

declare void @rBInsertAll(ptr noundef, ptr noundef, i32 noundef) local_unnamed_addr #2

declare i32 @rBTreeContains(ptr noundef, ptr noundef) local_unnamed_addr #2

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { mustprogress nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(inaccessiblemem: readwrite) "alloc-family"="malloc" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #2 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite) "alloc-family"="malloc" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #4 = { nounwind }
attributes #5 = { nounwind allocsize(0) }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"any pointer", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}
!13 = !{!14, !6, i64 0}
!14 = !{!"RBTree", !6, i64 0, !11, i64 8, !6, i64 16, !6, i64 24}


; Effective O3 passes: EarlyCSEPass,GVNPass,GlobalOptPass,IndVarSimplifyPass,InferAlignmentPass,InferFunctionAttrsPass,InstCombinePass,LoopRotatePass,SROAPass,SimplifyCFGPass,TailCallElimPass