The input is redundant, so let's focus on the essentials:
You have a "base point" p0 with coordinates (x0,z0) (latitude and longitude in degrees).
You have a "target point" p1 with coordinates (x1,z1).
The distance to travel from p towards p1 is d. Let (x,z) be the coordinates of the endpoint p: we wish to compute x and z.
Because (a) d is a few meters, (b) p and p1 are not near the poles, and (c) high accuracy is not needed, we can use Euclidean calculations upon applying a moderately accurate projection. About the simplest is the cylindrical projection
(x,z) --> (x, z * Cos(x)) = (x, y).
This reflects the shrinking of longitude (z) with varying latitude (x).
From now on we may compute with our points as if they were vectors. The solution is obtained in simple steps:
(i) The direction vector from p0 to p1 is p1 - p2 with coordinates v = (x1-x0, y1-y0).
(ii) The length of this vector, by the Pythagorean Theorem, is the square root of the sum of squares of its coordinates, Sqrt((x1-x0)^2 + (y1-y0)^2). Call this 'a'.
(iii) A parallel vector of length d is obtained by scaling the direction vector v by d/a, after expressing d in degrees. To do this, divide d by 111300 (meters per degree). Then rescale by multiplying each of x1-x0 and y1-y0 by d/a. Call this vector 'w'.
(iv) Displacing p0 by w is obtained by adding the vectors: p = p0 + w = (x,y).
(v) Unproject (x,y). This gives (x,z) = (x, y/Cos(x)).