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 372K
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 98K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Peterson-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478600557
=====================================================================

--------------------
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 Peterson-PT-2-CTLFireability-00
FORMULA_NAME Peterson-PT-2-CTLFireability-01
FORMULA_NAME Peterson-PT-2-CTLFireability-02
FORMULA_NAME Peterson-PT-2-CTLFireability-03
FORMULA_NAME Peterson-PT-2-CTLFireability-04
FORMULA_NAME Peterson-PT-2-CTLFireability-05
FORMULA_NAME Peterson-PT-2-CTLFireability-06
FORMULA_NAME Peterson-PT-2-CTLFireability-07
FORMULA_NAME Peterson-PT-2-CTLFireability-08
FORMULA_NAME Peterson-PT-2-CTLFireability-09
FORMULA_NAME Peterson-PT-2-CTLFireability-10
FORMULA_NAME Peterson-PT-2-CTLFireability-11
FORMULA_NAME Peterson-PT-2-CTLFireability-12
FORMULA_NAME Peterson-PT-2-CTLFireability-13
FORMULA_NAME Peterson-PT-2-CTLFireability-14
FORMULA_NAME Peterson-PT-2-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527297173213


BK_STOP 1527297217545

--------------------
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 Peterson-PT-2 as instance name.
Using Peterson 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': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
/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': 449, 'Memory': 107.65, 'Tool': 'lola'}, {'Time': 891, 'Memory': 112.22, 'Tool': 'lola'}, {'Time': 5317, 'Memory': 2206.84, 'Tool': 'marcie'}, {'Time': 5480, 'Memory': 2206.86, 'Tool': 'marcie'}, {'Time': 21246, 'Memory': 632.11, 'Tool': 'gspn'}, {'Time': 24103, 'Memory': 663.23, 'Tool': 'gspn'}, {'Time': 32775, 'Memory': 859.38, 'Tool': 'itstools'}, {'Time': 33715, 'Memory': 838.99, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola Peterson-PT-2...

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


