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 364K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 7.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 196K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578900161
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526958086940

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-09 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-09 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-09 @ 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: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 413
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-ReachabilityFireability.task
lola: E (F ((FIREABLE(t169) AND FIREABLE(t43) AND (NOT FIREABLE(t435) OR NOT FIREABLE(t239) OR FIREABLE(t151))))) : E (F ((FIREABLE(t489) AND FIREABLE(t391)))) : E (F ((NOT FIREABLE(t167) AND FIREABLE(t160) AND FIREABLE(t363)))) : A (G ((NOT FIREABLE(t133) OR FIREABLE(t106)))) : A (G (((NOT FIREABLE(t651) AND FIREABLE(t686)) OR FIREABLE(t85) OR NOT FIREABLE(t649) OR NOT FIREABLE(t345) OR FIREABLE(t449)))) : A (G ((FIREABLE(t484) OR NOT FIREABLE(t165) OR FIREABLE(t113) OR FIREABLE(t324)))) : E (F (FIREABLE(t2))) : A (G ((NOT FIREABLE(t540) OR NOT FIREABLE(t425) OR FIREABLE(t268) OR NOT FIREABLE(t37)))) : E (F (((NOT FIREABLE(t287) OR NOT FIREABLE(t646)) AND NOT FIREABLE(t540) AND NOT FIREABLE(t240) AND FIREABLE(t56) AND FIREABLE(t593)))) : E (F (((FIREABLE(t154) OR (FIREABLE(t219) AND FIREABLE(t512)) OR FIREABLE(t494)) AND FIREABLE(t287)))) : E (F (((FIREABLE(t265) OR FIREABLE(t198)) AND FIREABLE(t681)))) : E (F ((FIREABLE(t353) AND FIREABLE(t19) AND NOT FIREABLE(t441) AND FIREABLE(t221)))) : A (G ((FIREABLE(t309) OR FIREABLE(t92) OR FIREABLE(t162) OR (NOT FIREABLE(t616) AND NOT FIREABLE(t193)) OR (FIREABLE(t105) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t163)))))) : A (G (((NOT FIREABLE(t287) AND NOT FIREABLE(t197)) OR FIREABLE(t302) OR NOT FIREABLE(t92) OR (FIREABLE(t651) AND FIREABLE(t575)) OR ((FIREABLE(t649) OR FIREABLE(t159)) AND (FIREABLE(t339) OR FIREABLE(t216)))))) : A (G ((NOT FIREABLE(t338) OR FIREABLE(t622) OR FIREABLE(t69) OR FIREABLE(t650) OR (FIREABLE(t609) AND FIREABLE(t329)) OR (FIREABLE(t519) AND FIREABLE(t306)) OR (FIREABLE(t78) AND FIREABLE(t229))))) : A (G ((NOT FIREABLE(t477) OR NOT FIREABLE(t262) OR FIREABLE(t625) OR FIREABLE(t265) OR (FIREABLE(t178) AND FIREABLE(t188)) OR (FIREABLE(t323) AND (FIREABLE(t70) OR FIREABLE(t101))) OR (NOT FIREABLE(t599) AND FIREABLE(t221)))))
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-09-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: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Raft-PT-09-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(t133) OR FIREABLE(t106))))
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(t133) OR FIREABLE(t106))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t133) AND NOT FIREABLE(t106))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 174 markings, 1119 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-3 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(t489) AND FIREABLE(t391))))
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(t489) AND FIREABLE(t391))))
lola: processed formula length: 43
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t489) AND FIREABLE(t391))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-2-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-09-ReachabilityFireability-1 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(t167) AND FIREABLE(t160) AND FIREABLE(t363))))
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(t167) AND FIREABLE(t160) AND FIREABLE(t363))))
lola: processed formula length: 66
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t167) AND FIREABLE(t160) AND FIREABLE(t363))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-ReachabilityFireability-3-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-09-ReachabilityFireability-2 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 (((FIREABLE(t265) OR FIREABLE(t198)) AND FIREABLE(t681))))
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(t265) OR FIREABLE(t198)) AND FIREABLE(t681))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t265) OR FIREABLE(t198)) AND FIREABLE(t681))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-4-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-09-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t540) OR NOT FIREABLE(t425) OR FIREABLE(t268) OR NOT FIREABLE(t37))))
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(t540) OR NOT FIREABLE(t425) OR FIREABLE(t268) OR NOT FIREABLE(t37))))
lola: processed formula length: 92
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t540) AND FIREABLE(t425) AND NOT FIREABLE(t268) AND FIREABLE(t37))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
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-09-ReachabilityFireability-7 FALSE 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: A (G ((FIREABLE(t484) OR NOT FIREABLE(t165) OR FIREABLE(t113) OR FIREABLE(t324))))
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(t484) OR NOT FIREABLE(t165) OR FIREABLE(t113) OR FIREABLE(t324))))
lola: processed formula length: 85
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t484) AND FIREABLE(t165) AND NOT FIREABLE(t113) AND NOT FIREABLE(t324))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-ReachabilityFireability-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 173 markings, 1118 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t353) AND FIREABLE(t19) AND NOT FIREABLE(t441) AND FIREABLE(t221))))
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(t353) AND FIREABLE(t19) AND NOT FIREABLE(t441) AND FIREABLE(t221))))
lola: processed formula length: 84
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t353) AND FIREABLE(t19) AND NOT FIREABLE(t441) AND FIREABLE(t221))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 41 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-11 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(t169) AND FIREABLE(t43) AND (NOT FIREABLE(t435) OR NOT FIREABLE(t239) OR 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 ((FIREABLE(t169) AND FIREABLE(t43) AND (NOT FIREABLE(t435) OR NOT FIREABLE(t239) OR FIREABLE(t151)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t169) AND FIREABLE(t43) AND (NOT FIREABLE(t435) OR NOT FIREABLE(t239) OR FIREABLE(t151)))
lola: state equation: Generated DNF with 21 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 29 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-0 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: E (F (((FIREABLE(t154) OR (FIREABLE(t219) AND FIREABLE(t512)) OR FIREABLE(t494)) AND FIREABLE(t287))))
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) OR (FIREABLE(t219) AND FIREABLE(t512)) OR FIREABLE(t494)) AND FIREABLE(t287))))
lola: processed formula length: 104
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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) OR (FIREABLE(t219) AND FIREABLE(t512)) OR FIREABLE(t494)) AND FIREABLE(t287))
lola: state equation: Generated DNF with 14 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-9-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-09-ReachabilityFireability-9 TRUE 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(t287) OR NOT FIREABLE(t646)) AND NOT FIREABLE(t540) AND NOT FIREABLE(t240) AND FIREABLE(t56) AND FIREABLE(t593))))
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(t287) OR NOT FIREABLE(t646)) AND NOT FIREABLE(t540) AND NOT FIREABLE(t240) AND FIREABLE(t56) AND FIREABLE(t593))))
lola: processed formula length: 136
lola: 1 rewrites
lola: closed formula file Raft-PT-09-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(t287) OR NOT FIREABLE(t646)) AND NOT FIREABLE(t540) AND NOT FIREABLE(t240) AND FIREABLE(t56) AND FIREABLE(t593))
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 24 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-8 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: A (G (((NOT FIREABLE(t651) AND FIREABLE(t686)) OR FIREABLE(t85) OR NOT FIREABLE(t649) OR NOT FIREABLE(t345) OR FIREABLE(t449))))
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(t651) AND FIREABLE(t686)) OR FIREABLE(t85) OR NOT FIREABLE(t649) OR NOT FIREABLE(t345) OR FIREABLE(t449))))
lola: processed formula length: 132
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t651) OR NOT FIREABLE(t686)) AND NOT FIREABLE(t85) AND FIREABLE(t649) AND FIREABLE(t345) AND NOT FIREABLE(t449))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-11-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: 11 markings, 38 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-4 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: A (G ((FIREABLE(t309) OR FIREABLE(t92) OR FIREABLE(t162) OR (NOT FIREABLE(t616) AND NOT FIREABLE(t193)) OR (FIREABLE(t105) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t163))))))
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(t309) OR FIREABLE(t92) OR FIREABLE(t162) OR (NOT FIREABLE(t616) AND NOT FIREABLE(t193)) OR (FIREABLE(t105) AND (NOT FIREABLE(t133) OR NOT FIREABLE(t163))))))
lola: processed formula length: 178
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t309) AND NOT FIREABLE(t92) AND NOT FIREABLE(t162) AND (FIREABLE(t616) OR FIREABLE(t193)) AND (NOT FIREABLE(t105) OR (FIREABLE(t133) AND FIREABLE(t163))))
lola: state equation: Generated DNF with 144 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-09-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 173 markings, 1118 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-12 FALSE 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(t287) AND NOT FIREABLE(t197)) OR FIREABLE(t302) OR NOT FIREABLE(t92) OR (FIREABLE(t651) AND FIREABLE(t575)) OR ((FIREABLE(t649) OR FIREABLE(t159)) AND (FIREABLE(t339) OR FIREABLE(t216))))))
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(t287) AND NOT FIREABLE(t197)) OR FIREABLE(t302) OR NOT FIREABLE(t92) OR (FIREABLE(t651) AND FIREABLE(t575)) OR ((FIREABLE(t649) OR FIREABLE(t159)) AND (FIREABLE(t339) OR FIREABLE(t216))))))
lola: processed formula length: 216
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t287) OR FIREABLE(t197)) AND NOT FIREABLE(t302) AND FIREABLE(t92) AND (NOT FIREABLE(t651) OR NOT FIREABLE(t575)) AND ((NOT FIREABLE(t649) AND NOT FIREABLE(t159)) OR (NOT FIREABLE(t339) AND NOT FIREABLE(t216))))
lola: state equation: Generated DNF with 480 literals and 60 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-09-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 28 edges

