OpenMP 5.1/5.2/6.0 forms HPE does not claim are rejected, and some crash the compiler instead of a diagnostic

// # Draft finding: omp52-c-clause-map-iterator on cce19
//
// - compiler: cce19
// - toolchain: cce19; arch: gfx942; machine: tuolumne; memory mode: unified; opt: -O2
// - program: catalog omp52-c-clause-map-iterator (c, version 52, sha256 a7be9001f201c65b)
// - expected: None (None; )
// - actual: ice  (ice: PLEASE submit a bug report to HPE at https://support.hpe.com/ and include the crash backtrace, preprocessed source, and associated run script.)
// - verdict: compiler_bug by rule R10-compile-ice: an internal compiler error (or the compiler rejecting code it generated) on a legal program: always the compiler's defect
// - reason: 
// - citations: RUL-COMPILE-TIME (rulings.md)
// - legality: legal (legal by construction: offload.engine.gen / c_gen / acc_gen check every program against the catalog rules and the offload scope as it is built (no compiler))
// - witnesses: none
// - withdrawn: none
//
// Generated by compliance.c_gen (OpenMP 5.2, C11): the C port (offload.engine.f2c) of omp52-clause-map-iterator. Do not edit.
// id: omp52-c-clause-map-iterator
// primary atom: omp.clause.map.iterator
// legal: yes
// observable: yes
// ran_on_host: inside the target region of interest
// evidence: copy_mode_only
// needs: none
// std: c11
#include <stdio.h>
#include <stdbool.h>
#include <omp.h>

enum { n = 64 };

int main(void) {
  int a[n];
  int b[n];
  int ref[n];
  int host_flag;
  bool ok;
  int k;
  int w[n];
  bool pres;
  bool shared_mem;
  int zc[1];
  for (int i = 1; i <= n; i++) {
    a[i - 1] = i;
    b[i - 1] = 0;
    ref[i - 1] = 2 * i + 1;
  }
  host_flag = 1;
  for (int k1_ = 0; k1_ < n; k1_++)
    w[k1_] = 0;
  #pragma omp target enter data map(iterator(k = 1:2), to: w[k:n / 2 - (k + 1) + 1])
  pres = true;
  for (int k2_ = 0; k2_ < 1; k2_++)
    zc[k2_] = 0;
  #pragma omp target map(to: zc)
  {
    zc[0] = 1;
  }
  shared_mem = zc[0] == 1;
  #pragma omp target map(to: a) map(from: b) map(tofrom: host_flag)
  {
    host_flag = (omp_is_initial_device() ? 1 : 0);
    for (int i = 1; i <= n; i++) {
      b[i - 1] = 2 * a[i - 1] + 1;
    }
  }
  if (!shared_mem) pres = pres && (omp_target_is_present(&w[1], omp_get_default_device()) != 0);
  if (!shared_mem) pres = pres && (omp_target_is_present(&w[n / 2 - 1], omp_get_default_device()) != 0);
  if (!shared_mem) pres = pres && (omp_target_is_present(&w[0], omp_get_default_device()) == 0);
  if (!shared_mem) pres = pres && (omp_target_is_present(&w[n / 2], omp_get_default_device()) == 0);
  #pragma omp target exit data map(iterator(k = 1:2), release: w[k:n / 2 - (k + 1) + 1])
  bool t3_ = true;
  for (int k4_ = 0; k4_ < n; k4_++)
    t3_ = t3_ && (b[k4_] == ref[k4_]);
  ok = t3_ && pres;
  printf("RESULT ran_on_host=%d check=%s\n", host_flag, ok ? "pass" : "fail");
  return 0;
}
// spec (requirement): An iterator modifier defines a set of iterators and is allowed on the map clause.
// "An iterator modifier is a unique, complex modifier that defines a set of iterators, each of which is an
//   iterator-identifier and an associated set of values." (5.2 §3.2.6 p.67 l.6-8)
// spec (requirement): A list item in a map clause may use any iterator-identifier defined in the iterator modifier of
//   that clause.
// "A list item in a map clause may reference any iterator-identifier defined in its iterator modifier." (5.2 §5.8.3
//   p.151 l.13-14)
// spec (this program): target enter data and target exit data map w[k:n/2-(k+1)+1] for k = 1:2 with an iterator
//   modifier; the compiler stops with an internal error instead of mapping the iterated sections or giving a
//   diagnostic.