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 704K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 536K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526665113037

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-12b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating FlexibleBarrier-PT-12b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ FlexibleBarrier-PT-12b @ 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: 4277/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 1988
lola: finding significant places
lola: 1988 places, 2289 transitions, 1974 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-12b-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t1224) AND NOT FIREABLE(t954)) OR NOT FIREABLE(t1619) OR NOT FIREABLE(t1975)))) : E (F ((FIREABLE(t803) AND (NOT FIREABLE(t759) OR NOT FIREABLE(t2063) OR FIREABLE(t799))))) : A (G ((FIREABLE(t747) OR NOT FIREABLE(t1887)))) : E (F (FIREABLE(t61))) : E (F (((NOT FIREABLE(t1215) OR NOT FIREABLE(t161)) AND NOT FIREABLE(t1788) AND (FIREABLE(t1974) OR FIREABLE(t501) OR FIREABLE(t1451) OR (FIREABLE(t2152) AND FIREABLE(t2199) AND (FIREABLE(t2163) OR FIREABLE(t722))))))) : E (F (FIREABLE(t1091))) : E (F (FIREABLE(t1901))) : A (G (((FIREABLE(t220) AND FIREABLE(t2254)) OR NOT FIREABLE(t312) OR (FIREABLE(t1059) AND FIREABLE(t550) AND (FIREABLE(t868) OR FIREABLE(t333))) OR ((FIREABLE(t261) OR FIREABLE(t768)) AND FIREABLE(t870)) OR (FIREABLE(t2206) AND FIREABLE(t1907) AND FIREABLE(t1909))))) : E (F ((FIREABLE(t1755) OR FIREABLE(t634) OR FIREABLE(t330)))) : A (G ((FIREABLE(t1039) OR ((NOT FIREABLE(t2217) OR NOT FIREABLE(t2274)) AND NOT FIREABLE(t1767))))) : E (F ((NOT FIREABLE(t2075) AND NOT FIREABLE(t422) AND FIREABLE(t190) AND FIREABLE(t45) AND FIREABLE(t1065) AND FIREABLE(t2009) AND (NOT FIREABLE(t2022) OR (NOT FIREABLE(t696) AND NOT FIREABLE(t213)))))) : E (F (FIREABLE(t781))) : E (F ((((NOT FIREABLE(t2157) AND FIREABLE(t965)) OR (FIREABLE(t1913) AND FIREABLE(t677) AND NOT FIREABLE(t1658))) AND FIREABLE(t510)))) : E (F (FIREABLE(t847))) : A (G ((((FIREABLE(t981) OR FIREABLE(t1525)) AND FIREABLE(t1706) AND (FIREABLE(t87) OR FIREABLE(t472) OR FIREABLE(t1039) OR FIREABLE(t849))) OR NOT FIREABLE(t45)))) : E (F ((NOT FIREABLE(t1079) AND NOT FIREABLE(t64) AND (NOT FIREABLE(t1779) OR NOT FIREABLE(t1574)) AND FIREABLE(t2278))))
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(t61)))
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(t61)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t61)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 120669 markings, 145597 edges, 24134 markings/sec, 0 secs
lola: sara is running 5 secs || 240062 markings, 300185 edges, 23879 markings/sec, 5 secs
lola: sara is running 10 secs || 361186 markings, 447854 edges, 24225 markings/sec, 10 secs
lola: sara is running 15 secs || 479205 markings, 600141 edges, 23604 markings/sec, 15 secs
lola: sara is running 20 secs || 598882 markings, 753447 edges, 23935 markings/sec, 20 secs

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

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1091)))
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(t1091)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1091)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola:
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1901)))
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(t1901)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1901)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t781)))
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(t781)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t781)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t847)))
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(t847)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t847)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t747) OR NOT FIREABLE(t1887))))
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(t747) OR NOT FIREABLE(t1887))))
lola: processed formula length: 48
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t747) AND FIREABLE(t1887))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1755) OR FIREABLE(t634) OR FIREABLE(t330))))
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(t1755) OR FIREABLE(t634) OR FIREABLE(t330))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1755) OR FIREABLE(t634) OR FIREABLE(t330))
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-6-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola:
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1039) OR ((NOT FIREABLE(t2217) OR NOT FIREABLE(t2274)) AND NOT FIREABLE(t1767)))))
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(t1039) OR ((NOT FIREABLE(t2217) OR NOT FIREABLE(t2274)) AND NOT FIREABLE(t1767)))))
lola: processed formula length: 101
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1039) AND ((FIREABLE(t2217) AND FIREABLE(t2274)) OR FIREABLE(t1767)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t803) AND (NOT FIREABLE(t759) OR NOT FIREABLE(t2063) OR FIREABLE(t799)))))
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(t803) AND (NOT FIREABLE(t759) OR NOT FIREABLE(t2063) OR FIREABLE(t799)))))
lola: processed formula length: 92
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t803) AND (NOT FIREABLE(t759) OR NOT FIREABLE(t2063) OR FIREABLE(t799)))
lola: state equation: Generated DNF with 10 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 44 markings, 43 edges
lola:
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1224) AND NOT FIREABLE(t954)) OR NOT FIREABLE(t1619) OR NOT FIREABLE(t1975))))
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(t1224) AND NOT FIREABLE(t954)) OR NOT FIREABLE(t1619) OR NOT FIREABLE(t1975))))
lola: processed formula length: 102
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1224) OR FIREABLE(t954)) AND FIREABLE(t1619) AND FIREABLE(t1975))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1079) AND NOT FIREABLE(t64) AND (NOT FIREABLE(t1779) OR NOT FIREABLE(t1574)) AND FIREABLE(t2278))))
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(t1079) AND NOT FIREABLE(t64) AND (NOT FIREABLE(t1779) OR NOT FIREABLE(t1574)) AND FIREABLE(t2278))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1079) AND NOT FIREABLE(t64) AND (NOT FIREABLE(t1779) OR NOT FIREABLE(t1574)) AND FIREABLE(t2278))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola:
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t2157) AND FIREABLE(t965)) OR (FIREABLE(t1913) AND FIREABLE(t677) AND NOT FIREABLE(t1658))) AND FIREABLE(t510))))
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(t2157) AND FIREABLE(t965)) OR (FIREABLE(t1913) AND FIREABLE(t677) AND NOT FIREABLE(t1658))) AND FIREABLE(t510))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t2157) AND FIREABLE(t965)) OR (FIREABLE(t1913) AND FIREABLE(t677) AND NOT FIREABLE(t1658))) AND FIREABLE(t510))
lola: state equation: Generated DNF with 13 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola:
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t981) OR FIREABLE(t1525)) AND FIREABLE(t1706) AND (FIREABLE(t87) OR FIREABLE(t472) OR FIREABLE(t1039) OR FIREABLE(t849))) OR NOT FIREABLE(t45))))
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(t981) OR FIREABLE(t1525)) AND FIREABLE(t1706) AND (FIREABLE(t87) OR FIREABLE(t472) OR FIREABLE(t1039) OR FIREABLE(t849))) OR NOT FIREABLE(t45))))
lola: processed formula length: 168
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t981) AND NOT FIREABLE(t1525)) OR NOT FIREABLE(t1706) OR (NOT FIREABLE(t87) AND NOT FIREABLE(t472) AND NOT FIREABLE(t1039) AND NOT FIREABLE(t849))) AND FIREABLE(t45))
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 116305 markings, 140408 edges, 23261 markings/sec, 0 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2075) AND NOT FIREABLE(t422) AND FIREABLE(t190) AND FIREABLE(t45) AND FIREABLE(t1065) AND FIREABLE(t2009) AND (NOT FIREABLE(t2022) OR (NOT FIREABLE(t696) AND NOT FIREABLE(t213))))))
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(t2075) AND NOT FIREABLE(t422) AND FIREABLE(t190) AND FIREABLE(t45) AND FIREABLE(t1065) AND FIREABLE(t2009) AND (NOT FIREABLE(t2022) OR (NOT FIREABLE(t696) AND NOT FIREABLE(t213))))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t2075) AND NOT FIREABLE(t422) AND FIREABLE(t190) AND FIREABLE(t45) AND FIREABLE(t1065) AND FIREABLE(t2009) AND (NOT FIREABLE(t2022) OR (NOT FIREABLE(t696) AND NOT FIREABLE(t213))))
lola: state equation: Generated DNF with 51 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t1215) OR NOT FIREABLE(t161)) AND NOT FIREABLE(t1788) AND (FIREABLE(t1974) OR FIREABLE(t501) OR FIREABLE(t1451) OR (FIREABLE(t2152) AND FIREABLE(t2199) AND (FIREABLE(t2163) OR FIREABLE(t722)))))))
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(t1215) OR NOT FIREABLE(t161)) AND NOT FIREABLE(t1788) AND (FIREABLE(t1974) OR FIREABLE(t501) OR FIREABLE(t1451) OR (FIREABLE(t2152) AND FIREABLE(t2199) AND (FIREABLE(t2163) OR FIREABLE(t722)))))))
lola: processed formula length: 222
lola: 1 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t1215) OR NOT FIREABLE(t161)) AND NOT FIREABLE(t1788) AND (FIREABLE(t1974) OR FIREABLE(t501) OR FIREABLE(t1451) OR (FIREABLE(t2152) AND FIREABLE(t2199) AND (FIREABLE(t2163) OR FIREABLE(t722)))))
lola: state equation: Generated DNF with 60 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-12b-ReachabilityFireability-14-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 122121 markings, 147347 edges, 24424 markings/sec, 0 secs
lola: sara is running 5 secs || 238986 markings, 298253 edges, 23373 markings/sec, 5 secs
lola: sara is running 10 secs || 360357 markings, 446892 edges, 24274 markings/sec, 10 secs

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

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t220) AND FIREABLE(t2254)) OR NOT FIREABLE(t312) OR (FIREABLE(t1059) AND FIREABLE(t550) AND (FIREABLE(t868) OR FIREABLE(t333))) OR ((FIREABLE(t261) OR FIREABLE(t768)) AND FIREABLE(t870)) OR (FIREABLE(t2206) AND FIREABLE(t1907) AND FIREABLE(t1909)))))
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(t220) AND FIREABLE(t2254)) OR NOT FIREABLE(t312) OR (FIREABLE(t1059) AND FIREABLE(t550) AND (FIREABLE(t868) OR FIREABLE(t333))) OR ((FIREABLE(t261) OR FIREABLE(t768)) AND FIREABLE(t870)) OR (FIREABLE(t2206) AND FIREABLE(t1907) AND FIREABLE(t1909)))))
lola: processed formula length: 273
lola: 2 rewrites
lola: closed formula file FlexibleBarrier-PT-12b-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(t220) OR NOT FIREABLE(t2254)) AND FIREABLE(t312) AND (NOT FIREABLE(t1059) OR NOT FIREABLE(t550) OR (NOT FIREABLE(t868) AND NOT FIREABLE(t333))) AND ((NOT FIREABLE(t261) AND NOT FIREABLE(t768)) OR NOT FIREABLE(t870)) AND (NOT FIREABLE(t2206) OR NOT FIREABLE(t1907) OR NOT FIREABLE(t1909)))
lola: state equation: Generated DNF with 700 literals and 120 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-12b-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 34 markings, 33 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no yes no no yes yes yes no yes
lola:
preliminary result: no yes no yes yes yes yes no yes no no yes yes yes no yes
lola: memory consumption: 17652 KB
lola: time consumption: 59 seconds

BK_STOP 1526665172900

--------------------
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="FlexibleBarrier-PT-12b"
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/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 FlexibleBarrier-PT-12b, 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 r088-blw7-152649998100168"
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 ;