Given two coprime polynomials P and Q in Z[x,y] of degree at most d and coefficients of bitsize at most τ, we address the problem of computing a triangular decomposition {(Ui(x),Vi(x,y))}i∈I of the system {P,Q}. The state-of-the-art worst-case bit complexity for computing such triangular decompositions when the curves defined by the input polynomials do not have common vertical asymptotes is in O~B(d6+d5τ) [Bouzidi et al. 2015, Prop. 16], where O~ refers to the complexity where polylogarithmic factors are omitted and OB refers to the bit complexity. We show that the same worst-case bit complexity can be achieved even when the curves defined by the input polynomials may have common vertical asymptotes.We actually present a refined bit complexity in O~B(dx3dy3+(dx2dy3+dxdy4)τ) where dx and dy bound the degrees of P and Q in x and y, respectively. We also prove that the total bitsize of the decomposition is in O~((dx2dy3+dxdy4)τ)