Triple nested loop complexity
$O(nop)$ is indeed exactly the best upper bound one can conclude for this program without additional information. The bound $O(n^3)$ cannot be shown unless you know $o$ and $p$ are themselves $O(n)$. On the other hand, if you knew $o$ and $p$ were actually constants, then you could prove a bound of $O(n)$ for the entire program.