************************************************************ * IMITATOR 2.9.2-working "Butter Incaberry" * * * * Etienne Andre, Ulrich Kuehne et al. * * 2009 - 2017 * * LSV, ENS de Cachan & CNRS, France * * LIPN, Universite Paris 13, France * * www.imitator.fr * * * * Build: 2363 (2017-06-08 17:40:33 UTC) * * explorder/5c40e39 * ************************************************************ Analysis time: Fri Jun 16, 2017 12:52:34  Model: /media/gia/Data/Example-Models/AndOr/AndOr.imi Mode: EF-synthesis. Exploration order: layer-based BFS. Considering fixpoint variant with bidirectional inclusion of symbolic zones (instead of equality). Merging technique of [AFS13] enabled. The cartography will be drawn. The result will be written to a file. The trace set(s) will be generated in a graphical mode. Description of states will be output. This model is an L/U-PTA: - lower-bound parameters {dAnd_l, dA_High_l, dB_High_l, dOr_l, dA_Low_l, dB_Low_l} - upper-bound parameters {dA_High_u, dAnd_u, dOr_u, dB_High_u, dA_Low_u, dB_Low_u}  Abstract model built after 0.012 second. Memory for abstract model: 1090.128 KiB (i.e., 279073 words)  Starting running algorithm AGsafe…  Computing post^1 from 1 state. Computing post^2 from 1 state.  [AGsafe] Found a new state violating the property. Computing post^3 from 1 state. Computing post^4 from 1 state. Computing post^5 from 2 states.  [AGsafe] Found a new state violating the property. Computing post^6 from 3 states.  [AGsafe] Found a new state violating the property. Computing post^7 from 2 states.  [AGsafe] Found a new state violating the property.  [AGsafe] Found a new state violating the property.  1 state merged within 2 states. Computing post^8 from 1 state.  [AGsafe] Found a new state violating the property. Computing post^9 from 1 state.  Fixpoint reached at a depth of 10: 19 states with 21 transitions in the final state space.  [AGsafe] Algorithm completed after 0.771 second.  Final constraint such that the system is correct:  dAnd_l >= 0 & dA_High_l > dB_High_u + dB_Low_u & dB_Low_l >= 0 & dB_Low_u >= dB_Low_l & dB_High_l >= 0 & dA_Low_l >= 0 & dA_Low_u >= dA_Low_l & dOr_u >= dOr_l & dAnd_u >= dAnd_l & dOr_l >= 0 & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l OR dB_High_l >= 0 & dAnd_l > dA_Low_u & dOr_l > dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dAnd_u >= dB_High_l & dOr_u >= dOr_l & dA_Low_l >= 0 & dAnd_u >= dAnd_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dB_High_l >= 0 & dAnd_l >= 0 & dOr_u >= dOr_l & dA_Low_l >= 0 & dOr_u >= dA_Low_l & dA_Low_u >= dA_Low_l & dAnd_u >= dB_High_l & dOr_l >= 0 & dOr_u >= dAnd_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_Low_u >= dAnd_l & dA_High_l > dB_High_u + dAnd_u & dAnd_u >= dAnd_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l OR dB_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dAnd_l > dOr_u & dB_High_u + dB_Low_u >= dA_High_l & dB_High_l > dOr_u + dAnd_u & dB_Low_u >= dB_Low_l & dA_Low_l >= 0 & dOr_l >= 0 & dA_Low_u >= dA_Low_l & dOr_u >= dOr_l & dA_Low_u >= dOr_l & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l OR dOr_l >= 0 & dAnd_l >= 0 & dA_Low_l >= 0 & dB_High_l > dOr_u + dAnd_u & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dA_Low_u >= dOr_l & dOr_u >= dOr_l & dA_Low_u >= dA_Low_l & dA_Low_u >= dAnd_l & dOr_u >= dAnd_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dAnd_u >= dAnd_l OR dAnd_l >= 0 & dA_Low_u >= dA_Low_l & dOr_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dOr_u & dB_High_l > dOr_u + dAnd_u & dOr_u >= dOr_l & dA_Low_l >= 0 & dOr_u >= dAnd_l & dA_High_u + dA_Low_u >= dB_High_l + dB_Low_l + dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dAnd_u >= dAnd_l OR dOr_l >= 0 & dB_High_l >= 0 & dA_Low_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dAnd_l > dOr_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_Low_u >= dOr_l & dOr_u >= dOr_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_Low_u >= dA_Low_l & dOr_u >= dA_Low_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dOr_u + dAnd_u >= dB_High_l & dAnd_u >= dAnd_l OR dB_High_l >= 0 & dOr_u + dAnd_u >= dB_High_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dAnd_l > dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dOr_l >= 0 & dA_Low_u >= dOr_l & dA_Low_u >= dA_Low_l & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dB_Low_u >= dB_Low_l & dOr_u >= dAnd_l OR dOr_l >= 0 & dB_High_l > dA_High_u & dAnd_l > dB_Low_u & dOr_u >= dOr_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_Low_l >= 0 & dAnd_u >= dAnd_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dAnd_l >= 0 & dOr_l >= 0 & dB_Low_l >= 0 & dB_High_l > dA_High_u & dB_High_u + dB_Low_u + dAnd_u > dB_High_l + dAnd_l & dA_Low_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l >= 0 & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dB_Low_l >= 0 & dAnd_l > dOr_u & dB_High_l > dA_High_u & dB_Low_u >= dB_Low_l & dOr_u >= dA_Low_l & dOr_l >= 0 & dOr_u >= dOr_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dA_High_l >= 0 & dOr_l >= 0 & dA_Low_l + dB_High_l + dAnd_l > dB_Low_u + dAnd_u & dB_Low_l >= 0 & dAnd_l > dA_Low_u & dB_High_l > dA_High_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dB_Low_u >= dAnd_l & dAnd_u >= dAnd_l & dA_Low_l >= 0 & dB_High_u >= dB_High_l & dOr_u >= dAnd_l OR dOr_l >= 0 & dA_Low_l >= 0 & dOr_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dAnd_u >= dAnd_l & dAnd_l >= 0 & dOr_u >= dA_Low_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dB_Low_u + dAnd_u >= dA_Low_l + dB_High_l + dAnd_l & dA_High_l >= 0 & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l OR dB_Low_l >= 0 & dAnd_l > dA_Low_u & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l > dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dB_Low_u >= dB_Low_l & dOr_u >= dOr_l & dA_Low_l >= 0 & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dB_High_u + dB_Low_u >= dA_High_l OR dB_Low_l >= 0 & dAnd_l > dA_Low_u & dB_High_l > dAnd_u & dOr_l > dA_Low_u & dA_High_l > dB_High_u + dAnd_u & dB_Low_u >= dB_Low_l & dOr_u >= dOr_l & dA_Low_l >= 0 & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l OR dB_High_u + dB_Low_u >= dA_High_l & dB_Low_l >= 0 & dB_High_l > dOr_u + dAnd_u & dA_High_l > dB_High_u + dAnd_u & dAnd_l > dA_Low_u & dB_Low_u >= dB_Low_l & dA_Low_l >= 0 & dA_Low_u >= dOr_l & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_u >= dAnd_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dA_High_u >= dA_High_l OR dB_High_l >= 0 & dAnd_l >= 0 & dOr_l >= 0 & dA_High_l > dB_High_u + dAnd_u & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_Low_l > dOr_u & dOr_u >= dOr_l & dB_High_u >= dB_High_l & dA_High_u >= dA_High_l & dA_Low_u >= dA_Low_l & dB_Low_u >= dB_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dOr_u + dAnd_u >= dB_High_l & dAnd_u >= dAnd_l OR dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dB_Low_u >= dAnd_l & dA_High_l >= 0 & dA_Low_l >= 0 & dB_Low_l >= 0 & dOr_l >= 0 & dAnd_u >= dAnd_l & dAnd_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dA_High_l >= 0 & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_Low_l + dB_High_l + dAnd_l > dB_Low_u + dAnd_u & dOr_u >= dA_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l >= 0 & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dB_Low_l >= 0 & dB_Low_u >= dAnd_l & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l > dA_High_u & dA_High_u >= dA_High_l OR dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_l > dA_Low_u & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l OR dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dB_High_l > dAnd_u & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_l > dA_Low_u & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l + dAnd_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l OR dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dOr_l & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l >= 0 & dAnd_u >= dAnd_l & dAnd_l > dOr_u & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l OR dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dA_Low_u >= dOr_l & dA_High_l + dA_Low_l + dB_High_l > dB_High_u + dB_Low_u + dAnd_u & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l OR dOr_u >= dA_Low_l & dB_High_u + dB_Low_u + dAnd_u >= dA_High_l + dA_Low_l + dB_High_l & dA_High_l > dB_High_u + dAnd_u & dA_Low_l >= 0 & dA_Low_u >= dAnd_l & dA_Low_u >= dOr_l & dB_High_l > dAnd_u & dOr_l >= 0 & dOr_u >= dAnd_l & dAnd_l >= 0 & dAnd_u >= dAnd_l & dOr_u >= dOr_l & dB_Low_u >= dB_Low_l & dB_High_u >= dB_High_l & dOr_u + dAnd_u >= dB_High_l & dA_Low_u >= dA_Low_l & dB_High_l + dB_Low_l > dA_High_u + dA_Low_u & dA_High_u >= dA_High_l This good constraint is exact (sound and complete) 3.487 MiB (i.e., 457084 words of size 8)  Result written to file '/media/gia/Data/Example-Models/AndOr/AndOr-layerBFS-incl2-merge-EF.res'.  ------------------------------------------------------------ Statistics: State space ------------------------------------------------------------ Number of states : 19 Number of transitions : 21 Number of computed states : 22 Total computation time : 1.618 seconds States/second in state space : 11.7 (19/1.618 seconds) Computed states/second : 13.5 (22/1.618 seconds) Estimated memory : 4.132 MiB (i.e., 541610 words of size 8)  Generating graphical output to '/media/gia/Data/Example-Models/AndOr/AndOr-layerBFS-incl2-merge-EF-statespace.jpg'… Writing the states description to file '/media/gia/Data/Example-Models/AndOr/AndOr-layerBFS-incl2-merge-EF-statespace.states'…  Drawing the cartography… Plot cartography in 2D projected on parameters dA_High_l and dA_High_u to file '/media/gia/Data/Example-Models/AndOr/AndOr-layerBFS-incl2-merge-EF_cart.png'.  ------------------------------------------------------------ Statistics: Algorithm counters ------------------------------------------------------------ main algorithm : 1.630 seconds ------------------------------------------------------------ Statistics: Parsing counters ------------------------------------------------------------ model parsing : 0.009 second ------------------------------------------------------------ Statistics: State computation counters ------------------------------------------------------------ number of state comparisons : 26 number of constraints comparisons : 18 number of new states <= old : 2 number of new states >= old : 0 StateSpace.merging attempts : 8 StateSpace.merges : 1 StatesMerging.merging attempts : 0 StatesMerging.merges : 0 ------------------------------------------------------------ Statistics: Graphics-related counters ------------------------------------------------------------ state space drawing : 0.134 second cartography drawing : 0.103 second ------------------------------------------------------------ Statistics: Global counter ------------------------------------------------------------ total : 1.962 seconds IMITATOR successfully terminated (after 1.964 seconds) Estimated memory used: 7.691 MiB (i.e., 1008190 words of size 8)