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 292K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 120K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526953425321

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-07 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 Raft-PT-07 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-07 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 695/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 253
lola: finding significant places
lola: 253 places, 442 transitions, 204 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 434 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-07-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t29) OR NOT FIREABLE(t406) OR FIREABLE(t436) OR (FIREABLE(t112) AND (NOT FIREABLE(t351) OR (FIREABLE(t208) AND FIREABLE(t23))))))) : A (G ((NOT FIREABLE(t186) OR NOT FIREABLE(t368) OR (NOT FIREABLE(t277) AND NOT FIREABLE(t399)) OR FIREABLE(t272)))) : A (G ((NOT FIREABLE(t7) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t397) AND NOT FIREABLE(t147)) OR FIREABLE(t262)))) : A (G ((NOT FIREABLE(t411) OR NOT FIREABLE(t25)))) : A (G (((FIREABLE(t414) AND (FIREABLE(t101) OR FIREABLE(t364)) AND FIREABLE(t183)) OR NOT FIREABLE(t320)))) : E (F ((NOT FIREABLE(t132) AND NOT FIREABLE(t191) AND FIREABLE(t159) AND (NOT FIREABLE(t280) OR (FIREABLE(t7) AND FIREABLE(t249)) OR (NOT FIREABLE(t165) AND NOT FIREABLE(t357)))))) : E (F (((FIREABLE(t427) OR FIREABLE(t152)) AND (FIREABLE(t385) OR FIREABLE(t246)) AND FIREABLE(t52) AND FIREABLE(t217)))) : E (F ((NOT FIREABLE(t53) AND NOT FIREABLE(t244) AND FIREABLE(t202) AND NOT FIREABLE(t278) AND (FIREABLE(t358) OR FIREABLE(t275)) AND FIREABLE(t148) AND FIREABLE(t129) AND (FIREABLE(t26) OR FIREABLE(t388))))) : E (F ((NOT FIREABLE(t96) AND NOT FIREABLE(t126) AND FIREABLE(t54) AND FIREABLE(t151)))) : E (F (((FIREABLE(t383) OR FIREABLE(t71)) AND FIREABLE(t11)))) : E (F ((FIREABLE(t154) AND FIREABLE(t251) AND FIREABLE(t2)))) : A (G ((NOT FIREABLE(t186) OR NOT FIREABLE(t37) OR FIREABLE(t355) OR FIREABLE(t225) OR (FIREABLE(t320) AND FIREABLE(t392)) OR (NOT FIREABLE(t365) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t296)))))) : A (G ((FIREABLE(t148) OR FIREABLE(t206) OR NOT FIREABLE(t176) OR NOT FIREABLE(t376) OR NOT FIREABLE(t178)))) : A (G ((((FIREABLE(t436) OR FIREABLE(t409)) AND FIREABLE(t55)) OR (NOT FIREABLE(t8) AND NOT FIREABLE(t155)) OR FIREABLE(t82)))) : A (G ((((FIREABLE(t313) OR NOT FIREABLE(t301)) AND (NOT FIREABLE(t325) OR NOT FIREABLE(t281))) OR ((FIREABLE(t264) OR FIREABLE(t130) OR FIREABLE(t272) OR FIREABLE(t3)) AND (NOT FIREABLE(t9) OR FIREABLE(t321)))))) : E (F (((FIREABLE(t426) OR FIREABLE(t210) OR FIREABLE(t203) OR ((FIREABLE(t24) OR FIREABLE(t369)) AND (FIREABLE(t98) OR FIREABLE(t394)))) AND FIREABLE(t334))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t411) OR NOT FIREABLE(t25))))
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(t411) OR NOT FIREABLE(t25))))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t411) AND FIREABLE(t25))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t383) OR FIREABLE(t71)) AND FIREABLE(t11))))
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(t383) OR FIREABLE(t71)) AND FIREABLE(t11))))
lola: processed formula length: 62
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t383) OR FIREABLE(t71)) AND FIREABLE(t11))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t154) AND FIREABLE(t251) AND FIREABLE(t2))))
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(t154) AND FIREABLE(t251) AND FIREABLE(t2))))
lola: processed formula length: 60
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t154) AND FIREABLE(t251) AND FIREABLE(t2))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-10 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 ((NOT FIREABLE(t96) AND NOT FIREABLE(t126) AND FIREABLE(t54) AND FIREABLE(t151))))
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(t96) AND NOT FIREABLE(t126) AND FIREABLE(t54) AND FIREABLE(t151))))
lola: processed formula length: 87
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t96) AND NOT FIREABLE(t126) AND FIREABLE(t54) AND FIREABLE(t151))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-07-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Raft-PT-07-ReachabilityFireability-8 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: A (G ((NOT FIREABLE(t7) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t397) AND NOT FIREABLE(t147)) OR FIREABLE(t262))))
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(t7) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t397) AND NOT FIREABLE(t147)) OR FIREABLE(t262))))
lola: processed formula length: 114
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t7) AND FIREABLE(t2) AND (FIREABLE(t397) OR FIREABLE(t147)) AND NOT FIREABLE(t262))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-4-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: 9 markings, 9 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-2 FALSE 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(t186) OR NOT FIREABLE(t368) OR (NOT FIREABLE(t277) AND NOT FIREABLE(t399)) OR FIREABLE(t272))))
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(t186) OR NOT FIREABLE(t368) OR (NOT FIREABLE(t277) AND NOT FIREABLE(t399)) OR FIREABLE(t272))))
lola: processed formula length: 118
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t186) AND FIREABLE(t368) AND (FIREABLE(t277) OR FIREABLE(t399)) AND NOT FIREABLE(t272))
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 13 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t414) AND (FIREABLE(t101) OR FIREABLE(t364)) AND FIREABLE(t183)) OR NOT FIREABLE(t320))))
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(t414) AND (FIREABLE(t101) OR FIREABLE(t364)) AND FIREABLE(t183)) OR NOT FIREABLE(t320))))
lola: processed formula length: 108
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t414) OR (NOT FIREABLE(t101) AND NOT FIREABLE(t364)) OR NOT FIREABLE(t183)) AND FIREABLE(t320))
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
sara: try reading problem file Raft-PT-07-ReachabilityFireability-5-0.sara.
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-6-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: 7 markings, 18 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-4 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: A (G ((FIREABLE(t148) OR FIREABLE(t206) OR NOT FIREABLE(t176) OR NOT FIREABLE(t376) OR NOT FIREABLE(t178))))
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(t148) OR FIREABLE(t206) OR NOT FIREABLE(t176) OR NOT FIREABLE(t376) OR NOT FIREABLE(t178))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 23 edges
lola:
FORMULA Raft-PT-07-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
formula 0: (NOT FIREABLE(t148) AND NOT FIREABLE(t206) AND FIREABLE(t176) AND FIREABLE(t376) AND FIREABLE(t178))
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t427) OR FIREABLE(t152)) AND (FIREABLE(t385) OR FIREABLE(t246)) AND FIREABLE(t52) AND FIREABLE(t217))))
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(t427) OR FIREABLE(t152)) AND (FIREABLE(t385) OR FIREABLE(t246)) AND FIREABLE(t52) AND FIREABLE(t217))))
lola: processed formula length: 122
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t427) OR FIREABLE(t152)) AND (FIREABLE(t385) OR FIREABLE(t246)) AND FIREABLE(t52) AND FIREABLE(t217))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-07-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

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

