Whenever a variable v has v->Scope() == s && s->Node() == n, the following should be true:

1. n->IsScopeBearer()
2. Either
   • n->Scope() == s
   • n->IsFunctionScope() && n->ParamScope() == s
   • n->IsLoopScope() && n->DeclScope() == s
   • n->IsCatchScope() && n->ParamScope() == s

This should be checker by walking all the identifiers in a program, because violations of the invariant take place when identifiers have variables with stale scopes, replaced by new ones.

#17145