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 224K
-rw-r--r-- 1 mcc users 3.2K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 12K 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 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 62K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526946782775

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-05 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-05 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-05 @ 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: 371/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 133
lola: finding significant places
lola: 133 places, 238 transitions, 108 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-05-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(t61) AND (NOT FIREABLE(t168) OR NOT FIREABLE(t197)) AND FIREABLE(t108) AND FIREABLE(t8)))) : E (F ((NOT FIREABLE(t58) AND NOT FIREABLE(t142) AND FIREABLE(t40) AND FIREABLE(t227) AND (FIREABLE(t48) OR FIREABLE(t9)) AND FIREABLE(t170)))) : E (F ((NOT FIREABLE(t34) AND (FIREABLE(t54) OR FIREABLE(t87) OR FIREABLE(t150)) AND NOT FIREABLE(t5) AND NOT FIREABLE(t207) AND NOT FIREABLE(t8) AND NOT FIREABLE(t64)))) : E (F (((FIREABLE(t54) OR (NOT FIREABLE(t61) AND NOT FIREABLE(t78))) AND (FIREABLE(t8) OR FIREABLE(t13))))) : E (F (((FIREABLE(t76) OR FIREABLE(t2)) AND NOT FIREABLE(t162) AND FIREABLE(t225) AND FIREABLE(t200) AND FIREABLE(t71) AND FIREABLE(t14) AND FIREABLE(t201)))) : A (G ((FIREABLE(t70) OR (NOT FIREABLE(t42) AND (FIREABLE(t124) OR FIREABLE(t198))) OR FIREABLE(t96) OR (NOT FIREABLE(t184) AND NOT FIREABLE(t31))))) : E (F (FIREABLE(t2))) : E (F ((FIREABLE(t54) AND FIREABLE(t65)))) : E (F (((FIREABLE(t75) OR FIREABLE(t136)) AND (FIREABLE(t55) OR FIREABLE(t152)) AND NOT FIREABLE(t155) AND FIREABLE(t19)))) : A (G ((FIREABLE(t147) OR FIREABLE(t53) OR (FIREABLE(t88) AND (FIREABLE(t200) OR FIREABLE(t104))) OR FIREABLE(t170) OR FIREABLE(t55) OR NOT FIREABLE(t163) OR FIREABLE(t192)))) : A (G (((NOT FIREABLE(t51) AND NOT FIREABLE(t192)) OR NOT FIREABLE(t39) OR NOT FIREABLE(t89)))) : A (G (NOT FIREABLE(t2))) : E (F ((FIREABLE(t46) AND FIREABLE(t140) AND NOT FIREABLE(t148) AND NOT FIREABLE(t168) AND FIREABLE(t190)))) : E (F ((FIREABLE(t15) AND (FIREABLE(t196) OR FIREABLE(t172) OR NOT FIREABLE(t237)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t57) OR FIREABLE(t224))))) : E (F (((FIREABLE(t152) OR FIREABLE(t149) OR NOT FIREABLE(t120)) AND FIREABLE(t201) AND FIREABLE(t140)))) : E (F ((NOT FIREABLE(t149) AND NOT FIREABLE(t83) AND NOT FIREABLE(t103) AND NOT FIREABLE(t47) AND FIREABLE(t28) AND FIREABLE(t75) AND FIREABLE(t174) AND (FIREABLE(t14) OR FIREABLE(t1) OR (FIREABLE(t165) AND FIREABLE(t201))))))
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(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(t2)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t2)
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: 6 markings, 5 edges
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-0.sara
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-6 TRUE 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: A (G (NOT FIREABLE(t2)))
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(t2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file Raft-PT-05-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(t2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-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: 6 markings, 5 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-11 FALSE 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(t54) AND FIREABLE(t65))))
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(t54) AND FIREABLE(t65))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t54) AND FIREABLE(t65))
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: 8 markings, 7 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-7 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: A (G (((NOT FIREABLE(t51) AND NOT FIREABLE(t192)) OR NOT FIREABLE(t39) OR NOT FIREABLE(t89))))
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(t51) AND NOT FIREABLE(t192)) OR NOT FIREABLE(t39) OR NOT FIREABLE(t89))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file Raft-PT-05-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(t51) OR FIREABLE(t192)) AND FIREABLE(t39) AND FIREABLE(t89))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-05-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Raft-PT-05-ReachabilityFireability-10 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(t61) AND (NOT FIREABLE(t168) OR NOT FIREABLE(t197)) AND FIREABLE(t108) AND FIREABLE(t8))))
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(t61) AND (NOT FIREABLE(t168) OR NOT FIREABLE(t197)) AND FIREABLE(t108) AND FIREABLE(t8))))
lola: processed formula length: 111
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t61) AND (NOT FIREABLE(t168) OR NOT FIREABLE(t197)) AND FIREABLE(t108) AND FIREABLE(t8))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.

