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 188K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 16K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FMS-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998000077
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526622899673

info: Time: 3600 - MCC
===========================================================================================
prep: translating FMS-PT-050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FMS-PT-050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ FMS-PT-050 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-050-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(tM1) OR FIREABLE(tP1)) AND FIREABLE(tP1)))) : E (F (FIREABLE(tP12))) : E (F ((FIREABLE(tP1e) AND FIREABLE(tP1M1) AND (FIREABLE(tx) OR ((FIREABLE(tP12) OR FIREABLE(tP1j)) AND FIREABLE(tP12s)))))) : E (F (FIREABLE(tP12))) : A (G ((FIREABLE(tP1) OR ((FIREABLE(tP1e) OR FIREABLE(tP2e)) AND FIREABLE(tP3s) AND (FIREABLE(tP1) OR FIREABLE(tP3M2) OR (FIREABLE(tP3s) AND FIREABLE(tP3))))))) : E (F (NOT FIREABLE(tP1))) : A (G (((FIREABLE(tP12M3) AND FIREABLE(tP3)) OR FIREABLE(tM1) OR FIREABLE(tP1s) OR (FIREABLE(tx) AND FIREABLE(tP2s)) OR FIREABLE(tP2M2) OR FIREABLE(tP1)))) : A (G (((FIREABLE(tP3) AND FIREABLE(tP2) AND FIREABLE(tP3) AND FIREABLE(tP2e) AND FIREABLE(tP1M1) AND FIREABLE(tP2j)) OR FIREABLE(tP3)))) : A (G (FIREABLE(tP3))) : E (F ((FIREABLE(tx) AND FIREABLE(tP3s)))) : A (G ((FIREABLE(tP2e) OR FIREABLE(tP1) OR (NOT FIREABLE(tP1M1) AND NOT FIREABLE(tM3) AND FIREABLE(tM1))))) : A (G (((FIREABLE(tP2) OR (NOT FIREABLE(tM3) AND NOT FIREABLE(tP2M2))) AND (NOT FIREABLE(tP3s) OR NOT FIREABLE(tx))))) : E (F ((FIREABLE(tP1M1) AND FIREABLE(tP2M2) AND FIREABLE(tP1s) AND FIREABLE(tP12s) AND (FIREABLE(tP12) OR NOT FIREABLE(tM2)) AND FIREABLE(tM3)))) : E (F (NOT FIREABLE(tP2))) : A (G ((NOT FIREABLE(tP12s) OR (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tM1))))) : A (G (NOT FIREABLE(tP12)))
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(tP12)))
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(tP12)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tP12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-0.sara
lola: lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tP12)))
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(tP12)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tP12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-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: 10 markings, 9 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-3 TRUE 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(tP1)))
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(tP1)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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 FMS-PT-050-ReachabilityFireability-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(tP1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-2-0.sara
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-5 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: ========================================
sara: try reading problem file FMS-PT-050-ReachabilityFireability-2-0.sara.
lola: ...considering subproblem: A (G (FIREABLE(tP3)))
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(tP3)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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(tP3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(tP2)))
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(tP2)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tP2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-4-0.sara
sara: try reading problem file FMS-PT-050-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-13 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: A (G (NOT FIREABLE(tP12)))
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(tP12)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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(tP12)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-15 FALSE 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: A (G (((NOT FIREABLE(tM1) OR FIREABLE(tP1)) AND FIREABLE(tP1))))
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(tM1) OR FIREABLE(tP1)) AND FIREABLE(tP1))))
lola: processed formula length: 65
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: result: no
lola: produced by: state space
lola: formula 0: ((FIREABLE(tM1) AND NOT FIREABLE(tP1)) OR NOT FIREABLE(tP1))
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tx) AND FIREABLE(tP3s))))
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(tx) AND FIREABLE(tP3s))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tx) AND FIREABLE(tP3s))
lola: SUBRESULT
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-9 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 ((NOT FIREABLE(tP12s) OR (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tM1)))))
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(tP12s) OR (NOT FIREABLE(tP12M3) AND NOT FIREABLE(tM1)))))
lola: processed formula length: 78
lola: 2 rewrites
lola: closed formula file FMS-PT-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: formula 0: (FIREABLE(tP12s) AND (FIREABLE(tP12M3) OR FIREABLE(tM1)))
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-14 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 (((FIREABLE(tP3) AND FIREABLE(tP2) AND FIREABLE(tP3) AND FIREABLE(tP2e) AND FIREABLE(tP1M1) AND FIREABLE(tP2j)) OR FIREABLE(tP3))))
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(tP3) AND FIREABLE(tP2) AND FIREABLE(tP3) AND FIREABLE(tP2e) AND FIREABLE(tP1M1) AND FIREABLE(tP2j)) OR FIREABLE(tP3))))
lola: processed formula length: 137
lola: 2 rewrites
lola: closed formula file FMS-PT-050-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: The predicate is not invariant.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA FMS-PT-050-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: A (G ((FIREABLE(tP2e) OR FIREABLE(tP1) OR (NOT FIREABLE(tP1M1) AND NOT FIREABLE(tM3) AND FIREABLE(tM1)))))
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(tP2e) OR FIREABLE(tP1) OR (NOT FIREABLE(tP1M1) AND NOT FIREABLE(tM3) AND FIREABLE(tM1)))))
lola: processed formula length: 108
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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(tP2e) AND NOT FIREABLE(tP1) AND (FIREABLE(tP1M1) OR FIREABLE(tM3) OR NOT FIREABLE(tM1)))
lola: state equation: Generated DNF with 13 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-10-0.sara

