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 252K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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.3K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 89K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800140
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526950180417

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-06 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-06 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-06 @ 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: 520/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 188
lola: finding significant places
lola: 188 places, 332 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 325 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-06-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t124) OR NOT FIREABLE(t198)) AND FIREABLE(t154) AND (FIREABLE(t48) OR FIREABLE(t1))))) : A (G (NOT FIREABLE(t28))) : E (F ((FIREABLE(t137) AND NOT FIREABLE(t159)))) : E (F (FIREABLE(t18))) : E (F ((FIREABLE(t241) AND FIREABLE(t326) AND NOT FIREABLE(t105)))) : E (F ((FIREABLE(t10) AND NOT FIREABLE(t192) AND FIREABLE(t93) AND FIREABLE(t131) AND NOT FIREABLE(t19) AND (FIREABLE(t217) OR FIREABLE(t83)) AND NOT FIREABLE(t127)))) : E (F (FIREABLE(t35))) : A (G (((NOT FIREABLE(t4) AND NOT FIREABLE(t119)) OR FIREABLE(t114) OR FIREABLE(t45)))) : A (G ((NOT FIREABLE(t94) OR NOT FIREABLE(t5) OR NOT FIREABLE(t122) OR NOT FIREABLE(t245) OR (FIREABLE(t169) AND (NOT FIREABLE(t189) OR FIREABLE(t136)))))) : A (G ((NOT FIREABLE(t18) OR NOT FIREABLE(t137)))) : A (G ((NOT FIREABLE(t237) OR FIREABLE(t214) OR (FIREABLE(t50) AND FIREABLE(t165))))) : A (G ((FIREABLE(t82) OR (NOT FIREABLE(t148) AND NOT FIREABLE(t147) AND NOT FIREABLE(t272) AND NOT FIREABLE(t40))))) : E (F ((FIREABLE(t29) AND ((NOT FIREABLE(t297) AND NOT FIREABLE(t49)) OR FIREABLE(t68))))) : E (F ((FIREABLE(t162) AND NOT FIREABLE(t74) AND ((FIREABLE(t280) AND FIREABLE(t127)) OR FIREABLE(t252)) AND NOT FIREABLE(t206) AND FIREABLE(t234)))) : E (F ((FIREABLE(t224) AND ((FIREABLE(t19) AND FIREABLE(t324)) OR (FIREABLE(t160) AND FIREABLE(t234))) AND (FIREABLE(t286) OR (FIREABLE(t264) AND FIREABLE(t8) AND NOT FIREABLE(t33)))))) : E (F (FIREABLE(t48)))
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(t28)))
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(t28)))
lola: processed formula length: 25
lola: 2 rewrites
lola: closed formula file Raft-PT-06-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(t28)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t18)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t18)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file Raft-PT-06-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t18)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-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-06-ReachabilityFireability-3 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(t35)))
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(t35)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t35)
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: 4 markings, 3 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t48)))
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(t48)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t48)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-3-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-06-ReachabilityFireability-15 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(t18) OR NOT FIREABLE(t137))))
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(t18) OR NOT FIREABLE(t137))))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file Raft-PT-06-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(t18) AND FIREABLE(t137))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-06-ReachabilityFireability-4-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-06-ReachabilityFireability-9 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: E (F ((FIREABLE(t137) AND NOT FIREABLE(t159))))
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(t137) AND NOT FIREABLE(t159))))
lola: processed formula length: 47
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t137) AND NOT FIREABLE(t159))
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: 5 markings, 8 edges
lola:
FORMULA Raft-PT-06-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-5-0.sara
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t241) AND FIREABLE(t326) AND NOT FIREABLE(t105))))
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(t241) AND FIREABLE(t326) AND NOT FIREABLE(t105))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t241) AND FIREABLE(t326) AND NOT FIREABLE(t105))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-6-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-06-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t237) OR FIREABLE(t214) OR (FIREABLE(t50) AND FIREABLE(t165)))))
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(t237) OR FIREABLE(t214) OR (FIREABLE(t50) AND FIREABLE(t165)))))
lola: processed formula length: 86
lola: 2 rewrites
lola: closed formula file Raft-PT-06-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(t237) AND NOT FIREABLE(t214) AND (NOT FIREABLE(t50) OR NOT FIREABLE(t165)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 8 edges
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-7-0.sara
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t29) AND ((NOT FIREABLE(t297) AND NOT FIREABLE(t49)) OR FIREABLE(t68)))))
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(t29) AND ((NOT FIREABLE(t297) AND NOT FIREABLE(t49)) OR FIREABLE(t68)))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t29) AND ((NOT FIREABLE(t297) AND NOT FIREABLE(t49)) OR FIREABLE(t68)))
lola: state equation: Generated DNF with 14 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-8-0.sara
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-12 TRUE 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 (((NOT FIREABLE(t4) AND NOT FIREABLE(t119)) OR FIREABLE(t114) OR FIREABLE(t45))))
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(t4) AND NOT FIREABLE(t119)) OR FIREABLE(t114) OR FIREABLE(t45))))
lola: processed formula length: 88
lola: 2 rewrites
lola: closed formula file Raft-PT-06-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
try reading problem file Raft-PT-06-ReachabilityFireability-7-0.sara.
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(t4) OR FIREABLE(t119)) AND NOT FIREABLE(t114) AND NOT FIREABLE(t45))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-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: 25 markings, 95 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-7 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 (((NOT FIREABLE(t124) OR NOT FIREABLE(t198)) AND FIREABLE(t154) AND (FIREABLE(t48) OR FIREABLE(t1)))))
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(t124) OR NOT FIREABLE(t198)) AND FIREABLE(t154) AND (FIREABLE(t48) OR FIREABLE(t1)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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(t124) OR NOT FIREABLE(t198)) AND FIREABLE(t154) AND (FIREABLE(t48) OR FIREABLE(t1)))
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-10-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-06-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file Raft-PT-06-ReachabilityFireability-10-0.sara.
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t82) OR (NOT FIREABLE(t148) AND NOT FIREABLE(t147) AND NOT FIREABLE(t272) AND NOT FIREABLE(t40)))))
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(t82) OR (NOT FIREABLE(t148) AND NOT FIREABLE(t147) AND NOT FIREABLE(t272) AND NOT FIREABLE(t40)))))
lola: processed formula length: 116
lola: 2 rewrites
lola: closed formula file Raft-PT-06-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(t82) AND (FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t272) OR FIREABLE(t40)))
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara

