Since both the triangle and the line are convex objects, they are separate (i.e. do not overlap) if and only if there exists a line so that the projections of the two objects onto the line do not overlap.
In your case it suffices to check this condition for four potential projection directions: the direction vectors of the edges, and the direction vector of the line segment.
Let $(x, y)$ be one of the four direction vectors mentioned above. Then $n := (y, -x)$ is a vector that is orthogonal to it. Calculate the dot product of $n$ with $t_0$, $t_1$ and $t_2$, which gives you three scalars. Set $t_{min}$ and $t_{max}$ to the minimum/maximum of these three. Do the same for $P_0$ and $P_1$, which gives you $p_{min}$ and $p_{max}$.
Now check the these two (min, max) ranges for overlap. If they are disjoint, your are done - the triangle and the line segment do not overlap. Otherwise, repeat the check for the next candidate direction. If the ranges overlap for all four of these, the line segment overlaps the triangle.
This procedure does not discriminate between partial overlap and inclusion (i.e. the line segment may lie entirely inside the triangle, without intersecting any of the edges). To detect the latter, test for containment rather than overlap in the (min, max) range check described above.