Some fixes and improvements from integrating the new Boomerang version into CryptoAnalysis:

• Some fixes in the Opal Scope
• The computation of final weights at the end of an object lifetime was not correct
• The TransitionFunctionImpl stored the state changing transitions and state changing statement in two separate sets. This does not allow us to connect corresponding transitions and statements. Solution: Use a Map to map the transitions to their statements. For example, assuming a state machine 0 -[ new A() ]-> 1 -[ op ]-> 2 in the program

A a = new A();
if (...) {
    a.op();
}
// a is either in state 1 or 2

the current solution just stores the sets {[0->1], [0->2]} and {<init>, op}. With the map, we have the mapping {[0->1] -> <init>, [0->2] -> op}, giving us the information that state 1 is reached with the call to <init> and state 2 is reached with the call to op