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 216K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 16 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DNAwalker-PT-02track12Block2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735400238
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526749735917

info: Time: 3600 - MCC
===========================================================================================
prep: translating DNAwalker-PT-02track12Block2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DNAwalker-PT-02track12Block2 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DNAwalker-PT-02track12Block2 @ 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: 98/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 84 transitions, 14 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 57 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-02track12Block2-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t6_2) AND NOT FIREABLE(t5_1)) OR (NOT FIREABLE(t5_1) AND NOT FIREABLE(t4_7)) OR FIREABLE(t4_7) OR FIREABLE(t2_4)))) : E (F (FIREABLE(t5_1))) : A (G ((NOT FIREABLE(t11_5) OR NOT FIREABLE(t5_9) OR (FIREABLE(t11_9) AND FIREABLE(tloop12) AND (FIREABLE(t2_5) OR FIREABLE(t1_2))) OR (NOT FIREABLE(t11_3) AND (FIREABLE(t10_11) OR FIREABLE(t10_9))) OR (FIREABLE(t5_2) AND FIREABLE(t5_9) AND (FIREABLE(t10_5) OR FIREABLE(t10_3)))))) : E (F ((FIREABLE(t2_10) AND FIREABLE(tloop12)))) : E (F ((FIREABLE(t4_9) AND FIREABLE(t6_8) AND NOT FIREABLE(t7_6)))) : E (F ((FIREABLE(t6_8) AND FIREABLE(t9_1) AND NOT FIREABLE(t10_3) AND NOT FIREABLE(t3_5) AND (NOT FIREABLE(t9_2) OR NOT FIREABLE(t6_8))))) : E (F ((NOT FIREABLE(t3_7) AND NOT FIREABLE(t5_7) AND (FIREABLE(t1_5) OR FIREABLE(t7_6)) AND (FIREABLE(t7_6) OR FIREABLE(t9_3)) AND ((FIREABLE(t9_2) AND FIREABLE(t10_4)) OR FIREABLE(t4_5))))) : A (G (((NOT FIREABLE(t4_10) AND NOT FIREABLE(t2_6)) OR NOT FIREABLE(t2_3) OR NOT FIREABLE(t7_4) OR NOT FIREABLE(t5_6) OR (NOT FIREABLE(t10_6) AND NOT FIREABLE(t2_4))))) : E (F (((FIREABLE(t6_3) AND FIREABLE(t5_8) AND (FIREABLE(t3_7) OR FIREABLE(t3_6))) OR (FIREABLE(t7_6) AND FIREABLE(t7_8) AND FIREABLE(t4_1)) OR (FIREABLE(t4_11) AND (FIREABLE(t7_5) OR FIREABLE(t3_9)) AND FIREABLE(t5_7))))) : E (F ((FIREABLE(t5_9) AND FIREABLE(t7_8) AND NOT FIREABLE(t1_5) AND (NOT FIREABLE(t4_2) OR NOT FIREABLE(t9_6)) AND NOT FIREABLE(t3_2) AND FIREABLE(t4_3) AND FIREABLE(t4_2) AND FIREABLE(t11_3) AND FIREABLE(t6_3)))) : E (F ((FIREABLE(t3_11) AND FIREABLE(t11_10)))) : A (G ((FIREABLE(t4_10) OR NOT FIREABLE(t6_3) OR NOT FIREABLE(t10_4) OR NOT FIREABLE(t5_2) OR NOT FIREABLE(t3_7)))) : A (G ((FIREABLE(t5_10) OR ((FIREABLE(t6_3) OR FIREABLE(t9_10)) AND NOT FIREABLE(t3_5)) OR NOT FIREABLE(t4_3) OR NOT FIREABLE(t9_3) OR (NOT FIREABLE(t4_5) AND NOT FIREABLE(t5_1))))) : A (G (((FIREABLE(t5_1) AND FIREABLE(t3_2) AND NOT FIREABLE(t10_4)) OR NOT FIREABLE(tloop8) OR ((NOT FIREABLE(t1_4) OR NOT FIREABLE(t3_6)) AND (NOT FIREABLE(t6_3) OR NOT FIREABLE(t1_5)))))) : A (G ((FIREABLE(t6_8) OR FIREABLE(t6_7) OR (FIREABLE(t11_5) AND FIREABLE(t4_2)) OR FIREABLE(t2_6) OR (NOT FIREABLE(t5_11) AND NOT FIREABLE(t1_5)) OR NOT FIREABLE(t4_7)))) : E (F ((NOT FIREABLE(t5_1) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_5) AND FIREABLE(t9_4))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5_1)))
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(t5_1)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t5_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1852 markings, 5242 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-1 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: E (F ((FIREABLE(t2_10) AND FIREABLE(tloop12))))
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(t2_10) AND FIREABLE(tloop12))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t2_10) AND FIREABLE(tloop12))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4103 markings, 11352 edges
lola:
FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-3 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: E (F ((FIREABLE(t3_11) AND FIREABLE(t11_10))))
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(t3_11) AND FIREABLE(t11_10))))
lola: processed formula length: 46
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t3_11) AND FIREABLE(t11_10))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3206 markings, 6596 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-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: E (F ((FIREABLE(t4_9) AND FIREABLE(t6_8) AND NOT FIREABLE(t7_6))))
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(t4_9) AND FIREABLE(t6_8) AND NOT FIREABLE(t7_6))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t4_9) AND FIREABLE(t6_8) AND NOT FIREABLE(t7_6))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2049 markings, 4693 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-4 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 (((NOT FIREABLE(t6_2) AND NOT FIREABLE(t5_1)) OR (NOT FIREABLE(t5_1) AND NOT FIREABLE(t4_7)) OR FIREABLE(t4_7) OR FIREABLE(t2_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 (((NOT FIREABLE(t6_2) AND NOT FIREABLE(t5_1)) OR (NOT FIREABLE(t5_1) AND NOT FIREABLE(t4_7)) OR FIREABLE(t4_7) OR FIREABLE(t2_4))))
lola: processed formula length: 139
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t6_2) OR FIREABLE(t5_1)) AND (FIREABLE(t5_1) OR FIREABLE(t4_7)) AND NOT FIREABLE(t4_7) AND NOT FIREABLE(t2_4))
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4177 markings, 11668 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-0 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 ((NOT FIREABLE(t5_1) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_5) AND FIREABLE(t9_4))))
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(t5_1) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_5) AND FIREABLE(t9_4))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t5_1) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_5) AND FIREABLE(t9_4))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1840 markings, 3623 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-15 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 (G ((FIREABLE(t4_10) OR NOT FIREABLE(t6_3) OR NOT FIREABLE(t10_4) OR NOT FIREABLE(t5_2) OR NOT FIREABLE(t3_7))))
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(t4_10) OR NOT FIREABLE(t6_3) OR NOT FIREABLE(t10_4) OR NOT FIREABLE(t5_2) OR NOT FIREABLE(t3_7))))
lola: processed formula length: 118
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t4_10) AND FIREABLE(t6_3) AND FIREABLE(t10_4) AND FIREABLE(t5_2) AND FIREABLE(t3_7))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1493 markings, 2397 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-11 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: E (F ((FIREABLE(t6_8) AND FIREABLE(t9_1) AND NOT FIREABLE(t10_3) AND NOT FIREABLE(t3_5) AND (NOT FIREABLE(t9_2) OR NOT FIREABLE(t6_8)))))
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(t6_8) AND FIREABLE(t9_1) AND NOT FIREABLE(t10_3) AND NOT FIREABLE(t3_5) AND (NOT FIREABLE(t9_2) OR NOT FIREABLE(t6_8)))))
lola: processed formula length: 138
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t6_8) AND FIREABLE(t9_1) AND NOT FIREABLE(t10_3) AND NOT FIREABLE(t3_5) AND (NOT FIREABLE(t9_2) OR NOT FIREABLE(t6_8)))
lola: state equation: Generated DNF with 84 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2659 markings, 6497 edges
lola:
FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t4_10) AND NOT FIREABLE(t2_6)) OR NOT FIREABLE(t2_3) OR NOT FIREABLE(t7_4) OR NOT FIREABLE(t5_6) OR (NOT FIREABLE(t10_6) AND NOT FIREABLE(t2_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 (((NOT FIREABLE(t4_10) AND NOT FIREABLE(t2_6)) OR NOT FIREABLE(t2_3) OR NOT FIREABLE(t7_4) OR NOT FIREABLE(t5_6) OR (NOT FIREABLE(t10_6) AND NOT FIREABLE(t2_4)))))
lola: processed formula length: 172
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t4_10) OR FIREABLE(t2_6)) AND FIREABLE(t2_3) AND FIREABLE(t7_4) AND FIREABLE(t5_6) AND (FIREABLE(t10_6) OR FIREABLE(t2_4)))
lola: state equation: Generated DNF with 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2656 markings, 5510 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-7 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 (G ((FIREABLE(t5_10) OR ((FIREABLE(t6_3) OR FIREABLE(t9_10)) AND NOT FIREABLE(t3_5)) OR NOT FIREABLE(t4_3) OR NOT FIREABLE(t9_3) OR (NOT FIREABLE(t4_5) AND NOT FIREABLE(t5_1)))))
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(t5_10) OR ((FIREABLE(t6_3) OR FIREABLE(t9_10)) AND NOT FIREABLE(t3_5)) OR NOT FIREABLE(t4_3) OR NOT FIREABLE(t9_3) OR (NOT FIREABLE(t4_5) AND NOT FIREABLE(t5_1)))))
lola: processed formula length: 185
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t5_10) AND ((NOT FIREABLE(t6_3) AND NOT FIREABLE(t9_10)) OR FIREABLE(t3_5)) AND FIREABLE(t4_3) AND FIREABLE(t9_3) AND (FIREABLE(t4_5) OR FIREABLE(t5_1)))
lola: state equation: Generated DNF with 108 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3131 markings, 6175 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-12 TRUE 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(t5_1) AND FIREABLE(t3_2) AND NOT FIREABLE(t10_4)) OR NOT FIREABLE(tloop8) OR ((NOT FIREABLE(t1_4) OR NOT FIREABLE(t3_6)) AND (NOT FIREABLE(t6_3) OR NOT FIREABLE(t1_5))))))
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(t5_1) AND FIREABLE(t3_2) AND NOT FIREABLE(t10_4)) OR NOT FIREABLE(tloop8) OR ((NOT FIREABLE(t1_4) OR NOT FIREABLE(t3_6)) AND (NOT FIREABLE(t6_3) OR NOT FIREABLE(t1_5))))))
lola: processed formula length: 192
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t5_1) OR NOT FIREABLE(t3_2) OR FIREABLE(t10_4)) AND FIREABLE(tloop8) AND ((FIREABLE(t1_4) AND FIREABLE(t3_6)) OR (FIREABLE(t6_3) AND FIREABLE(t1_5))))
lola: state equation: Generated DNF with 62 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2714 markings, 7193 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-13 TRUE 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(t6_8) OR FIREABLE(t6_7) OR (FIREABLE(t11_5) AND FIREABLE(t4_2)) OR FIREABLE(t2_6) OR (NOT FIREABLE(t5_11) AND NOT FIREABLE(t1_5)) OR NOT FIREABLE(t4_7))))
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(t6_8) OR FIREABLE(t6_7) OR (FIREABLE(t11_5) AND FIREABLE(t4_2)) OR FIREABLE(t2_6) OR (NOT FIREABLE(t5_11) AND NOT FIREABLE(t1_5)) OR NOT FIREABLE(t4_7))))
lola: processed formula length: 175
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t6_8) AND NOT FIREABLE(t6_7) AND (NOT FIREABLE(t11_5) OR NOT FIREABLE(t4_2)) AND NOT FIREABLE(t2_6) AND (FIREABLE(t5_11) OR FIREABLE(t1_5)) AND FIREABLE(t4_7))
lola: state equation: Generated DNF with 224 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1910 markings, 3459 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-14 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(t3_7) AND NOT FIREABLE(t5_7) AND (FIREABLE(t1_5) OR FIREABLE(t7_6)) AND (FIREABLE(t7_6) OR FIREABLE(t9_3)) AND ((FIREABLE(t9_2) AND FIREABLE(t10_4)) OR FIREABLE(t4_5)))))
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(t3_7) AND NOT FIREABLE(t5_7) AND (FIREABLE(t1_5) OR FIREABLE(t7_6)) AND (FIREABLE(t7_6) OR FIREABLE(t9_3)) AND ((FIREABLE(t9_2) AND FIREABLE(t10_4)) OR FIREABLE(t4_5)))))
lola: processed formula length: 193
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t3_7) AND NOT FIREABLE(t5_7) AND (FIREABLE(t1_5) OR FIREABLE(t7_6)) AND (FIREABLE(t7_6) OR FIREABLE(t9_3)) AND ((FIREABLE(t9_2) AND FIREABLE(t10_4)) OR FIREABLE(t4_5)))
lola: state equation: Generated DNF with 288 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4337 markings, 12819 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-6 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: E (F ((FIREABLE(t5_9) AND FIREABLE(t7_8) AND NOT FIREABLE(t1_5) AND (NOT FIREABLE(t4_2) OR NOT FIREABLE(t9_6)) AND NOT FIREABLE(t3_2) AND FIREABLE(t4_3) AND FIREABLE(t4_2) AND FIREABLE(t11_3) AND FIREABLE(t6_3))))
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(t5_9) AND FIREABLE(t7_8) AND NOT FIREABLE(t1_5) AND (NOT FIREABLE(t4_2) OR NOT FIREABLE(t9_6)) AND NOT FIREABLE(t3_2) AND FIREABLE(t4_3) AND FIREABLE(t4_2) AND FIREABLE(t11_3) AND FIREABLE(t6_3))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t5_9) AND FIREABLE(t7_8) AND NOT FIREABLE(t1_5) AND (NOT FIREABLE(t4_2) OR NOT FIREABLE(t9_6)) AND NOT FIREABLE(t3_2) AND FIREABLE(t4_3) AND FIREABLE(t4_2) AND FIREABLE(t11_3) AND FIREABLE(t6_3))
lola: state equation: Generated DNF with 90 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2350 markings, 4600 edges
lola:
FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-9 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(t6_3) AND FIREABLE(t5_8) AND (FIREABLE(t3_7) OR FIREABLE(t3_6))) OR (FIREABLE(t7_6) AND FIREABLE(t7_8) AND FIREABLE(t4_1)) OR (FIREABLE(t4_11) AND (FIREABLE(t7_5) OR FIREABLE(t3_9)) AND FIREABLE(t5_7)))))
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(t6_3) AND FIREABLE(t5_8) AND (FIREABLE(t3_7) OR FIREABLE(t3_6))) OR (FIREABLE(t7_6) AND FIREABLE(t7_8) AND FIREABLE(t4_1)) OR (FIREABLE(t4_11) AND (FIREABLE(t7_5) OR FIREABLE(t3_9)) AND FIREABLE(t5_7)))))
lola: processed formula length: 225
lola: 1 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t6_3) AND FIREABLE(t5_8) AND (FIREABLE(t3_7) OR FIREABLE(t3_6))) OR (FIREABLE(t7_6) AND FIREABLE(t7_8) AND FIREABLE(t4_1)) OR (FIREABLE(t4_11) AND (FIREABLE(t7_5) OR FIREABLE(t3_9)) AND FIREABLE(t5_7)))
lola: state equation: Generated DNF with 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4792 markings, 15370 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-8 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 ((NOT FIREABLE(t11_5) OR NOT FIREABLE(t5_9) OR (FIREABLE(t11_9) AND FIREABLE(tloop12) AND (FIREABLE(t2_5) OR FIREABLE(t1_2))) OR (NOT FIREABLE(t11_3) AND (FIREABLE(t10_11) OR FIREABLE(t10_9))) OR (FIREABLE(t5_2) AND FIREABLE(t5_9) AND (FIREABLE(t10_5) OR FIREABLE(t10_3))))))
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(t11_5) OR NOT FIREABLE(t5_9) OR (FIREABLE(t11_9) AND FIREABLE(tloop12) AND (FIREABLE(t2_5) OR FIREABLE(t1_2))) OR (NOT FIREABLE(t11_3) AND (FIREABLE(t10_11) OR FIREABLE(t10_9))) OR (FIREABLE(t5_2) AND FIREABLE(t5_9) AND (FIREABLE(t10_5) OR FIREABLE(t10_3))))))
lola: processed formula length: 287
lola: 2 rewrites
lola: closed formula file DNAwalker-PT-02track12Block2-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(t11_5) AND FIREABLE(t5_9) AND (NOT FIREABLE(t11_9) OR NOT FIREABLE(tloop12) OR (NOT FIREABLE(t2_5) AND NOT FIREABLE(t1_2))) AND (FIREABLE(t11_3) OR (NOT FIREABLE(t10_11) AND NOT FIREABLE(t10_9))) AND (NOT FIREABLE(t5_2) OR NOT FIREABLE(t5_9) OR (NOT FIREABLE(t10_5) AND NOT FIREABLE(t10_3))))
lola: state equation: Generated DNF with 496 literals and 56 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-02track12Block2-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-02track12Block2-ReachabilityFireability-15-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2408 markings, 5446 edges
lola: ========================================

FORMULA DNAwalker-PT-02track12Block2-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no yes no no no yes yes yes yes no
lola:
preliminary result: yes no yes no no no no yes no no no yes yes yes yes no
lola: memory consumption: 14764 KB
lola: time consumption: 0 seconds

BK_STOP 1526749736524

--------------------
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="DNAwalker-PT-02track12Block2"
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/DNAwalker-PT-02track12Block2.tgz
mv DNAwalker-PT-02track12Block2 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 DNAwalker-PT-02track12Block2, 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 r064-smll-152649735400238"
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 ;