FORMULA Raft-PT-05-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t54) OR (NOT FIREABLE(t61) AND NOT FIREABLE(t78))) AND (FIREABLE(t8) OR FIREABLE(t13)))))
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(t54) OR (NOT FIREABLE(t61) AND NOT FIREABLE(t78))) AND (FIREABLE(t8) OR FIREABLE(t13)))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t54) OR (NOT FIREABLE(t61) AND NOT FIREABLE(t78))) AND (FIREABLE(t8) OR FIREABLE(t13)))
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-5-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 130 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t46) AND FIREABLE(t140) AND NOT FIREABLE(t148) AND NOT FIREABLE(t168) AND FIREABLE(t190))))
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(t46) AND FIREABLE(t140) AND NOT FIREABLE(t148) AND NOT FIREABLE(t168) AND FIREABLE(t190))))
lola: processed formula length: 107
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t46) AND FIREABLE(t140) AND NOT FIREABLE(t148) AND NOT FIREABLE(t168) AND FIREABLE(t190))
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-6-0.sara
lola: The predicate is reachable.
lola: 8 markings, 15 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-12 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 (((FIREABLE(t152) OR FIREABLE(t149) OR NOT FIREABLE(t120)) AND FIREABLE(t201) AND FIREABLE(t140))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
sara: lola: try reading problem file Raft-PT-05-ReachabilityFireability-6-0.sara. Planning: workflow for reachability check: stateequation||search (--findpath=off)

lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t152) OR FIREABLE(t149) OR NOT FIREABLE(t120)) AND FIREABLE(t201) AND FIREABLE(t140))))
lola: processed formula length: 106
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t152) OR FIREABLE(t149) OR NOT FIREABLE(t120)) AND FIREABLE(t201) AND FIREABLE(t140))
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-7-0.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-05-ReachabilityFireability-14 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: E (F (((FIREABLE(t75) OR FIREABLE(t136)) AND (FIREABLE(t55) OR FIREABLE(t152)) AND NOT FIREABLE(t155) AND FIREABLE(t19))))
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(t75) OR FIREABLE(t136)) AND (FIREABLE(t55) OR FIREABLE(t152)) AND NOT FIREABLE(t155) AND FIREABLE(t19))))
lola: processed formula length: 124
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t75) OR FIREABLE(t136)) AND (FIREABLE(t55) OR FIREABLE(t152)) AND NOT FIREABLE(t155) AND FIREABLE(t19))
lola: state equation: Generated DNF with 32 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 9 edges
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t70) OR (NOT FIREABLE(t42) AND (FIREABLE(t124) OR FIREABLE(t198))) OR FIREABLE(t96) OR (NOT FIREABLE(t184) AND NOT FIREABLE(t31)))))
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(t70) OR (NOT FIREABLE(t42) AND (FIREABLE(t124) OR FIREABLE(t198))) OR FIREABLE(t96) OR (NOT FIREABLE(t184) AND NOT FIREABLE(t31)))))
lola: processed formula length: 152
lola: 2 rewrites
lola: closed formula file Raft-PT-05-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(t70) AND (FIREABLE(t42) OR (NOT FIREABLE(t124) AND NOT FIREABLE(t198))) AND NOT FIREABLE(t96) AND (FIREABLE(t184) OR FIREABLE(t31)))
lola: state equation: Generated DNF with 50 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-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: 167 markings, 577 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-5 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: E (F ((FIREABLE(t15) AND (FIREABLE(t196) OR FIREABLE(t172) OR NOT FIREABLE(t237)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t57) OR FIREABLE(t224)))))
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(t15) AND (FIREABLE(t196) OR FIREABLE(t172) OR NOT FIREABLE(t237)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t57) OR FIREABLE(t224)))))
lola: processed formula length: 151
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t15) AND (FIREABLE(t196) OR FIREABLE(t172) OR NOT FIREABLE(t237)) AND (NOT FIREABLE(t56) OR NOT FIREABLE(t57) OR FIREABLE(t224)))
lola: state equation: Generated DNF with 46 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-05-ReachabilityFireability-10-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-05-ReachabilityFireability-13 TRUE 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(t58) AND NOT FIREABLE(t142) AND FIREABLE(t40) AND FIREABLE(t227) AND (FIREABLE(t48) OR FIREABLE(t9)) AND FIREABLE(t170))))
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(t58) AND NOT FIREABLE(t142) AND FIREABLE(t40) AND FIREABLE(t227) AND (FIREABLE(t48) OR FIREABLE(t9)) AND FIREABLE(t170))))
lola: processed formula length: 143
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t58) AND NOT FIREABLE(t142) AND FIREABLE(t40) AND FIREABLE(t227) AND (FIREABLE(t48) OR FIREABLE(t9)) AND FIREABLE(t170))
lola: state equation: Generated DNF with 19 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-05-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

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

