A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper we construct an algorithm for finding the correlation immune order of a Boolean function, and check how long to find the correlation immune order of a given Boolean function in our algorithm.