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 240K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K 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.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-30a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100245
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526616549659

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-30a 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 DES-PT-30a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-30a @ 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: 425/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 234
lola: finding significant places
lola: 234 places, 191 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 216 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30a-ReachabilityFireability.task
lola: E (F ((((FIREABLE(t38) AND (FIREABLE(t99) OR FIREABLE(t15))) OR (FIREABLE(t82) AND FIREABLE(t151) AND FIREABLE(t2) AND FIREABLE(t171))) AND (FIREABLE(t72) OR FIREABLE(t85))))) : A (G ((FIREABLE(t69) OR NOT FIREABLE(t45) OR NOT FIREABLE(t161)))) : E (F ((FIREABLE(t98) AND FIREABLE(t9) AND FIREABLE(t31) AND FIREABLE(t107) AND ((FIREABLE(t109) AND FIREABLE(t6)) OR FIREABLE(t174)) AND (NOT FIREABLE(t4) OR NOT FIREABLE(t16) OR FIREABLE(t15))))) : E (F (FIREABLE(t0))) : A (G (((FIREABLE(t40) AND FIREABLE(t9)) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t171) OR NOT FIREABLE(t27)))))) : A (G ((NOT FIREABLE(t58) OR (NOT FIREABLE(t134) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t5)))))) : E (F (FIREABLE(t147))) : E (F ((FIREABLE(t65) AND (FIREABLE(t28) OR (FIREABLE(t19) AND (FIREABLE(t143) OR FIREABLE(t102))))))) : E (F ((FIREABLE(t92) OR FIREABLE(t89)))) : E (F (FIREABLE(t122))) : A (G (NOT FIREABLE(t108))) : A (G (NOT FIREABLE(t2))) : E (F (((FIREABLE(t184) OR FIREABLE(t92)) AND FIREABLE(t9) AND FIREABLE(t24) AND FIREABLE(t1) AND FIREABLE(t136) AND FIREABLE(t127) AND FIREABLE(t143) AND FIREABLE(t91)))) : E (F ((FIREABLE(t56) AND NOT FIREABLE(t110)))) : E (F (FIREABLE(t102))) : E (F ((((FIREABLE(t4) OR FIREABLE(t146)) AND FIREABLE(t12)) OR (FIREABLE(t187) AND NOT FIREABLE(t62) AND FIREABLE(t98) AND (FIREABLE(t175) OR FIREABLE(t77))))))
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(t0)))
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(t0)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t0)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-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: 18 markings, 17 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-3 TRUE 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(t147)))
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(t147)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t147)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-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: 45 markings, 44 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t122)))
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(t122)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t122)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-2-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: 798 markings, 798 edges
lola: ========================================
FORMULA DES-PT-30a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t108)))
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(t108)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DES-PT-30a-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(t108)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 258 markings, 258 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(t2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: closed formula file DES-PT-30a-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(t2)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges

FORMULA DES-PT-30a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t102)))
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(t102)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t102)
lola: lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

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

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 49088 markings, 77238 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t92) OR FIREABLE(t89))))
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(t92) OR FIREABLE(t89))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t92) OR FIREABLE(t89))
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: 330 markings, 375 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-8 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: A (G ((FIREABLE(t69) OR NOT FIREABLE(t45) OR NOT FIREABLE(t161))))
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(t69) OR NOT FIREABLE(t45) OR NOT FIREABLE(t161))))
lola: processed formula length: 68
lola: 2 rewrites
lola: closed formula file DES-PT-30a-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(t69) AND FIREABLE(t45) AND FIREABLE(t161))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 157395 markings, 291295 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t58) OR (NOT FIREABLE(t134) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t5))))))
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(t58) OR (NOT FIREABLE(t134) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t11) OR NOT FIREABLE(t5))))))
lola: processed formula length: 120
lola: 2 rewrites
lola: closed formula file DES-PT-30a-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(t58) AND (FIREABLE(t134) OR FIREABLE(t114) OR (FIREABLE(t11) AND FIREABLE(t5))))
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-9-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 DES-PT-30a-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t65) AND (FIREABLE(t28) OR (FIREABLE(t19) AND (FIREABLE(t143) OR FIREABLE(t102)))))))
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) AND (FIREABLE(t28) OR (FIREABLE(t19) AND (FIREABLE(t143) OR FIREABLE(t102)))))))
lola: processed formula length: 103
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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) AND (FIREABLE(t28) OR (FIREABLE(t19) AND (FIREABLE(t143) OR FIREABLE(t102)))))
lola: state equation: Generated DNF with 19 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-10-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 DES-PT-30a-ReachabilityFireability-7 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 (((FIREABLE(t40) AND FIREABLE(t9)) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t171) OR 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 (((FIREABLE(t40) AND FIREABLE(t9)) OR (NOT FIREABLE(t14) AND NOT FIREABLE(t114) AND (NOT FIREABLE(t171) OR NOT FIREABLE(t27))))))
lola: processed formula length: 136
lola: 2 rewrites
lola: closed formula file DES-PT-30a-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(t40) OR NOT FIREABLE(t9)) AND (FIREABLE(t14) OR FIREABLE(t114) OR (FIREABLE(t171) AND FIREABLE(t27))))
lola: state equation: Generated DNF with 39 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 569 markings, 568 edges
lola:
FORMULA DES-PT-30a-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: E (F ((((FIREABLE(t4) OR FIREABLE(t146)) AND FIREABLE(t12)) OR (FIREABLE(t187) AND NOT FIREABLE(t62) AND FIREABLE(t98) AND (FIREABLE(t175) OR FIREABLE(t77))))))
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(t4) OR FIREABLE(t146)) AND FIREABLE(t12)) OR (FIREABLE(t187) AND NOT FIREABLE(t62) AND FIREABLE(t98) AND (FIREABLE(t175) OR FIREABLE(t77))))))
lola: processed formula length: 163
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t4) OR FIREABLE(t146)) AND FIREABLE(t12)) OR (FIREABLE(t187) AND NOT FIREABLE(t62) AND FIREABLE(t98) AND (FIREABLE(t175) OR FIREABLE(t77))))
lola: state equation: Generated DNF with 38 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 489948 markings, 1953900 edges, 97990 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 556609 markings, 2216082 edges
lola: ========================================

