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-full
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 r094-blw7-152650006200213
=====================================================================

--------------------
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 1527514712152


BK_STOP 1527516256862

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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: 986650 markings, 3320882 edges, 197234 markings/sec, 0 secs
lola: 1922426 markings, 6537419 edges, 187155 markings/sec, 5 secs
lola: 2747945 markings, 9490947 edges, 165104 markings/sec, 10 secs
lola: 3530161 markings, 12318378 edges, 156443 markings/sec, 15 secs
lola: 4349034 markings, 15221494 edges, 163775 markings/sec, 20 secs
lola: 5127923 markings, 18009033 edges, 155778 markings/sec, 25 secs
lola: 5872508 markings, 20703556 edges, 148917 markings/sec, 30 secs
lola: 6599813 markings, 23359943 edges, 145461 markings/sec, 35 secs
lola: 7336093 markings, 26017823 edges, 147256 markings/sec, 40 secs
lola: 8049956 markings, 28618712 edges, 142773 markings/sec, 45 secs
lola: 8751488 markings, 31183860 edges, 140306 markings/sec, 50 secs
lola: 9452719 markings, 33748198 edges, 140246 markings/sec, 55 secs
lola: 10135629 markings, 36258291 edges, 136582 markings/sec, 60 secs
lola: 10810361 markings, 38739918 edges, 134946 markings/sec, 65 secs
lola: 11479807 markings, 41213333 edges, 133889 markings/sec, 70 secs
lola: 12131404 markings, 43637733 edges, 130319 markings/sec, 75 secs
lola: 12995167 markings, 46650187 edges, 172753 markings/sec, 80 secs
lola: 13905477 markings, 49824226 edges, 182062 markings/sec, 85 secs
lola: 14748160 markings, 52829278 edges, 168537 markings/sec, 90 secs
lola: 15681124 markings, 56014187 edges, 186593 markings/sec, 95 secs
lola: 16477045 markings, 58847785 edges, 159184 markings/sec, 100 secs
lola: 17235977 markings, 61584630 edges, 151786 markings/sec, 105 secs
lola: 17997044 markings, 64309899 edges, 152213 markings/sec, 110 secs
lola: 18735487 markings, 66977877 edges, 147689 markings/sec, 115 secs
lola: 19460295 markings, 69611452 edges, 144962 markings/sec, 120 secs
lola: 20166165 markings, 72185120 edges, 141174 markings/sec, 125 secs
lola: 20854844 markings, 74720739 edges, 137736 markings/sec, 130 secs
lola: 21535865 markings, 77235210 edges, 136204 markings/sec, 135 secs
lola: 22207917 markings, 79720394 edges, 134410 markings/sec, 140 secs
lola: 22884750 markings, 82216067 edges, 135367 markings/sec, 145 secs
lola: 23557352 markings, 84692778 edges, 134520 markings/sec, 150 secs
lola: 24218923 markings, 87128356 edges, 132314 markings/sec, 155 secs
lola: 24866489 markings, 89527970 edges, 129513 markings/sec, 160 secs
lola: 25509726 markings, 91928998 edges, 128647 markings/sec, 165 secs
lola: 26157328 markings, 94328328 edges, 129520 markings/sec, 170 secs
lola: 26795268 markings, 96715400 edges, 127588 markings/sec, 175 secs
lola: 27432936 markings, 99095502 edges, 127534 markings/sec, 180 secs
lola: 28056983 markings, 101424542 edges, 124809 markings/sec, 185 secs
lola: 28675630 markings, 103743923 edges, 123729 markings/sec, 190 secs
lola: 29290998 markings, 106063854 edges, 123074 markings/sec, 195 secs
lola: 29909726 markings, 108369444 edges, 123746 markings/sec, 200 secs
lola: 30528901 markings, 110686605 edges, 123835 markings/sec, 205 secs
lola: 31152863 markings, 113023752 edges, 124792 markings/sec, 210 secs
lola: 31766791 markings, 115325275 edges, 122786 markings/sec, 215 secs
lola: 32381724 markings, 117633335 edges, 122987 markings/sec, 220 secs
lola: 33012623 markings, 119994424 edges, 126180 markings/sec, 225 secs
lola: 33668931 markings, 122423092 edges, 131262 markings/sec, 230 secs
lola: 34314311 markings, 124825453 edges, 129076 markings/sec, 235 secs
lola: 34923096 markings, 127108454 edges, 121757 markings/sec, 240 secs
lola: 35531139 markings, 129401562 edges, 121609 markings/sec, 245 secs
lola: 36131662 markings, 131672153 edges, 120105 markings/sec, 250 secs
lola: 36737709 markings, 133950093 edges, 121209 markings/sec, 255 secs
lola: 37330848 markings, 136185921 edges, 118628 markings/sec, 260 secs
lola: 37914742 markings, 138407664 edges, 116779 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to FlexibleBarrier-PT-20a-CTLCardinality-4.sara
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: calling and running sara
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
sara: try reading problem file 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: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
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

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: 1175243 markings, 2753191 edges, 235036 markings/sec, 0 secs
lola: 2286206 markings, 5457325 edges, 222193 markings/sec, 5 secs
lola: 3341478 markings, 8085126 edges, 211054 markings/sec, 10 secs
lola: 4252700 markings, 10479295 edges, 182244 markings/sec, 15 secs
lola: 5167457 markings, 12880124 edges, 182951 markings/sec, 20 secs
lola: 6036033 markings, 15191176 edges, 173715 markings/sec, 25 secs
lola: 6852448 markings, 17410382 edges, 163283 markings/sec, 30 secs
lola: 7744017 markings, 19755086 edges, 178314 markings/sec, 35 secs
lola: 8784111 markings, 22355457 edges, 208019 markings/sec, 40 secs
lola: 9777605 markings, 24896401 edges, 198699 markings/sec, 45 secs
lola: 10697521 markings, 27287134 edges, 183983 markings/sec, 50 secs
lola: 11535293 markings, 29539569 edges, 167554 markings/sec, 55 secs
lola: 12336911 markings, 31741517 edges, 160324 markings/sec, 60 secs
lola: 13271833 markings, 34112863 edges, 186984 markings/sec, 65 secs
lola: 14259228 markings, 36607579 edges, 197479 markings/sec, 70 secs
lola: 15288323 markings, 39147803 edges, 205819 markings/sec, 75 secs
lola: 16061316 markings, 41284157 edges, 154599 markings/sec, 80 secs
lola: 16816712 markings, 43365547 edges, 151079 markings/sec, 85 secs
lola: 17670778 markings, 45611146 edges, 170813 markings/sec, 90 secs
lola: 18545475 markings, 47866687 edges, 174939 markings/sec, 95 secs
lola: 19311883 markings, 49991307 edges, 153282 markings/sec, 100 secs
lola: 20077642 markings, 52067233 edges, 153152 markings/sec, 105 secs
lola: 20811781 markings, 54104310 edges, 146828 markings/sec, 110 secs
lola: 21542462 markings, 56102337 edges, 146136 markings/sec, 115 secs
lola: 22225683 markings, 58051666 edges, 136644 markings/sec, 120 secs
lola: 22969380 markings, 60076046 edges, 148739 markings/sec, 125 secs
lola: 23682622 markings, 62046107 edges, 142648 markings/sec, 130 secs
lola: 24384597 markings, 63983214 edges, 140395 markings/sec, 135 secs
lola: 25103787 markings, 65966607 edges, 143838 markings/sec, 140 secs
lola: 25781802 markings, 67882967 edges, 135603 markings/sec, 145 secs
lola: 26516043 markings, 69867549 edges, 146848 markings/sec, 150 secs
lola: 27243039 markings, 71885316 edges, 145399 markings/sec, 155 secs
lola: 27969766 markings, 73890929 edges, 145345 markings/sec, 160 secs
lola: 28631814 markings, 75768512 edges, 132410 markings/sec, 165 secs
lola: 29331130 markings, 77695679 edges, 139863 markings/sec, 170 secs
lola: 30013231 markings, 79592269 edges, 136420 markings/sec, 175 secs
lola: 30725309 markings, 81559456 edges, 142416 markings/sec, 180 secs
lola: 31403014 markings, 83447925 edges, 135541 markings/sec, 185 secs
lola: 32061965 markings, 85309834 edges, 131790 markings/sec, 190 secs
lola: 32705688 markings, 87115938 edges, 128745 markings/sec, 195 secs
lola: 33425658 markings, 89102106 edges, 143994 markings/sec, 200 secs
lola: 34080854 markings, 90932476 edges, 131039 markings/sec, 205 secs
lola: 34739148 markings, 92759179 edges, 131659 markings/sec, 210 secs
lola: 35395996 markings, 94617613 edges, 131370 markings/sec, 215 secs
lola: 36032810 markings, 96435956 edges, 127363 markings/sec, 220 secs
lola: 36673895 markings, 98244947 edges, 128217 markings/sec, 225 secs
lola: 37308633 markings, 100057705 edges, 126948 markings/sec, 230 secs
lola: 37922872 markings, 101827650 edges, 122848 markings/sec, 235 secs
lola: 38538852 markings, 103613910 edges, 123196 markings/sec, 240 secs
lola: 39187486 markings, 105474201 edges, 129727 markings/sec, 245 secs
lola: 39922419 markings, 107499652 edges, 146987 markings/sec, 250 secs
lola: 40750081 markings, 109641277 edges, 165532 markings/sec, 255 secs
lola: 41431993 markings, 111566041 edges, 136382 markings/sec, 260 secs
lola: 42081155 markings, 113396246 edges, 129832 markings/sec, 265 secs
lola: 42721614 markings, 115195801 edges, 128092 markings/sec, 270 secs
lola: 43319924 markings, 116951300 edges, 119662 markings/sec, 275 secs
lola: 43943551 markings, 118734329 edges, 124725 markings/sec, 280 secs
lola: 44591068 markings, 120548414 edges, 129503 markings/sec, 285 secs
lola: 45223873 markings, 122341867 edges, 126561 markings/sec, 290 secs
lola: 45844001 markings, 124122200 edges, 124026 markings/sec, 295 secs
lola: 46456575 markings, 125892020 edges, 122515 markings/sec, 300 secs
lola: 47167600 markings, 127858343 edges, 142205 markings/sec, 305 secs
lola: 47845745 markings, 129773185 edges, 135629 markings/sec, 310 secs
lola: 48484376 markings, 131603212 edges, 127726 markings/sec, 315 secs
lola: 49100431 markings, 133365737 edges, 123211 markings/sec, 320 secs
lola: 49740580 markings, 135193089 edges, 128030 markings/sec, 325 secs
lola: 50371086 markings, 136990057 edges, 126101 markings/sec, 330 secs
lola: 51010414 markings, 138802493 edges, 127866 markings/sec, 335 secs
lola: 51616626 markings, 140565835 edges, 121242 markings/sec, 340 secs
lola: 52258286 markings, 142378289 edges, 128332 markings/sec, 345 secs
lola: 52861319 markings, 144120685 edges, 120607 markings/sec, 350 secs
lola: 53451457 markings, 145839273 edges, 118028 markings/sec, 355 secs
lola: 54091708 markings, 147662461 edges, 128050 markings/sec, 360 secs
lola: 54723983 markings, 149455510 edges, 126455 markings/sec, 365 secs
lola: 55353558 markings, 151248569 edges, 125915 markings/sec, 370 secs
lola: 55980950 markings, 153045897 edges, 125478 markings/sec, 375 secs
lola: 56614643 markings, 154868288 edges, 126739 markings/sec, 380 secs
lola: 57322496 markings, 156800461 edges, 141571 markings/sec, 385 secs
lola: 57974009 markings, 158658605 edges, 130303 markings/sec, 390 secs
lola: 58596437 markings, 160442022 edges, 124486 markings/sec, 395 secs
lola: 59196670 markings, 162177926 edges, 120047 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: 1021424 markings, 2778773 edges, 3689323855827959808 markings/sec, 0 secs
lola: 1967056 markings, 5447664 edges, 189126 markings/sec, 5 secs
lola: 2971701 markings, 8163288 edges, 200929 markings/sec, 10 secs
lola: 3793772 markings, 10591582 edges, 164414 markings/sec, 15 secs
lola: 4592276 markings, 13008388 edges, 159701 markings/sec, 20 secs
lola: 5328053 markings, 15280122 edges, 147155 markings/sec, 25 secs
lola: 6012672 markings, 17449129 edges, 136924 markings/sec, 30 secs
lola: 6679805 markings, 19584426 edges, 133427 markings/sec, 35 secs
lola: 7337624 markings, 21701966 edges, 131564 markings/sec, 40 secs
lola: 8035808 markings, 23874458 edges, 139637 markings/sec, 45 secs
lola: 8654854 markings, 25920323 edges, 123809 markings/sec, 50 secs
lola: 9320689 markings, 28000255 edges, 133167 markings/sec, 55 secs
lola: 10000157 markings, 30136186 edges, 135894 markings/sec, 60 secs
lola: 10636803 markings, 32185743 edges, 127329 markings/sec, 65 secs
lola: 11236331 markings, 34160083 edges, 119906 markings/sec, 70 secs
lola: 11874165 markings, 36217058 edges, 127567 markings/sec, 75 secs
lola: 12472305 markings, 38193748 edges, 119628 markings/sec, 80 secs
lola: 13083625 markings, 40198677 edges, 122264 markings/sec, 85 secs
lola: 13931259 markings, 42661185 edges, 169527 markings/sec, 90 secs
lola: 14698605 markings, 44977250 edges, 153469 markings/sec, 95 secs
lola: 15532496 markings, 47390813 edges, 166778 markings/sec, 100 secs
lola: 16250169 markings, 49603892 edges, 143535 markings/sec, 105 secs
lola: 16922084 markings, 51741064 edges, 134383 markings/sec, 110 secs
lola: 17585604 markings, 53848047 edges, 132704 markings/sec, 115 secs
lola: 18196479 markings, 55834987 edges, 122175 markings/sec, 120 secs
lola: 18802408 markings, 57837152 edges, 121186 markings/sec, 125 secs
lola: 19411463 markings, 59829873 edges, 121811 markings/sec, 130 secs
lola: 20124260 markings, 61991922 edges, 142559 markings/sec, 135 secs
lola: 20975266 markings, 64393172 edges, 170201 markings/sec, 140 secs
lola: 21874102 markings, 66855934 edges, 179767 markings/sec, 145 secs
lola: 22641093 markings, 69120677 edges, 153398 markings/sec, 150 secs
lola: 23278099 markings, 71157356 edges, 127401 markings/sec, 155 secs
lola: 23901430 markings, 73153992 edges, 124666 markings/sec, 160 secs
lola: 24610025 markings, 75305907 edges, 141719 markings/sec, 165 secs
lola: 25265711 markings, 77371286 edges, 131137 markings/sec, 170 secs
lola: 25900436 markings, 79394468 edges, 126945 markings/sec, 175 secs
lola: 26478511 markings, 81320182 edges, 115615 markings/sec, 180 secs
lola: 27040622 markings, 83213989 edges, 112422 markings/sec, 185 secs
lola: 27609772 markings, 85125490 edges, 113830 markings/sec, 190 secs
lola: 28179453 markings, 87025486 edges, 113936 markings/sec, 195 secs
lola: 28780042 markings, 88969509 edges, 120118 markings/sec, 200 secs
lola: 29346702 markings, 90864213 edges, 113332 markings/sec, 205 secs
lola: 29912229 markings, 92746258 edges, 113105 markings/sec, 210 secs
lola: 30497109 markings, 94675585 edges, 116976 markings/sec, 215 secs
lola: 31056012 markings, 96554735 edges, 111781 markings/sec, 220 secs
lola: 31610425 markings, 98394546 edges, 110883 markings/sec, 225 secs
lola: 32192571 markings, 100307957 edges, 116429 markings/sec, 230 secs
lola: 32729784 markings, 102117635 edges, 107443 markings/sec, 235 secs
lola: 33306005 markings, 104027406 edges, 115244 markings/sec, 240 secs
lola: 33653410 markings, 105237416 edges, 69481 markings/sec, 245 secs
lola: 33653410 markings, 105237416 edges, 0 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: 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: ========================================
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 1292 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 1292 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 2584 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 2584 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: 437738 markings, 1981710 edges, 87535 markings/sec, 0 secs
lola: 843989 markings, 3948328 edges, 81250 markings/sec, 5 secs
lola: 1222390 markings, 5825838 edges, 75680 markings/sec, 10 secs
lola: 1653510 markings, 7846517 edges, 86224 markings/sec, 15 secs
lola: 2050528 markings, 9797077 edges, 79404 markings/sec, 20 secs
lola: 2466634 markings, 11790397 edges, 83221 markings/sec, 25 secs
lola: 2922280 markings, 13865359 edges, 91129 markings/sec, 30 secs
lola: 3329522 markings, 15844480 edges, 81448 markings/sec, 35 secs
lola: 3712561 markings, 17767592 edges, 76608 markings/sec, 40 secs
lola: 4089161 markings, 19671514 edges, 75320 markings/sec, 45 secs
lola: 4480289 markings, 21617005 edges, 78226 markings/sec, 50 secs
lola: 4857961 markings, 23529031 edges, 75534 markings/sec, 55 secs
lola: 5225778 markings, 25407607 edges, 73563 markings/sec, 60 secs
lola: 5592278 markings, 27286118 edges, 73300 markings/sec, 65 secs
lola: 5947950 markings, 29137266 edges, 71134 markings/sec, 70 secs
lola: 6304488 markings, 30990865 edges, 71308 markings/sec, 75 secs
lola: 6655723 markings, 32819666 edges, 70247 markings/sec, 80 secs
lola: 7012523 markings, 34673464 edges, 71360 markings/sec, 85 secs
lola: 7360701 markings, 36497405 edges, 69636 markings/sec, 90 secs
lola: 7741861 markings, 38396265 edges, 76232 markings/sec, 95 secs
lola: 8085308 markings, 40211890 edges, 68689 markings/sec, 100 secs
lola: 8433673 markings, 42046599 edges, 69673 markings/sec, 105 secs
lola: 8771400 markings, 43840110 edges, 67545 markings/sec, 110 secs
lola: 9142415 markings, 45715282 edges, 74203 markings/sec, 115 secs
lola: 9488425 markings, 47510005 edges, 69202 markings/sec, 120 secs
lola: 9851055 markings, 49354421 edges, 72526 markings/sec, 125 secs
lola: 10198404 markings, 51149190 edges, 69470 markings/sec, 130 secs
lola: 10535339 markings, 52912700 edges, 67387 markings/sec, 135 secs
lola: 10876383 markings, 54717350 edges, 68209 markings/sec, 140 secs
lola: 11211417 markings, 56502115 edges, 67007 markings/sec, 145 secs
lola: 11556111 markings, 58309828 edges, 68939 markings/sec, 150 secs
lola: 11904102 markings, 60123422 edges, 69598 markings/sec, 155 secs
lola: 12236361 markings, 61901101 edges, 66452 markings/sec, 160 secs
lola: 12567938 markings, 63633636 edges, 66315 markings/sec, 165 secs
lola: 12896115 markings, 65383400 edges, 65635 markings/sec, 170 secs
lola: 13217977 markings, 67097994 edges, 64372 markings/sec, 175 secs
lola: 13643087 markings, 69113584 edges, 85022 markings/sec, 180 secs
lola: 14048470 markings, 71103079 edges, 81077 markings/sec, 185 secs
lola: 14432605 markings, 73028486 edges, 76827 markings/sec, 190 secs
lola: 14809787 markings, 74947875 edges, 75436 markings/sec, 195 secs
lola: 15230236 markings, 76956657 edges, 84090 markings/sec, 200 secs
lola: 15606134 markings, 78825231 edges, 75180 markings/sec, 205 secs
lola: 15974168 markings, 80704451 edges, 73607 markings/sec, 210 secs
lola: 16343957 markings, 82586855 edges, 73958 markings/sec, 215 secs
lola: 16697182 markings, 84431037 edges, 70645 markings/sec, 220 secs
lola: 17058146 markings, 86289585 edges, 72193 markings/sec, 225 secs
lola: 17412799 markings, 88135090 edges, 70931 markings/sec, 230 secs
lola: 17763474 markings, 89960875 edges, 70135 markings/sec, 235 secs
lola: 18110433 markings, 91778566 edges, 69392 markings/sec, 240 secs
lola: 18455845 markings, 93593004 edges, 69082 markings/sec, 245 secs
lola: 18793418 markings, 95394392 edges, 67515 markings/sec, 250 secs
lola: 19136526 markings, 97200654 edges, 68622 markings/sec, 255 secs
lola: 19475581 markings, 98996625 edges, 67811 markings/sec, 260 secs
lola: 19816550 markings, 100802869 edges, 68194 markings/sec, 265 secs
lola: 20246796 markings, 102793077 edges, 86049 markings/sec, 270 secs
lola: 20653989 markings, 104752177 edges, 81439 markings/sec, 275 secs
lola: 21037118 markings, 106651764 edges, 76626 markings/sec, 280 secs
lola: 21443004 markings, 108594627 edges, 81177 markings/sec, 285 secs
lola: 21867166 markings, 110570763 edges, 84832 markings/sec, 290 secs
lola: 22254371 markings, 112469895 edges, 77441 markings/sec, 295 secs
lola: 22629711 markings, 114350241 edges, 75068 markings/sec, 300 secs
lola: 22993381 markings, 116186585 edges, 72734 markings/sec, 305 secs
lola: 23325247 markings, 117958598 edges, 66373 markings/sec, 310 secs
lola: 23672164 markings, 119730841 edges, 69383 markings/sec, 315 secs
lola: 24015823 markings, 121523527 edges, 68732 markings/sec, 320 secs
lola: 24380494 markings, 123367210 edges, 72934 markings/sec, 325 secs
lola: 24738812 markings, 125187611 edges, 71664 markings/sec, 330 secs
lola: 25087999 markings, 126991339 edges, 69837 markings/sec, 335 secs
lola: 25437730 markings, 128792676 edges, 69946 markings/sec, 340 secs
lola: 25785995 markings, 130587069 edges, 69653 markings/sec, 345 secs
lola: 26109454 markings, 132300013 edges, 64692 markings/sec, 350 secs
lola: 26439440 markings, 134067035 edges, 65997 markings/sec, 355 secs
lola: 26758790 markings, 135785040 edges, 63870 markings/sec, 360 secs
lola: 27088072 markings, 137532394 edges, 65856 markings/sec, 365 secs
lola: 27410725 markings, 139275942 edges, 64531 markings/sec, 370 secs
lola: 27736293 markings, 141024144 edges, 65114 markings/sec, 375 secs
lola: 28061600 markings, 142768813 edges, 65061 markings/sec, 380 secs
lola: 28408807 markings, 144554790 edges, 69441 markings/sec, 385 secs
lola: 28738933 markings, 146305741 edges, 66025 markings/sec, 390 secs
lola: 29058577 markings, 148031624 edges, 63929 markings/sec, 395 secs
lola: 29390080 markings, 149782612 edges, 66301 markings/sec, 400 secs
lola: 29713344 markings, 151511662 edges, 64653 markings/sec, 405 secs
lola: 30043019 markings, 153259342 edges, 65935 markings/sec, 410 secs
lola: 30378921 markings, 155024598 edges, 67180 markings/sec, 415 secs
lola: 30702317 markings, 156757016 edges, 64679 markings/sec, 420 secs
lola: 31019890 markings, 158475675 edges, 63515 markings/sec, 425 secs
lola: 31352882 markings, 160225133 edges, 66598 markings/sec, 430 secs
lola: 31673712 markings, 161955165 edges, 64166 markings/sec, 435 secs
lola: 32005813 markings, 163707347 edges, 66420 markings/sec, 440 secs
lola: 32326867 markings, 165435311 edges, 64211 markings/sec, 445 secs
lola: 32655329 markings, 167169095 edges, 65692 markings/sec, 450 secs
lola: 32979536 markings, 168907275 edges, 64841 markings/sec, 455 secs
lola: 33306395 markings, 170641535 edges, 65372 markings/sec, 460 secs
lola: 33607962 markings, 172288449 edges, 60313 markings/sec, 465 secs
lola: 33947817 markings, 174047013 edges, 67971 markings/sec, 470 secs
lola: 34267077 markings, 175767579 edges, 63852 markings/sec, 475 secs
lola: 34575232 markings, 177419190 edges, 61631 markings/sec, 480 secs
lola: 34907148 markings, 179152614 edges, 66383 markings/sec, 485 secs
lola: 35226128 markings, 180855396 edges, 63796 markings/sec, 490 secs
lola: 35389238 markings, 181734931 edges, 32622 markings/sec, 495 secs
lola: 35390708 markings, 181742477 edges, 294 markings/sec, 500 secs
lola: 35392879 markings, 181754066 edges, 434 markings/sec, 505 secs
lola: 35393550 markings, 181757633 edges, 134 markings/sec, 510 secs
lola: 35394157 markings, 181760797 edges, 121 markings/sec, 515 secs
lola: 35395161 markings, 181766213 edges, 201 markings/sec, 520 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
----- Kill lola and sara stderr -----
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 -----
----- 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-full"
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-full"
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 r094-blw7-152650006200213"
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 ;