Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 321K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007100213
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527605413046


BK_STOP 1527606913071

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-20a as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3577, 'Memory': 283.3, 'Tool': 'itstools'}, {'Time': 8381, 'Memory': 191.88, 'Tool': 'gspn'}, {'Time': 2262703, 'Memory': 15951.31, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 632.5700307520268x far from the best tool itstools.
CTLCardinality lola FlexibleBarrier-PT-20a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-20a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-20a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ FlexibleBarrier-PT-20a @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1307/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 243 places, 1064 transitions, 221 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 744 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-20a-CTLCardinality.task
lola: ((p22 <= p170) AND E (F (((p59 <= 0) AND (p25 + 1 <= p193))))) : ((A (G ((p107 <= 1))) AND A (F (((p119 <= p21) OR (3 <= p233))))) AND E (G (E (G ((p155 <= p4)))))) : NOT(A (G (((1 <= p218) OR (p204 <= p29) OR (p13 <= 2))))) : E (((p230 <= 0) U E (G ((3 <= p16))))) : (NOT(A (G ((p44 <= 0)))) OR E (G (A (X ((p72 <= p211)))))) : (E (F (((p133 + 1 <= p173) OR (p147 + 1 <= p197)))) AND NOT(A (G ((p7 <= p193))))) : NOT(A (G (((p64 <= p175) OR (p207 <= p119) OR (p40 <= 2))))) : NOT(NOT(NOT(E (F ((2 <= p51)))))) : A ((((p173 <= p28) AND (p233 <= p19) AND ((1 <= p114) OR (1 <= p214))) U E (F ((3 <= p118))))) : A (G (A (((p27 <= p158) U (p65 <= p79))))) : NOT(E (F ((((p125 <= p117) AND (3 <= p63)) OR (3 <= p25))))) : ((((p83 <= p219) AND ((p97 <= p55) OR (p170 <= p33) OR (1 <= p27))) OR (p174 <= 2)) AND E ((((3 <= p20) OR (p162 <= p169)) U (p76 + 1 <= p18)))) : E (X (A (G (((p99 <= p78) OR (3 <= p161)))))) : A (G (((p9 <= 2) OR (p113 <= p235)))) : (E (F ((((2 <= p15) OR (1 <= p39)) AND (p12 + 1 <= p96)))) AND (p59 <= p13)) : A (G ((A (X ((1 <= p76))) OR E (G ((p151 <= p72))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p22 <= p170) AND E (F (((p59 <= 0) AND (p25 + 1 <= p193)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 <= p170)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p170)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p59 <= 0) AND (p25 + 1 <= p193))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p107 <= 1))) AND A (F (((p119 <= p21) OR (3 <= p233))))) AND E (G (E (G ((p155 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p107 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p119 <= p21) OR (3 <= p233))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p119 <= p21) OR (3 <= p233))))
lola: processed formula: A (F (((p119 <= p21) OR (3 <= p233))))
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p155 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p4 + 1 <= p155))))
lola: processed formula length: 41
lola: 5 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 30 markings, 90 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= p218) OR (p204 <= p29) OR (p13 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p230 <= 0) U E (G ((3 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p230 <= 0) U NOT(A(TRUE U (p16 <= 2))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 880451 markings, 2975439 edges, 175994 markings/sec, 0 secs
lola: 1761951 markings, 5964020 edges, 176300 markings/sec, 5 secs
lola: 2454962 markings, 8450924 edges, 138602 markings/sec, 10 secs
lola: 3168135 markings, 11009829 edges, 142635 markings/sec, 15 secs
lola: 3880273 markings, 13544736 edges, 142428 markings/sec, 20 secs
lola: 4589441 markings, 16076724 edges, 141834 markings/sec, 25 secs
lola: 5285312 markings, 18569327 edges, 139174 markings/sec, 30 secs
lola: 5934866 markings, 20937371 edges, 129911 markings/sec, 35 secs
lola: 6599048 markings, 23357148 edges, 132836 markings/sec, 40 secs
lola: 7271022 markings, 25784664 edges, 134395 markings/sec, 45 secs
lola: 7930479 markings, 28178503 edges, 131891 markings/sec, 50 secs
lola: 8541313 markings, 30411631 edges, 122167 markings/sec, 55 secs
lola: 9170501 markings, 32712779 edges, 125838 markings/sec, 60 secs
lola: 9782027 markings, 34960122 edges, 122305 markings/sec, 65 secs
lola: 10403966 markings, 37249604 edges, 124388 markings/sec, 70 secs
lola: 11027378 markings, 39543465 edges, 124682 markings/sec, 75 secs
lola: 11637195 markings, 41800826 edges, 121963 markings/sec, 80 secs
lola: 12231474 markings, 44012479 edges, 118856 markings/sec, 85 secs
lola: 13047008 markings, 46836514 edges, 163107 markings/sec, 90 secs
lola: 13875617 markings, 49722844 edges, 165722 markings/sec, 95 secs
lola: 14650307 markings, 52472830 edges, 154938 markings/sec, 100 secs
lola: 15491705 markings, 55363162 edges, 168280 markings/sec, 105 secs
lola: 16250713 markings, 58047129 edges, 151802 markings/sec, 110 secs
lola: 16962879 markings, 60600121 edges, 142433 markings/sec, 115 secs
lola: 17699075 markings, 63230420 edges, 147239 markings/sec, 120 secs
lola: 18396438 markings, 65754771 edges, 139473 markings/sec, 125 secs
lola: 19067680 markings, 68193750 edges, 134248 markings/sec, 130 secs
lola: 19742479 markings, 70642423 edges, 134960 markings/sec, 135 secs
lola: 20396022 markings, 73036764 edges, 130709 markings/sec, 140 secs
lola: 21035421 markings, 75385631 edges, 127880 markings/sec, 145 secs
lola: 21673907 markings, 77740441 edges, 127697 markings/sec, 150 secs
lola: 22295739 markings, 80045125 edges, 124366 markings/sec, 155 secs
lola: 22935412 markings, 82401655 edges, 127935 markings/sec, 160 secs
lola: 23557549 markings, 84693579 edges, 124427 markings/sec, 165 secs
lola: 24174726 markings, 86968744 edges, 123435 markings/sec, 170 secs
lola: 24783915 markings, 89221142 edges, 121838 markings/sec, 175 secs
lola: 25387252 markings, 91466145 edges, 120667 markings/sec, 180 secs
lola: 25988614 markings, 93693749 edges, 120272 markings/sec, 185 secs
lola: 26580911 markings, 95914906 edges, 118459 markings/sec, 190 secs
lola: 27179788 markings, 98155011 edges, 119775 markings/sec, 195 secs
lola: 27769433 markings, 100347234 edges, 117929 markings/sec, 200 secs
lola: 28343055 markings, 102500229 edges, 114724 markings/sec, 205 secs
lola: 28918851 markings, 104662815 edges, 115159 markings/sec, 210 secs
lola: 29495153 markings, 106822835 edges, 115260 markings/sec, 215 secs
lola: 30080938 markings, 109005863 edges, 117157 markings/sec, 220 secs
lola: 30663541 markings, 111190348 edges, 116521 markings/sec, 225 secs
lola: 31248971 markings, 113382104 edges, 117086 markings/sec, 230 secs
lola: 31787759 markings, 115404872 edges, 107758 markings/sec, 235 secs
lola: 32323898 markings, 117413193 edges, 107228 markings/sec, 240 secs
lola: 32846559 markings, 119379303 edges, 104532 markings/sec, 245 secs
lola: 33447650 markings, 121607724 edges, 120218 markings/sec, 250 secs
lola: 34069903 markings, 123909052 edges, 124451 markings/sec, 255 secs
lola: 34594109 markings, 125869979 edges, 104841 markings/sec, 260 secs
lola: 35094726 markings, 127759449 edges, 100123 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((p44 <= 0)))) OR E (G (A (X ((p72 <= p211))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p44)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p133 + 1 <= p173) OR (p147 + 1 <= p197)))) AND NOT(A (G ((p7 <= p193)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p133 + 1 <= p173) OR (p147 + 1 <= p197))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p193 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p64 <= p175) OR (p207 <= p119) OR (p40 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(E (F ((2 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p173 <= p28) AND (p233 <= p19) AND ((1 <= p114) OR (1 <= p214))) U E (F ((3 <= p118)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p173 <= p28) AND (p233 <= p19) AND ((1 <= p114) OR (1 <= p214))) U E(TRUE U (3 <= p118)))
lola: processed formula length: 94
lola: 2 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1012554 markings, 2395753 edges, 202498 markings/sec, 0 secs
lola: 1982444 markings, 4732332 edges, 193978 markings/sec, 5 secs
lola: 2946055 markings, 7109028 edges, 192722 markings/sec, 10 secs
lola: 3837256 markings, 9380019 edges, 178240 markings/sec, 15 secs
lola: 4648478 markings, 11530819 edges, 162244 markings/sec, 20 secs
lola: 5465255 markings, 13648669 edges, 163355 markings/sec, 25 secs
lola: 6241328 markings, 15742834 edges, 155215 markings/sec, 30 secs
lola: 6991808 markings, 17791834 edges, 150096 markings/sec, 35 secs
lola: 7789530 markings, 19881656 edges, 159544 markings/sec, 40 secs
lola: 8763890 markings, 22303985 edges, 194872 markings/sec, 45 secs
lola: 9696235 markings, 24677585 edges, 186469 markings/sec, 50 secs
lola: 10547025 markings, 26888563 edges, 170158 markings/sec, 55 secs
lola: 11283255 markings, 28858474 edges, 147246 markings/sec, 60 secs
lola: 12032921 markings, 30897537 edges, 149933 markings/sec, 65 secs
lola: 12753328 markings, 32877990 edges, 144081 markings/sec, 70 secs
lola: 13734898 markings, 35264467 edges, 196314 markings/sec, 75 secs
lola: 14687090 markings, 37612703 edges, 190438 markings/sec, 80 secs
lola: 15521425 markings, 39783074 edges, 166867 markings/sec, 85 secs
lola: 16226364 markings, 41745731 edges, 140988 markings/sec, 90 secs
lola: 17009538 markings, 43814483 edges, 156635 markings/sec, 95 secs
lola: 17775556 markings, 45846991 edges, 153204 markings/sec, 100 secs
lola: 18520607 markings, 47796832 edges, 149010 markings/sec, 105 secs
lola: 19204243 markings, 49696473 edges, 136727 markings/sec, 110 secs
lola: 19887458 markings, 51562941 edges, 136643 markings/sec, 115 secs
lola: 20558623 markings, 53406944 edges, 134233 markings/sec, 120 secs
lola: 21188085 markings, 55155027 edges, 125892 markings/sec, 125 secs
lola: 21838204 markings, 56951203 edges, 130024 markings/sec, 130 secs
lola: 22421835 markings, 58617224 edges, 116726 markings/sec, 135 secs
lola: 23090840 markings, 60417323 edges, 133801 markings/sec, 140 secs
lola: 23792165 markings, 62329942 edges, 140265 markings/sec, 145 secs
lola: 24449322 markings, 64170781 edges, 131431 markings/sec, 150 secs
lola: 25143024 markings, 66078955 edges, 138740 markings/sec, 155 secs
lola: 25786952 markings, 67897031 edges, 128786 markings/sec, 160 secs
lola: 26492325 markings, 69808414 edges, 141075 markings/sec, 165 secs
lola: 27179487 markings, 71714623 edges, 137432 markings/sec, 170 secs
lola: 27884611 markings, 73648812 edges, 141025 markings/sec, 175 secs
lola: 28519517 markings, 75441227 edges, 126981 markings/sec, 180 secs
lola: 29185292 markings, 77276891 edges, 133155 markings/sec, 185 secs
lola: 29808056 markings, 79049872 edges, 124553 markings/sec, 190 secs
lola: 30464055 markings, 80848356 edges, 131200 markings/sec, 195 secs
lola: 31129107 markings, 82702926 edges, 133010 markings/sec, 200 secs
lola: 31798756 markings, 84546079 edges, 133930 markings/sec, 205 secs
lola: 32434522 markings, 86330539 edges, 127153 markings/sec, 210 secs
lola: 33058985 markings, 88122743 edges, 124893 markings/sec, 215 secs
lola: 33728793 markings, 89986087 edges, 133962 markings/sec, 220 secs
lola: 34406564 markings, 91823250 edges, 135554 markings/sec, 225 secs
lola: 35043655 markings, 93610125 edges, 127418 markings/sec, 230 secs
lola: 35641833 markings, 95338852 edges, 119636 markings/sec, 235 secs
lola: 36276267 markings, 97103866 edges, 126887 markings/sec, 240 secs
lola: 36882268 markings, 98844977 edges, 121200 markings/sec, 245 secs
lola: 37485665 markings, 100565660 edges, 120679 markings/sec, 250 secs
lola: 38084154 markings, 102298075 edges, 119698 markings/sec, 255 secs
lola: 38674422 markings, 104000368 edges, 118054 markings/sec, 260 secs
lola: 39295063 markings, 105779713 edges, 124128 markings/sec, 265 secs
lola: 39993262 markings, 107697234 edges, 139640 markings/sec, 270 secs
lola: 40793738 markings, 109759189 edges, 160095 markings/sec, 275 secs
lola: 41440053 markings, 111588373 edges, 129263 markings/sec, 280 secs
lola: 42040332 markings, 113286347 edges, 120056 markings/sec, 285 secs
lola: 42656145 markings, 115013740 edges, 123163 markings/sec, 290 secs
lola: 43244094 markings, 116737567 edges, 117590 markings/sec, 295 secs
lola: 43863932 markings, 118503826 edges, 123968 markings/sec, 300 secs
lola: 44510775 markings, 120307932 edges, 129369 markings/sec, 305 secs
lola: 45135103 markings, 122083574 edges, 124866 markings/sec, 310 secs
lola: 45744532 markings, 123839527 edges, 121886 markings/sec, 315 secs
lola: 46349100 markings, 125574131 edges, 120914 markings/sec, 320 secs
lola: 47037573 markings, 127491309 edges, 137695 markings/sec, 325 secs
lola: 47670692 markings, 129294509 edges, 126624 markings/sec, 330 secs
lola: 48301194 markings, 131096812 edges, 126100 markings/sec, 335 secs
lola: 48932647 markings, 132878328 edges, 126291 markings/sec, 340 secs
lola: 49545406 markings, 134641333 edges, 122552 markings/sec, 345 secs
lola: 50189520 markings, 136461113 edges, 128823 markings/sec, 350 secs
lola: 50833345 markings, 138281607 edges, 128765 markings/sec, 355 secs
lola: 51423842 markings, 140009114 edges, 118099 markings/sec, 360 secs
lola: 52049563 markings, 141788876 edges, 125144 markings/sec, 365 secs
lola: 52663529 markings, 143541132 edges, 122793 markings/sec, 370 secs
lola: 53249393 markings, 145244733 edges, 117173 markings/sec, 375 secs
lola: 53881337 markings, 147052153 edges, 126389 markings/sec, 380 secs
lola: 54492871 markings, 148794490 edges, 122307 markings/sec, 385 secs
lola: 55106836 markings, 150532940 edges, 122793 markings/sec, 390 secs
lola: 55719203 markings, 152284719 edges, 122473 markings/sec, 395 secs
lola: 56324627 markings, 154023867 edges, 121085 markings/sec, 400 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p27 <= p158) U (p65 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((p27 <= p158) U (p65 <= p79)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45143 markings, 138942 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((p125 <= p117) AND (3 <= p63)) OR (3 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p83 <= p219) AND ((p97 <= p55) OR (p170 <= p33) OR (1 <= p27))) OR (p174 <= 2)) AND E ((((3 <= p20) OR (p162 <= p169)) U (p76 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p83 <= p219) AND ((p97 <= p55) OR (p170 <= p33) OR (1 <= p27))) OR (p174 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p83 <= p219) AND ((p97 <= p55) OR (p170 <= p33) OR (1 <= p27))) OR (p174 <= 2))
lola: processed formula length: 85
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p20) OR (p162 <= p169)) U (p76 + 1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= p20) OR (p162 <= p169)) U (p76 + 1 <= p18))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 205 markings, 1099 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p99 <= p78) OR (3 <= p161))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((p78 + 1 <= p99) AND (p161 <= 2)))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 921565 markings, 2485009 edges, 3689323855827959808 markings/sec, 0 secs
lola: 1806113 markings, 4974419 edges, 176910 markings/sec, 5 secs
lola: 2733178 markings, 7520780 edges, 185413 markings/sec, 10 secs
lola: 3590594 markings, 9971216 edges, 171483 markings/sec, 15 secs
lola: 4339029 markings, 12230537 edges, 149687 markings/sec, 20 secs
lola: 5068698 markings, 14468688 edges, 145934 markings/sec, 25 secs
lola: 5756245 markings, 16622404 edges, 137509 markings/sec, 30 secs
lola: 6399657 markings, 18695554 edges, 128682 markings/sec, 35 secs
lola: 7050547 markings, 20774299 edges, 130178 markings/sec, 40 secs
lola: 7741194 markings, 22910453 edges, 138129 markings/sec, 45 secs
lola: 8355101 markings, 24924724 edges, 122781 markings/sec, 50 secs
lola: 8985201 markings, 26964174 edges, 126020 markings/sec, 55 secs
lola: 9672425 markings, 29094905 edges, 137445 markings/sec, 60 secs
lola: 10340711 markings, 31196953 edges, 133657 markings/sec, 65 secs
lola: 10939462 markings, 33171736 edges, 119750 markings/sec, 70 secs
lola: 11540589 markings, 35149541 edges, 120225 markings/sec, 75 secs
lola: 12154565 markings, 37149045 edges, 122795 markings/sec, 80 secs
lola: 12759582 markings, 39136384 edges, 121003 markings/sec, 85 secs
lola: 13409055 markings, 41198423 edges, 129895 markings/sec, 90 secs
lola: 14274196 markings, 43679438 edges, 173028 markings/sec, 95 secs
lola: 15033160 markings, 45979486 edges, 151793 markings/sec, 100 secs
lola: 15847936 markings, 48354909 edges, 162955 markings/sec, 105 secs
lola: 16533610 markings, 50508335 edges, 137135 markings/sec, 110 secs
lola: 17195571 markings, 52618293 edges, 132392 markings/sec, 115 secs
lola: 17843204 markings, 54690385 edges, 129527 markings/sec, 120 secs
lola: 18467978 markings, 56722094 edges, 124955 markings/sec, 125 secs
lola: 19073719 markings, 58720565 edges, 121148 markings/sec, 130 secs
lola: 19681480 markings, 60717250 edges, 121552 markings/sec, 135 secs
lola: 20547673 markings, 63139191 edges, 173239 markings/sec, 140 secs
lola: 21347024 markings, 65459597 edges, 159870 markings/sec, 145 secs
lola: 22235984 markings, 67908515 edges, 177792 markings/sec, 150 secs
lola: 22964120 markings, 70103570 edges, 145627 markings/sec, 155 secs
lola: 23595285 markings, 72138679 edges, 126233 markings/sec, 160 secs
lola: 24244163 markings, 74196711 edges, 129776 markings/sec, 165 secs
lola: 24933019 markings, 76314549 edges, 137771 markings/sec, 170 secs
lola: 25585345 markings, 78370323 edges, 130465 markings/sec, 175 secs
lola: 26186190 markings, 80337992 edges, 120169 markings/sec, 180 secs
lola: 26752535 markings, 82245224 edges, 113269 markings/sec, 185 secs
lola: 27323522 markings, 84158214 edges, 114197 markings/sec, 190 secs
lola: 27879072 markings, 86041831 edges, 111110 markings/sec, 195 secs
lola: 28491170 markings, 88010940 edges, 122420 markings/sec, 200 secs
lola: 29054571 markings, 89901326 edges, 112680 markings/sec, 205 secs
lola: 29628371 markings, 91801186 edges, 114760 markings/sec, 210 secs
lola: 30215326 markings, 93729299 edges, 117391 markings/sec, 215 secs
lola: 30785948 markings, 95632984 edges, 114124 markings/sec, 220 secs
lola: 31351039 markings, 97513311 edges, 113018 markings/sec, 225 secs
lola: 31895834 markings, 99368298 edges, 108959 markings/sec, 230 secs
lola: 32464506 markings, 101254160 edges, 113734 markings/sec, 235 secs
lola: 33052256 markings, 103173742 edges, 117550 markings/sec, 240 secs
lola: 33592917 markings, 105018260 edges, 108132 markings/sec, 245 secs
lola: 33653410 markings, 105237416 edges, 12099 markings/sec, 250 secs
lola: 33653410 markings, 105237416 edges, 0 markings/sec, 255 secs
lola: 33653410 markings, 105237416 edges, 0 markings/sec, 260 secs
lola: 33653410 markings, 105237416 edges, 0 markings/sec, 265 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 33653410 markings, 105237416 edges
lola: ========================================
lola: subprocess 13 will run for 861 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p9 <= 2) OR (p113 <= p235))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-20a-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((2 <= p15) OR (1 <= p39)) AND (p12 + 1 <= p96)))) AND (p59 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p15) OR (1 <= p39)) AND (p12 + 1 <= p96))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 15 will run for 2583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p59 <= p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p59 <= p13)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((1 <= p76))) OR E (G ((p151 <= p72))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(AX((1 <= p76))) AND A(TRUE U (p72 + 1 <= p151)))))
lola: processed formula length: 68
lola: 6 rewrites
lola: formula mentions 0 of 243 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 457131 markings, 2074209 edges, 91413 markings/sec, 0 secs
lola: 869750 markings, 4073982 edges, 82524 markings/sec, 5 secs
lola: 1263178 markings, 6029480 edges, 78686 markings/sec, 10 secs
lola: 1698273 markings, 8066215 edges, 87019 markings/sec, 15 secs
lola: 2094498 markings, 10017243 edges, 79245 markings/sec, 20 secs
lola: 2524388 markings, 12047826 edges, 85978 markings/sec, 25 secs
lola: 2973504 markings, 14114903 edges, 89823 markings/sec, 30 secs
lola: 3379503 markings, 16091996 edges, 81200 markings/sec, 35 secs
lola: 3760510 markings, 18009675 edges, 76201 markings/sec, 40 secs
lola: 4137889 markings, 19909102 edges, 75476 markings/sec, 45 secs
lola: 4522163 markings, 21831768 edges, 76855 markings/sec, 50 secs
lola: 4900651 markings, 23743144 edges, 75698 markings/sec, 55 secs
lola: 5266121 markings, 25617243 edges, 73094 markings/sec, 60 secs
lola: 5630450 markings, 27485666 edges, 72866 markings/sec, 65 secs
lola: 5985897 markings, 29337475 edges, 71089 markings/sec, 70 secs
lola: 6342030 markings, 31190573 edges, 71227 markings/sec, 75 secs
lola: 6694907 markings, 33022458 edges, 70575 markings/sec, 80 secs
lola: 7048895 markings, 34867362 edges, 70798 markings/sec, 85 secs
lola: 7407383 markings, 36718388 edges, 71698 markings/sec, 90 secs
lola: 7780880 markings, 38603153 edges, 74699 markings/sec, 95 secs
lola: 8123644 markings, 40416626 edges, 68553 markings/sec, 100 secs
lola: 8471544 markings, 42247404 edges, 69580 markings/sec, 105 secs
lola: 8809593 markings, 44041355 edges, 67610 markings/sec, 110 secs
lola: 9186186 markings, 45934143 edges, 75319 markings/sec, 115 secs
lola: 9541392 markings, 47774838 edges, 71041 markings/sec, 120 secs
lola: 9899957 markings, 49617496 edges, 71713 markings/sec, 125 secs
lola: 10261196 markings, 51468005 edges, 72248 markings/sec, 130 secs
lola: 10602648 markings, 53274377 edges, 68290 markings/sec, 135 secs
lola: 10943643 markings, 55073344 edges, 68199 markings/sec, 140 secs
lola: 11278560 markings, 56859799 edges, 66983 markings/sec, 145 secs
lola: 11629615 markings, 58681634 edges, 70211 markings/sec, 150 secs
lola: 11970495 markings, 60479319 edges, 68176 markings/sec, 155 secs
lola: 12302134 markings, 62256420 edges, 66328 markings/sec, 160 secs
lola: 12647325 markings, 64058238 edges, 69038 markings/sec, 165 secs
lola: 12987803 markings, 65859525 edges, 68096 markings/sec, 170 secs
lola: 13333660 markings, 67668514 edges, 69171 markings/sec, 175 secs
lola: 13769526 markings, 69720134 edges, 87173 markings/sec, 180 secs
lola: 14166983 markings, 71693337 edges, 79491 markings/sec, 185 secs
lola: 14552363 markings, 73631072 edges, 77076 markings/sec, 190 secs
lola: 14927180 markings, 75553585 edges, 74963 markings/sec, 195 secs
lola: 15362025 markings, 77589288 edges, 86969 markings/sec, 200 secs
lola: 15738507 markings, 79488504 edges, 75296 markings/sec, 205 secs
lola: 16105812 markings, 81365588 edges, 73461 markings/sec, 210 secs
lola: 16467372 markings, 83231847 edges, 72312 markings/sec, 215 secs
lola: 16822206 markings, 85078560 edges, 70967 markings/sec, 220 secs
lola: 17180799 markings, 86930922 edges, 71719 markings/sec, 225 secs
lola: 17541015 markings, 88786209 edges, 72043 markings/sec, 230 secs
lola: 17887789 markings, 90613665 edges, 69355 markings/sec, 235 secs
lola: 18237146 markings, 92437201 edges, 69871 markings/sec, 240 secs
lola: 18577794 markings, 94244577 edges, 68130 markings/sec, 245 secs
lola: 18915575 markings, 96036881 edges, 67556 markings/sec, 250 secs
lola: 19258247 markings, 97845463 edges, 68534 markings/sec, 255 secs
lola: 19600864 markings, 99651649 edges, 68523 markings/sec, 260 secs
lola: 19965910 markings, 101515843 edges, 73009 markings/sec, 265 secs
lola: 20404223 markings, 103537491 edges, 87663 markings/sec, 270 secs
lola: 20804107 markings, 105489949 edges, 79977 markings/sec, 275 secs
lola: 21187361 markings, 107408674 edges, 76651 markings/sec, 280 secs
lola: 21622522 markings, 109416151 edges, 87032 markings/sec, 285 secs
lola: 22045221 markings, 111442123 edges, 84540 markings/sec, 290 secs
lola: 22442850 markings, 113417053 edges, 79526 markings/sec, 295 secs
lola: 22842137 markings, 115393015 edges, 79857 markings/sec, 300 secs
lola: 23193475 markings, 117259057 edges, 70268 markings/sec, 305 secs
lola: 23554964 markings, 119125062 edges, 72298 markings/sec, 310 secs
lola: 23908545 markings, 120991011 edges, 70716 markings/sec, 315 secs
lola: 24297245 markings, 122938965 edges, 77740 markings/sec, 320 secs
lola: 24669441 markings, 124845677 edges, 74439 markings/sec, 325 secs
lola: 25035756 markings, 126719286 edges, 73263 markings/sec, 330 secs
lola: 25389881 markings, 128553972 edges, 70825 markings/sec, 335 secs
lola: 25750284 markings, 130397464 edges, 72081 markings/sec, 340 secs
lola: 26089581 markings, 132197547 edges, 67859 markings/sec, 345 secs
lola: 26425307 markings, 133988894 edges, 67145 markings/sec, 350 secs
lola: 26754685 markings, 135762443 edges, 65876 markings/sec, 355 secs
lola: 27097979 markings, 137582226 edges, 68659 markings/sec, 360 secs
lola: 27425731 markings, 139359018 edges, 65550 markings/sec, 365 secs
lola: 27756677 markings, 141135723 edges, 66189 markings/sec, 370 secs
lola: 28089924 markings, 142918685 edges, 66649 markings/sec, 375 secs
lola: 28444185 markings, 144742063 edges, 70852 markings/sec, 380 secs
lola: 28785751 markings, 146560531 edges, 68313 markings/sec, 385 secs
lola: 29121157 markings, 148373081 edges, 67081 markings/sec, 390 secs
lola: 29465318 markings, 150189074 edges, 68832 markings/sec, 395 secs
lola: 29806946 markings, 151999842 edges, 68326 markings/sec, 400 secs
lola: 30148790 markings, 153799058 edges, 68369 markings/sec, 405 secs
lola: 30479707 markings, 155576873 edges, 66183 markings/sec, 410 secs
lola: 30816286 markings, 157367365 edges, 67316 markings/sec, 415 secs
lola: 31145354 markings, 159139845 edges, 65814 markings/sec, 420 secs
lola: 31477710 markings, 160898863 edges, 66471 markings/sec, 425 secs
lola: 31797581 markings, 162633341 edges, 63974 markings/sec, 430 secs
lola: 32141805 markings, 164416812 edges, 68845 markings/sec, 435 secs
lola: 32454287 markings, 166126038 edges, 62496 markings/sec, 440 secs
lola: 32790863 markings, 167909270 edges, 67315 markings/sec, 445 secs
lola: 33124114 markings, 169669279 edges, 66650 markings/sec, 450 secs
lola: 33444134 markings, 171386740 edges, 64004 markings/sec, 455 secs
lola: 33775047 markings, 173151107 edges, 66183 markings/sec, 460 secs
lola: 34110776 markings, 174928101 edges, 67146 markings/sec, 465 secs
lola: 34432856 markings, 176648491 edges, 64416 markings/sec, 470 secs
lola: 34759044 markings, 178377850 edges, 65238 markings/sec, 475 secs
lola: 35083046 markings, 180094137 edges, 64800 markings/sec, 480 secs
lola: 35372017 markings, 181644709 edges, 57794 markings/sec, 485 secs
lola: 35391849 markings, 181748895 edges, 3966 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no unknown yes yes no yes unknown no yes yes no yes yes unknown
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-20a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20a.tgz
mv FlexibleBarrier-PT-20a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is FlexibleBarrier-PT-20a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r095-blw7-152650007100213"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;