Jullien's indecomposability theorem (INDEC) states that if a scattered countable linear order is indecomposable, then it is either indecomposable to the left, or indecomposable to the right. The theorem was shown by Montalbán to be a theorem of hyperarithmetic analysis, and then, in the base system RCA₀ plus ${\mathrm{\Sigma }}_{1}^{1}\text{\hspace{0.17em}}$ induction, it was shown by Neeman to have strength strictly between weak ${\mathrm{\Sigma }}_{1}^{1}$ choice and ${\mathrm{\Delta }}_{1}^{1}$ comprehension. We prove in this paper that ${\mathrm{\Sigma }}_{1}^{1}$ induction is needed for (...) the reversal of INDEC, that is for the proof that INDEC implies weak ${\mathrm{\Sigma }}_{1}^{1}$ choice. This is in contrast with the typical situation in reverse mathematics, where reversals can usually be refined to use only ${\mathrm{\Sigma }}_{1}^{0}$ induction. (shrink)