FORMULA Raft-PT-09-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t338) OR FIREABLE(t622) OR FIREABLE(t69) OR FIREABLE(t650) OR (FIREABLE(t609) AND FIREABLE(t329)) OR (FIREABLE(t519) AND FIREABLE(t306)) OR (FIREABLE(t78) AND FIREABLE(t229)))))
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(t338) OR FIREABLE(t622) OR FIREABLE(t69) OR FIREABLE(t650) OR (FIREABLE(t609) AND FIREABLE(t329)) OR (FIREABLE(t519) AND FIREABLE(t306)) OR (FIREABLE(t78) AND FIREABLE(t229)))))
lola: processed formula length: 203
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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)
sara: try reading problem file Raft-PT-09-ReachabilityFireability-13-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(t338) AND NOT FIREABLE(t622) AND NOT FIREABLE(t69) AND NOT FIREABLE(t650) AND (NOT FIREABLE(t609) OR NOT FIREABLE(t329)) AND (NOT FIREABLE(t519) OR NOT FIREABLE(t306)) AND (NOT FIREABLE(t78) OR NOT FIREABLE(t229)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 85 edges
lola: ========================================

FORMULA Raft-PT-09-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t477) OR NOT FIREABLE(t262) OR FIREABLE(t625) OR FIREABLE(t265) OR (FIREABLE(t178) AND FIREABLE(t188)) OR (FIREABLE(t323) AND (FIREABLE(t70) OR FIREABLE(t101))) OR (NOT FIREABLE(t599) AND FIREABLE(t221)))))
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(t477) OR NOT FIREABLE(t262) OR FIREABLE(t625) OR FIREABLE(t265) OR (FIREABLE(t178) AND FIREABLE(t188)) OR (FIREABLE(t323) AND (FIREABLE(t70) OR FIREABLE(t101))) OR (NOT FIREABLE(t599) AND FIREABLE(t221)))))
lola: processed formula length: 233
lola: 2 rewrites
lola: closed formula file Raft-PT-09-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(t477) AND FIREABLE(t262) AND NOT FIREABLE(t625) AND NOT FIREABLE(t265) AND (NOT FIREABLE(t178) OR NOT FIREABLE(t188)) AND (NOT FIREABLE(t323) OR (NOT FIREABLE(t70) AND NOT FIREABLE(t101))) AND (FIREABLE(t599) OR NOT FIREABLE(t221)))
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-09-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no yes no yes yes yes yes no no no no
lola:
preliminary result: yes yes no no no no yes no yes yes yes yes no no no no
lola: memory consumption: 15856 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526958108598

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