This is similar to Triple DES, except that Triple DES generally uses Encrypt/Decrypt/Encrypt.
First, I would be very surprised if AES was constructed in such a way that key2 exists (except possibly for very rare situations). If key2 always exists, then from the attacker's view we are just using plain AES with key2. If we assume AES is a random permutation, then we have (assuming 256-bit keys) two permutations of $2^{256}$ possible values each, for a total of $2^{512}$ possible permutations after two encryptions, but key2 only provides $2^{256}$ possible permutations, so it would be extremely unlikely for such a key2 to exist.
Second, double encryption does not provide a significant increase in security even if key2 doesn't exist. Given a plaintext/ciphertext pair, an attacker can execute a meet-in-the-middle attack by simply encrypting the plaintext with each possible key0, and decrypting the ciphertext with each possible key1, and looking for a match. So with only double the effort of plain AES (and lots of memory), this system can be broken.
Finally, I will note that this depends on the encryption algorithm used. If we replace AES with monoalphabetic substitution, then key2 does exist and can be easily found.