FORMULA DES-PT-30a-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t184) OR FIREABLE(t92)) AND FIREABLE(t9) AND FIREABLE(t24) AND FIREABLE(t1) AND FIREABLE(t136) AND FIREABLE(t127) AND FIREABLE(t143) AND FIREABLE(t91))))
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(t184) OR FIREABLE(t92)) AND FIREABLE(t9) AND FIREABLE(t24) AND FIREABLE(t1) AND FIREABLE(t136) AND FIREABLE(t127) AND FIREABLE(t143) AND FIREABLE(t91))))
lola: processed formula length: 171
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t184) OR FIREABLE(t92)) AND FIREABLE(t9) AND FIREABLE(t24) AND FIREABLE(t1) AND FIREABLE(t136) AND FIREABLE(t127) AND FIREABLE(t143) AND FIREABLE(t91))
lola: state equation: Generated DNF with 45 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-13-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 DES-PT-30a-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t38) AND (FIREABLE(t99) OR FIREABLE(t15))) OR (FIREABLE(t82) AND FIREABLE(t151) AND FIREABLE(t2) AND FIREABLE(t171))) AND (FIREABLE(t72) OR FIREABLE(t85)))))
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(t38) AND (FIREABLE(t99) OR FIREABLE(t15))) OR (FIREABLE(t82) AND FIREABLE(t151) AND FIREABLE(t2) AND FIREABLE(t171))) AND (FIREABLE(t72) OR FIREABLE(t85)))))
lola: processed formula length: 178
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t38) AND (FIREABLE(t99) OR FIREABLE(t15))) OR (FIREABLE(t82) AND FIREABLE(t151) AND FIREABLE(t2) AND FIREABLE(t171))) AND (FIREABLE(t72) OR FIREABLE(t85)))
lola: state equation: Generated DNF with 50 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-14-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 DES-PT-30a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t98) AND FIREABLE(t9) AND FIREABLE(t31) AND FIREABLE(t107) AND ((FIREABLE(t109) AND FIREABLE(t6)) OR FIREABLE(t174)) AND (NOT FIREABLE(t4) OR NOT FIREABLE(t16) OR FIREABLE(t15)))))
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(t98) AND FIREABLE(t9) AND FIREABLE(t31) AND FIREABLE(t107) AND ((FIREABLE(t109) AND FIREABLE(t6)) OR FIREABLE(t174)) AND (NOT FIREABLE(t4) OR NOT FIREABLE(t16) OR FIREABLE(t15)))))
lola: processed formula length: 199
lola: 1 rewrites
lola: closed formula file DES-PT-30a-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(t98) AND FIREABLE(t9) AND FIREABLE(t31) AND FIREABLE(t107) AND ((FIREABLE(t109) AND FIREABLE(t6)) OR FIREABLE(t174)) AND (NOT FIREABLE(t4) OR NOT FIREABLE(t16) OR FIREABLE(t15)))
lola: state equation: Generated DNF with 96 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-ReachabilityFireability-15-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 DES-PT-30a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no yes yes no no no yes yes yes
lola:
preliminary result: no no no yes no no yes no yes yes no no no yes yes yes
lola: memory consumption: 14940 KB
lola: time consumption: 8 seconds

BK_STOP 1526616557697

--------------------
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="DES-PT-30a"
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/DES-PT-30a.tgz
mv DES-PT-30a 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 DES-PT-30a, 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 r052-smll-152646380100245"
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 ;