Index: lib/Analysis/DependenceAnalysis.cpp
===================================================================
--- lib/Analysis/DependenceAnalysis.cpp
+++ lib/Analysis/DependenceAnalysis.cpp
@@ -3337,12 +3337,15 @@
       SrcGEP->getPointerOperandType() == DstGEP->getPointerOperandType()) {
     const SCEV *SrcPtrSCEV = SE->getSCEV(SrcGEP->getPointerOperand());
     const SCEV *DstPtrSCEV = SE->getSCEV(DstGEP->getPointerOperand());
+    const SCEV *DiffSCEV = SE->getMinusSCEV(SrcPtrSCEV, DstPtrSCEV);
     DEBUG(dbgs() << "    SrcPtrSCEV = " << *SrcPtrSCEV << "\n");
     DEBUG(dbgs() << "    DstPtrSCEV = " << *DstPtrSCEV << "\n");
+    DEBUG(dbgs() << "    DiffSCEV = " << *DiffSCEV << "\n");
 
     UsefulGEP = isLoopInvariant(SrcPtrSCEV, LI->getLoopFor(Src->getParent())) &&
                 isLoopInvariant(DstPtrSCEV, LI->getLoopFor(Dst->getParent())) &&
-                (SrcGEP->getNumOperands() == DstGEP->getNumOperands());
+                (SrcGEP->getNumOperands() == DstGEP->getNumOperands()) &&
+                DiffSCEV->isZero();
   }
   unsigned Pairs = UsefulGEP ? SrcGEP->idx_end() - SrcGEP->idx_begin() : 1;
   SmallVector<Subscript, 4> Pair(Pairs);
Index: test/Analysis/DependenceAnalysis/BasePtrBug.ll
===================================================================
--- test/Analysis/DependenceAnalysis/BasePtrBug.ll
+++ test/Analysis/DependenceAnalysis/BasePtrBug.ll
@@ -0,0 +1,39 @@
+; RUN: opt < %s -analyze -basicaa -da  | FileCheck %s
+
+; Check that we do not produce an input dependence of distance 0 for top[i] and bot[i]
+; c source code
+; void foo(int *A, int *B, int N) {
+;   int *top = A;
+;  int *bot = A + N/2;
+;   for (int i = 0; i < N; i++)
+;     B[i] = top[i] + bot[i];
+; }
+
+; CHECK: da analyze - consistent input [*|<]!
+
+define void @foo(i32* nocapture %A, i32* nocapture %B, i32 %N) #0 {
+entry:
+  %cmp9 = icmp sgt i32 %N, 0
+  br i1 %cmp9, label %for.body.lr.ph, label %for.end
+
+for.body.lr.ph:
+  %div = sdiv i32 %N, 2
+  %bot.gep = getelementptr i32, i32* %A, i32 %div
+  br label %for.body
+
+for.body:
+  %i = phi i32 [ 0, %for.body.lr.ph ], [ %inc, %for.body ]
+  %gep.0 = getelementptr i32, i32* %A, i32 %i
+  %gep.1 = getelementptr i32, i32* %bot.gep, i32 %i
+  %gep.B = getelementptr i32, i32* %B, i32 %i
+  %0 = load i32, i32* %gep.0, align 4
+  %1 = load i32, i32* %gep.1, align 4
+  %add = add nsw i32 %1, %0
+  store i32 %add, i32* %gep.B, align 4
+  %inc = add nsw i32 %i, 1
+  %exitcond = icmp eq i32 %inc, %N
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:
+  ret void
+}
Index: test/Analysis/DependenceAnalysis/BasePtrBug1.ll
===================================================================
--- test/Analysis/DependenceAnalysis/BasePtrBug1.ll
+++ test/Analysis/DependenceAnalysis/BasePtrBug1.ll
@@ -0,0 +1,39 @@
+; RUN: opt < %s -analyze -basicaa -da | FileCheck %s
+
+; Check that the dependence analysis generate the correct result when using
+; an aliased object that points to a difference element in the array.
+; void example_B(int *A, unsigned n) {
+;  int *B = A + 1;
+;  for (unsigned i = 0; i < n; ++i) {
+;    A[i] = B[i];
+;  }
+; }
+
+; CHECK: da analyze - consistent anti [1]!
+
+define void @example_B(i32*, i32) #3 {
+  %3 = getelementptr inbounds i32, i32* %0, i64 1
+  br label %4
+
+; <label>:4:
+  %.0 = phi i32 [ 0, %2 ], [ %14, %13 ]
+  %5 = sub i32 %1, 1
+  %6 = icmp ult i32 %.0, %5
+  br i1 %6, label %7, label %15
+
+; <label>:7:
+  %8 = zext i32 %.0 to i64
+  %9 = getelementptr inbounds i32, i32* %3, i64 %8
+  %10 = load i32, i32* %9, align 4
+  %11 = zext i32 %.0 to i64
+  %12 = getelementptr inbounds i32, i32* %0, i64 %11
+  store i32 %10, i32* %12, align 4
+  br label %13
+
+; <label>:13:
+  %14 = add i32 %.0, 1
+  br label %4
+
+; <label>:15:
+  ret void
+}
\ No newline at end of file