Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K 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.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Raft-PT-03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800119
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526939619450

info: Time: 3600 - MCC
===========================================================================================
prep: translating Raft-PT-03 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-03 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Raft-PT-03 @ 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: 151/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 53
lola: finding significant places
lola: 53 places, 98 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 94 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-03-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t95) OR FIREABLE(t88) OR FIREABLE(t62) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t20)) AND NOT FIREABLE(t27))))) : E (F ((FIREABLE(t22) OR (NOT FIREABLE(t0) AND FIREABLE(t22) AND FIREABLE(t19))))) : E (F (((((FIREABLE(t67) OR FIREABLE(t24)) AND (FIREABLE(t79) OR FIREABLE(t74))) OR (FIREABLE(t16) AND FIREABLE(t76) AND NOT FIREABLE(t22))) AND FIREABLE(t3)))) : A (G ((NOT FIREABLE(t97) OR NOT FIREABLE(t19) OR FIREABLE(t59) OR NOT FIREABLE(t77) OR NOT FIREABLE(t9) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t97))))) : A (G ((NOT FIREABLE(t32) OR (FIREABLE(t5) AND FIREABLE(t59)) OR FIREABLE(t91) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t5) AND NOT FIREABLE(t29))))) : E (F (((FIREABLE(t65) OR FIREABLE(t40)) AND FIREABLE(t65) AND FIREABLE(t26) AND (FIREABLE(t78) OR FIREABLE(t57))))) : E (F (FIREABLE(t3))) : A (G (((FIREABLE(t34) AND FIREABLE(t47)) OR NOT FIREABLE(t34) OR (FIREABLE(t60) AND FIREABLE(t79) AND (FIREABLE(t11) OR FIREABLE(t27))) OR (FIREABLE(t97) AND FIREABLE(t65))))) : E (F ((FIREABLE(t8) AND FIREABLE(t69) AND (FIREABLE(t16) OR NOT FIREABLE(t37))))) : E (F ((FIREABLE(t1) AND FIREABLE(t25) AND (FIREABLE(t18) OR FIREABLE(t48))))) : A (G ((FIREABLE(t80) OR FIREABLE(t55) OR NOT FIREABLE(t27) OR NOT FIREABLE(t34) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t9))))) : E (F ((FIREABLE(t15) AND FIREABLE(t35) AND FIREABLE(t87)))) : E (F ((NOT FIREABLE(t83) AND FIREABLE(t49) AND FIREABLE(t21)))) : A (G ((NOT FIREABLE(t4) OR NOT FIREABLE(t59) OR NOT FIREABLE(t10) OR (FIREABLE(t6) AND FIREABLE(t21)) OR FIREABLE(t29)))) : E (F ((FIREABLE(t71) AND FIREABLE(t95) AND (FIREABLE(t86) OR FIREABLE(t94)) AND FIREABLE(t93) AND FIREABLE(t28)))) : E (F ((FIREABLE(t9) AND (NOT FIREABLE(t45) OR NOT FIREABLE(t17)) AND FIREABLE(t81))))
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(t3)))
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(t3)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-0.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-03-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: E (F ((FIREABLE(t22) OR (NOT FIREABLE(t0) AND FIREABLE(t22) 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(t22) OR (NOT FIREABLE(t0) AND FIREABLE(t22) AND FIREABLE(t19)))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t22) OR (NOT FIREABLE(t0) AND FIREABLE(t22) AND FIREABLE(t19)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-0.sara

FORMULA Raft-PT-03-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t15) AND FIREABLE(t35) AND FIREABLE(t87))))
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(t35) AND FIREABLE(t87))))
lola: processed formula length: 59
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t35) AND FIREABLE(t87))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-2-0.sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


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

