Consider this:
B
| \
1 | \1
| \
A -- C
| 1
+
|
D
At time t, link between A and D is broken.
A tells B & C that D is unreachable by DA(D) = inf
B computes new route to D through C. DB(D)=CB(C)+DC(D)=1+2=3. B will tell C that D is unreachable by DB(D)=inf (poisoned reverse). B still tells A it has a path to D of cost 3 (split horizon doesn't apply).
A computes new route through B. A tells C that D is now reachable
Etc…