Algorithmic detectability of iwip automorphisms

We produce an algorithm that, given $\varphi \in Out(F_N)$, where $N\ge 2$, decides wether or not $\varphi$ is an iwip (“fully irreducible”) automorphism.