sara: try reading problem file Raft-PT-06-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 646 markings, 3337 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-11 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(t162) AND NOT FIREABLE(t74) AND ((FIREABLE(t280) AND FIREABLE(t127)) OR FIREABLE(t252)) AND NOT FIREABLE(t206) AND FIREABLE(t234))))
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(t162) AND NOT FIREABLE(t74) AND ((FIREABLE(t280) AND FIREABLE(t127)) OR FIREABLE(t252)) AND NOT FIREABLE(t206) AND FIREABLE(t234))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file Raft-PT-06-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: place or transition ordering is non-deterministic
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(t162) AND NOT FIREABLE(t74) AND ((FIREABLE(t280) AND FIREABLE(t127)) OR FIREABLE(t252)) AND NOT FIREABLE(t206) AND FIREABLE(t234))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-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: 154 markings, 540 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-13 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(t94) OR NOT FIREABLE(t5) OR NOT FIREABLE(t122) OR NOT FIREABLE(t245) OR (FIREABLE(t169) AND (NOT FIREABLE(t189) OR FIREABLE(t136))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t94) OR NOT FIREABLE(t5) OR NOT FIREABLE(t122) OR NOT FIREABLE(t245) OR (FIREABLE(t169) AND (NOT FIREABLE(t189) OR FIREABLE(t136))))))
lola: processed formula length: 159
lola: 2 rewrites
lola: closed formula file Raft-PT-06-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(t94) AND FIREABLE(t5) AND FIREABLE(t122) AND FIREABLE(t245) AND (NOT FIREABLE(t169) OR (FIREABLE(t189) AND NOT FIREABLE(t136))))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 11 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-8 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: E (F ((FIREABLE(t10) AND NOT FIREABLE(t192) AND FIREABLE(t93) AND FIREABLE(t131) AND NOT FIREABLE(t19) AND (FIREABLE(t217) OR FIREABLE(t83)) AND NOT FIREABLE(t127))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t10) AND NOT FIREABLE(t192) AND FIREABLE(t93) AND FIREABLE(t131) AND NOT FIREABLE(t19) AND (FIREABLE(t217) OR FIREABLE(t83)) AND NOT FIREABLE(t127))))
lola: processed formula length: 167
lola: 1 rewrites
lola: closed formula file Raft-PT-06-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t10) AND NOT FIREABLE(t192) AND FIREABLE(t93) AND FIREABLE(t131) AND NOT FIREABLE(t19) AND (FIREABLE(t217) OR FIREABLE(t83)) AND NOT FIREABLE(t127))
lola: state equation: Generated DNF with 38 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-06-ReachabilityFireability-14-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: 12 markings, 27 edges
lola: ========================================

FORMULA Raft-PT-06-ReachabilityFireability-5 TRUE 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 ((FIREABLE(t224) AND ((FIREABLE(t19) AND FIREABLE(t324)) OR (FIREABLE(t160) AND FIREABLE(t234))) AND (FIREABLE(t286) OR (FIREABLE(t264) AND FIREABLE(t8) AND NOT FIREABLE(t33))))))
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(t224) AND ((FIREABLE(t19) AND FIREABLE(t324)) OR (FIREABLE(t160) AND FIREABLE(t234))) AND (FIREABLE(t286) OR (FIREABLE(t264) AND FIREABLE(t8) AND NOT FIREABLE(t33))))))
lola: processed formula length: 186
lola: 1 rewrites
lola: closed formula file Raft-PT-06-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola:
FORMULA Raft-PT-06-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes no no no no no yes yes yes yes
lola:
preliminary result: yes no yes yes yes yes yes no no no no no yes yes yes yes
formula 0: (FIREABLE(t224) AND ((FIREABLE(t19) AND FIREABLE(t324)) OR (FIREABLE(t160) AND FIREABLE(t234))) AND (FIREABLE(t286) OR (FIREABLE(t264) AND FIREABLE(t8) AND NOT FIREABLE(t33))))
lola: state equation: Generated DNF with 34 literals and 4 conjunctive subformulas
lola: ========================================

lola: memory consumption: 14960 KB
lola: time consumption: 1 seconds

BK_TIME_CONFINEMENT_REACHED

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