The existence of the real number line is one thing. The existence of an uncountable ordinal is another. When you consider the hierarchies of uncomputable ordinals to their various Turing degrees that are numbered among the countable ordinals, and that which countable ordinals you can constructively well-order strongly corresponds to the strength of your proof theory and which Turing machines you believe to halt, and when you combine this with the Burali-Forti paradox saying that the predicate "well-ordered" cannot be self-applicable, even though any given collection of well-orderings can be well-ordered...

...I just have trouble believing that there's actually any such thing as an uncountable ordinal out there, because it implies an absolute well-ordering of all the countable well-orderings; it seems to have a superlogical character to it.