FORMULA Raft-PT-03-ReachabilityFireability-11 FALSE 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(t83) AND FIREABLE(t49) AND FIREABLE(t21))))
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(t83) AND FIREABLE(t49) AND FIREABLE(t21))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t83) AND FIREABLE(t49) AND FIREABLE(t21))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 14 edges
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-3-0.sara
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-12 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: E (F ((FIREABLE(t8) AND FIREABLE(t69) AND (FIREABLE(t16) OR NOT FIREABLE(t37)))))
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(t8) AND FIREABLE(t69) AND (FIREABLE(t16) OR NOT FIREABLE(t37)))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t8) AND FIREABLE(t69) AND (FIREABLE(t16) OR NOT FIREABLE(t37)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 48 edges
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-8 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: E (F ((FIREABLE(t1) AND FIREABLE(t25) AND (FIREABLE(t18) OR 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(t1) AND FIREABLE(t25) AND (FIREABLE(t18) OR FIREABLE(t48)))))
lola: processed formula length: 78
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t1) AND FIREABLE(t25) AND (FIREABLE(t18) OR FIREABLE(t48)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-5-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-03-ReachabilityFireability-9 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: E (F ((FIREABLE(t9) AND (NOT FIREABLE(t45) OR NOT FIREABLE(t17)) AND FIREABLE(t81))))
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(t9) AND (NOT FIREABLE(t45) OR NOT FIREABLE(t17)) AND FIREABLE(t81))))
lola: processed formula length: 86
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t9) AND (NOT FIREABLE(t45) OR NOT FIREABLE(t17)) AND FIREABLE(t81))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-6-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-03-ReachabilityFireability-15 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(t65) OR FIREABLE(t40)) AND FIREABLE(t65) AND FIREABLE(t26) AND (FIREABLE(t78) OR FIREABLE(t57)))))
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(t65) OR FIREABLE(t40)) AND FIREABLE(t65) AND FIREABLE(t26) AND (FIREABLE(t78) OR FIREABLE(t57)))))
lola: processed formula length: 117
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t65) OR FIREABLE(t40)) AND FIREABLE(t65) AND FIREABLE(t26) AND (FIREABLE(t78) OR FIREABLE(t57)))
lola: state equation: Generated DNF with 30 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-7-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-03-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t80) OR FIREABLE(t55) OR NOT FIREABLE(t27) OR NOT FIREABLE(t34) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t9)))))
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(t80) OR FIREABLE(t55) OR NOT FIREABLE(t27) OR NOT FIREABLE(t34) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t9)))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file Raft-PT-03-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(t80) AND NOT FIREABLE(t55) AND FIREABLE(t27) AND FIREABLE(t34) AND (FIREABLE(t10) OR FIREABLE(t9)))
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-10 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(t97) OR NOT FIREABLE(t19) OR FIREABLE(t59) OR NOT FIREABLE(t77) OR NOT FIREABLE(t9) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t97)))))
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(t97) OR NOT FIREABLE(t19) OR FIREABLE(t59) OR NOT FIREABLE(t77) OR NOT FIREABLE(t9) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t97)))))
lola: processed formula length: 156
lola: 2 rewrites
lola: closed formula file Raft-PT-03-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(t97) AND FIREABLE(t19) AND NOT FIREABLE(t59) AND FIREABLE(t77) AND FIREABLE(t9) AND (FIREABLE(t93) OR FIREABLE(t97)))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-3 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: A (G ((NOT FIREABLE(t32) OR (FIREABLE(t5) AND FIREABLE(t59)) OR FIREABLE(t91) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t5) AND NOT FIREABLE(t29)))))
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(t32) OR (FIREABLE(t5) AND FIREABLE(t59)) OR FIREABLE(t91) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t5) AND NOT FIREABLE(t29)))))
lola: processed formula length: 149
lola: 2 rewrites
lola: closed formula file Raft-PT-03-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(t32) AND (NOT FIREABLE(t5) OR NOT FIREABLE(t59)) AND NOT FIREABLE(t91) AND (FIREABLE(t12) OR FIREABLE(t5) OR FIREABLE(t29)))
lola: state equation: Generated DNF with 54 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-10-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: 20 markings, 48 edges
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t4) OR NOT FIREABLE(t59) OR NOT FIREABLE(t10) OR (FIREABLE(t6) AND FIREABLE(t21)) OR FIREABLE(t29))))
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) OR NOT FIREABLE(t59) OR NOT FIREABLE(t10) OR (FIREABLE(t6) AND FIREABLE(t21)) OR FIREABLE(t29))))
lola: processed formula length: 125
lola: 2 rewrites
lola: closed formula file Raft-PT-03-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: formula 0: (FIREABLE(t4) AND FIREABLE(t59) AND FIREABLE(t10) AND (NOT FIREABLE(t6) OR NOT FIREABLE(t21)) AND NOT FIREABLE(t29))
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-13 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(t71) AND FIREABLE(t95) AND (FIREABLE(t86) OR FIREABLE(t94)) AND FIREABLE(t93) AND FIREABLE(t28))))
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(t71) AND FIREABLE(t95) AND (FIREABLE(t86) OR FIREABLE(t94)) AND FIREABLE(t93) AND FIREABLE(t28))))
lola: processed formula length: 115
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t71) AND FIREABLE(t95) AND (FIREABLE(t86) OR FIREABLE(t94)) AND FIREABLE(t93) AND FIREABLE(t28))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-12-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-03-ReachabilityFireability-14 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(t95) OR FIREABLE(t88) OR FIREABLE(t62) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t20)) AND NOT FIREABLE(t27)))))
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(t95) OR FIREABLE(t88) OR FIREABLE(t62) OR ((NOT FIREABLE(t23) OR NOT FIREABLE(t20)) AND NOT FIREABLE(t27)))))
lola: processed formula length: 133
lola: 2 rewrites
lola: closed formula file Raft-PT-03-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(t95) AND NOT FIREABLE(t88) AND NOT FIREABLE(t62) AND ((FIREABLE(t23) AND FIREABLE(t20)) OR FIREABLE(t27)))
lola: state equation: Generated DNF with 44 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-03-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Raft-PT-03-ReachabilityFireability-0 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: E (F (((((FIREABLE(t67) OR FIREABLE(t24)) AND (FIREABLE(t79) OR FIREABLE(t74))) OR (FIREABLE(t16) AND FIREABLE(t76) AND NOT FIREABLE(t22))) AND FIREABLE(t3))))
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(t67) OR FIREABLE(t24)) AND (FIREABLE(t79) OR FIREABLE(t74))) OR (FIREABLE(t16) AND FIREABLE(t76) AND NOT FIREABLE(t22))) AND FIREABLE(t3))))
lola: processed formula length: 162
lola: 1 rewrites
lola: closed formula file Raft-PT-03-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(t67) OR FIREABLE(t24)) AND (FIREABLE(t79) OR FIREABLE(t74))) OR (FIREABLE(t16) AND FIREABLE(t76) AND NOT FIREABLE(t22))) AND FIREABLE(t3))
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 8 edges
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-14-0.sara

