```python
import math

def count_Intgral_Points(x1, y1, x2, y2):
    """
    Counts the number of integer coordinate points that lie strictly inside
    an axis-aligned square defined by two opposite vertices.
    """
    # Determine the boundaries of the square.
    min_x = min(x1, x2)
    max_x = max(x1, x2)
    min_y = min(y1, y2)
    max_y = max(y1, y2)

    # Find the first integer strictly greater than the minimum x-coordinate.
    # Example: if min_x is 2.3, the first integer is 3 (floor(2.3) + 1).
    # Example: if min_x is 2.0, the first integer is 3 (floor(2.0) + 1).
    first_x = math.floor(min_x) + 1

    # Find the last integer strictly less than the maximum x-coordinate.
    # Example: if max_x is 5.7, the last integer is 5 (ceil(5.7) - 1).
    # Example: if max_x is 5.0, the last integer is 4 (ceil(5.0) - 1).
    last_x = math.ceil(max_x) - 1

    # The number of integers in the range [first_x, last_x] is last_x - first_x + 1.
    # If first_x > last_x, there are no integers in the range, so the count is 0.
    if first_x > last_x:
        count_x = 0
    else:
        count_x = last_x - first_x + 1

    # Repeat the same logic for the y-coordinates.
    first_y = math.floor(min_y) + 1
    last_y = math.ceil(max_y) - 1

    if first_y > last_y:
        count_y = 0
    else:
        count_y = last_y - first_y + 1

    # The total number of points is the product of the counts for each axis.
    return count_x * count_y
```