Fix intersection bug caused by intvalued clean.

After e528b30, intersection would increase `N`‘s `occurs_inv` when compare `Vararg{Any}` and `Vararg{Any,N}` for reintersection hint.

Here we just need to check if `ylv` is unbounded.

Author: N5N3

src/subtype.c

@@ -1069,7 +1069,9 @@ static int subtype_tuple_varargs(
         }
 
         if (ylv) {
-            if (ylv->depth0 != e->invdepth || ylv->occurs_inv)
+            if (ylv->depth0 != e->invdepth ||
+                ylv->lb != jl_bottom_type ||
+                ylv->ub != (jl_value_t *)jl_any_type)
                 return 0;
             ylv->intvalued = 1;
         }
@@ -2518,6 +2520,7 @@ static int check_unsat_bound(jl_value_t *t, jl_tvar_t *v, jl_stenv_t *e) JL_NOTS
     return 0;
 }
 
+//TODO: This doesn't work for nested `Tuple`.
 static int has_free_vararg_length(jl_value_t *a, jl_stenv_t *e) {
     if (jl_is_unionall(a))
         a = jl_unwrap_unionall(a);

test/subtype.jl

@@ -2218,6 +2218,12 @@ end
 # Example from pr#39098
 @testintersect(NTuple, Tuple{Any,Vararg}, Tuple{T, Vararg{T}} where {T})
 
+let S = Val{T} where T<:Tuple{Tuple{Any, Vararg{Any}}}
+    T = Val{Tuple{Tuple{Vararg{Any, N}}}} where {N}
+    @testintersect(S, T, !Union{})
+    @test_broken typeintersect(S, T) != Val{Tuple{Tuple{Any, Vararg{Any}}}}
+end
+
 let A = Pair{NTuple{N, Int}, Val{N}} where N,
     Bs = (Pair{<:Tuple{Int, Vararg{Int}}, <:Val},
           Pair{Tuple{Int, Vararg{Int,N1}}, Val{N2}} where {N1,N2})