Work Factor is defined as the minimum amount of work (can be the length of the key) to determine the secret key of an cryptosystem (HAC, Menezes, Alfred J. et al).
And One time pad have unconditional security or is perfectly secure, it means it is impossible to break even with unlimited processing power and memory (when correctly implemented, of course). How these definitions can be met? Because its possible to generate all possible combinations for an cypher text encrypted with OTP, but we can't isolate the correct one, we can say that OTP have an unlimited work factor?