Version number: -
Successfully parsed 'input graph': contains 11 nodes and 17 edges
Successfully parsed 'input graph': contains 13144 nodes and 1996782 edges
Successfully parsed 'matching graph': contains 8 matching edges
Using scoring function Edge correctness
Using beta = 1
Computing edge correctness by normalizing with 17
Breaking ties using beta = 0.00490196
Number of primal x variables: 8
Number of primal y variables: 4
Number of dual lambda variables: 2
Number of dual mu variables: 0
Number of subgradients: 2
Initialized dual ascent solver with tau = 1, phi = 0.5 and enhanced = 0
Initialized subgradient solver with k = 20 and l = 10
Initialized combined solver with maxSwitches = 3
i      mu          LB*             UB*              LB              UB             time (s) #subgr+  #subgr-  #dual    
1      1           -1.7976931e+308 1.7976931e+308  *0.067932827    *0.067932827   8.39e-05 0        0        0        
Solved to optimality.