Complexity of tests checking the operation of logic diagram inputs

Exact upper bounds for the complexity of absolute tests checking the correctness of inputs of logic diagrams realizing Boolean functions which are essentially dependent on $n$ variables have been found for $n\ge136$.