If my copy of your FLEx project is still accurate you have 13 affixes that could go in the genitive slot and 1 that can go in the associative slot.
The brute force method would be to have the first part of your and statement check if the 1 associative affix is present, the second part of your and statement would be a long or statement that would check equality with each of the 13 affixes.
A less long way to do the second part would be to check if the affix ends with POSS1 or POSS2 or POSS3. It might look like this:
Note that you can't use a literal tag with the ends with statement you have to use literal string and end it with a > which is the end marker for a tag.
A different approach would be to do all the enumerating in category definition. It might look like this:
Of course, this is just a partial list and you may have to add to the list for each of your noun categories. na, ni, etc.
The advantage of this, is you do all the enumerating in the category and have a rule using that category where you already know all the conditions have been met and you can do the changes needed.
I'd be curious to know what you end up choosing to do.
