The statement is false because we know that sigma star is countable and a language is nothing but a subset of sigma star..every subset of a countable set is countable..hence all languages are countable.
Hence every language whether it is RE or not ,it is always countable.So the statement is false.
Not RE will always be countable infinite.