FORMULA Raft-PT-03-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t34) AND FIREABLE(t47)) OR NOT FIREABLE(t34) OR (FIREABLE(t60) AND FIREABLE(t79) AND (FIREABLE(t11) OR FIREABLE(t27))) OR (FIREABLE(t97) AND FIREABLE(t65)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: sara: try reading problem file Raft-PT-03-ReachabilityFireability-14-0.sara.
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(t34) AND FIREABLE(t47)) OR NOT FIREABLE(t34) OR (FIREABLE(t60) AND FIREABLE(t79) AND (FIREABLE(t11) OR FIREABLE(t27))) OR (FIREABLE(t97) AND FIREABLE(t65)))))
lola: processed formula length: 179
lola: 2 rewrites
lola: closed formula file Raft-PT-03-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(t34) OR NOT FIREABLE(t47)) AND FIREABLE(t34) AND (NOT FIREABLE(t60) OR NOT FIREABLE(t79) OR (NOT FIREABLE(t11) AND NOT FIREABLE(t27))) AND (NOT FIREABLE(t97) OR NOT FIREABLE(t65)))
lola: state equation: Generated DNF with 216 literals and 40 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: sara: place or transition ordering is non-deterministic
8 markings, 7 edges
lola: state equation: write sara problem file to Raft-PT-03-ReachabilityFireability-15-0.sara
lola:
FORMULA Raft-PT-03-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no yes no yes no yes no yes no no no
lola:
preliminary result: yes yes yes yes no no yes no yes no yes no yes no no no
========================================

lola: memory consumption: 14832 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-03"
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-03.tgz
mv Raft-PT-03 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-03, 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-152673578800119"
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 ;