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 176K
-rw-r--r-- 1 mcc users 3.5K 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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 19K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DatabaseWithMutex-COL-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936700007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526594982878

info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-COL-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-COL-02 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityFireability @ DatabaseWithMutex-COL-02 @ 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: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 46 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-COL-02-ReachabilityFireability.task
lola: A (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)))) : E (F ((((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND ((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))))) : A (G ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)))) : A (G (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24))) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))) : A (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)))))) : E (F (((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR ((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))))) : A (G ((FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))) : A (G ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28)))) : E (F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)))) : A (G ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)))) : E (F ((NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28)))) : E (F (((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))) AND ((NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))))) : E (F ((NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))) : A (G (((NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))))) : A (G ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12))))) : A (G (((FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))))
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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4))
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-0.sara
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))
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(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16))))
lola: processed formula length: 77
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

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(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))
lola: processed formula length: 73
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-6 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: E (F ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))))
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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))))
lola: processed formula length: 73
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-8 TRUE 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 ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4))))
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(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4))))
lola: processed formula length: 89
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-4-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 DatabaseWithMutex-COL-02-ReachabilityFireability-9 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: E (F ((NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28))))
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(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28))))
lola: processed formula length: 93
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28))
lola: The predicate is reachable.
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-5-0.sara
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-10 TRUE 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 (G ((FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12)))))
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(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12)))))
lola: processed formula length: 167
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 151 markings, 276 edges
lola: state equation: State predicate is contradiction.
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-14 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 ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28))))
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(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28))
lola: state equation: Generated DNF with 12 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-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 DatabaseWithMutex-COL-02-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
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(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8)))))
lola: processed formula length: 151
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: ((NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24)) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)))
lola: state equation: Generated DNF with 68 literals and 17 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-8-0.sara
lola: ========================================

lola: FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-7-0.sara.
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))))
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(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))))
lola: processed formula length: 323
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-8-0.sara.
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(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND (FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-COL-02-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
sara: place or transition ordering is non-deterministic

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))))
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(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))))
lola: processed formula length: 241
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: lola: state equation: calling and running sara
state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file DatabaseWithMutex-COL-02-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic


lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges


FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR ((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))))
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(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR ((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR ((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20))))
lola: state equation: Generated DNF with 96 literals and 32 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-5 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: A (G ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) 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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))))))
lola: processed formula length: 223
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND ((NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR (NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24))))
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-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 (((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t2... (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(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t2... (shortened)
lola: processed formula length: 547
lola: 2 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: ((NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4)) OR (NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24)) OR (NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12)) OR ((FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4)) AND (FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24))) OR (NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20)))
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-3 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 ((((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND ((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT... (shortened)
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(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND ((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT... (shortened)
lola: processed formula length: 419
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: (((FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28)) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND ((NOT FIREABLE(t11) AND NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8)) OR (NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))))
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-1 TRUE 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: E (F (((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FI... (shortened)
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(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FI... (shortened)
lola: processed formula length: 929
lola: 1 rewrites
lola: closed formula file DatabaseWithMutex-COL-02-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(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR ((FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)) AND (FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20)))) AND ((NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16)) OR (NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12) AND (FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND (FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DatabaseWithMutex-COL-02-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no yes no yes yes yes no yes no
lola:
preliminary result: no yes no no no yes no no yes no yes yes yes no yes no
lola: memory consumption: 14704 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="DatabaseWithMutex-COL-02"
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/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 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 DatabaseWithMutex-COL-02, 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 r076-blw3-152649936700007"
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 ;