FThis is a $ZFC$-theorem. Actually for any $\Sigma^1_1$-locally countable partial ordering, there is a non-null antichain.
The proof is not quite simple. See my paper
http://math.nju.edu.cn/~yuliang/lcpfinal
I feel that it might be helpful to give more details.
The ideal is as following:
By Harrison's theorem, the question concerning $\Sigma^1_1$-locally countable partial ordering can be reduced to the question about the measure of antichains of hyperarithmetic degrees. So it is sufficient to construct a non-null antichain of hyperarithmetic degree. By an application of some algorithmic randomness results due to Kucera, Miller and me, any such antichain must be nonmeasurable.
So we just need to construct a nonmeasureable antichain of hyperdegrees. By a generlaization of the results due to Miller and me, it can be proved that sufficient randomness (in the paper "sufficient randomness" means $\Delta^1_2$-randomness. Now we know that $\Pi^1_1$-randomness is sufficient after the development of higher randomness theory) is $\leq_h$-downward closed.
Now take a maximal set $X$ of reals so that any two different reals in $X$ bounds disjoint "sufficiently random" reals. If $X$ is not null, then we are done. Otherwise, by the randomness result above, the $\leq_h$-upward closure of $X$ must be null. For each $e$, let $X_e$ be the collection of the $e$-th "sufficiently random" real hyperarithmetically below some $x\in X$ (such an $\omega$-type well ordering is "natural" for each $x$, i.e. the $e$-th hyperarithmetic reduction.) It cannot be true that for every $e$, $X_e$ is null (Otherwise, by the randomness result and maximality of $X$, the set of "sufficiently random" reals would be null). By the property of $X$, $X_e$ is an antichain for every $e$. So there must be some $e_0$ so that $X_{e_0}$ is an antichain and non-null.
Note that even the hyperarithmetic closure of $X_{e_0}$ does not have a positive measure.