Is the description of program output in README.md misleading?

[takemaru]

README.md says the output is $U(n')$, which is described in the paper as the probability that exactly $n'$ nodes out of the nodes in $C$ fail to connect with the nodes in $T$.
But I'm afraid that this description is misleaning.

Please see the following example.

./main ../data/0189-real-UsCarrier.edgelist.txt ../data/0189-real-UsCarrier.edgelist.txt.prob ../data/src/0189-real-UsCarrier.edgelist.txt.bc5.src ../data/0189-real-UsCarrier.edgelist.txt
0: 0.000000000000000
1: 0.000000000000000
:
157: 0.001650299336476
158: 0.991746954807834

README.md makes me interpret these output lines as $n': U(n')$.
But the last output line is "158: 0.991746954807834", where 158 is the number $n$ of nodes on the graph and the probability is almost 1.0, so I guess that the line indicates that all the nodes can access $T$ with the probability of about 0.99.
If so, an output line must indicate $n - n': U(n')$, right?