; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 6
; RUN: opt -disable-output -passes='print<scalar-evolution>' < %s 2>&1 | FileCheck %s

; Test where the outermost loop doesn't contain exactly one latch;
; ScalarEvolution shouldn't crash in this case.

define void @f(ptr %a0) {
; CHECK-LABEL: 'f'
; CHECK-NEXT:  Classifying expressions for: @f
; CHECK-NEXT:    %phi1 = phi ptr [ null, %entry ], [ %inc, %b3 ], [ %inc, %b4 ]
; CHECK-NEXT:    --> {null,+,-32}<%b1> U: [0,-31) S: [-9223372036854775808,9223372036854775777) Exits: <<Unknown>> LoopDispositions: { %b1: Computable, %b3: Invariant }
; CHECK-NEXT:    %inc = getelementptr i8, ptr %phi1, i64 -32
; CHECK-NEXT:    --> {(-32 + null)<nuw><nsw>,+,-32}<%b1> U: [0,-31) S: [-9223372036854775808,9223372036854775777) Exits: <<Unknown>> LoopDispositions: { %b1: Computable, %b3: Invariant }
; CHECK-NEXT:    %phi2 = phi ptr [ %a0, %b2 ], [ %inc2, %b5 ]
; CHECK-NEXT:    --> {%a0,+,1}<%b3> U: full-set S: full-set Exits: ((-1 * (ptrtoint ptr %a0 to i64)) + %a0) LoopDispositions: { %b3: Computable, %b1: Uniform }
; CHECK-NEXT:    %ld1 = load i8, ptr %phi2, align 1
; CHECK-NEXT:    --> %ld1 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %b3: Variant, %b1: Variant }
; CHECK-NEXT:    %ld2 = load i8, ptr null, align 1
; CHECK-NEXT:    --> %ld2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %b3: Variant, %b1: Variant }
; CHECK-NEXT:    %inc2 = getelementptr i8, ptr %phi2, i64 1
; CHECK-NEXT:    --> {(1 + %a0),+,1}<%b3> U: full-set S: full-set Exits: (1 + (-1 * (ptrtoint ptr %a0 to i64)) + %a0) LoopDispositions: { %b3: Computable, %b1: Uniform }
; CHECK-NEXT:  Determining loop execution counts for: @f
; CHECK-NEXT:  Loop %b3: <multiple exits> backedge-taken count is (-1 * (ptrtoint ptr %a0 to i64))
; CHECK-NEXT:    exit count for b3: (-1 * (ptrtoint ptr %a0 to i64))
; CHECK-NEXT:    exit count for b4: ***COULDNOTCOMPUTE***
; CHECK-NEXT:  Loop %b3: constant max backedge-taken count is i64 -1
; CHECK-NEXT:  Loop %b3: symbolic max backedge-taken count is (-1 * (ptrtoint ptr %a0 to i64))
; CHECK-NEXT:    symbolic max exit count for b3: (-1 * (ptrtoint ptr %a0 to i64))
; CHECK-NEXT:    symbolic max exit count for b4: ***COULDNOTCOMPUTE***
; CHECK-NEXT:  Loop %b3: Trip multiple is 1
; CHECK-NEXT:  Loop %b1: Unpredictable backedge-taken count.
; CHECK-NEXT:  Loop %b1: Unpredictable constant max backedge-taken count.
; CHECK-NEXT:  Loop %b1: Unpredictable symbolic max backedge-taken count.
;
entry:
  br label %b1
b1:
  %phi1 = phi ptr [ null, %entry ], [ %inc, %b3 ], [ %inc, %b4 ]
  %cmp1 = icmp eq ptr %phi1, null
  br i1 %cmp1, label %ret, label %b2
b2:
  %inc = getelementptr i8, ptr %phi1, i64 -32
  br label %b3
b3:
  %phi2 = phi ptr [ %a0, %b2 ], [ %inc2, %b5 ]
  %cmp2 = icmp eq ptr %phi2, null
  br i1 %cmp2, label %b1, label %b4
b4:
  %ld1 = load i8, ptr %phi2, align 1
  %ld2 = load i8, ptr null, align 1
  %cmp3 = icmp slt i8 %ld1, %ld2
  br i1 false, label %b1, label %b5
b5:
  %inc2 = getelementptr i8, ptr %phi2, i64 1
  br label %b3
ret:
  ret void
}