code: public void computeUnionOfInterestingPropertiesFromSuccessors() {
  		List<DagConnection> conns = getOutgoingConnections();
  		if (conns.size() == 0) {
  			// no incoming, we have none ourselves
  			this.intProps = new InterestingProperties();
  		} else {
  			this.intProps = conns.get(0).getInterestingProperties().clone();
  			for (int i = 1; i < conns.size(); i++) {
  				this.intProps.addInterestingProperties(conns.get(i).getInterestingProperties());
  			}
  		}
  		this.intProps.dropTrivials();
  	}
docs: Computes all the interesting properties that are relevant to this node. The interesting
  properties are a union of the interesting properties on each outgoing connection.
  However, if two interesting properties on the outgoing connections overlap,
  the interesting properties will occur only once in this set. For that, this
  method deduplicates and merges the interesting properties.
  This method returns copies of the original interesting properties objects and
  leaves the original objects, contained by the connections, unchanged.