The gcd must eventually equal one of the input numbers

The remainders form a strictly decreasing sequence of non-negative integers

The algorithm can loop at most $n$ times for inputs $\leq n$

Fibonacci numbers always appear in the remainder sequence