FORMULA Raft-PT-07-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t436) OR FIREABLE(t409)) AND FIREABLE(t55)) OR (NOT FIREABLE(t8) AND NOT FIREABLE(t155)) OR FIREABLE(t82))))
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(t436) OR FIREABLE(t409)) AND FIREABLE(t55)) OR (NOT FIREABLE(t8) AND NOT FIREABLE(t155)) OR FIREABLE(t82))))
lola: processed formula length: 129
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t436) AND NOT FIREABLE(t409)) OR NOT FIREABLE(t55)) AND (FIREABLE(t8) OR FIREABLE(t155)) AND NOT FIREABLE(t82))
lola: state equation: Generated DNF with 22 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-07-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 153 markings, 856 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t29) OR NOT FIREABLE(t406) OR FIREABLE(t436) OR (FIREABLE(t112) AND (NOT FIREABLE(t351) OR (FIREABLE(t208) AND FIREABLE(t23)))))))
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(t29) OR NOT FIREABLE(t406) OR FIREABLE(t436) OR (FIREABLE(t112) AND (NOT FIREABLE(t351) OR (FIREABLE(t208) AND FIREABLE(t23)))))))
lola: processed formula length: 154
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t29) AND FIREABLE(t406) AND NOT FIREABLE(t436) AND (NOT FIREABLE(t112) OR (FIREABLE(t351) AND (NOT FIREABLE(t208) OR NOT FIREABLE(t23)))))
lola: state equation: Generated DNF with 31 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t132) AND NOT FIREABLE(t191) AND FIREABLE(t159) AND (NOT FIREABLE(t280) OR (FIREABLE(t7) AND FIREABLE(t249)) OR (NOT FIREABLE(t165) AND NOT 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 ((NOT FIREABLE(t132) AND NOT FIREABLE(t191) AND FIREABLE(t159) AND (NOT FIREABLE(t280) OR (FIREABLE(t7) AND FIREABLE(t249)) OR (NOT FIREABLE(t165) AND NOT FIREABLE(t357))))))
lola: processed formula length: 181
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t132) AND NOT FIREABLE(t191) AND FIREABLE(t159) AND (NOT FIREABLE(t280) OR (FIREABLE(t7) AND FIREABLE(t249)) OR (NOT FIREABLE(t165) AND NOT FIREABLE(t357))))
lola: state equation: Generated DNF with 58 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 53 edges
lola: ========================================

