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 296K
-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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 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 lola
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 r136-qhx2-152673579000270
=====================================================================

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

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-PT-0015 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Referendum-PT-0015 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ Referendum-PT-0015 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 46
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: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
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 223 seconds at most (--localtimelimit=0)
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: 42 rewrites
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 237 seconds at most (--localtimelimit=0)
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: 42 rewrites
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 2 will run for 254 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
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: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 668067 markings, 5260515 edges, 133613 markings/sec, 0 secs
lola: 1252109 markings, 10347798 edges, 116808 markings/sec, 5 secs
lola: 1797757 markings, 15347892 edges, 109130 markings/sec, 10 secs
lola: 2362647 markings, 20347076 edges, 112978 markings/sec, 15 secs
lola: 2886564 markings, 25295466 edges, 104783 markings/sec, 20 secs
lola: 3398339 markings, 30175932 edges, 102355 markings/sec, 25 secs
lola: 3892597 markings, 34963284 edges, 98852 markings/sec, 30 secs
lola: 4354453 markings, 39719085 edges, 92371 markings/sec, 35 secs
lola: 4759811 markings, 44297950 edges, 81072 markings/sec, 40 secs
lola: 5358930 markings, 49402021 edges, 119824 markings/sec, 45 secs
lola: 5877239 markings, 54303655 edges, 103662 markings/sec, 50 secs
lola: 6416851 markings, 59232959 edges, 107922 markings/sec, 55 secs
lola: 6915099 markings, 64064814 edges, 99650 markings/sec, 60 secs
lola: 7382425 markings, 68799630 edges, 93465 markings/sec, 65 secs
lola: 7814552 markings, 73461548 edges, 86425 markings/sec, 70 secs
lola: 8313952 markings, 78278350 edges, 99880 markings/sec, 75 secs
lola: 8812876 markings, 83119115 edges, 99785 markings/sec, 80 secs
lola: 9301569 markings, 87907764 edges, 97739 markings/sec, 85 secs
lola: 9753550 markings, 92600475 edges, 90396 markings/sec, 90 secs
lola: 10177041 markings, 97223347 edges, 84698 markings/sec, 95 secs
lola: 10669853 markings, 102049891 edges, 98562 markings/sec, 100 secs
lola: 11122260 markings, 106723839 edges, 90481 markings/sec, 105 secs
lola: 11518048 markings, 111205864 edges, 79158 markings/sec, 110 secs
lola: 11984473 markings, 115913661 edges, 93285 markings/sec, 115 secs
lola: 12390227 markings, 120433430 edges, 81151 markings/sec, 120 secs
lola: 12814413 markings, 124996797 edges, 84837 markings/sec, 125 secs
lola: 13199622 markings, 129400857 edges, 77042 markings/sec, 130 secs
lola: 13589079 markings, 133849232 edges, 77891 markings/sec, 135 secs
lola: 13949668 markings, 138199391 edges, 72118 markings/sec, 140 secs
lola: 14282952 markings, 142451082 edges, 66657 markings/sec, 145 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (NOT FIREABLE(start_0))))) AND FIREABLE(start_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(start_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(start_0)
lola: processed formula length: 17
lola: 42 rewrites
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 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(start_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(start_0)))))
lola: processed formula length: 45
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 17 markings, 16 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(start_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(start_0))))))
lola: processed formula length: 47
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 17 markings, 16 edges
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G (FIREABLE(yes_1))))) OR E (X (((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 3 will run for 262 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((NOT FIREABLE(no_9)) AND (NOT FIREABLE(yes_5) OR NOT FIREABLE(yes_4))))
lola: processed formula length: 76
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (FIREABLE(yes_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: FIREABLE(yes_1)
lola: processed formula length: 15
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 32767 markings, 32766 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA Referendum-PT-0015-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(no_7)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(no_7)
lola: processed formula length: 18
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: ========================================
lola: 764754 markings, 6073328 edges, 152951 markings/sec, 0 secs
lola: 1413943 markings, 11905859 edges, 129838 markings/sec, 5 secs
lola: 2078702 markings, 17821904 edges, 132952 markings/sec, 10 secs
lola: 2682272 markings, 23562420 edges, 120714 markings/sec, 15 secs
lola: 3307933 markings, 29323182 edges, 125132 markings/sec, 20 secs
lola: 3888238 markings, 34990073 edges, 116061 markings/sec, 25 secs
lola: 4431877 markings, 40558466 edges, 108728 markings/sec, 30 secs
lola: 4985718 markings, 46104587 edges, 110768 markings/sec, 35 secs
lola: 5688634 markings, 51980906 edges, 140583 markings/sec, 40 secs
lola: 6299451 markings, 57575848 edges, 122163 markings/sec, 45 secs
lola: 6953270 markings, 63289273 edges, 130764 markings/sec, 50 secs
lola: 7554671 markings, 68933171 edges, 120280 markings/sec, 55 secs
lola: 8142347 markings, 74542072 edges, 117535 markings/sec, 60 secs
lola: 8691418 markings, 79820744 edges, 109814 markings/sec, 65 secs
lola: 9184360 markings, 84885832 edges, 98588 markings/sec, 70 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 9565940 markings, 89282091 edges
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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)) AND FIREABLE(start_0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((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)) OR NOT FIREABLE(start_0))
lola: processed formula length: 375
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 17 markings, 16 edges

FORMULA Referendum-PT-0015-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
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: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
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)) AND FIREABLE(start_0)) OR ((FIREABLE(no_0) OR FIREABLE(no_1) OR FIREABLE(no_2) OR FIREABLE(... (shortened)
lola: processed formula length: 644
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 2 markings, 1 edges

FORMULA Referendum-PT-0015-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
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: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 655283 markings, 5846447 edges, 131057 markings/sec, 0 secs
lola: 1228764 markings, 11385014 edges, 114696 markings/sec, 5 secs
lola: 1755161 markings, 16793182 edges, 105279 markings/sec, 10 secs
lola: 2274677 markings, 21847237 edges, 103903 markings/sec, 15 secs
lola: 2767319 markings, 27021815 edges, 98528 markings/sec, 20 secs
lola: 3272243 markings, 32238499 edges, 100985 markings/sec, 25 secs
lola: 3748760 markings, 37314094 edges, 95303 markings/sec, 30 secs
lola: 4190583 markings, 42239805 edges, 88365 markings/sec, 35 secs
lola: 4577659 markings, 46728048 edges, 77415 markings/sec, 40 secs
lola: 5004799 markings, 51369138 edges, 85428 markings/sec, 45 secs
lola: 5525554 markings, 56512108 edges, 104151 markings/sec, 50 secs
lola: 6005681 markings, 61513289 edges, 96025 markings/sec, 55 secs
lola: 6475036 markings, 66393074 edges, 93871 markings/sec, 60 secs
lola: 6930637 markings, 71250613 edges, 91120 markings/sec, 65 secs
lola: 7352553 markings, 75973658 edges, 84383 markings/sec, 70 secs
lola: 7721904 markings, 80228251 edges, 73870 markings/sec, 75 secs
lola: 8127776 markings, 84858776 edges, 81174 markings/sec, 80 secs
lola: 8595558 markings, 89718295 edges, 93556 markings/sec, 85 secs
lola: 9047418 markings, 94522798 edges, 90372 markings/sec, 90 secs
lola: 9462973 markings, 99186456 edges, 83111 markings/sec, 95 secs
lola: 9867268 markings, 103817776 edges, 80859 markings/sec, 100 secs
lola: 10252006 markings, 108351411 edges, 76948 markings/sec, 105 secs
lola: 10677253 markings, 112961604 edges, 85049 markings/sec, 110 secs
lola: 11089256 markings, 117614503 edges, 82401 markings/sec, 115 secs
lola: 11461267 markings, 122089166 edges, 74402 markings/sec, 120 secs
lola: 11866029 markings, 126707844 edges, 80952 markings/sec, 125 secs
lola: 12256263 markings, 131239473 edges, 78047 markings/sec, 130 secs
lola: 12621643 markings, 135662060 edges, 73076 markings/sec, 135 secs
lola: 12988873 markings, 140059101 edges, 73446 markings/sec, 140 secs
lola: 13304355 markings, 143952169 edges, 63096 markings/sec, 145 secs
lola: 13644075 markings, 148232932 edges, 67944 markings/sec, 150 secs
lola: 13966931 markings, 152460168 edges, 64571 markings/sec, 155 secs
lola: 14274018 markings, 156606906 edges, 61417 markings/sec, 160 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

FORMULA Referendum-PT-0015-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 47 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 466112 markings, 5376889 edges, 93222 markings/sec, 0 secs
lola: 870501 markings, 10554313 edges, 80878 markings/sec, 5 secs
lola: 1274002 markings, 15514059 edges, 80700 markings/sec, 10 secs
lola: 1591684 markings, 20416347 edges, 63536 markings/sec, 15 secs
lola: 2016538 markings, 25552756 edges, 84971 markings/sec, 20 secs
lola: 2397003 markings, 30455036 edges, 76093 markings/sec, 25 secs
lola: 2731010 markings, 35310299 edges, 66801 markings/sec, 30 secs
lola: 3110172 markings, 40201821 edges, 75832 markings/sec, 35 secs
lola: 3434201 markings, 44963435 edges, 64806 markings/sec, 40 secs
lola: 3808171 markings, 49439260 edges, 74794 markings/sec, 45 secs
lola: 4115457 markings, 54129704 edges, 61457 markings/sec, 50 secs
lola: 4404504 markings, 58739808 edges, 57809 markings/sec, 55 secs
lola: 4658556 markings, 63125008 edges, 50810 markings/sec, 60 secs
lola: 5010489 markings, 67909651 edges, 70387 markings/sec, 65 secs
lola: 5410401 markings, 72792384 edges, 79982 markings/sec, 70 secs
lola: 5773463 markings, 78070046 edges, 72612 markings/sec, 75 secs
lola: 6188281 markings, 83463967 edges, 82964 markings/sec, 80 secs
lola: 6534616 markings, 88744037 edges, 69267 markings/sec, 85 secs
lola: 6972369 markings, 93957974 edges, 87551 markings/sec, 90 secs
lola: 7314164 markings, 99157093 edges, 68359 markings/sec, 95 secs
lola: 7635555 markings, 104349352 edges, 64278 markings/sec, 100 secs
lola: 7930893 markings, 109402555 edges, 59068 markings/sec, 105 secs
lola: 8348632 markings, 114768724 edges, 83548 markings/sec, 110 secs
lola: 8698993 markings, 120083693 edges, 70072 markings/sec, 115 secs
lola: 9134814 markings, 125267029 edges, 87164 markings/sec, 120 secs
lola: 9475305 markings, 130517224 edges, 68098 markings/sec, 125 secs
lola: 9800382 markings, 135733094 edges, 65015 markings/sec, 130 secs
lola: 10087055 markings, 140754766 edges, 57335 markings/sec, 135 secs
lola: 10528152 markings, 146008470 edges, 88219 markings/sec, 140 secs
lola: 10871767 markings, 151276686 edges, 68723 markings/sec, 145 secs
lola: 11194371 markings, 156456347 edges, 64521 markings/sec, 150 secs
lola: 11482827 markings, 161469935 edges, 57691 markings/sec, 155 secs
lola: 11882754 markings, 166570402 edges, 79985 markings/sec, 160 secs
lola: 12262073 markings, 171515238 edges, 75864 markings/sec, 165 secs
lola: 12605981 markings, 176453853 edges, 68782 markings/sec, 170 secs
lola: 12901078 markings, 181527174 edges, 59019 markings/sec, 175 secs
lola: 13183640 markings, 186461093 edges, 56512 markings/sec, 180 secs
lola: 13471037 markings, 191423350 edges, 57479 markings/sec, 185 secs
lola: 13748946 markings, 196330154 edges, 55582 markings/sec, 190 secs
lola: 14034569 markings, 201155814 edges, 57125 markings/sec, 195 secs
lola: 14261609 markings, 205929456 edges, 45408 markings/sec, 200 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 207760666 edges

FORMULA Referendum-PT-0015-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 423 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 46 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 834574 markings, 4119428 edges, 166915 markings/sec, 0 secs
lola: 1664756 markings, 8463429 edges, 166036 markings/sec, 5 secs
lola: 2486236 markings, 12925164 edges, 164296 markings/sec, 10 secs
lola: 3293657 markings, 17264265 edges, 161484 markings/sec, 15 secs
lola: 4123756 markings, 21728461 edges, 166020 markings/sec, 20 secs
lola: 4926287 markings, 26182580 edges, 160506 markings/sec, 25 secs
lola: 5751981 markings, 30759335 edges, 165139 markings/sec, 30 secs
lola: 6559619 markings, 35295297 edges, 161528 markings/sec, 35 secs
lola: 7345931 markings, 39802272 edges, 157262 markings/sec, 40 secs
lola: 8097063 markings, 44221067 edges, 150226 markings/sec, 45 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

FORMULA Referendum-PT-0015-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(start_0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(start_0)
lola: processed formula length: 21
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 17 markings, 16 edges

FORMULA Referendum-PT-0015-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 582 seconds at most (--localtimelimit=0)
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 11 will run for 582 seconds at most (--localtimelimit=0)
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: 42 rewrites
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 12 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(no_13)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(no_13)
lola: processed formula length: 19
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate does not eventually occur from all states.
lola: 17 markings, 16 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================

FORMULA Referendum-PT-0015-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 728 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(no_3) AND E (G (A (F (NOT FIREABLE(yes_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 728 seconds at most (--localtimelimit=0)
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: 42 rewrites
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 13 will run for 971 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (NOT FIREABLE(yes_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT FIREABLE(yes_6)))))
lola: processed formula length: 49
lola: 44 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1539522 markings, 5068432 edges, 307904 markings/sec, 0 secs
lola: 2967664 markings, 9998045 edges, 285628 markings/sec, 5 secs
lola: 4250133 markings, 14765203 edges, 256494 markings/sec, 10 secs
lola: 5550573 markings, 19536073 edges, 260088 markings/sec, 15 secs
lola: 6885589 markings, 24351724 edges, 267003 markings/sec, 20 secs
lola: 8055151 markings, 28955189 edges, 233912 markings/sec, 25 secs
lola: 9375593 markings, 33758293 edges, 264088 markings/sec, 30 secs
lola: 10556756 markings, 38393515 edges, 236233 markings/sec, 35 secs
lola: 11729881 markings, 43015545 edges, 234625 markings/sec, 40 secs
lola: 12842781 markings, 47512566 edges, 222580 markings/sec, 45 secs
lola: 13868651 markings, 51907308 edges, 205174 markings/sec, 50 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA Referendum-PT-0015-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=0)lola: ========================================

lola: ========================================
lola: ...considering subproblem: E (G (E (F ((NOT FIREABLE(no_12) OR FIREABLE(yes_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (NOT FIREABLE(no_12) OR FIREABLE(yes_1))
lola: processed formula length: 41
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 17 markings, 16 edges
lola:
FORMULA Referendum-PT-0015-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1427 seconds at most (--localtimelimit=0)
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 14 will run for 1427 seconds at most (--localtimelimit=0)
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 existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
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 FIRE... (shortened)
lola: processed formula length: 1266
lola: 45 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: formula 0: (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)))
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2855 seconds at most (--localtimelimit=0)
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))) OR (E (F ((NOT FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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 initial satisfaction
lola: processed formula: (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: processed formula length: 362
lola: 42 rewrites
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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
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))) OR (E (F ((NOT FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (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 initial satisfaction
lola: processed formula: (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: processed formula length: 362
lola: 42 rewrites
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: ========================================
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: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 334
lola: 43 rewrites
lola: closed formula file Referendum-PT-0015-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: lola: formula 0: ((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: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Referendum-PT-0015-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no yes no no yes yes
lola:
preliminary result: no no no no no no no no yes no no yes no no yes yes
lola: memory consumption: 14808 KB
lola: time consumption: 714 seconds

BK_STOP 1526988544856

--------------------
content from 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="lola"
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 lola"
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 r136-qhx2-152673579000270"
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 '' CTLFireability.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 ;