FORMULA FMS-PT-050-ReachabilityFireability-10 FALSE 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: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tP2) OR (NOT FIREABLE(tM3) AND NOT FIREABLE(tP2M2))) AND (NOT FIREABLE(tP3s) OR NOT FIREABLE(tx)))))
lola: ========================================
lola: lola: state equation: calling and running sara
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(tP2) OR (NOT FIREABLE(tM3) AND NOT FIREABLE(tP2M2))) AND (NOT FIREABLE(tP3s) OR NOT FIREABLE(tx)))))
lola: processed formula length: 119
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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(tP2) AND (FIREABLE(tM3) OR FIREABLE(tP2M2))) OR (FIREABLE(tP3s) AND FIREABLE(tx)))
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
sara: try reading problem file FMS-PT-050-ReachabilityFireability-10-0.sara.
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara


sara: try reading problem file FMS-PT-050-ReachabilityFireability-11-0.sara.

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

FORMULA FMS-PT-050-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tP1) OR ((FIREABLE(tP1e) OR FIREABLE(tP2e)) AND FIREABLE(tP3s) AND (FIREABLE(tP1) OR FIREABLE(tP3M2) OR (FIREABLE(tP3s) AND FIREABLE(tP3)))))))
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(tP1) OR ((FIREABLE(tP1e) OR FIREABLE(tP2e)) AND FIREABLE(tP3s) AND (FIREABLE(tP1) OR FIREABLE(tP3M2) OR (FIREABLE(tP3s) AND FIREABLE(tP3)))))))
lola: processed formula length: 163
lola: 2 rewrites
lola: closed formula file FMS-PT-050-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(tP1) AND ((NOT FIREABLE(tP1e) AND NOT FIREABLE(tP2e)) OR NOT FIREABLE(tP3s) OR (NOT FIREABLE(tP1) AND NOT FIREABLE(tP3M2) AND (NOT FIREABLE(tP3s) OR NOT FIREABLE(tP3)))))
lola: state equation: Generated DNF with 21 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 51 markings, 50 edges

FORMULA FMS-PT-050-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tP1e) AND FIREABLE(tP1M1) AND (FIREABLE(tx) OR ((FIREABLE(tP12) OR FIREABLE(tP1j)) AND FIREABLE(tP12s))))))
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(tP1e) AND FIREABLE(tP1M1) AND (FIREABLE(tx) OR ((FIREABLE(tP12) OR FIREABLE(tP1j)) AND FIREABLE(tP12s))))))
lola: processed formula length: 125
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tP1e) AND FIREABLE(tP1M1) AND (FIREABLE(tx) OR ((FIREABLE(tP12) OR FIREABLE(tP1j)) AND FIREABLE(tP12s))))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-13-0.sara
sara: try reading problem file FMS-PT-050-ReachabilityFireability-12-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: 14 markings, 13 edges
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-2 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(tP1M1) AND FIREABLE(tP2M2) AND FIREABLE(tP1s) AND FIREABLE(tP12s) AND (FIREABLE(tP12) OR NOT FIREABLE(tM2)) AND FIREABLE(tM3))))
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(tP1M1) AND FIREABLE(tP2M2) AND FIREABLE(tP1s) AND FIREABLE(tP12s) AND (FIREABLE(tP12) OR NOT FIREABLE(tM2)) AND FIREABLE(tM3))))
lola: processed formula length: 145
lola: 1 rewrites
lola: closed formula file FMS-PT-050-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(tP1M1) AND FIREABLE(tP2M2) AND FIREABLE(tP1s) AND FIREABLE(tP12s) AND (FIREABLE(tP12) OR NOT FIREABLE(tM2)) AND FIREABLE(tM3))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-050-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tP12M3) AND FIREABLE(tP3)) OR FIREABLE(tM1) OR FIREABLE(tP1s) OR (FIREABLE(tx) AND FIREABLE(tP2s)) OR FIREABLE(tP2M2) OR FIREABLE(tP1))))
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(tP12M3) AND FIREABLE(tP3)) OR FIREABLE(tM1) OR FIREABLE(tP1s) OR (FIREABLE(tx) AND FIREABLE(tP2s)) OR FIREABLE(tP2M2) OR FIREABLE(tP1))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file FMS-PT-050-ReachabilityFireability.task
lola: STORE
lola: sara: try reading problem file FMS-PT-050-ReachabilityFireability-14-0.sara.
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(tP12M3) OR NOT FIREABLE(tP3)) AND NOT FIREABLE(tM1) AND NOT FIREABLE(tP1s) AND (NOT FIREABLE(tx) OR NOT FIREABLE(tP2s)) AND NOT FIREABLE(tP2M2) AND NOT FIREABLE(tP1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54 markings, 53 edges
lola: state equation: Generated DNF with 72 literals and 12 conjunctive subformulas
lola: ========================================

FORMULA FMS-PT-050-ReachabilityFireability-6 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 no no no yes no no yes yes no no
lola:
preliminary result: no yes yes yes no yes no no no yes no no yes yes no no

lola: memory consumption: 14492 KB
lola: time consumption: 0 seconds

BK_STOP 1526622899998

--------------------
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="FMS-PT-050"
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/FMS-PT-050.tgz
mv FMS-PT-050 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 FMS-PT-050, 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-152649998000077"
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 ;