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 392K
-rw-r--r-- 1 mcc users 3.2K May 30 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 11:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 28 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 05:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 05:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 217K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-100101, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400765
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527827000556

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100101 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100101 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ RefineWMG-PT-100101 @ 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: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-101-ReachabilityFireability.task
lola: E (F ((FIREABLE(t262) OR FIREABLE(t86) OR (FIREABLE(t313) AND FIREABLE(t312)) OR FIREABLE(t121) OR (FIREABLE(t290) AND FIREABLE(t90) AND NOT FIREABLE(t215) AND ((FIREABLE(t37) AND FIREABLE(t15)) OR FIREABLE(t327)))))) : E (F (((((FIREABLE(t182) OR FIREABLE(t357)) AND (FIREABLE(t182) OR FIREABLE(t310))) OR (FIREABLE(t296) AND FIREABLE(t144) AND FIREABLE(t249))) AND (FIREABLE(t252) OR (FIREABLE(t270) AND (FIREABLE(t208) OR FIREABLE(t370))))))) : E (F ((((NOT FIREABLE(t332) OR NOT FIREABLE(t240)) AND FIREABLE(t282)) OR (NOT FIREABLE(t257) AND NOT FIREABLE(t120) AND NOT FIREABLE(t393))))) : A (G ((FIREABLE(t158) OR FIREABLE(t96) OR NOT FIREABLE(t373) OR FIREABLE(t163) OR NOT FIREABLE(t83)))) : E (F (FIREABLE(t333))) : E (F ((FIREABLE(t18) AND FIREABLE(t80) AND NOT FIREABLE(t88)))) : E (F (FIREABLE(t357))) : A (G ((NOT FIREABLE(t53) OR FIREABLE(t269) OR (NOT FIREABLE(t144) AND NOT FIREABLE(t203)) OR NOT FIREABLE(t196)))) : E (F ((NOT FIREABLE(t168) AND NOT FIREABLE(t312) AND FIREABLE(t208) AND NOT FIREABLE(t230)))) : A (G (NOT FIREABLE(t50))) : E (F ((NOT FIREABLE(t155) AND NOT FIREABLE(t238) AND FIREABLE(t156) AND FIREABLE(t306) AND FIREABLE(t90)))) : E (F ((FIREABLE(t325) OR FIREABLE(t309) OR (FIREABLE(t154) AND (FIREABLE(t76) OR FIREABLE(t352) OR (FIREABLE(t140) AND FIREABLE(t79))))))) : E (F (FIREABLE(t10))) : E (F ((((FIREABLE(t386) AND FIREABLE(t313)) OR FIREABLE(t221)) AND FIREABLE(t40) AND FIREABLE(t385) AND FIREABLE(t311)))) : E (F (FIREABLE(t53))) : E (F ((NOT FIREABLE(t107) AND FIREABLE(t225) AND (NOT FIREABLE(t162) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t367) AND NOT FIREABLE(t255))))))
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(t333)))
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(t333)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t333)
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-4 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: E (F (FIREABLE(t357)))
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(t357)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 12 markings, 11 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-0.sara
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t50)))
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(t50)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t50)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 90 markings, 89 edges
lola: ========================================
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-9 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(t10)))
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(t10)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t10)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-0.sara.
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 99 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-12 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(t53)))
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(t53)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 88 markings, 87 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-14 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(t18) AND FIREABLE(t80) AND NOT FIREABLE(t88))))
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(t18) AND FIREABLE(t80) AND NOT FIREABLE(t88))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t18) AND FIREABLE(t80) AND NOT FIREABLE(t88))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 198 markings, 197 edges

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t168) AND NOT FIREABLE(t312) AND FIREABLE(t208) AND NOT FIREABLE(t230))))
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(t168) AND NOT FIREABLE(t312) AND FIREABLE(t208) AND NOT FIREABLE(t230))))
lola: processed formula length: 93
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 203 markings, 202 edges
lola: ========================================
sara: place or transition ordering is non-deterministic

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-8 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 ((NOT FIREABLE(t155) AND NOT FIREABLE(t238) AND FIREABLE(t156) AND FIREABLE(t306) AND FIREABLE(t90))))
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(t155) AND NOT FIREABLE(t238) AND FIREABLE(t156) AND FIREABLE(t306) AND FIREABLE(t90))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t155) AND NOT FIREABLE(t238) AND FIREABLE(t156) AND FIREABLE(t306) AND FIREABLE(t90))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 82 markings, 81 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-10 TRUE 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 ((FIREABLE(t158) OR FIREABLE(t96) OR NOT FIREABLE(t373) OR FIREABLE(t163) OR NOT FIREABLE(t83))))
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(t158) OR FIREABLE(t96) OR NOT FIREABLE(t373) OR FIREABLE(t163) OR NOT FIREABLE(t83))))
lola: processed formula length: 106
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: 110 markings, 109 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-3 FALSE 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: A (G ((NOT FIREABLE(t53) OR FIREABLE(t269) OR (NOT FIREABLE(t144) AND NOT FIREABLE(t203)) OR NOT FIREABLE(t196))))
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(t53) OR FIREABLE(t269) OR (NOT FIREABLE(t144) AND NOT FIREABLE(t203)) OR NOT FIREABLE(t196))))
lola: processed formula length: 117
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t53) AND NOT FIREABLE(t269) AND (FIREABLE(t144) OR FIREABLE(t203)) AND FIREABLE(t196))
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 88 markings, 87 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-7 FALSE 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(t386) AND FIREABLE(t313)) OR FIREABLE(t221)) AND FIREABLE(t40) AND FIREABLE(t385) AND FIREABLE(t311))))
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(t386) AND FIREABLE(t313)) OR FIREABLE(t221)) AND FIREABLE(t40) AND FIREABLE(t385) AND FIREABLE(t311))))
lola: processed formula length: 122
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t386) AND FIREABLE(t313)) OR FIREABLE(t221)) AND FIREABLE(t40) AND FIREABLE(t385) AND FIREABLE(t311))
lola: state equation: Generated DNF with 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-10-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 RefineWMG-PT-100-101-ReachabilityFireability-13 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 ((((NOT FIREABLE(t332) OR NOT FIREABLE(t240)) AND FIREABLE(t282)) OR (NOT FIREABLE(t257) AND NOT FIREABLE(t120) AND NOT FIREABLE(t393)))))
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(t332) OR NOT FIREABLE(t240)) AND FIREABLE(t282)) OR (NOT FIREABLE(t257) AND NOT FIREABLE(t120) AND NOT FIREABLE(t393)))))
lola: processed formula length: 145
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t332) OR NOT FIREABLE(t240)) AND FIREABLE(t282)) OR (NOT FIREABLE(t257) AND NOT FIREABLE(t120) AND NOT FIREABLE(t393)))
lola: state equation: Generated DNF with 31 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-11-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: 203 markings, 202 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-2 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(t107) AND FIREABLE(t225) AND (NOT FIREABLE(t162) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t367) AND NOT FIREABLE(t255))))))
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(t107) AND FIREABLE(t225) AND (NOT FIREABLE(t162) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t367) AND NOT FIREABLE(t255))))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t107) AND FIREABLE(t225) AND (NOT FIREABLE(t162) OR NOT FIREABLE(t217) OR (NOT FIREABLE(t367) AND NOT FIREABLE(t255))))
lola: state equation: Generated DNF with 26 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-15 TRUE 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: E (F ((FIREABLE(t325) OR FIREABLE(t309) OR (FIREABLE(t154) AND (FIREABLE(t76) OR FIREABLE(t352) OR (FIREABLE(t140) AND FIREABLE(t79)))))))
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(t325) OR FIREABLE(t309) OR (FIREABLE(t154) AND (FIREABLE(t76) OR FIREABLE(t352) OR (FIREABLE(t140) AND FIREABLE(t79)))))))
lola: processed formula length: 142
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t325) OR FIREABLE(t309) OR (FIREABLE(t154) AND (FIREABLE(t76) OR FIREABLE(t352) OR (FIREABLE(t140) AND FIREABLE(t79)))))
lola: state equation: Generated DNF with 13 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-11 TRUE 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 (((((FIREABLE(t182) OR FIREABLE(t357)) AND (FIREABLE(t182) OR FIREABLE(t310))) OR (FIREABLE(t296) AND FIREABLE(t144) AND FIREABLE(t249))) AND (FIREABLE(t252) OR (FIREABLE(t270) AND (FIREABLE(t208) OR FIREABLE(t370)))))))
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(t182) OR FIREABLE(t357)) AND (FIREABLE(t182) OR FIREABLE(t310))) OR (FIREABLE(t296) AND FIREABLE(t144) AND FIREABLE(t249))) AND (FIREABLE(t252) OR (FIREABLE(t270) AND (FIREABLE(t208) OR FIREABLE(t370)))))))
lola: processed formula length: 230
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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(t182) OR FIREABLE(t357)) AND (FIREABLE(t182) OR FIREABLE(t310))) OR (FIREABLE(t296) AND FIREABLE(t144) AND FIREABLE(t249))) AND (FIREABLE(t252) OR (FIREABLE(t270) AND (FIREABLE(t208) OR FIREABLE(t370)))))
lola: state equation: Generated DNF with 76 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t262) OR FIREABLE(t86) OR (FIREABLE(t313) AND FIREABLE(t312)) OR FIREABLE(t121) OR (FIREABLE(t290) AND FIREABLE(t90) AND NOT FIREABLE(t215) AND ((FIREABLE(t37) AND FIREABLE(t15)) OR FIREABLE(t327))))))
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(t262) OR FIREABLE(t86) OR (FIREABLE(t313) AND FIREABLE(t312)) OR FIREABLE(t121) OR (FIREABLE(t290) AND FIREABLE(t90) AND NOT FIREABLE(t215) AND ((FIREABLE(t37) AND FIREABLE(t15)) OR FIREABLE(t327))))))
lola: processed formula length: 222
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityFireability-14-0.sara.
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t262) OR FIREABLE(t86) OR (FIREABLE(t313) AND FIREABLE(t312)) OR FIREABLE(t121) OR (FIREABLE(t290) AND FIREABLE(t90) AND NOT FIREABLE(t215) AND ((FIREABLE(t37) AND FIREABLE(t15)) OR FIREABLE(t327))))
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no yes no yes yes yes yes yes yes
lola:
preliminary result: yes yes yes no yes yes yes no yes no yes yes yes yes yes yes
sara: place or transition ordering is non-deterministic
lola: memory consumption: 15032 KB
lola: time consumption: 1 seconds


BK_STOP 1527830466724

--------------------
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="RefineWMG-PT-100101"
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/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 RefineWMG-PT-100101, 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 r280-csrt-152749170400765"
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 ;