FORMULA Raft-PT-07-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: E (F (((FIREABLE(t426) OR FIREABLE(t210) OR FIREABLE(t203) OR ((FIREABLE(t24) OR FIREABLE(t369)) AND (FIREABLE(t98) OR FIREABLE(t394)))) AND FIREABLE(t334))))
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(t426) OR FIREABLE(t210) OR FIREABLE(t203) OR ((FIREABLE(t24) OR FIREABLE(t369)) AND (FIREABLE(t98) OR FIREABLE(t394)))) AND FIREABLE(t334))))
lola: processed formula length: 163
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t426) OR FIREABLE(t210) OR FIREABLE(t203) OR ((FIREABLE(t24) OR FIREABLE(t369)) AND (FIREABLE(t98) OR FIREABLE(t394)))) AND FIREABLE(t334))
lola: state equation: Generated DNF with 32 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-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: 4 markings, 3 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t186) OR NOT FIREABLE(t37) OR FIREABLE(t355) OR FIREABLE(t225) OR (FIREABLE(t320) AND FIREABLE(t392)) OR (NOT FIREABLE(t365) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t296))))))
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(t186) OR NOT FIREABLE(t37) OR FIREABLE(t355) OR FIREABLE(t225) OR (FIREABLE(t320) AND FIREABLE(t392)) OR (NOT FIREABLE(t365) AND (NOT FIREABLE(t165) OR NOT FIREABLE(t296))))))
lola: processed formula length: 201
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t186) AND FIREABLE(t37) AND NOT FIREABLE(t355) AND NOT FIREABLE(t225) AND (NOT FIREABLE(t320) OR NOT FIREABLE(t392)) AND (FIREABLE(t365) OR (FIREABLE(t165) AND FIREABLE(t296))))
lola: state equation: Generated DNF with 184 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 9 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t313) OR NOT FIREABLE(t301)) AND (NOT FIREABLE(t325) OR NOT FIREABLE(t281))) OR ((FIREABLE(t264) OR FIREABLE(t130) OR FIREABLE(t272) OR FIREABLE(t3)) AND (NOT FIREABLE(t9) OR FIREABLE(t321))))))
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(t313) OR NOT FIREABLE(t301)) AND (NOT FIREABLE(t325) OR NOT FIREABLE(t281))) OR ((FIREABLE(t264) OR FIREABLE(t130) OR FIREABLE(t272) OR FIREABLE(t3)) AND (NOT FIREABLE(t9) OR FIREABLE(t321))))))
lola: processed formula length: 219
lola: 2 rewrites
lola: closed formula file Raft-PT-07-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(t313) AND FIREABLE(t301)) OR (FIREABLE(t325) AND FIREABLE(t281))) AND ((NOT FIREABLE(t264) AND NOT FIREABLE(t130) AND NOT FIREABLE(t272) AND NOT FIREABLE(t3)) OR (FIREABLE(t9) AND NOT FIREABLE(t321))))
lola: state equation: Generated DNF with 22 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-14-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 49 edges
lola: ========================================

FORMULA Raft-PT-07-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t53) AND NOT FIREABLE(t244) AND FIREABLE(t202) AND NOT FIREABLE(t278) AND (FIREABLE(t358) OR FIREABLE(t275)) AND FIREABLE(t148) AND FIREABLE(t129) AND (FIREABLE(t26) OR FIREABLE(t388)))))
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(t53) AND NOT FIREABLE(t244) AND FIREABLE(t202) AND NOT FIREABLE(t278) AND (FIREABLE(t358) OR FIREABLE(t275)) AND FIREABLE(t148) AND FIREABLE(t129) AND (FIREABLE(t26) OR FIREABLE(t388)))))
lola: processed formula length: 209
lola: 1 rewrites
lola: closed formula file Raft-PT-07-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(t53) AND NOT FIREABLE(t244) AND FIREABLE(t202) AND NOT FIREABLE(t278) AND (FIREABLE(t358) OR FIREABLE(t275)) AND FIREABLE(t148) AND FIREABLE(t129) AND (FIREABLE(t26) OR FIREABLE(t388)))
lola: state equation: Generated DNF with 150 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-07-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 34 edges

FORMULA Raft-PT-07-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes yes yes yes no no no no yes
lola:
preliminary result: no no no no no yes no yes yes yes yes no no no no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-07-ReachabilityFireability-15-0.sara.
lola: memory consumption: 15220 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526953446859

--------------------
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="Raft-PT-07"
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/Raft-PT-07.tgz
mv Raft-PT-07 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 Raft-PT-07, 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 r136-qhx2-152673578800147"
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 ;