Explain the process of converting an arbitrary control flow graph into Static Single Assignment (SSA) form, paying special attention to the handling of phi functions. Detail how induction variable analysis (IVS) facilitates loop-invariant code motion and strength reduction. Provide a concrete example of a loop nest and demonstrate the transformation steps through SSA and subsequent optimization passes.