Dijkstra's algorithm on a graph with one negative edge

Given the directed, weighted edges A→B (weight 1), A→C (weight 4), C→B (weight -10), run standard Dijkstra from source A: extract-min a vertex, finalize its distance, relax its outgoing edges, never reconsider a finalized vertex. What distance does Dijkstra report for B, and is it correct?

graph.txt
A --1--> B
A --4--> C
C --(-10)--> B

17 of 46 in Data Structures & Algorithms