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 416K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K 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 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 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 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 251K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Parking-PT-832, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500420
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527034038794

info: Time: 3600 - MCC
===========================================================================================
prep: translating Parking-PT-832 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 Parking-PT-832 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Parking-PT-832 @ 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: 1730/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 737
lola: finding significant places
lola: 737 places, 993 transitions, 553 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 714 transition conflict sets
lola: TASK
lola: reading formula from Parking-PT-832-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t235) AND NOT FIREABLE(t825)) OR FIREABLE(t84) OR (NOT FIREABLE(t778) AND FIREABLE(t387))))) : E (F ((NOT FIREABLE(t91) AND FIREABLE(t207)))) : E (F ((FIREABLE(t702) OR ((FIREABLE(t747) OR FIREABLE(t875)) AND NOT FIREABLE(t701) AND FIREABLE(t308))))) : E (F ((FIREABLE(t605) AND (NOT FIREABLE(t640) OR NOT FIREABLE(t611)) AND FIREABLE(t661)))) : A (G (((NOT FIREABLE(t246) AND NOT FIREABLE(t891)) OR FIREABLE(t794) OR ((NOT FIREABLE(t307) OR NOT FIREABLE(t259)) AND FIREABLE(t897))))) : E (F (((FIREABLE(t954) OR ((FIREABLE(t830) OR FIREABLE(t107)) AND (FIREABLE(t25) OR FIREABLE(t611)))) AND FIREABLE(t124)))) : E (F (FIREABLE(t253))) : E (F ((FIREABLE(t492) AND FIREABLE(t864) AND NOT FIREABLE(t58)))) : A (G ((((FIREABLE(t725) OR NOT FIREABLE(t194)) AND (NOT FIREABLE(t386) OR NOT FIREABLE(t740))) OR (((FIREABLE(t237) AND FIREABLE(t526)) OR NOT FIREABLE(t215)) AND (FIREABLE(t126) OR FIREABLE(t46) OR (FIREABLE(t878) AND FIREABLE(t903))))))) : A (G (NOT FIREABLE(t136))) : E (F (((FIREABLE(t928) OR FIREABLE(t642)) AND FIREABLE(t589)))) : E (F ((FIREABLE(t840) AND FIREABLE(t767) AND (NOT FIREABLE(t745) OR NOT FIREABLE(t416) OR FIREABLE(t900))))) : A (G (((FIREABLE(t847) AND FIREABLE(t251) AND NOT FIREABLE(t3)) OR NOT FIREABLE(t141) OR (FIREABLE(t442) AND (FIREABLE(t968) OR FIREABLE(t77)) AND FIREABLE(t789))))) : E (F ((FIREABLE(t763) OR FIREABLE(t84) OR (FIREABLE(t702) AND FIREABLE(t208))))) : E (F (((FIREABLE(t861) OR (NOT FIREABLE(t761) AND (FIREABLE(t639) OR FIREABLE(t265)))) AND FIREABLE(t666)))) : E (F ((NOT FIREABLE(t874) AND NOT FIREABLE(t134) AND NOT FIREABLE(t902) AND FIREABLE(t618) AND FIREABLE(t762) AND NOT FIREABLE(t367) AND (FIREABLE(t63) OR FIREABLE(t253) OR FIREABLE(t331)))))
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(t253)))
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(t253)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t253)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-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: 7 markings, 6 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t136)))
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(t136)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file Parking-PT-832-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(t136)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t91) AND FIREABLE(t207))))
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(t91) AND FIREABLE(t207))))
lola: processed formula length: 46
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t492) AND FIREABLE(t864) AND NOT FIREABLE(t58))))
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(t492) AND FIREABLE(t864) AND NOT FIREABLE(t58))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t492) AND FIREABLE(t864) AND NOT FIREABLE(t58))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-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: 28 markings, 27 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-7 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: E (F (((FIREABLE(t928) OR FIREABLE(t642)) AND FIREABLE(t589))))
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(t928) OR FIREABLE(t642)) AND FIREABLE(t589))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t928) OR FIREABLE(t642)) AND FIREABLE(t589))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 53 edges
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-4-0.sara
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t605) AND (NOT FIREABLE(t640) OR NOT FIREABLE(t611)) AND FIREABLE(t661))))
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(t605) AND (NOT FIREABLE(t640) OR NOT FIREABLE(t611)) AND FIREABLE(t661))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t605) AND (NOT FIREABLE(t640) OR NOT FIREABLE(t611)) AND FIREABLE(t661))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA Parking-PT-832-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t763) OR FIREABLE(t84) OR (FIREABLE(t702) AND FIREABLE(t208)))))
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(t763) OR FIREABLE(t84) OR (FIREABLE(t702) AND FIREABLE(t208)))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t763) OR FIREABLE(t84) OR (FIREABLE(t702) AND FIREABLE(t208)))
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-6-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: 7 markings, 6 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t235) AND NOT FIREABLE(t825)) OR FIREABLE(t84) OR (NOT FIREABLE(t778) AND FIREABLE(t387)))))
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(t235) AND NOT FIREABLE(t825)) OR FIREABLE(t84) OR (NOT FIREABLE(t778) AND FIREABLE(t387)))))
lola: processed formula length: 115
lola: 2 rewrites
lola: closed formula file Parking-PT-832-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
sara: try reading problem file Parking-PT-832-ReachabilityFireability-5-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t235) OR FIREABLE(t825)) AND NOT FIREABLE(t84) AND (FIREABLE(t778) OR NOT FIREABLE(t387)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t840) AND FIREABLE(t767) AND (NOT FIREABLE(t745) OR NOT FIREABLE(t416) OR FIREABLE(t900)))))
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(t840) AND FIREABLE(t767) AND (NOT FIREABLE(t745) OR NOT FIREABLE(t416) OR FIREABLE(t900)))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t840) AND FIREABLE(t767) AND (NOT FIREABLE(t745) OR NOT FIREABLE(t416) OR FIREABLE(t900)))
lola: state equation: Generated DNF with 21 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-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: 20 markings, 19 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t702) OR ((FIREABLE(t747) OR FIREABLE(t875)) AND NOT FIREABLE(t701) AND FIREABLE(t308)))))
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(t702) OR ((FIREABLE(t747) OR FIREABLE(t875)) AND NOT FIREABLE(t701) AND FIREABLE(t308)))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t702) OR ((FIREABLE(t747) OR FIREABLE(t875)) AND NOT FIREABLE(t701) AND FIREABLE(t308)))
lola: state equation: Generated DNF with 18 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Parking-PT-832-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t861) OR (NOT FIREABLE(t761) AND (FIREABLE(t639) OR FIREABLE(t265)))) AND FIREABLE(t666))))
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(t861) OR (NOT FIREABLE(t761) AND (FIREABLE(t639) OR FIREABLE(t265)))) AND FIREABLE(t666))))
lola: processed formula length: 110
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t861) OR (NOT FIREABLE(t761) AND (FIREABLE(t639) OR FIREABLE(t265)))) AND FIREABLE(t666))
lola: state equation: Generated DNF with 22 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Parking-PT-832-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t954) OR ((FIREABLE(t830) OR FIREABLE(t107)) AND (FIREABLE(t25) OR FIREABLE(t611)))) AND FIREABLE(t124))))
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(t954) OR ((FIREABLE(t830) OR FIREABLE(t107)) AND (FIREABLE(t25) OR FIREABLE(t611)))) AND FIREABLE(t124))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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(t954) OR ((FIREABLE(t830) OR FIREABLE(t107)) AND (FIREABLE(t25) OR FIREABLE(t611)))) AND FIREABLE(t124))
lola: state equation: Generated DNF with 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Parking-PT-832-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA Parking-PT-832-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 (((NOT FIREABLE(t246) AND NOT FIREABLE(t891)) OR FIREABLE(t794) OR ((NOT FIREABLE(t307) OR NOT FIREABLE(t259)) AND FIREABLE(t897)))))
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(t246) AND NOT FIREABLE(t891)) OR FIREABLE(t794) OR ((NOT FIREABLE(t307) OR NOT FIREABLE(t259)) AND FIREABLE(t897)))))
lola: processed formula length: 141
lola: 2 rewrites
lola: closed formula file Parking-PT-832-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(t246) OR FIREABLE(t891)) AND NOT FIREABLE(t794) AND ((FIREABLE(t307) AND FIREABLE(t259)) OR NOT FIREABLE(t897)))
lola: state equation: Generated DNF with 46 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Parking-PT-832-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges

FORMULA Parking-PT-832-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t847) AND FIREABLE(t251) AND NOT FIREABLE(t3)) OR NOT FIREABLE(t141) OR (FIREABLE(t442) AND (FIREABLE(t968) OR FIREABLE(t77)) AND FIREABLE(t789)))))
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(t847) AND FIREABLE(t251) AND NOT FIREABLE(t3)) OR NOT FIREABLE(t141) OR (FIREABLE(t442) AND (FIREABLE(t968) OR FIREABLE(t77)) AND FIREABLE(t789)))))
lola: processed formula length: 168
lola: 2 rewrites
lola: closed formula file Parking-PT-832-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: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t874) AND NOT FIREABLE(t134) AND NOT FIREABLE(t902) AND FIREABLE(t618) AND FIREABLE(t762) AND NOT FIREABLE(t367) AND (FIREABLE(t63) OR FIREABLE(t253) OR FIREABLE(t331)))))
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(t874) AND NOT FIREABLE(t134) AND NOT FIREABLE(t902) AND FIREABLE(t618) AND FIREABLE(t762) AND NOT FIREABLE(t367) AND (FIREABLE(t63) OR FIREABLE(t253) OR FIREABLE(t331)))))
lola: processed formula length: 193
lola: 1 rewrites
lola: closed formula file Parking-PT-832-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA Parking-PT-832-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t725) OR NOT FIREABLE(t194)) AND (NOT FIREABLE(t386) OR NOT FIREABLE(t740))) OR (((FIREABLE(t237) AND FIREABLE(t526)) OR NOT FIREABLE(t215)) AND (FIREABLE(t126) OR FIREABLE(t46) OR (FIREABLE(t878) AND FIREABLE(t903)))))))
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(t725) OR NOT FIREABLE(t194)) AND (NOT FIREABLE(t386) OR NOT FIREABLE(t740))) OR (((FIREABLE(t237) AND FIREABLE(t526)) OR NOT FIREABLE(t215)) AND (FIREABLE(t126) OR FIREABLE(t46) OR (FIREABLE(t878) AND FIREABLE(t903)))))))
lola: processed formula length: 245
lola: 2 rewrites
lola: closed formula file Parking-PT-832-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(t725) AND FIREABLE(t194)) OR (FIREABLE(t386) AND FIREABLE(t740))) AND (((NOT FIREABLE(t237) OR NOT FIREABLE(t526)) AND FIREABLE(t215)) OR (NOT FIREABLE(t126) AND NOT FIREABLE(t46) AND (NOT FIREABLE(t878) OR NOT FIREABLE(t903)))))
lola: state equation: Generated DNF with 90 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to Parking-PT-832-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Parking-PT-832-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges

FORMULA Parking-PT-832-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes no yes yes yes no no yes yes no yes yes yes
lola:
preliminary result: no yes yes yes no yes yes yes no no yes yes no yes yes yes
lola: ========================================
lola: memory consumption: 16624 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1527034039347

--------------------
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="Parking-PT-832"
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/Parking-PT-832.tgz
mv Parking-PT-832 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 Parking-PT-832, 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 r112-csrt-152666469500420"
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 ;