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 1004K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 836K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0010w0500, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526947792478

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0010w0500 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 RwMutex-PT-r0010w0500 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RwMutex-PT-r0010w0500 @ 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: 2050/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1030
lola: finding significant places
lola: 1030 places, 1020 transitions, 510 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 521 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t748) OR FIREABLE(t204)))) : E (F ((NOT FIREABLE(t104) AND NOT FIREABLE(t834) AND (NOT FIREABLE(t968) OR NOT FIREABLE(t880)) AND (NOT FIREABLE(t250) OR FIREABLE(t745) OR FIREABLE(t610))))) : E (F ((FIREABLE(t598) OR FIREABLE(t744) OR NOT FIREABLE(t92)))) : E (F (((FIREABLE(t164) AND NOT FIREABLE(t316)) OR ((NOT FIREABLE(t876) OR NOT FIREABLE(t304)) AND NOT FIREABLE(t877))))) : A (G (FIREABLE(t482))) : A (G ((NOT FIREABLE(t715) AND NOT FIREABLE(t238) AND NOT FIREABLE(t393) AND FIREABLE(t295) AND FIREABLE(t762) AND (NOT FIREABLE(t647) OR (FIREABLE(t371) AND FIREABLE(t345)))))) : E (F ((NOT FIREABLE(t92) AND NOT FIREABLE(t730) AND (FIREABLE(t938) OR FIREABLE(t553)) AND NOT FIREABLE(t199) AND (FIREABLE(t27) OR FIREABLE(t871) OR FIREABLE(t875))))) : A (G ((FIREABLE(t268) AND FIREABLE(t402) AND FIREABLE(t861) AND FIREABLE(t350) AND (NOT FIREABLE(t731) OR NOT FIREABLE(t616)) AND FIREABLE(t328)))) : A (G (((FIREABLE(t262) AND FIREABLE(t461)) OR FIREABLE(t507) OR FIREABLE(t570) OR ((NOT FIREABLE(t136) OR NOT FIREABLE(t887)) AND FIREABLE(t857))))) : E (F (((NOT FIREABLE(t602) AND FIREABLE(t862)) OR (NOT FIREABLE(t642) AND NOT FIREABLE(t7)) OR (FIREABLE(t587) AND FIREABLE(t639) AND FIREABLE(t518))))) : A (G (((FIREABLE(t240) OR FIREABLE(t145)) AND ((FIREABLE(t237) AND (FIREABLE(t1001) OR FIREABLE(t650))) OR FIREABLE(t24))))) : E (F ((NOT FIREABLE(t492) AND NOT FIREABLE(t62)))) : A (G ((FIREABLE(t183) OR FIREABLE(t285)))) : A (G ((FIREABLE(t34) OR (FIREABLE(t379) AND FIREABLE(t2)) OR FIREABLE(t273) OR NOT FIREABLE(t68)))) : E (F ((NOT FIREABLE(t127) OR NOT FIREABLE(t367) OR NOT FIREABLE(t412) OR NOT FIREABLE(t676) OR NOT FIREABLE(t37) OR FIREABLE(t496)))) : A (G (((FIREABLE(t322) OR FIREABLE(t304) OR (FIREABLE(t566) AND FIREABLE(t47)) OR (FIREABLE(t481) AND FIREABLE(t806) AND FIREABLE(t357) AND FIREABLE(t929))) AND (FIREABLE(t949) OR FIREABLE(t206)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t482)))
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(t482)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t482)
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-4 FALSE 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: E (F ((NOT FIREABLE(t748) OR FIREABLE(t204))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t748) OR FIREABLE(t204))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t748) OR FIREABLE(t204))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-0 TRUE 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: E (F ((NOT FIREABLE(t492) AND NOT FIREABLE(t62))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t492) AND NOT FIREABLE(t62))))
lola: processed formula length: 50
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t492) AND NOT FIREABLE(t62))
lola: state equation: Generated DNF with 242 literals and 121 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-11 TRUE 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(t183) OR FIREABLE(t285))))
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(t183) OR FIREABLE(t285))))
lola: processed formula length: 43
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t183) AND NOT FIREABLE(t285))
lola: state equation: Generated DNF with 242 literals and 121 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-12 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: E (F ((FIREABLE(t598) OR FIREABLE(t744) OR NOT FIREABLE(t92))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t598) OR FIREABLE(t744) OR NOT FIREABLE(t92))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t598) OR FIREABLE(t744) OR NOT FIREABLE(t92))
lola: state equation: Generated DNF with 13 literals and 13 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-2 TRUE 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: E (F (((FIREABLE(t164) AND NOT FIREABLE(t316)) OR ((NOT FIREABLE(t876) OR NOT FIREABLE(t304)) AND NOT FIREABLE(t877)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t164) AND NOT FIREABLE(t316)) OR ((NOT FIREABLE(t876) OR NOT FIREABLE(t304)) AND NOT FIREABLE(t877)))))
lola: processed formula length: 122
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t164) AND NOT FIREABLE(t316)) OR ((NOT FIREABLE(t876) OR NOT FIREABLE(t304)) AND NOT FIREABLE(t877)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 36 literals and 13 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-5-0.sara
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-3 TRUE 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 (G ((FIREABLE(t34) OR (FIREABLE(t379) AND FIREABLE(t2)) OR FIREABLE(t273) OR NOT FIREABLE(t68))))
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(t34) OR (FIREABLE(t379) AND FIREABLE(t2)) OR FIREABLE(t273) OR NOT FIREABLE(t68))))
lola: processed formula length: 102
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t34) AND (NOT FIREABLE(t379) OR NOT FIREABLE(t2)) AND NOT FIREABLE(t273) AND FIREABLE(t68))
lola: state equation: Generated DNF with 28 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w0500-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 511 markings, 1020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-13 TRUE 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 (G (((FIREABLE(t240) OR FIREABLE(t145)) AND ((FIREABLE(t237) AND (FIREABLE(t1001) OR FIREABLE(t650))) OR FIREABLE(t24)))))
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(t240) OR FIREABLE(t145)) AND ((FIREABLE(t237) AND (FIREABLE(t1001) OR FIREABLE(t650))) OR FIREABLE(t24)))))
lola: processed formula length: 127
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t240) AND NOT FIREABLE(t145)) OR ((NOT FIREABLE(t237) OR (NOT FIREABLE(t1001) AND NOT FIREABLE(t650))) AND NOT FIREABLE(t24)))
lola: state equation: Generated DNF with 517 literals and 253 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-10 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: E (F ((NOT FIREABLE(t127) OR NOT FIREABLE(t367) OR NOT FIREABLE(t412) OR NOT FIREABLE(t676) OR NOT FIREABLE(t37) OR FIREABLE(t496))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t127) OR NOT FIREABLE(t367) OR NOT FIREABLE(t412) OR NOT FIREABLE(t676) OR NOT FIREABLE(t37) OR FIREABLE(t496))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t127) OR NOT FIREABLE(t367) OR NOT FIREABLE(t412) OR NOT FIREABLE(t676) OR NOT FIREABLE(t37) OR FIREABLE(t496))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: Generated DNF with 56 literals and 46 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t268) AND FIREABLE(t402) AND FIREABLE(t861) AND FIREABLE(t350) AND (NOT FIREABLE(t731) OR NOT FIREABLE(t616)) AND FIREABLE(t328))))
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(t268) AND FIREABLE(t402) AND FIREABLE(t861) AND FIREABLE(t350) AND (NOT FIREABLE(t731) OR NOT FIREABLE(t616)) AND FIREABLE(t328))))
lola: processed formula length: 148
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t268) OR NOT FIREABLE(t402) OR NOT FIREABLE(t861) OR NOT FIREABLE(t350) OR (FIREABLE(t731) AND FIREABLE(t616)) OR NOT FIREABLE(t328))
lola: state equation: Generated DNF with 47 literals and 46 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-9-0.sara
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-7 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 (((FIREABLE(t262) AND FIREABLE(t461)) OR FIREABLE(t507) OR FIREABLE(t570) OR ((NOT FIREABLE(t136) OR NOT FIREABLE(t887)) AND FIREABLE(t857)))))
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(t262) AND FIREABLE(t461)) OR FIREABLE(t507) OR FIREABLE(t570) OR ((NOT FIREABLE(t136) OR NOT FIREABLE(t887)) AND FIREABLE(t857)))))
lola: processed formula length: 152
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t262) OR NOT FIREABLE(t461)) AND NOT FIREABLE(t507) AND NOT FIREABLE(t570) AND ((FIREABLE(t136) AND FIREABLE(t887)) OR NOT FIREABLE(t857)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-8 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: E (F (((NOT FIREABLE(t602) AND FIREABLE(t862)) OR (NOT FIREABLE(t642) AND NOT FIREABLE(t7)) OR (FIREABLE(t587) AND FIREABLE(t639) AND FIREABLE(t518)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t602) AND FIREABLE(t862)) OR (NOT FIREABLE(t642) AND NOT FIREABLE(t7)) OR (FIREABLE(t587) AND FIREABLE(t639) AND FIREABLE(t518)))))
lola: processed formula length: 154
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(t602) AND FIREABLE(t862)) OR (NOT FIREABLE(t642) AND NOT FIREABLE(t7)) OR (FIREABLE(t587) AND FIREABLE(t639) AND FIREABLE(t518)))
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-9 TRUE 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: E (F ((NOT FIREABLE(t104) AND NOT FIREABLE(t834) AND (NOT FIREABLE(t968) OR NOT FIREABLE(t880)) AND (NOT FIREABLE(t250) OR FIREABLE(t745) OR FIREABLE(t610)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t104) AND NOT FIREABLE(t834) AND (NOT FIREABLE(t968) OR NOT FIREABLE(t880)) AND (NOT FIREABLE(t250) OR FIREABLE(t745) OR FIREABLE(t610)))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t104) AND NOT FIREABLE(t834) AND (NOT FIREABLE(t968) OR NOT FIREABLE(t880)) AND (NOT FIREABLE(t250) OR FIREABLE(t745) OR FIREABLE(t610)))
lola: state equation: Generated DNF with 1144 literals and 286 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-1 TRUE 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 ((NOT FIREABLE(t715) AND NOT FIREABLE(t238) AND NOT FIREABLE(t393) AND FIREABLE(t295) AND FIREABLE(t762) AND (NOT FIREABLE(t647) OR (FIREABLE(t371) AND FIREABLE(t345))))))
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 ((NOT FIREABLE(t715) AND NOT FIREABLE(t238) AND NOT FIREABLE(t393) AND FIREABLE(t295) AND FIREABLE(t762) AND (NOT FIREABLE(t647) OR (FIREABLE(t371) AND FIREABLE(t345))))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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: (FIREABLE(t715) OR FIREABLE(t238) OR FIREABLE(t393) OR NOT FIREABLE(t295) OR NOT FIREABLE(t762) OR (FIREABLE(t647) AND (NOT FIREABLE(t371) OR NOT FIREABLE(t345))))
lola: SUBRESULT
lola: state equation: Generated DNF with 79 literals and 37 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-13-0.sara
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-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: E (F ((NOT FIREABLE(t92) AND NOT FIREABLE(t730) AND (FIREABLE(t938) OR FIREABLE(t553)) AND NOT FIREABLE(t199) AND (FIREABLE(t27) OR FIREABLE(t871) OR FIREABLE(t875)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t92) AND NOT FIREABLE(t730) AND (FIREABLE(t938) OR FIREABLE(t553)) AND NOT FIREABLE(t199) AND (FIREABLE(t27) OR FIREABLE(t871) OR FIREABLE(t875)))))
lola: processed formula length: 171
lola: 1 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t92) AND NOT FIREABLE(t730) AND (FIREABLE(t938) OR FIREABLE(t553)) AND NOT FIREABLE(t199) AND (FIREABLE(t27) OR FIREABLE(t871) OR FIREABLE(t875)))
lola: state equation: Generated DNF with 2450 literals and 486 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0010w0500-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r0010w0500-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 511 markings, 1020 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-6 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 (G (((FIREABLE(t322) OR FIREABLE(t304) OR (FIREABLE(t566) AND FIREABLE(t47)) OR (FIREABLE(t481) AND FIREABLE(t806) AND FIREABLE(t357) AND FIREABLE(t929))) AND (FIREABLE(t949) OR FIREABLE(t206)))))
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(t322) OR FIREABLE(t304) OR (FIREABLE(t566) AND FIREABLE(t47)) OR (FIREABLE(t481) AND FIREABLE(t806) AND FIREABLE(t357) AND FIREABLE(t929))) AND (FIREABLE(t949) OR FIREABLE(t206)))))
lola: processed formula length: 202
lola: 2 rewrites
lola: closed formula file RwMutex-PT-r0010w0500-ReachabilityFireability.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(t322) AND NOT FIREABLE(t304) AND (NOT FIREABLE(t566) OR NOT FIREABLE(t47)) AND (NOT FIREABLE(t481) OR NOT FIREABLE(t806) OR NOT FIREABLE(t357) OR NOT FIREABLE(t929))) OR (NOT FIREABLE(t949) AND NOT FIREABLE(t206)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA RwMutex-PT-r0010w0500-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no no yes no yes no yes yes no
lola:
preliminary result: yes yes yes yes no no no no no yes no yes no yes yes no
lola: memory consumption: 16552 KB
lola: time consumption: 1 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="RwMutex-PT-r0010w0500"
export BK_EXAMINATION="ReachabilityFireability"
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/RwMutex-PT-r0010w0500.tgz
mv RwMutex-PT-r0010w0500 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 RwMutex-PT-r0010w0500, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-smll-152685547100126"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;