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 312K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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 75K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582700034
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527429905786

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-3 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 LamportFastMutEx-PT-3 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ LamportFastMutEx-PT-3 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 256/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 156 transitions, 74 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 222 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-3-LTLFireability.task
lola: A (G ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4)))) : A (G ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9) OR FIREABLE(T-sety_9_10) OR FIREABLE(T-sety_9_11) OR FIREABLE(T-sety_9_12) OR FIREABLE(T-sety_9_13) OR FIREABLE(T-sety_9_14) OR FIREABLE(T-sety_9_15) OR FIREABLE(T-sety_9_16)))) : A (F (G ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9) OR FIREABLE(T-await_13_10) OR FIREABLE(T-await_13_11) OR FIREABLE(T-await_13_12) OR FIREABLE(T-await_13_13) OR FIREABLE(T-await_13_14) OR FIREABLE(T-await_13_15) OR FIREABLE(T-await_13_16))))) : A ((G (F (X ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-awaity_4))))) U ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4)) U G ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8)))))) : A (G (G (F (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-awaity_4))))))) : A (G (F (G (F ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_6) OR FIREABLE(T-xeqi_10_11) OR FIREABLE(T-xeqi_10_16))))))) : A (X (X (X (X ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8))))))) : A ((FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6) OR FIREABLE(T-setbi_2_7) OR FIREABLE(T-setbi_2_8))) : A (F ((FIREABLE(T-ynei_15_9) U (FIREABLE(T-setbi_2_8) U FIREABLE(T-yne0_4_4))))) : A (G ((G (G (FIREABLE(T-setbi_5_7))) U FIREABLE(T-setbi_11_8)))) : A (X (FIREABLE(T-xnei_10_4))) : A (G (FIREABLE(T-await_13_14))) : A (F (FIREABLE(T-xnei_10_12))) : A (F (FIREABLE(T-setbi_2_3))) : A (F (((FIREABLE(T-await_13_11) U FIREABLE(T-setx_3_12)) U (FIREABLE(T-sety_9_10) U FIREABLE(T-xeqi_10_1))))) : A ((X ((FIREABLE(T-forod_13_2) U FIREABLE(T-setbi_2_4))) U F (G (F (FIREABLE(T-setbi_2_8))))))
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6) OR FIREABLE(T-setbi_2_7) OR FIREABLE(T-setbi_2_8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6) OR FIREABLE(T-setbi_2_7) OR FIREABLE(T-setbi_2_8))
lola: processed formula length: 205
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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

FORMULA LamportFastMutEx-PT-3-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8)))))))
lola: processed formula length: 233
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 6 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: 22 markings, 22 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T-xnei_10_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(T-xnei_10_4)))
lola: processed formula length: 29
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 22 markings, 22 edges
lola:
========================================
FORMULA LamportFastMutEx-PT-3-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T-await_13_14)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(T-await_13_14)))
lola: processed formula length: 31
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola:
FORMULA LamportFastMutEx-PT-3-LTLFireability-11 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 (G ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4))))
lola: processed formula length: 105
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(T-yeq0_4_1) AND NOT FIREABLE(T-yeq0_4_2) AND NOT FIREABLE(T-yeq0_4_3) AND NOT FIREABLE(T-yeq0_4_4))
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-3-LTLFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA LamportFastMutEx-PT-3-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)========================================

lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9) OR FIREABLE(T-sety_9_10) OR FIREABLE(T-sety_9_11) OR FIREABLE(T-sety_9_12) OR FIREABLE(T-sety_9_13) OR FIREABLE(T-sety_9_14) OR FIREABLE(T-sety_9_15) OR FIREABLE(T-s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9) OR FIREABLE(T-sety_9_10) OR FIREABLE(T-sety_9_11) OR FIREABLE(T-sety_9_12) OR FIREABLE(T-sety_9_13) OR FIREABLE(T-sety_9_14) OR FIREABLE(T-sety_9_15) OR FIREABLE(T-s... (shortened)
lola: processed formula length: 412
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T-yne0_4_4)))
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(T-yne0_4_4)
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 27 markings, 27 edges

FORMULA LamportFastMutEx-PT-3-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T-xnei_10_12)))
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(T-xnei_10_12)
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 31 markings, 31 edges

FORMULA LamportFastMutEx-PT-3-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T-setbi_2_3)))
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(T-setbi_2_3)
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T-xeqi_10_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(T-xeqi_10_1)
lola: processed formula length: 25
lola: 20 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 27 markings, 27 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(T-setbi_2_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(T-setbi_2_8))))
lola: processed formula length: 33
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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, 30 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-setbi_11_8) OR (G (FIREABLE(T-setbi_5_7)) AND F (FIREABLE(T-setbi_11_8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(T-setbi_11_8) OR (G (FIREABLE(T-setbi_5_7)) AND F (FIREABLE(T-setbi_11_8))))))
lola: processed formula length: 94
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 28 markings, 28 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-9 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 (G (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-awaity_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-awaity_4)))))
lola: processed formula length: 109
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 26 markings, 26 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_6) OR FIREABLE(T-xeqi_10_11) OR FIREABLE(T-xeqi_10_16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_6) OR FIREABLE(T-xeqi_10_11) OR FIREABLE(T-xeqi_10_16)))))
lola: processed formula length: 115
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 38 markings, 38 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9) OR FIREABLE(T-await_13_10) OR FIREABLE(T-await_13_11) OR FIREABLE(T-await_13_12) OR FIREABLE(T-await_13_13) OR FIREABLE(T-await_13_14) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(T-await_13_1) OR FIREABLE(T-await_13_2) OR FIREABLE(T-await_13_3) OR FIREABLE(T-await_13_4) OR FIREABLE(T-await_13_5) OR FIREABLE(T-await_13_6) OR FIREABLE(T-await_13_7) OR FIREABLE(T-await_13_8) OR FIREABLE(T-await_13_9) OR FIREABLE(T-await_13_10) OR FIREABLE(T-await_13_11) OR FIREABLE(T-await_13_12) OR FIREABLE(T-await_13_13) OR FIREABLE(T-await_13_14) OR FIREABL... (shortened)
lola: processed formula length: 448
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-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: 29 markings, 30 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4)) U G ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8)))) OR (G (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awai... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3) OR FIREABLE(T-yeq0_4_4)) U G ((FIREABLE(T-setbi_24_1) OR FIREABLE(T-setbi_24_2) OR FIREABLE(T-setbi_24_3) OR FIREABLE(T-setbi_24_4) OR FIREABLE(T-setbi_24_5) OR FIREABLE(T-setbi_24_6) OR FIREABLE(T-setbi_24_7) OR FIREABLE(T-setbi_24_8)))) OR (G (F ((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awai... (shortened)
lola: processed formula length: 662
lola: 18 rewrites
lola: closed formula file LamportFastMutEx-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 15 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: 28 markings, 28 edges
lola:
FORMULA LamportFastMutEx-PT-3-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no no no no yes no no
lola:
preliminary result: no no no no no no no yes no no no no no yes no no
========================================
lola: memory consumption: 14892 KB
lola: time consumption: 0 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="LamportFastMutEx-PT-3"
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/LamportFastMutEx-PT-3.tgz
mv LamportFastMutEx-PT-3 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 LamportFastMutEx-PT-3, 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-152732582700034"
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 ;