About the Execution of M4M.full for Referendum-PT-0015
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2738.950 | 1377135.00 | 1360551.00 | 7827.20 | FFFFFFFFTFFTFFTT | normal |
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 300K
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-PT-0015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583900270
=====================================================================
--------------------
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 Referendum-PT-0015-CTLFireability-00
FORMULA_NAME Referendum-PT-0015-CTLFireability-01
FORMULA_NAME Referendum-PT-0015-CTLFireability-02
FORMULA_NAME Referendum-PT-0015-CTLFireability-03
FORMULA_NAME Referendum-PT-0015-CTLFireability-04
FORMULA_NAME Referendum-PT-0015-CTLFireability-05
FORMULA_NAME Referendum-PT-0015-CTLFireability-06
FORMULA_NAME Referendum-PT-0015-CTLFireability-07
FORMULA_NAME Referendum-PT-0015-CTLFireability-08
FORMULA_NAME Referendum-PT-0015-CTLFireability-09
FORMULA_NAME Referendum-PT-0015-CTLFireability-10
FORMULA_NAME Referendum-PT-0015-CTLFireability-11
FORMULA_NAME Referendum-PT-0015-CTLFireability-12
FORMULA_NAME Referendum-PT-0015-CTLFireability-13
FORMULA_NAME Referendum-PT-0015-CTLFireability-14
FORMULA_NAME Referendum-PT-0015-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527968385464
BK_STOP 1527969762599
--------------------
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 Referendum-PT-0015 as instance name.
Using Referendum as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 2128, 'Memory': 153.76, 'Tool': 'gspn'}, {'Time': 2456, 'Memory': 2206.43, 'Tool': 'marcie'}, {'Time': 3974, 'Memory': 215.04, 'Tool': 'itstools'}, {'Time': 2402655, 'Memory': 2445.58, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1129.0671992481202x far from the best tool gspn.
CTLFireability lola Referendum-PT-0015...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Referendum-PT-0015: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
Referendum-PT-0015: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Referendum-PT-0015 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 77/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 18 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0015-CTLFireability.task
lola: ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) OR (E (G (E (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)))))) OR (FIREABLE(start_0) AND (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14))))) : E (G (A (F ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)))))) : (A (G (NOT(A (X (FIREABLE(start_0)))))) AND FIREABLE(start_0)) : A (G (E (F ((((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) AND FIREABLE(start_0)) OR ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) AND FIREABLE(start_0))))))) : NOT(((A (((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) U FIREABLE(start_0))) AND (A (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)))) AND (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)))) OR NOT(E (F (((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) AND FIREABLE(start_0))))))) : (E ((((FIREABLE(start_0)) AND (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))) U (NOT FIREABLE(yes_0) AND NOT FIREABLE(yes_1) AND NOT FIREABLE(yes_2) AND NOT FIREABLE(yes_3) AND NOT FIREABLE(yes_4) AND NOT FIREABLE(yes_5) AND NOT FIREABLE(yes_6) AND NOT FIREABLE(yes_7) AND NOT FIREABLE(yes_8) AND NOT FIREABLE(yes_9) AND NOT FIREABLE(yes_10) AND NOT FIREABLE(yes_11) AND NOT FIREABLE(yes_12) AND NOT FIREABLE(yes_13) AND NOT FIREABLE(yes_14) AND (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))))) AND (E (F (E (F (FIREABLE(start_0))))) OR (E ((FIREABLE(start_0) U FIREABLE(start_0))) OR (NOT FIREABLE(yes_0) AND NOT FIREABLE(yes_1) AND NOT FIREABLE(yes_2) AND NOT FIREABLE(yes_3) AND NOT FIREABLE(yes_4) AND NOT FIREABLE(yes_5) AND NOT FIREABLE(yes_6) AND NOT FIREABLE(yes_7) AND NOT FIREABLE(yes_8) AND NOT FIREABLE(yes_9) AND NOT FIREABLE(yes_10) AND NOT FIREABLE(yes_11) AND NOT FIREABLE(yes_12) AND NOT FIREABLE(yes_13) AND NOT FIREABLE(yes_14) AND NOT FIREABLE(no_0) AND NOT FIREABLE(no_1) AND NOT FIREABLE(no_2) AND NOT FIREABLE(no_3) AND NOT FIREABLE(no_4) AND NOT FIREABLE(no_5) AND NOT FIREABLE(no_6) AND NOT FIREABLE(no_7) AND NOT FIREABLE(no_8) AND NOT FIREABLE(no_9) AND NOT FIREABLE(no_10) AND NOT FIREABLE(no_11) AND NOT FIREABLE(no_12) AND NOT FIREABLE(no_13) AND NOT FIREABLE(no_14) AND (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)))))) : A (F (A (((FIREABLE(start_0)) U ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) AND FIREABLE(start_0)))))) : NOT(E (F (A (X ((FIREABLE(start_0))))))) : A (F ((A (G (NOT FIREABLE(no_0))) AND E (G (NOT FIREABLE(no_5)))))) : E (X ((E (G (FIREABLE(yes_1))) OR ((NOT FIREABLE(no_9)) AND (NOT FIREABLE(yes_5) OR NOT FIREABLE(yes_4)))))) : A (F (A (G (FIREABLE(start_0))))) : E (G (E (F ((NOT FIREABLE(no_12) OR FIREABLE(yes_1)))))) : E ((A (F ((FIREABLE(no_3) AND FIREABLE(no_0)))) U (A (G (FIREABLE(no_14))) AND (FIREABLE(no_7) AND FIREABLE(no_1) AND FIREABLE(yes_6))))) : (A (G (A (F (FIREABLE(no_13))))) OR FIREABLE(no_11)) : NOT((FIREABLE(no_3) OR A (F (E (G (FIREABLE(yes_6))))))) : NOT(E (F (A (G (FIREABLE(no_7))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) OR (E (G (E (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIR... (shortened)
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: (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14))
lola: processed formula length: 302
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))))))
lola: processed formula length: 311
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 488106 markings, 3796254 edges, 97311 markings/sec, 0 secs
lola: 934439 markings, 7540884 edges, 89267 markings/sec, 5 secs
lola: 1339380 markings, 11159302 edges, 80988 markings/sec, 10 secs
lola: 1720931 markings, 14723727 edges, 76310 markings/sec, 15 secs
lola: 2147306 markings, 18383786 edges, 85275 markings/sec, 20 secs
lola: 2529125 markings, 21943147 edges, 76364 markings/sec, 25 secs
lola: 2914052 markings, 25513422 edges, 76985 markings/sec, 30 secs
lola: 3284512 markings, 29034112 edges, 74092 markings/sec, 35 secs
lola: 3658679 markings, 32594191 edges, 74833 markings/sec, 40 secs
lola: 4005106 markings, 36066096 edges, 69285 markings/sec, 45 secs
lola: 4334639 markings, 39485534 edges, 65907 markings/sec, 50 secs
lola: 4635409 markings, 42777600 edges, 60154 markings/sec, 55 secs
lola: 5008264 markings, 46297383 edges, 74571 markings/sec, 60 secs
lola: 5434133 markings, 50030497 edges, 85174 markings/sec, 65 secs
lola: 5797435 markings, 53564238 edges, 72660 markings/sec, 70 secs
lola: 6205682 markings, 57220371 edges, 81649 markings/sec, 75 secs
lola: 6564567 markings, 60753993 edges, 71777 markings/sec, 80 secs
lola: 6940154 markings, 64334069 edges, 75117 markings/sec, 85 secs
lola: 7286445 markings, 67807472 edges, 69258 markings/sec, 90 secs
lola: 7616643 markings, 71244619 edges, 66040 markings/sec, 95 secs
lola: 7907207 markings, 74540383 edges, 58113 markings/sec, 100 secs
lola: 8305527 markings, 78202149 edges, 79664 markings/sec, 105 secs
lola: 8658412 markings, 81726317 edges, 70577 markings/sec, 110 secs
lola: 9044491 markings, 85331317 edges, 77216 markings/sec, 115 secs
lola: 9393107 markings, 88828326 edges, 69723 markings/sec, 120 secs
lola: 9721173 markings, 92263701 edges, 65613 markings/sec, 125 secs
lola: 10016671 markings, 95580007 edges, 59100 markings/sec, 130 secs
lola: 10380824 markings, 99143885 edges, 72831 markings/sec, 135 secs
lola: 10733253 markings, 102669547 edges, 70486 markings/sec, 140 secs
lola: 11059768 markings, 106091647 edges, 65303 markings/sec, 145 secs
lola: 11368117 markings, 109450891 edges, 61670 markings/sec, 150 secs
lola: 11690534 markings, 112860824 edges, 64483 markings/sec, 155 secs
lola: 12015780 markings, 116283974 edges, 65049 markings/sec, 160 secs
lola: 12318785 markings, 119584163 edges, 60601 markings/sec, 165 secs
lola: 12621249 markings, 122922530 edges, 60493 markings/sec, 170 secs
lola: 12928377 markings, 126293370 edges, 61426 markings/sec, 175 secs
lola: 13217011 markings, 129570445 edges, 57727 markings/sec, 180 secs
lola: 13492503 markings, 132792422 edges, 55098 markings/sec, 185 secs
lola: 13764879 markings, 135977976 edges, 54475 markings/sec, 190 secs
lola: 14031466 markings, 139161375 edges, 53317 markings/sec, 195 secs
lola: 14270105 markings, 142257513 edges, 47728 markings/sec, 200 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14316140 markings, 142997551 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(start_0) AND (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(start_0) AND (FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)))
lola: processed formula length: 326
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14))))))
lola: processed formula length: 317
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 492903 markings, 4344597 edges, 3689348869717491712 markings/sec, 0 secs
lola: 947513 markings, 8620580 edges, 90922 markings/sec, 5 secs
lola: 1361254 markings, 12753660 edges, 82748 markings/sec, 10 secs
lola: 1755632 markings, 16798494 edges, 78876 markings/sec, 15 secs
lola: 2184127 markings, 20989962 edges, 85699 markings/sec, 20 secs
lola: 2574791 markings, 25023666 edges, 78133 markings/sec, 25 secs
lola: 2977664 markings, 29110367 edges, 80575 markings/sec, 30 secs
lola: 3346337 markings, 33083679 edges, 73735 markings/sec, 35 secs
lola: 3731564 markings, 37110643 edges, 77045 markings/sec, 40 secs
lola: 4086254 markings, 41031329 edges, 70938 markings/sec, 45 secs
lola: 4422648 markings, 44884213 edges, 67279 markings/sec, 50 secs
lola: 4727827 markings, 48609760 edges, 61036 markings/sec, 55 secs
lola: 5151313 markings, 52838395 edges, 84697 markings/sec, 60 secs
lola: 5584734 markings, 57103944 edges, 86684 markings/sec, 65 secs
lola: 5974025 markings, 61211672 edges, 77858 markings/sec, 70 secs
lola: 6381041 markings, 65358202 edges, 81403 markings/sec, 75 secs
lola: 6759103 markings, 69396745 edges, 75612 markings/sec, 80 secs
lola: 7122649 markings, 73375242 edges, 72709 markings/sec, 85 secs
lola: 7477436 markings, 77332989 edges, 70957 markings/sec, 90 secs
lola: 7798409 markings, 81142088 edges, 64195 markings/sec, 95 secs
lola: 8151176 markings, 85092831 edges, 70553 markings/sec, 100 secs
lola: 8551205 markings, 89228967 edges, 80006 markings/sec, 105 secs
lola: 8933729 markings, 93297599 edges, 76505 markings/sec, 110 secs
lola: 9293684 markings, 97239421 edges, 71991 markings/sec, 115 secs
lola: 9636778 markings, 101097706 edges, 68619 markings/sec, 120 secs
lola: 9951582 markings, 104856178 edges, 62961 markings/sec, 125 secs
lola: 10295300 markings, 108778680 edges, 68744 markings/sec, 130 secs
lola: 10658521 markings, 112741177 edges, 72644 markings/sec, 135 secs
lola: 11012719 markings, 116691074 edges, 70840 markings/sec, 140 secs
lola: 11333024 markings, 120497237 edges, 64061 markings/sec, 145 secs
lola: 11655797 markings, 124324931 edges, 64555 markings/sec, 150 secs
lola: 12000076 markings, 128198842 edges, 68856 markings/sec, 155 secs
lola: 12314787 markings, 131955387 edges, 62942 markings/sec, 160 secs
lola: 12627097 markings, 135721909 edges, 62462 markings/sec, 165 secs
lola: 12945035 markings, 139519252 edges, 63588 markings/sec, 170 secs
lola: 13243109 markings, 143233052 edges, 59615 markings/sec, 175 secs
lola: 13532565 markings, 146890431 edges, 57891 markings/sec, 180 secs
lola: 13818482 markings, 150512633 edges, 57183 markings/sec, 185 secs
lola: 14088184 markings, 154068871 edges, 53940 markings/sec, 190 secs
lola: 14331922 markings, 157524094 edges, 48748 markings/sec, 195 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 157837980 edges
lola: ========================================
lola: subprocess 2 will run for 223 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT(A (X (FIREABLE(start_0)))))) AND FIREABLE(start_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 223 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(start_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(start_0)))))
lola: processed formula length: 45
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 240 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) AND FIREABLE(start_0)) OR ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) AND FIREABLE(start_0)) OR ((FIREABLE(no_0) OR FIREABLE(no_1) OR FI... (shortened)
lola: processed formula length: 674
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 529481 markings, 4223299 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1036888 markings, 8431456 edges, 101481 markings/sec, 5 secs
lola: 1471197 markings, 12476563 edges, 86862 markings/sec, 10 secs
lola: 1930885 markings, 16566466 edges, 91938 markings/sec, 15 secs
lola: 2391262 markings, 20649891 edges, 92075 markings/sec, 20 secs
lola: 2810047 markings, 24622303 edges, 83757 markings/sec, 25 secs
lola: 3238041 markings, 28609558 edges, 85599 markings/sec, 30 secs
lola: 3645667 markings, 32538816 edges, 81525 markings/sec, 35 secs
lola: 4035196 markings, 36415132 edges, 77906 markings/sec, 40 secs
lola: 4399138 markings, 40218714 edges, 72788 markings/sec, 45 secs
lola: 4731891 markings, 43928299 edges, 66551 markings/sec, 50 secs
lola: 5202045 markings, 48087410 edges, 94031 markings/sec, 55 secs
lola: 5653575 markings, 52184497 edges, 90306 markings/sec, 60 secs
lola: 6078872 markings, 56209672 edges, 85059 markings/sec, 65 secs
lola: 6503510 markings, 60211570 edges, 84928 markings/sec, 70 secs
lola: 6920127 markings, 64201949 edges, 83323 markings/sec, 75 secs
lola: 7306398 markings, 68095212 edges, 77254 markings/sec, 80 secs
lola: 7670783 markings, 71920522 edges, 72877 markings/sec, 85 secs
lola: 7996636 markings, 75643141 edges, 65171 markings/sec, 90 secs
lola: 8458056 markings, 79762015 edges, 92284 markings/sec, 95 secs
lola: 8865514 markings, 83722242 edges, 81492 markings/sec, 100 secs
lola: 9262568 markings, 87660880 edges, 79411 markings/sec, 105 secs
lola: 9639539 markings, 91492488 edges, 75394 markings/sec, 110 secs
lola: 9975635 markings, 95204920 edges, 67219 markings/sec, 115 secs
lola: 10354599 markings, 99049728 edges, 75793 markings/sec, 120 secs
lola: 10744521 markings, 102941266 edges, 77984 markings/sec, 125 secs
lola: 11110617 markings, 106754291 edges, 73219 markings/sec, 130 secs
lola: 11447519 markings, 110462807 edges, 67380 markings/sec, 135 secs
lola: 11812334 markings, 114284499 edges, 72963 markings/sec, 140 secs
lola: 12172745 markings, 118079301 edges, 72082 markings/sec, 145 secs
lola: 12487278 markings, 121687331 edges, 62907 markings/sec, 150 secs
lola: 12846984 markings, 125479630 edges, 71941 markings/sec, 155 secs
lola: 13164664 markings, 129127404 edges, 63536 markings/sec, 160 secs
lola: 13483357 markings, 132746852 edges, 63739 markings/sec, 165 secs
lola: 13785136 markings, 136329666 edges, 60356 markings/sec, 170 secs
lola: 14080420 markings, 139869428 edges, 59057 markings/sec, 175 secs
lola: 14338841 markings, 143304277 edges, 51684 markings/sec, 180 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 143489072 edges
lola: ========================================
lola: subprocess 4 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) U FIREABLE(start_0))) AND (A (G ((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(no_0) AND NOT FIREABLE(no_1) AND NOT FIREABLE(no_2) AND NOT FIREABLE(no_3) AND NOT FIREABLE(no_4) AND NOT FIREABLE(no_5) AND NOT FIREABLE(no_6) AND NOT FIREABLE(no_7) AND NOT FIREABLE(no_8) AND NOT FIREABLE(no_9) AND NOT FIREABLE(no_10) AND NOT FIREABLE(no_11) AND NOT FIREABLE(no_12) AND NOT FIREABLE(no_13) AND NOT FIREABLE(no_14)) R NOT FIREABLE(start_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) U FIREABLE(start_0)))
lola: processed formula length: 315
lola: 20 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(yes_0) AND NOT FIREABLE(yes_1) AND NOT FIREABLE(yes_2) AND NOT FIREABLE(yes_3) AND NOT FIREABLE(yes_4) AND NOT FIREABLE(yes_5) AND NOT FIREABLE(yes_6) AND NOT FIREABLE(yes_7) AND NOT FIREABLE(yes_8) AND NOT FIREABLE(yes_9) AND NOT FIREABLE(yes_10) AND NOT FIREABLE(yes_11) AND NOT FIREABLE(yes_12) AND NOT FIREABLE(yes_13) AND NOT FIREABLE(yes_14))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(yes_0) OR FIREABLE(yes_1) OR FIREABLE(yes_2) OR FIREABLE(yes_3) OR FIREABLE(yes_4) OR FIREABLE(yes_5) OR FIREABLE(yes_6) OR FIREABLE(yes_7) OR FIREABLE(yes_8) OR FIREABLE(yes_9) OR FIREABLE(yes_10) OR FIREABLE(yes_11) OR FIREABLE(yes_12) OR FIREABLE(yes_13) OR FIREABLE(yes_14)) AND FIREABLE(start_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((FIREABLE(start_0)) AND (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((FIREABLE(start_0)) AND (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((FIREABLE(start_0)) AND (FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14) OR FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREAB... (shortened)
lola: processed formula length: 1263
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((FIREABLE(start_0)) U ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) AND FIREABLE(start_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((FIREABLE(start_0)) U ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(no_3) OR FIREABLE(no_4) OR FIREABLE(no_5) OR FIREABLE(no_6) OR FIREABLE(no_7) OR FIREABLE(no_8) OR FIREABLE(no_9) OR FIREABLE(no_10) OR FIREABLE(no_11) OR FIREABLE(no_12) OR FIREABLE(no_13) OR FIREABLE(no_14)) AND FIREABLE(start_0))))
lola: processed formula length: 346
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 17 markings, 34 edges
lola: ========================================
lola: subprocess 7 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((FIREABLE(start_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(start_0))))))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (NOT FIREABLE(no_0))) AND E (G (NOT FIREABLE(no_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U FIREABLE(no_0))) AND NOT(A(TRUE U FIREABLE(no_5)))))
lola: processed formula length: 75
lola: 5 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 419551 markings, 4758554 edges, 3689330178019819520 markings/sec, 0 secs
lola: 784654 markings, 9314349 edges, 73021 markings/sec, 5 secs
lola: 1146829 markings, 13702339 edges, 72435 markings/sec, 10 secs
lola: 1442422 markings, 17987718 edges, 59119 markings/sec, 15 secs
lola: 1760056 markings, 22242609 edges, 63527 markings/sec, 20 secs
lola: 2113929 markings, 26630551 edges, 70775 markings/sec, 25 secs
lola: 2429895 markings, 30950836 edges, 63193 markings/sec, 30 secs
lola: 2707409 markings, 35052333 edges, 55503 markings/sec, 35 secs
lola: 3049777 markings, 39363992 edges, 68474 markings/sec, 40 secs
lola: 3324051 markings, 43526753 edges, 54855 markings/sec, 45 secs
lola: 3663576 markings, 47629372 edges, 67905 markings/sec, 50 secs
lola: 3952764 markings, 51586060 edges, 57838 markings/sec, 55 secs
lola: 4207404 markings, 55583446 edges, 50928 markings/sec, 60 secs
lola: 4454197 markings, 59580331 edges, 49359 markings/sec, 65 secs
lola: 4674985 markings, 63431424 edges, 44158 markings/sec, 70 secs
lola: 4990316 markings, 67662386 edges, 63066 markings/sec, 75 secs
lola: 5355082 markings, 72079823 edges, 72953 markings/sec, 80 secs
lola: 5665431 markings, 76480849 edges, 62070 markings/sec, 85 secs
lola: 5973018 markings, 80751263 edges, 61517 markings/sec, 90 secs
lola: 6307553 markings, 85146584 edges, 66907 markings/sec, 95 secs
lola: 6577658 markings, 89342215 edges, 54021 markings/sec, 100 secs
lola: 6930230 markings, 93487820 edges, 70514 markings/sec, 105 secs
lola: 7218842 markings, 97642566 edges, 57722 markings/sec, 110 secs
lola: 7488333 markings, 101726349 edges, 53898 markings/sec, 115 secs
lola: 7722787 markings, 105609307 edges, 46891 markings/sec, 120 secs
lola: 7932910 markings, 109434784 edges, 42025 markings/sec, 125 secs
lola: 8275463 markings, 113684072 edges, 68511 markings/sec, 130 secs
lola: 8564650 markings, 117984637 edges, 57837 markings/sec, 135 secs
lola: 8879879 markings, 122128644 edges, 63046 markings/sec, 140 secs
lola: 9195369 markings, 126133354 edges, 63098 markings/sec, 145 secs
lola: 9458640 markings, 130254358 edges, 52654 markings/sec, 150 secs
lola: 9711746 markings, 134280282 edges, 50621 markings/sec, 155 secs
lola: 9959852 markings, 138142983 edges, 49621 markings/sec, 160 secs
lola: 10198274 markings, 142070597 edges, 47684 markings/sec, 165 secs
lola: 10531655 markings, 146060649 edges, 66676 markings/sec, 170 secs
lola: 10816788 markings, 150212272 edges, 57027 markings/sec, 175 secs
lola: 11060395 markings, 154262812 edges, 48721 markings/sec, 180 secs
lola: 11296124 markings, 158168267 edges, 47146 markings/sec, 185 secs
lola: 11508259 markings, 161931491 edges, 42427 markings/sec, 190 secs
lola: 11826846 markings, 165928810 edges, 63717 markings/sec, 195 secs
lola: 12138789 markings, 169815863 edges, 62389 markings/sec, 200 secs
lola: 12407751 markings, 173479426 edges, 53792 markings/sec, 205 secs
lola: 12654926 markings, 177441505 edges, 49435 markings/sec, 210 secs
lola: 12894557 markings, 181405291 edges, 47926 markings/sec, 215 secs
lola: 13104752 markings, 185143425 edges, 42039 markings/sec, 220 secs
lola: 13346406 markings, 189028461 edges, 48331 markings/sec, 225 secs
lola: 13544004 markings, 192794431 edges, 39520 markings/sec, 230 secs
lola: 13759341 markings, 196527668 edges, 43067 markings/sec, 235 secs
lola: 13962017 markings, 200204926 edges, 40535 markings/sec, 240 secs
lola: 14144862 markings, 203838770 edges, 36569 markings/sec, 245 secs
lola: 14331172 markings, 207334633 edges, 37262 markings/sec, 250 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 207760666 edges
lola: ========================================
lola: subprocess 9 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G (FIREABLE(yes_1))) OR ((NOT FIREABLE(no_9)) AND (NOT FIREABLE(yes_5) OR NOT FIREABLE(yes_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (FIREABLE(yes_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U NOT FIREABLE(yes_1))))
lola: processed formula length: 38
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 934912 markings, 2937907 edges, 2503479399672709120 markings/sec, 0 secs
lola: 1774405 markings, 5851326 edges, 167899 markings/sec, 5 secs
lola: 2611399 markings, 8770201 edges, 167399 markings/sec, 10 secs
lola: 3418268 markings, 11663903 edges, 161374 markings/sec, 15 secs
lola: 4175702 markings, 14493263 edges, 151487 markings/sec, 20 secs
lola: 4873897 markings, 17265597 edges, 139639 markings/sec, 25 secs
lola: 5761754 markings, 20310181 edges, 177571 markings/sec, 30 secs
lola: 6573169 markings, 23241512 edges, 162283 markings/sec, 35 secs
lola: 7363315 markings, 26180319 edges, 158029 markings/sec, 40 secs
lola: 8084651 markings, 29045107 edges, 144267 markings/sec, 45 secs
lola: 8920167 markings, 32039079 edges, 167103 markings/sec, 50 secs
lola: 9686326 markings, 34981109 edges, 153232 markings/sec, 55 secs
lola: 10425321 markings, 37878297 edges, 147799 markings/sec, 60 secs
lola: 11183063 markings, 40795032 edges, 151548 markings/sec, 65 secs
lola: 11898755 markings, 43681927 edges, 143138 markings/sec, 70 secs
lola: 12604667 markings, 46550006 edges, 141182 markings/sec, 75 secs
lola: 13288913 markings, 49393347 edges, 136849 markings/sec, 80 secs
lola: 13923828 markings, 52156355 edges, 126983 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348907 markings, 54206982 edges
lola: ========================================
lola: subprocess 10 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NOT FIREABLE(no_9)) AND (NOT FIREABLE(yes_5) OR NOT FIREABLE(yes_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NOT FIREABLE(no_9)) AND (NOT FIREABLE(yes_5) OR NOT FIREABLE(yes_4))))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(start_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (FIREABLE(start_0)))))
lola: processed formula: A (F (A (G (FIREABLE(start_0)))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 128 bytes per marking, with 30 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((NOT FIREABLE(no_12) OR FIREABLE(yes_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (NOT FIREABLE(no_12) OR FIREABLE(yes_1))))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 17 markings, 37 edges
lola: ========================================
lola: subprocess 12 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((FIREABLE(no_3) AND FIREABLE(no_0)))) U (A (G (FIREABLE(no_14))) AND (FIREABLE(no_7) AND FIREABLE(no_1) AND FIREABLE(yes_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (FIREABLE(no_3) AND FIREABLE(no_0))) U (NOT(E(TRUE U NOT FIREABLE(no_14))) AND (FIREABLE(no_7) AND FIREABLE(no_1) AND FIREABLE(yes_6))))
lola: processed formula length: 147
lola: 4 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 602101 markings, 2903453 edges, 2313758393422053376 markings/sec, 0 secs
lola: 1187908 markings, 5957192 edges, 117161 markings/sec, 5 secs
lola: 1775188 markings, 9038633 edges, 117456 markings/sec, 10 secs
lola: 2343724 markings, 12130391 edges, 113707 markings/sec, 15 secs
lola: 2873209 markings, 15117563 edges, 105897 markings/sec, 20 secs
lola: 3470756 markings, 18239264 edges, 119509 markings/sec, 25 secs
lola: 4048794 markings, 21313289 edges, 115608 markings/sec, 30 secs
lola: 4584899 markings, 24324090 edges, 107221 markings/sec, 35 secs
lola: 5141969 markings, 27359898 edges, 111414 markings/sec, 40 secs
lola: 5712256 markings, 30522746 edges, 114057 markings/sec, 45 secs
lola: 6255345 markings, 33563723 edges, 108618 markings/sec, 50 secs
lola: 6778208 markings, 36560006 edges, 104573 markings/sec, 55 secs
lola: 7311662 markings, 39605423 edges, 106691 markings/sec, 60 secs
lola: 7816900 markings, 42561130 edges, 101048 markings/sec, 65 secs
lola: 8290329 markings, 45439620 edges, 94686 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8313760 markings, 45604105 edges
lola: ========================================
lola: subprocess 13 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (FIREABLE(no_13))))) OR FIREABLE(no_11))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(no_13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U FIREABLE(no_13)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 17 markings, 31 edges
lola: ========================================
lola: subprocess 14 will run for 1260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(no_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(no_11)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((FIREABLE(no_3) OR A (F (E (G (FIREABLE(yes_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(no_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(no_3)
lola: processed formula length: 18
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: processed formula with 0 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 15 will run for 2521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(yes_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(yes_6)))))
lola: processed formula length: 49
lola: 9 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 998260 markings, 3140619 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1887713 markings, 6225633 edges, 177891 markings/sec, 5 secs
lola: 2749892 markings, 9259444 edges, 172436 markings/sec, 10 secs
lola: 3600304 markings, 12294683 edges, 170082 markings/sec, 15 secs
lola: 4363423 markings, 15233756 edges, 152624 markings/sec, 20 secs
lola: 5145990 markings, 18170921 edges, 156513 markings/sec, 25 secs
lola: 6022785 markings, 21230009 edges, 175359 markings/sec, 30 secs
lola: 6862730 markings, 24258778 edges, 167989 markings/sec, 35 secs
lola: 7630451 markings, 27212609 edges, 153544 markings/sec, 40 secs
lola: 8419527 markings, 30206618 edges, 157815 markings/sec, 45 secs
lola: 9233166 markings, 33221318 edges, 162728 markings/sec, 50 secs
lola: 9960824 markings, 36085834 edges, 145532 markings/sec, 55 secs
lola: 10710572 markings, 38952535 edges, 149950 markings/sec, 60 secs
lola: 11420107 markings, 41786752 edges, 141907 markings/sec, 65 secs
lola: 12156037 markings, 44694061 edges, 147186 markings/sec, 70 secs
lola: 12853929 markings, 47560742 edges, 139578 markings/sec, 75 secs
lola: 13508357 markings, 50375886 edges, 130886 markings/sec, 80 secs
lola: 14139743 markings, 53129102 edges, 126277 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 54207015 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G (FIREABLE(no_7))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(no_7)))))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 46 places; total mentions: 0
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 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: 501864 markings, 4440662 edges, 2313758393422053376 markings/sec, 0 secs
lola: 947496 markings, 8827734 edges, 89126 markings/sec, 5 secs
lola: 1352597 markings, 13079846 edges, 81020 markings/sec, 10 secs
lola: 1740990 markings, 17201516 edges, 77679 markings/sec, 15 secs
lola: 2178525 markings, 21445364 edges, 87507 markings/sec, 20 secs
lola: 2571798 markings, 25525608 edges, 78655 markings/sec, 25 secs
lola: 2967761 markings, 29694566 edges, 79193 markings/sec, 30 secs
lola: 3328708 markings, 33728267 edges, 72189 markings/sec, 35 secs
lola: 3698061 markings, 37817373 edges, 73871 markings/sec, 40 secs
lola: 4047457 markings, 41810364 edges, 69879 markings/sec, 45 secs
lola: 4367876 markings, 45670367 edges, 64084 markings/sec, 50 secs
lola: 4677020 markings, 49486064 edges, 61829 markings/sec, 55 secs
lola: 5077464 markings, 53668723 edges, 80089 markings/sec, 60 secs
lola: 5514963 markings, 57984688 edges, 87500 markings/sec, 65 secs
lola: 5896042 markings, 62093130 edges, 76216 markings/sec, 70 secs
lola: 6303653 markings, 66354813 edges, 81522 markings/sec, 75 secs
lola: 6667402 markings, 70455877 edges, 72750 markings/sec, 80 secs
lola: 7021809 markings, 74511396 edges, 70881 markings/sec, 85 secs
lola: 7373242 markings, 78544219 edges, 70287 markings/sec, 90 secs
lola: 7697342 markings, 82455980 edges, 64820 markings/sec, 95 secs
lola: 7986747 markings, 86210092 edges, 57881 markings/sec, 100 secs
lola: 8420820 markings, 90486280 edges, 86815 markings/sec, 105 secs
lola: 8800687 markings, 94566994 edges, 75973 markings/sec, 110 secs
lola: 9171007 markings, 98619112 edges, 74064 markings/sec, 115 secs
lola: 9534264 markings, 102616688 edges, 72651 markings/sec, 120 secs
lola: 9869523 markings, 106500798 edges, 67052 markings/sec, 125 secs
lola: 10183889 markings, 110333788 edges, 62873 markings/sec, 130 secs
lola: 10546877 markings, 114414075 edges, 72598 markings/sec, 135 secs
lola: 10890258 markings, 118423345 edges, 68676 markings/sec, 140 secs
lola: 11218238 markings, 122315481 edges, 65596 markings/sec, 145 secs
lola: 11498755 markings, 125972088 edges, 56103 markings/sec, 150 secs
lola: 11837771 markings, 129947626 edges, 67803 markings/sec, 155 secs
lola: 12167456 markings, 133868428 edges, 65937 markings/sec, 160 secs
lola: 12451531 markings, 137598274 edges, 56815 markings/sec, 165 secs
lola: 12780984 markings, 141525734 edges, 65891 markings/sec, 170 secs
lola: 13065140 markings, 145213623 edges, 56831 markings/sec, 175 secs
lola: 13362165 markings, 148949120 edges, 59405 markings/sec, 180 secs
lola: 13638665 markings, 152591301 edges, 55300 markings/sec, 185 secs
lola: 13909392 markings, 156215294 edges, 54145 markings/sec, 190 secs
lola: 14169505 markings, 159807871 edges, 52023 markings/sec, 195 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 162620948 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no yes no no yes yes
lola: ========================================
FORMULA Referendum-PT-0015-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0015-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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="Referendum-PT-0015"
export BK_EXAMINATION="CTLFireability"
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/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 Referendum-PT-0015, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673583900270"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
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 ;