; LLVM IR from stivalaa/EstimNetDirected :: Test/TestChangeStatsAttrBipartite (attrbipartiteStats)

; 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.graph_s = type { i32, i32, i32, i32, ptr, ptr, ptr, ptr, ptr, i32, ptr, ptr, ptr, i32, i32, i32, ptr, ptr, i32, ptr, ptr, i32, ptr, ptr, i32, ptr, ptr, ptr, i32, i32, i32, i32, i32, ptr, i32, i32, ptr, ptr, i32, ptr, i32, ptr, ptr, i32, i32, ptr, i32, ptr }

@.str = external hidden unnamed_addr constant [16 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [114 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [16 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [36 x i8], align 1
@__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA = external hidden unnamed_addr constant [69 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [36 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [36 x i8], align 1

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

; Function Attrs: noreturn nounwind
declare void @__assert_fail(ptr noundef, ptr noundef, i32 noundef, ptr noundef) #1

declare i32 @bipartite_node_mode(ptr noundef, i32 noundef) #2

; Function Attrs: nounwind uwtable
declare hidden i32 @count_neighbours_with_binattr_a(ptr noundef, i32 noundef, i32 noundef) #3

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

; Function Attrs: nounwind uwtable
define dso_local double @BipartiteTwoPathExactlyOneNeighbourA(ptr noundef %0, i32 noundef %1) #3 {
  %3 = alloca ptr, align 8
  %4 = alloca i32, align 4
  %5 = alloca i32, align 4
  %6 = alloca i32, align 4
  %7 = alloca i32, align 4
  %8 = alloca i32, align 4
  %9 = alloca i32, align 4
  %10 = alloca i32, align 4
  store ptr %0, ptr %3, align 8, !tbaa !5
  store i32 %1, ptr %4, align 4, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 4, ptr %5) #4
  call void @llvm.lifetime.start.p0(i64 4, ptr %6) #4
  call void @llvm.lifetime.start.p0(i64 4, ptr %7) #4
  call void @llvm.lifetime.start.p0(i64 4, ptr %8) #4
  call void @llvm.lifetime.start.p0(i64 4, ptr %9) #4
  call void @llvm.lifetime.start.p0(i64 4, ptr %10) #4
  store i32 0, ptr %10, align 4, !tbaa !9
  %11 = load ptr, ptr %3, align 8, !tbaa !5
  %12 = getelementptr inbounds %struct.graph_s, ptr %11, i32 0, i32 2
  %13 = load i32, ptr %12, align 8, !tbaa !11
  %14 = icmp ne i32 %13, 0
  br i1 %14, label %15, label %16

15:                                               ; preds = %2
  br label %17

16:                                               ; preds = %2
  call void @__assert_fail(ptr noundef @.str, ptr noundef @.str.1, i32 noundef 118, ptr noundef @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #5
  unreachable

17:                                               ; preds = %15
  %18 = load ptr, ptr %3, align 8, !tbaa !5
  %19 = getelementptr inbounds %struct.graph_s, ptr %18, i32 0, i32 1
  %20 = load i32, ptr %19, align 4, !tbaa !13
  %21 = icmp ne i32 %20, 0
  br i1 %21, label %23, label %22

22:                                               ; preds = %17
  br label %24

23:                                               ; preds = %17
  call void @__assert_fail(ptr noundef @.str.2, ptr noundef @.str.1, i32 noundef 119, ptr noundef @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #5
  unreachable

24:                                               ; preds = %22
  store i32 0, ptr %5, align 4, !tbaa !9
  br label %25

25:                                               ; preds = %138, %24
  %26 = load i32, ptr %5, align 4, !tbaa !9
  %27 = load ptr, ptr %3, align 8, !tbaa !5
  %28 = getelementptr inbounds %struct.graph_s, ptr %27, i32 0, i32 13
  %29 = load i32, ptr %28, align 8, !tbaa !14
  %30 = icmp ult i32 %26, %29
  br i1 %30, label %31, label %141

31:                                               ; preds = %25
  %32 = load ptr, ptr %3, align 8, !tbaa !5
  %33 = load i32, ptr %5, align 4, !tbaa !9
  %34 = call i32 @bipartite_node_mode(ptr noundef %32, i32 noundef %33)
  %35 = icmp eq i32 %34, 0
  br i1 %35, label %36, label %37

36:                                               ; preds = %31
  br label %38

37:                                               ; preds = %31
  call void @__assert_fail(ptr noundef @.str.3, ptr noundef @.str.1, i32 noundef 121, ptr noundef @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #5
  unreachable

38:                                               ; preds = %36
  %39 = load ptr, ptr %3, align 8, !tbaa !5
  %40 = load i32, ptr %5, align 4, !tbaa !9
  %41 = load i32, ptr %4, align 4, !tbaa !9
  %42 = call i32 @count_neighbours_with_binattr_a(ptr noundef %39, i32 noundef %40, i32 noundef %41)
  %43 = icmp ne i32 %42, 1
  br i1 %43, label %44, label %45

44:                                               ; preds = %38
  br label %138

45:                                               ; preds = %38
  %46 = load i32, ptr %5, align 4, !tbaa !9
  %47 = add i32 %46, 1
  store i32 %47, ptr %6, align 4, !tbaa !9
  br label %48

48:                                               ; preds = %134, %45
  %49 = load i32, ptr %6, align 4, !tbaa !9
  %50 = load ptr, ptr %3, align 8, !tbaa !5
  %51 = getelementptr inbounds %struct.graph_s, ptr %50, i32 0, i32 13
  %52 = load i32, ptr %51, align 8, !tbaa !14
  %53 = icmp ult i32 %49, %52
  br i1 %53, label %54, label %137

54:                                               ; preds = %48
  %55 = load ptr, ptr %3, align 8, !tbaa !5
  %56 = load i32, ptr %6, align 4, !tbaa !9
  %57 = call i32 @bipartite_node_mode(ptr noundef %55, i32 noundef %56)
  %58 = icmp eq i32 %57, 0
  br i1 %58, label %59, label %60

59:                                               ; preds = %54
  br label %61

60:                                               ; preds = %54
  call void @__assert_fail(ptr noundef @.str.5, ptr noundef @.str.1, i32 noundef 125, ptr noundef @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #5
  unreachable

61:                                               ; preds = %59
  %62 = load ptr, ptr %3, align 8, !tbaa !5
  %63 = load i32, ptr %6, align 4, !tbaa !9
  %64 = load i32, ptr %4, align 4, !tbaa !9
  %65 = call i32 @count_neighbours_with_binattr_a(ptr noundef %62, i32 noundef %63, i32 noundef %64)
  %66 = icmp ne i32 %65, 1
  br i1 %66, label %67, label %68

67:                                               ; preds = %61
  br label %134

68:                                               ; preds = %61
  store i32 0, ptr %7, align 4, !tbaa !9
  br label %69

69:                                               ; preds = %130, %68
  %70 = load i32, ptr %7, align 4, !tbaa !9
  %71 = load ptr, ptr %3, align 8, !tbaa !5
  %72 = getelementptr inbounds %struct.graph_s, ptr %71, i32 0, i32 10
  %73 = load ptr, ptr %72, align 8, !tbaa !15
  %74 = load i32, ptr %5, align 4, !tbaa !9
  %75 = zext i32 %74 to i64
  %76 = getelementptr inbounds i32, ptr %73, i64 %75
  %77 = load i32, ptr %76, align 4, !tbaa !9
  %78 = icmp ult i32 %70, %77
  br i1 %78, label %79, label %133

79:                                               ; preds = %69
  %80 = load ptr, ptr %3, align 8, !tbaa !5
  %81 = getelementptr inbounds %struct.graph_s, ptr %80, i32 0, i32 11
  %82 = load ptr, ptr %81, align 8, !tbaa !16
  %83 = load i32, ptr %5, align 4, !tbaa !9
  %84 = zext i32 %83 to i64
  %85 = getelementptr inbounds ptr, ptr %82, i64 %84
  %86 = load ptr, ptr %85, align 8, !tbaa !5
  %87 = load i32, ptr %7, align 4, !tbaa !9
  %88 = zext i32 %87 to i64
  %89 = getelementptr inbounds i32, ptr %86, i64 %88
  %90 = load i32, ptr %89, align 4, !tbaa !9
  store i32 %90, ptr %9, align 4, !tbaa !9
  %91 = load ptr, ptr %3, align 8, !tbaa !5
  %92 = load i32, ptr %9, align 4, !tbaa !9
  %93 = call i32 @bipartite_node_mode(ptr noundef %91, i32 noundef %92)
  %94 = icmp eq i32 %93, 1
  br i1 %94, label %95, label %96

95:                                               ; preds = %79
  br label %97

96:                                               ; preds = %79
  call void @__assert_fail(ptr noundef @.str.6, ptr noundef @.str.1, i32 noundef 130, ptr noundef @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #5
  unreachable

97:                                               ; preds = %95
  store i32 0, ptr %8, align 4, !tbaa !9
  br label %98

98:                                               ; preds = %126, %97
  %99 = load i32, ptr %8, align 4, !tbaa !9
  %100 = load ptr, ptr %3, align 8, !tbaa !5
  %101 = getelementptr inbounds %struct.graph_s, ptr %100, i32 0, i32 10
  %102 = load ptr, ptr %101, align 8, !tbaa !15
  %103 = load i32, ptr %6, align 4, !tbaa !9
  %104 = zext i32 %103 to i64
  %105 = getelementptr inbounds i32, ptr %102, i64 %104
  %106 = load i32, ptr %105, align 4, !tbaa !9
  %107 = icmp ult i32 %99, %106
  br i1 %107, label %108, label %129

108:                                              ; preds = %98
  %109 = load ptr, ptr %3, align 8, !tbaa !5
  %110 = getelementptr inbounds %struct.graph_s, ptr %109, i32 0, i32 11
  %111 = load ptr, ptr %110, align 8, !tbaa !16
  %112 = load i32, ptr %6, align 4, !tbaa !9
  %113 = zext i32 %112 to i64
  %114 = getelementptr inbounds ptr, ptr %111, i64 %113
  %115 = load ptr, ptr %114, align 8, !tbaa !5
  %116 = load i32, ptr %8, align 4, !tbaa !9
  %117 = zext i32 %116 to i64
  %118 = getelementptr inbounds i32, ptr %115, i64 %117
  %119 = load i32, ptr %118, align 4, !tbaa !9
  %120 = load i32, ptr %9, align 4, !tbaa !9
  %121 = icmp eq i32 %119, %120
  br i1 %121, label %122, label %125

122:                                              ; preds = %108
  %123 = load i32, ptr %10, align 4, !tbaa !9
  %124 = add i32 %123, 1
  store i32 %124, ptr %10, align 4, !tbaa !9
  br label %125

125:                                              ; preds = %122, %108
  br label %126

126:                                              ; preds = %125
  %127 = load i32, ptr %8, align 4, !tbaa !9
  %128 = add i32 %127, 1
  store i32 %128, ptr %8, align 4, !tbaa !9
  br label %98, !llvm.loop !17

129:                                              ; preds = %98
  br label %130

130:                                              ; preds = %129
  %131 = load i32, ptr %7, align 4, !tbaa !9
  %132 = add i32 %131, 1
  store i32 %132, ptr %7, align 4, !tbaa !9
  br label %69, !llvm.loop !19

133:                                              ; preds = %69
  br label %134

134:                                              ; preds = %133, %67
  %135 = load i32, ptr %6, align 4, !tbaa !9
  %136 = add i32 %135, 1
  store i32 %136, ptr %6, align 4, !tbaa !9
  br label %48, !llvm.loop !20

137:                                              ; preds = %48
  br label %138

138:                                              ; preds = %137, %44
  %139 = load i32, ptr %5, align 4, !tbaa !9
  %140 = add i32 %139, 1
  store i32 %140, ptr %5, align 4, !tbaa !9
  br label %25, !llvm.loop !21

141:                                              ; preds = %25
  %142 = load i32, ptr %10, align 4, !tbaa !9
  %143 = uitofp i32 %142 to double
  call void @llvm.lifetime.end.p0(i64 4, ptr %10) #4
  call void @llvm.lifetime.end.p0(i64 4, ptr %9) #4
  call void @llvm.lifetime.end.p0(i64 4, ptr %8) #4
  call void @llvm.lifetime.end.p0(i64 4, ptr %7) #4
  call void @llvm.lifetime.end.p0(i64 4, ptr %6) #4
  call void @llvm.lifetime.end.p0(i64 4, ptr %5) #4
  ret double %143
}

attributes #0 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #1 = { noreturn 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 #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 = { 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 #4 = { nounwind }
attributes #5 = { noreturn nounwind }

!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, !10, i64 0}
!10 = !{!"int", !7, i64 0}
!11 = !{!12, !10, i64 8}
!12 = !{!"graph_s", !10, i64 0, !10, i64 4, !10, i64 8, !10, i64 12, !6, i64 16, !6, i64 24, !6, i64 32, !6, i64 40, !6, i64 48, !10, i64 56, !6, i64 64, !6, i64 72, !6, i64 80, !10, i64 88, !10, i64 92, !10, i64 96, !6, i64 104, !6, i64 112, !10, i64 120, !6, i64 128, !6, i64 136, !10, i64 144, !6, i64 152, !6, i64 160, !10, i64 168, !6, i64 176, !6, i64 184, !6, i64 192, !10, i64 200, !10, i64 204, !10, i64 208, !10, i64 212, !10, i64 216, !6, i64 224, !10, i64 232, !10, i64 236, !6, i64 240, !6, i64 248, !10, i64 256, !6, i64 264, !10, i64 272, !6, i64 280, !6, i64 288, !10, i64 296, !10, i64 300, !6, i64 304, !10, i64 312, !6, i64 320}
!13 = !{!12, !10, i64 4}
!14 = !{!12, !10, i64 88}
!15 = !{!12, !6, i64 64}
!16 = !{!12, !6, i64 72}
!17 = distinct !{!17, !18}
!18 = !{!"llvm.loop.mustprogress"}
!19 = distinct !{!19, !18}
!20 = distinct !{!20, !18}
!21 = distinct !{!21, !18}


; 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 [16 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [114 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [16 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [36 x i8], align 1
@__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA = external hidden unnamed_addr constant [69 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [36 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [36 x i8], align 1

; Function Attrs: noreturn nounwind
declare void @__assert_fail(ptr noundef, ptr noundef, i32 noundef, ptr noundef) local_unnamed_addr #0

declare i32 @bipartite_node_mode(ptr noundef, i32 noundef) local_unnamed_addr #1

; Function Attrs: nounwind uwtable
declare hidden i32 @count_neighbours_with_binattr_a(ptr noundef, i32 noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
define dso_local double @BipartiteTwoPathExactlyOneNeighbourA(ptr noundef %0, i32 noundef %1) local_unnamed_addr #2 {
  %3 = getelementptr inbounds i8, ptr %0, i64 8
  %4 = load i32, ptr %3, align 8, !tbaa !5
  %.not = icmp eq i32 %4, 0
  br i1 %.not, label %5, label %6

5:                                                ; preds = %2
  tail call void @__assert_fail(ptr noundef nonnull @.str, ptr noundef nonnull @.str.1, i32 noundef 118, ptr noundef nonnull @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #4
  unreachable

6:                                                ; preds = %2
  %7 = getelementptr inbounds i8, ptr %0, i64 4
  %8 = load i32, ptr %7, align 4, !tbaa !11
  %.not41 = icmp eq i32 %8, 0
  br i1 %.not41, label %.preheader47, label %13

.preheader47:                                     ; preds = %6
  %9 = getelementptr inbounds i8, ptr %0, i64 88
  %10 = load i32, ptr %9, align 8, !tbaa !12
  %.not70 = icmp eq i32 %10, 0
  br i1 %.not70, label %._crit_edge68, label %.lr.ph67

.lr.ph67:                                         ; preds = %.preheader47
  %11 = getelementptr inbounds i8, ptr %0, i64 64
  %12 = getelementptr inbounds i8, ptr %0, i64 72
  br label %14

13:                                               ; preds = %6
  tail call void @__assert_fail(ptr noundef nonnull @.str.2, ptr noundef nonnull @.str.1, i32 noundef 119, ptr noundef nonnull @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #4
  unreachable

14:                                               ; preds = %.lr.ph67, %.loopexit46
  %indvars.iv82 = phi i64 [ 0, %.lr.ph67 ], [ %21, %.loopexit46 ]
  %indvars.iv77 = phi i64 [ 1, %.lr.ph67 ], [ %indvars.iv.next78, %.loopexit46 ]
  %.066 = phi i32 [ 0, %.lr.ph67 ], [ %.6, %.loopexit46 ]
  %15 = trunc nuw i64 %indvars.iv82 to i32
  %16 = tail call i32 @bipartite_node_mode(ptr noundef nonnull %0, i32 noundef %15) #5
  %17 = icmp eq i32 %16, 0
  br i1 %17, label %19, label %18

18:                                               ; preds = %14
  tail call void @__assert_fail(ptr noundef nonnull @.str.3, ptr noundef nonnull @.str.1, i32 noundef 121, ptr noundef nonnull @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #4
  unreachable

19:                                               ; preds = %14
  %20 = tail call i32 @count_neighbours_with_binattr_a(ptr noundef nonnull %0, i32 noundef %15, i32 noundef %1)
  %.not42 = icmp eq i32 %20, 1
  %.pre = load i32, ptr %9, align 8, !tbaa !12
  %21 = add nuw nsw i64 %indvars.iv82, 1
  %22 = zext i32 %.pre to i64
  %23 = icmp ult i64 %21, %22
  %or.cond = select i1 %.not42, i1 %23, i1 false
  br i1 %or.cond, label %.lr.ph63, label %.loopexit46

.lr.ph63:                                         ; preds = %19, %.loopexit
  %indvars.iv79 = phi i64 [ %indvars.iv.next80, %.loopexit ], [ %indvars.iv77, %19 ]
  %.161 = phi i32 [ %.5, %.loopexit ], [ %.066, %19 ]
  %24 = trunc nuw i64 %indvars.iv79 to i32
  %25 = tail call i32 @bipartite_node_mode(ptr noundef nonnull %0, i32 noundef %24) #5
  %26 = icmp eq i32 %25, 0
  br i1 %26, label %28, label %27

27:                                               ; preds = %.lr.ph63
  tail call void @__assert_fail(ptr noundef nonnull @.str.5, ptr noundef nonnull @.str.1, i32 noundef 125, ptr noundef nonnull @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #4
  unreachable

28:                                               ; preds = %.lr.ph63
  %29 = tail call i32 @count_neighbours_with_binattr_a(ptr noundef nonnull %0, i32 noundef %24, i32 noundef %1)
  %.not43 = icmp eq i32 %29, 1
  br i1 %.not43, label %.preheader44, label %.loopexit

.preheader44:                                     ; preds = %28
  %30 = load ptr, ptr %11, align 8, !tbaa !13
  %31 = getelementptr inbounds i32, ptr %30, i64 %indvars.iv82
  %32 = load i32, ptr %31, align 4, !tbaa !14
  %.not71 = icmp eq i32 %32, 0
  br i1 %.not71, label %.loopexit, label %.lr.ph58

.lr.ph58:                                         ; preds = %.preheader44, %._crit_edge
  %indvars.iv74 = phi i64 [ %indvars.iv.next75, %._crit_edge ], [ 0, %.preheader44 ]
  %.257 = phi i32 [ %.3.lcssa, %._crit_edge ], [ %.161, %.preheader44 ]
  %33 = load ptr, ptr %12, align 8, !tbaa !15
  %34 = getelementptr inbounds ptr, ptr %33, i64 %indvars.iv82
  %35 = load ptr, ptr %34, align 8, !tbaa !16
  %36 = getelementptr inbounds i32, ptr %35, i64 %indvars.iv74
  %37 = load i32, ptr %36, align 4, !tbaa !14
  %38 = tail call i32 @bipartite_node_mode(ptr noundef nonnull %0, i32 noundef %37) #5
  %39 = icmp eq i32 %38, 1
  br i1 %39, label %.preheader, label %57

.preheader:                                       ; preds = %.lr.ph58
  %40 = load ptr, ptr %11, align 8, !tbaa !13
  %41 = getelementptr inbounds i32, ptr %40, i64 %indvars.iv79
  %42 = load i32, ptr %41, align 4, !tbaa !14
  %.not72 = icmp eq i32 %42, 0
  br i1 %.not72, label %._crit_edge, label %.lr.ph

.lr.ph:                                           ; preds = %.preheader
  %43 = load ptr, ptr %12, align 8, !tbaa !15
  %44 = getelementptr inbounds ptr, ptr %43, i64 %indvars.iv79
  %45 = load ptr, ptr %44, align 8, !tbaa !16
  %wide.trip.count = zext i32 %42 to i64
  %min.iters.check = icmp ult i32 %42, 8
  br i1 %min.iters.check, label %scalar.ph.preheader, label %vector.ph

scalar.ph.preheader:                              ; preds = %middle.block, %.lr.ph
  %indvars.iv.ph = phi i64 [ 0, %.lr.ph ], [ %n.vec, %middle.block ]
  %.355.ph = phi i32 [ %.257, %.lr.ph ], [ %56, %middle.block ]
  br label %scalar.ph

vector.ph:                                        ; preds = %.lr.ph
  %n.vec = and i64 %wide.trip.count, 4294967288
  %46 = insertelement <4 x i32> <i32 poison, i32 0, i32 0, i32 0>, i32 %.257, i64 0
  %broadcast.splatinsert = insertelement <4 x i32> poison, i32 %37, i64 0
  %broadcast.splat = shufflevector <4 x i32> %broadcast.splatinsert, <4 x i32> poison, <4 x i32> zeroinitializer
  br label %vector.body

vector.body:                                      ; preds = %vector.body, %vector.ph
  %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
  %vec.phi = phi <4 x i32> [ %46, %vector.ph ], [ %53, %vector.body ]
  %vec.phi88 = phi <4 x i32> [ zeroinitializer, %vector.ph ], [ %54, %vector.body ]
  %47 = getelementptr inbounds i32, ptr %45, i64 %index
  %48 = getelementptr inbounds i8, ptr %47, i64 16
  %wide.load = load <4 x i32>, ptr %47, align 4, !tbaa !14
  %wide.load89 = load <4 x i32>, ptr %48, align 4, !tbaa !14
  %49 = icmp eq <4 x i32> %wide.load, %broadcast.splat
  %50 = icmp eq <4 x i32> %wide.load89, %broadcast.splat
  %51 = zext <4 x i1> %49 to <4 x i32>
  %52 = zext <4 x i1> %50 to <4 x i32>
  %53 = add <4 x i32> %vec.phi, %51
  %54 = add <4 x i32> %vec.phi88, %52
  %index.next = add nuw i64 %index, 8
  %55 = icmp eq i64 %index.next, %n.vec
  br i1 %55, label %middle.block, label %vector.body, !llvm.loop !17

middle.block:                                     ; preds = %vector.body
  %bin.rdx = add <4 x i32> %54, %53
  %56 = tail call i32 @llvm.vector.reduce.add.v4i32(<4 x i32> %bin.rdx)
  %cmp.n = icmp eq i64 %n.vec, %wide.trip.count
  br i1 %cmp.n, label %._crit_edge, label %scalar.ph.preheader

57:                                               ; preds = %.lr.ph58
  tail call void @__assert_fail(ptr noundef nonnull @.str.6, ptr noundef nonnull @.str.1, i32 noundef 130, ptr noundef nonnull @__PRETTY_FUNCTION__.BipartiteTwoPathExactlyOneNeighbourA) #4
  unreachable

scalar.ph:                                        ; preds = %scalar.ph.preheader, %scalar.ph
  %indvars.iv = phi i64 [ %indvars.iv.next, %scalar.ph ], [ %indvars.iv.ph, %scalar.ph.preheader ]
  %.355 = phi i32 [ %spec.select, %scalar.ph ], [ %.355.ph, %scalar.ph.preheader ]
  %58 = getelementptr inbounds i32, ptr %45, i64 %indvars.iv
  %59 = load i32, ptr %58, align 4, !tbaa !14
  %60 = icmp eq i32 %59, %37
  %61 = zext i1 %60 to i32
  %spec.select = add i32 %.355, %61
  %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
  %exitcond.not = icmp eq i64 %indvars.iv.next, %wide.trip.count
  br i1 %exitcond.not, label %._crit_edge, label %scalar.ph, !llvm.loop !21

._crit_edge:                                      ; preds = %scalar.ph, %middle.block, %.preheader
  %.3.lcssa = phi i32 [ %.257, %.preheader ], [ %56, %middle.block ], [ %spec.select, %scalar.ph ]
  %indvars.iv.next75 = add nuw nsw i64 %indvars.iv74, 1
  %62 = getelementptr inbounds i32, ptr %40, i64 %indvars.iv82
  %63 = load i32, ptr %62, align 4, !tbaa !14
  %64 = zext i32 %63 to i64
  %65 = icmp ult i64 %indvars.iv.next75, %64
  br i1 %65, label %.lr.ph58, label %.loopexit, !llvm.loop !22

.loopexit:                                        ; preds = %._crit_edge, %.preheader44, %28
  %.5 = phi i32 [ %.161, %28 ], [ %.161, %.preheader44 ], [ %.3.lcssa, %._crit_edge ]
  %indvars.iv.next80 = add nuw nsw i64 %indvars.iv79, 1
  %66 = load i32, ptr %9, align 8, !tbaa !12
  %67 = zext i32 %66 to i64
  %68 = icmp ult i64 %indvars.iv.next80, %67
  br i1 %68, label %.lr.ph63, label %.loopexit46, !llvm.loop !23

.loopexit46:                                      ; preds = %.loopexit, %19
  %.pre-phi = phi i64 [ %22, %19 ], [ %67, %.loopexit ]
  %.6 = phi i32 [ %.066, %19 ], [ %.5, %.loopexit ]
  %69 = icmp ult i64 %21, %.pre-phi
  %indvars.iv.next78 = add nuw nsw i64 %indvars.iv77, 1
  br i1 %69, label %14, label %._crit_edge68.loopexit, !llvm.loop !24

._crit_edge68.loopexit:                           ; preds = %.loopexit46
  %70 = uitofp i32 %.6 to double
  br label %._crit_edge68

._crit_edge68:                                    ; preds = %._crit_edge68.loopexit, %.preheader47
  %.0.lcssa = phi double [ 0.000000e+00, %.preheader47 ], [ %70, %._crit_edge68.loopexit ]
  ret double %.0.lcssa
}

; Function Attrs: nocallback nofree nosync nounwind speculatable willreturn memory(none)
declare i32 @llvm.vector.reduce.add.v4i32(<4 x i32>) #3

attributes #0 = { noreturn 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 #1 = { "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 = { 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 #3 = { nocallback nofree nosync nounwind speculatable willreturn memory(none) }
attributes #4 = { noreturn nounwind }
attributes #5 = { nounwind }

!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, !7, i64 8}
!6 = !{!"graph_s", !7, i64 0, !7, i64 4, !7, i64 8, !7, i64 12, !10, i64 16, !10, i64 24, !10, i64 32, !10, i64 40, !10, i64 48, !7, i64 56, !10, i64 64, !10, i64 72, !10, i64 80, !7, i64 88, !7, i64 92, !7, i64 96, !10, i64 104, !10, i64 112, !7, i64 120, !10, i64 128, !10, i64 136, !7, i64 144, !10, i64 152, !10, i64 160, !7, i64 168, !10, i64 176, !10, i64 184, !10, i64 192, !7, i64 200, !7, i64 204, !7, i64 208, !7, i64 212, !7, i64 216, !10, i64 224, !7, i64 232, !7, i64 236, !10, i64 240, !10, i64 248, !7, i64 256, !10, i64 264, !7, i64 272, !10, i64 280, !10, i64 288, !7, i64 296, !7, i64 300, !10, i64 304, !7, i64 312, !10, i64 320}
!7 = !{!"int", !8, i64 0}
!8 = !{!"omnipotent char", !9, i64 0}
!9 = !{!"Simple C/C++ TBAA"}
!10 = !{!"any pointer", !8, i64 0}
!11 = !{!6, !7, i64 4}
!12 = !{!6, !7, i64 88}
!13 = !{!6, !10, i64 64}
!14 = !{!7, !7, i64 0}
!15 = !{!6, !10, i64 72}
!16 = !{!10, !10, i64 0}
!17 = distinct !{!17, !18, !19, !20}
!18 = !{!"llvm.loop.mustprogress"}
!19 = !{!"llvm.loop.isvectorized", i32 1}
!20 = !{!"llvm.loop.unroll.runtime.disable"}
!21 = distinct !{!21, !18, !20, !19}
!22 = distinct !{!22, !18}
!23 = distinct !{!23, !18}
!24 = distinct !{!24, !18}


; Effective O3 passes: BDCEPass,CorrelatedValuePropagationPass,EarlyCSEPass,GVNPass,GlobalOptPass,IndVarSimplifyPass,InferFunctionAttrsPass,InstCombinePass,InstSimplifyPass,JumpThreadingPass,LCSSAPass,LICMPass,LoopLoadEliminationPass,LoopRotatePass,LoopSimplifyPass,LoopUnrollPass,LoopVectorizePass,ReassociatePass,SROAPass,SimplifyCFGPass,TailCallElimPass