 an affirmative answer is never given for a non-terminating program) is "incomplete", i.e.must fail in determining termination for infinitely many terminating programs, either by running forever or halting with an indefinite answer.A "termination proof" is a type of mathematical proof that plays a critical role in formal verification because total correctness of an algorithm depends on termination.