checking for too many tokens
===========================================================================================
Peterson-PT-2: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Peterson-PT-2 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-PT-2-CTLFireability.task
lola: A (G (E (F (A (F ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))) : (E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) AND E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1)))) AND (NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND NOT FIREABLE(Alone1_0_2_0) AND NOT FIREABLE(Alone1_2_1_0) AND NOT FIREABLE(Alone1_0_1_0) AND NOT FIREABLE(Alone1_2_0_0) AND NOT FIREABLE(Alone1_1_0_0) AND NOT FIREABLE(Alone1_1_0_1) AND NOT FIREABLE(Alone1_1_2_0) AND NOT FIREABLE(Alone1_0_1_1) AND NOT FIREABLE(Alone1_2_0_1) AND NOT FIREABLE(Alone1_0_2_1) AND NOT FIREABLE(Alone1_2_1_1) AND NOT FIREABLE(Alone1_1_2_1)))))) : (E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) OR (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))) : A (F (A (((FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_0_0) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_0_1)) U (FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(NoIdentity_1_2_1) OR FIREABLE(NoIdentity_0_2_0) OR FIREABLE(NoIdentity_1_2_0) OR FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1) OR FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) : E (F (A (F (A (X ((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1)))))))) : A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))) : ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)) OR E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)) AND (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))) : ((FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) OR FIREABLE(UpdateTurn_0_1_1) OR FIREABLE(UpdateTurn_1_2_0) OR FIREABLE(UpdateTurn_0_2_0) OR FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_2_2_0)) OR NOT(E (X (A (F ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1)))))))) : (FIREABLE(BecomeIdle_0) OR A (((NOT FIREABLE(UpdateTurn_2_2_1) OR NOT FIREABLE(ContinueLoop_0_2_1)) U E (F (FIREABLE(Loop_2_1_1)))))) : E (F ((FIREABLE(Alone1_1_2_0) AND FIREABLE(Loop_1_0_0)))) : ((((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0))) OR ((((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1)) AND NOT(A (F (FIREABLE(UpdateTurn_1_2_0)))))) AND (E ((NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1))) AND NOT((E (X (FIREABLE(NoIdentity_2_0_0))) AND E (X (FIREABLE(Loop_1_1_1))))))) : (FIREABLE(ContinueLoop_1_2_0) OR (NOT(A ((FIREABLE(NotAlone_1_2_1) U FIREABLE(Identity_0_0)))) AND E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1)))))) : NOT(E (F ((A (G (FIREABLE(NotAlone_1_0_1))) OR (FIREABLE(Identity_2_1) OR FIREABLE(Alone1_0_2_1)))))) : A (G (E (F (FIREABLE(NotAlone_2_1_0))))) : (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2))) : ((FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0)) AND (E (F (A (G (FIREABLE(Loop_2_0_1))))) OR ((FIREABLE(TurnDiff_2_1_0) OR FIREABLE(Alone1_1_2_1)) OR A ((FIREABLE(NotAlone_1_2_0) U FIREABLE(TurnEqual_0_0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (F ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U A(TRUE U (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))
lola: processed formula length: 130
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8080 markings, 45613 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) AND E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))
lola: processed formula length: 102
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 95 markings, 194 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1)))) AND (NOT FIREABLE(AccessCS_2) AND NOT F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (NOT FIREABLE(TurnDiff_1_0_1) AND NOT FIREABLE(TurnDiff_1_2_0) AND NOT FIREABLE(TurnDiff_0_2_0) AND NOT FIREABLE(TurnDiff_2_1_0) AND NOT FIREABLE(TurnDiff_0_2_1) AND NOT FIREABLE(TurnDiff_2_1_1) AND NOT FIREABLE(TurnDiff_0_1_1) AND NOT FIREABLE(TurnDiff_2_0_1) AND NOT FIREABLE(TurnDiff_0_1_0) AND NOT FIREABLE(TurnDiff_2_0_0) AND NOT FIREABLE(TurnDiff_1_0_0) AND NOT FIREABLE(... (shortened)
lola: processed formula length: 881
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 10941 markings, 36269 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) OR (FIREABLE(Alone1_0_2_0) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (NOT FIREABLE(NotAlone_0_1_0) AND NOT FIREABLE(NotAlone_2_0_0) AND NOT FIREABLE(NotAlone_0_2_0) AND NOT FIREABLE(NotAlone_2_1_0) AND NOT FIREABLE(NotAlone_1_0_1) AND NOT FIREABLE(NotAlone_1_2_0) AND NOT FIREABLE(NotAlone_0_1_1) AND NOT FIREABLE(NotAlone_2_0_1) AND NOT FIREABLE(NotAlone_1_0_0) AND NOT FIREABLE(NotAlone_2_1_1) AND NOT FIREABLE(NotAlone_0_2_1) AND NOT FIREABLE(N... (shortened)
lola: processed formula length: 418
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 10214 markings, 36899 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))
lola: processed formula length: 321
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_0_0) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_0_1)) U (FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_0_0) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_0_1)) U (FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(... (shortened)
lola: processed formula length: 892
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 610 markings, 1516 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (A (X ((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U AX((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1)))))
lola: processed formula length: 345
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 103770 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))
lola: processed formula: A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))
lola: processed formula length: 353
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 4 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: 757 markings, 862 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)) OR E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))
lola: processed formula length: 345
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)) AND (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0)) OR (NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0))))))
lola: processed formula length: 236
lola: 3 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 8080 markings, 24835 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) ... (shortened)
lola: processed formula length: 555
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((NOT FIREABLE(ContinueLoop_2_1_0) AND NOT FIREABLE(ContinueLoop_0_2_0) AND NOT FIREABLE(ContinueLoop_1_2_0) AND NOT FIREABLE(ContinueLoop_2_2_0) AND NOT FIREABLE(ContinueLoop_0_0_1) AND NOT FIREABLE(ContinueLoop_1_0_1) AND NOT FIREABLE(ContinueLoop_2_0_1) AND NOT FIREABLE(ContinueLoop_0_1_1) AND NOT FIREABLE(ContinueLoop_0_0_0) AND NOT FIREABLE(ContinueLoop_1_0_0) AND NOT FIREABLE(Cont... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoo... (shortened)
lola: processed formula length: 610
lola: 8 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 86 markings, 88 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(BecomeIdle_0) OR A (((NOT FIREABLE(UpdateTurn_2_2_1) OR NOT FIREABLE(ContinueLoop_0_2_1)) U E (F (FIREABLE(Loop_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(BecomeIdle_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(BecomeIdle_0)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(UpdateTurn_2_2_1) OR NOT FIREABLE(ContinueLoop_0_2_1)) U E (F (FIREABLE(Loop_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((NOT FIREABLE(UpdateTurn_2_2_1) OR NOT FIREABLE(ContinueLoop_0_2_1)) U E(TRUE U FIREABLE(Loop_2_1_1)))
lola: processed formula length: 105
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 1591 markings, 2543 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Alone1_1_2_0) AND FIREABLE(Loop_1_0_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 12 bytes per marking, with 5 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: 12439 markings, 29963 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0))) OR ((((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1)) AND NOT(A (F (FIREABLE(UpdateTurn_1_2_0)))))) AND (E ((NOT FIREABLE(Loop_2_0_0) U ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0)))
lola: processed formula length: 192
lola: 10 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1))
lola: processed formula length: 52
lola: 11 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3409 markings, 6270 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(NoIdentity_2_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(NoIdentity_2_0_0)))
lola: processed formula: A (X (NOT FIREABLE(NoIdentity_2_0_0)))
lola: processed formula length: 38
lola: 10 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(ContinueLoop_1_2_0) OR (NOT(A ((FIREABLE(NotAlone_1_2_1) U FIREABLE(Identity_0_0)))) AND E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ContinueLoop_1_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ContinueLoop_1_2_0)
lola: processed formula length: 28
lola: 4 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(NotAlone_1_2_1) R NOT FIREABLE(Identity_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(NotAlone_1_2_1) U FIREABLE(Identity_0_0)))
lola: processed formula length: 57
lola: 7 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1)))
lola: processed formula length: 91
lola: 5 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 7331 markings, 14339 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((A (G (FIREABLE(NotAlone_1_0_1))) OR (FIREABLE(Identity_2_1) OR FIREABLE(Alone1_0_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(NotAlone_1_0_1)))))
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(NotAlone_1_0_1)))))
lola: processed formula length: 58
lola: 12 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 7612 markings, 22908 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Identity_2_1) AND NOT FIREABLE(Alone1_0_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 not invariant.
lola: 5325 markings, 12958 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(NotAlone_2_1_0)))))
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(NotAlone_2_1_0)))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 601 markings, 967 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2)))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0)) AND (E (F (A (G (FIREABLE(Loop_2_0_1))))) OR ((FIREABLE(TurnDiff_2_1_0) OR FIREABLE(Alone1_1_2_1)) OR A ((FIREABLE(NotAlone_1_2_0) U FIREABLE(TurnEqual_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 102 places; total mentions: 0
lola: closed formula file Peterson-PT-2-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: RESULT
lola:
SUMMARY: yes no no no no no no yes yes no yes no no no no no
FORMULA Peterson-PT-2-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-PT-2-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="Peterson-PT-2"
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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, 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 r118-csrt-152666478600557"
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 ;