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 384K
-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 5.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 26 09:26 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 lola
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582900160
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527437136472

info: Time: 3600 - MCC
===========================================================================================
prep: translating Peterson-PT-2 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 Peterson-PT-2 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ Peterson-PT-2 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 102
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-LTLFireability.task
lola: A (G (G (G (X (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))))) : A ((FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))) : A ((G (X (X ((FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_0_0) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1))))) U (X ((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))) U 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)))))) : A ((((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)) U (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))) U G (F (X ((FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1))))))) : A (((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)) U G (F (G ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))))))) : A (F ((((FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_0_1) OR FIREABLE(EndLoop_1_1) OR FIREABLE(EndLoop_1_0) OR FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0)) U (FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0))) U ((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)) U (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)))))) : A (F ((F (X ((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)))) U ((FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_0_0) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1)) U (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)))))) : A (F (G (G (G (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))))) : A (FIREABLE(Identity_2_1)) : A (X (G ((G (FIREABLE(TurnEqual_2_1)) U F (FIREABLE(ProgressTurn_1_0)))))) : A (X (X ((X (FIREABLE(TurnDiff_0_2_1)) U X (FIREABLE(EndLoop_0_1)))))) : A (FIREABLE(NotAlone_2_0_1)) : A (G (X (FIREABLE(Identity_1_1)))) : A ((F (G (FIREABLE(Loop_1_0_1))) U F (FIREABLE(UpdateTurn_1_0_1)))) : A (((FIREABLE(Alone1_2_0_0) U G (FIREABLE(Loop_0_0_0))) U G ((FIREABLE(TurnDiff_2_1_0) U FIREABLE(TurnDiff_2_0_0))))) : A ((X (F (F (FIREABLE(NoIdentity_1_2_0)))) U F (G (FIREABLE(Loop_2_1_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))
lola: processed formula length: 57
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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: ========================================

FORMULA Peterson-PT-2-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Identity_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Identity_2_1)
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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:
FORMULA Peterson-PT-2-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(NotAlone_2_0_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(NotAlone_2_0_1)
lola: processed formula length: 24
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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

FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F (FIREABLE(ProgressTurn_1_0)) OR (G (FIREABLE(TurnEqual_2_1)) AND F (FIREABLE(ProgressTurn_1_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (FIREABLE(ProgressTurn_1_0)) OR (G (FIREABLE(TurnEqual_2_1)) AND F (FIREABLE(ProgressTurn_1_0)))))))
lola: processed formula length: 112
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges

FORMULA Peterson-PT-2-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((FIREABLE(TurnDiff_0_2_1) U FIREABLE(EndLoop_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((FIREABLE(TurnDiff_0_2_1) U FIREABLE(EndLoop_0_1))))))
lola: processed formula length: 66
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))
lola: processed formula length: 84
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (FIREABLE(Identity_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(Identity_1_1))))
lola: processed formula length: 34
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
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 eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (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(NotAlone_1_2_1))
lola: processed formula length: 393
lola: 39 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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: 507 markings, 594 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((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))))
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(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(TurnDiff_1_2_1))
lola: processed formula length: 393
lola: 39 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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: 11 markings, 11 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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) O... (shortened)
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(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(ContinueLoop_2_0... (shortened)
lola: processed formula length: 663
lola: 39 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.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: 35 markings, 35 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(Loop_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(Loop_2_1_1))))
lola: processed formula length: 32
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 30 markings, 31 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(UpdateTurn_1_0_1)) OR (F (FIREABLE(UpdateTurn_1_0_1)) AND F (G (FIREABLE(Loop_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(UpdateTurn_1_0_1)) OR (F (FIREABLE(UpdateTurn_1_0_1)) AND F (G (FIREABLE(Loop_1_0_1))))))
lola: processed formula length: 105
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 33 markings, 36 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))
lola: processed formula length: 84
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 30 markings, 31 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))
lola: processed formula length: 102
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 25 markings, 26 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(Alone1_2_0_0) U G (FIREABLE(Loop_0_0_0))) U G ((F (FIREABLE(TurnDiff_2_0_0)) AND (FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_2_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(Alone1_2_0_0) U G (FIREABLE(Loop_0_0_0))) U G ((F (FIREABLE(TurnDiff_2_0_0)) AND (FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_2_0_0))))))
lola: processed formula length: 153
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 27 markings, 27 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1)))))
lola: processed formula length: 309
lola: 37 rewrites
lola: closed formula file Peterson-PT-2-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 16 markings, 16 edges
lola: ========================================

FORMULA Peterson-PT-2-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no no no no no
lola:
preliminary result: no yes no no no no no no no no no no no no no no
lola: ========================================
lola: memory consumption: 14844 KB
lola: time consumption: 0 seconds

BK_STOP 1527437136723

--------------------
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="Peterson-PT-2"
export BK_EXAMINATION="LTLFireability"
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/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 lola"
echo " Input is Peterson-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-csrt-152732582900160"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;