FORMULA Raft-PT-05-ReachabilityFireability-1 FALSE 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(t76) OR FIREABLE(t2)) AND NOT FIREABLE(t162) AND FIREABLE(t225) AND FIREABLE(t200) AND FIREABLE(t71) AND FIREABLE(t14) AND FIREABLE(t201))))
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(t76) OR FIREABLE(t2)) AND NOT FIREABLE(t162) AND FIREABLE(t225) AND FIREABLE(t200) AND FIREABLE(t71) AND FIREABLE(t14) AND FIREABLE(t201))))
lola: processed formula length: 158
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t76) OR FIREABLE(t2)) AND NOT FIREABLE(t162) AND FIREABLE(t225) AND FIREABLE(t200) AND FIREABLE(t71) AND FIREABLE(t14) AND FIREABLE(t201))
lola: state equation: Generated DNF with 42 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-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: 18 markings, 36 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-4 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: E (F ((NOT FIREABLE(t34) AND (FIREABLE(t54) OR FIREABLE(t87) OR FIREABLE(t150)) AND NOT FIREABLE(t5) AND NOT FIREABLE(t207) AND NOT FIREABLE(t8) AND NOT FIREABLE(t64))))
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(t34) AND (FIREABLE(t54) OR FIREABLE(t87) OR FIREABLE(t150)) AND NOT FIREABLE(t5) AND NOT FIREABLE(t207) AND NOT FIREABLE(t8) AND NOT FIREABLE(t64))))
lola: processed formula length: 171
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t34) AND (FIREABLE(t54) OR FIREABLE(t87) OR FIREABLE(t150)) AND NOT FIREABLE(t5) AND NOT FIREABLE(t207) AND NOT FIREABLE(t8) AND NOT FIREABLE(t64))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 134 edges
lola: state equation: Generated DNF with 21 literals and 3 conjunctive subformulas
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-2 TRUE 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(t147) OR FIREABLE(t53) OR (FIREABLE(t88) AND (FIREABLE(t200) OR FIREABLE(t104))) OR FIREABLE(t170) OR FIREABLE(t55) OR NOT FIREABLE(t163) OR FIREABLE(t192))))
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(t147) OR FIREABLE(t53) OR (FIREABLE(t88) AND (FIREABLE(t200) OR FIREABLE(t104))) OR FIREABLE(t170) OR FIREABLE(t55) OR NOT FIREABLE(t163) OR FIREABLE(t192))))
lola: processed formula length: 181
lola: 2 rewrites
lola: closed formula file Raft-PT-05-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(t147) AND NOT FIREABLE(t53) AND (NOT FIREABLE(t88) OR (NOT FIREABLE(t200) AND NOT FIREABLE(t104))) AND NOT FIREABLE(t170) AND NOT FIREABLE(t55) AND FIREABLE(t163) AND NOT FIREABLE(t192))
lola: state equation: Generated DNF with 208 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 205 edges
lola: lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t149) AND NOT FIREABLE(t83) AND NOT FIREABLE(t103) AND NOT FIREABLE(t47) AND FIREABLE(t28) AND FIREABLE(t75) AND FIREABLE(t174) AND (FIREABLE(t14) OR FIREABLE(t1) OR (FIREABLE(t165) AND FIREABLE(t201))))))
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(t149) AND NOT FIREABLE(t83) AND NOT FIREABLE(t103) AND NOT FIREABLE(t47) AND FIREABLE(t28) AND FIREABLE(t75) AND FIREABLE(t174) AND (FIREABLE(t14) OR FIREABLE(t1) OR (FIREABLE(t165) AND FIREABLE(t201))))))
lola: processed formula length: 227
lola: 1 rewrites
lola: closed formula file Raft-PT-05-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(t149) AND NOT FIREABLE(t83) AND NOT FIREABLE(t103) AND NOT FIREABLE(t47) AND FIREABLE(t28) AND FIREABLE(t75) AND FIREABLE(t174) AND (FIREABLE(t14) OR FIREABLE(t1) OR (FIREABLE(t165) AND FIREABLE(t201))))
lola: state equation: Generated DNF with 93 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-05-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-05-ReachabilityFireability-15-0.sara.
sara: try reading problem file Raft-PT-05-ReachabilityFireability-14-0.sara.
sara: sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 13 edges
lola: ========================================

FORMULA Raft-PT-05-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes yes no no no yes yes yes yes
lola:
preliminary result: no no yes yes yes no yes yes yes no no no yes yes yes yes
lola: memory consumption: 14848 KB
lola: time consumption: 1 seconds


BK_STOP 1526946804535

--------------------
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-05"
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-05.tgz
mv Raft-PT-05 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-05, 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-152673578800133"
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 ;