Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 66K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-00b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380000168
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526563774398

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-00b 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-00b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-00b @ 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: 501/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 271
lola: finding significant places
lola: 271 places, 230 transitions, 212 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 319 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00b-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t49) OR NOT FIREABLE(t68) OR (NOT FIREABLE(t207) AND NOT FIREABLE(t213)) OR (FIREABLE(t79) AND NOT FIREABLE(t75))))) : E (F ((FIREABLE(t28) AND ((FIREABLE(t192) AND FIREABLE(t128)) OR (FIREABLE(t123) AND FIREABLE(t182))) AND FIREABLE(t57)))) : E (F (FIREABLE(t226))) : E (F (FIREABLE(t185))) : E (F (FIREABLE(t212))) : A (G ((NOT FIREABLE(t160) AND NOT FIREABLE(t197) AND (NOT FIREABLE(t201) OR NOT FIREABLE(t195)) AND (FIREABLE(t223) OR FIREABLE(t227) OR NOT FIREABLE(t120) OR (FIREABLE(t108) AND FIREABLE(t10) AND (FIREABLE(t36) OR FIREABLE(t167))))))) : E (F ((NOT FIREABLE(t205) AND FIREABLE(t95) AND FIREABLE(t80) AND FIREABLE(t6)))) : E (F ((FIREABLE(t222) AND FIREABLE(t144) AND NOT FIREABLE(t67) AND (FIREABLE(t10) OR (FIREABLE(t95) AND FIREABLE(t20))) AND FIREABLE(t47)))) : E (F (FIREABLE(t141))) : A (G (((FIREABLE(t65) AND FIREABLE(t157)) OR NOT FIREABLE(t196) OR NOT FIREABLE(t113) OR NOT FIREABLE(t180) OR NOT FIREABLE(t5)))) : E (F (((FIREABLE(t148) OR (FIREABLE(t111) AND FIREABLE(t139))) AND (FIREABLE(t229) OR FIREABLE(t64) OR FIREABLE(t163)) AND ((NOT FIREABLE(t64) AND NOT FIREABLE(t3)) OR (NOT FIREABLE(t24) AND FIREABLE(t200)))))) : E (F ((FIREABLE(t190) AND FIREABLE(t96) AND (FIREABLE(t18) OR NOT FIREABLE(t165))))) : E (F ((FIREABLE(t96) AND (FIREABLE(t133) OR FIREABLE(t54) OR FIREABLE(t138)) AND NOT FIREABLE(t67)))) : A (G (NOT FIREABLE(t120))) : A (G ((NOT FIREABLE(t217) AND NOT FIREABLE(t178) AND NOT FIREABLE(t65) AND NOT FIREABLE(t148)))) : A (G ((FIREABLE(t32) OR NOT FIREABLE(t181) OR (NOT FIREABLE(t210) AND FIREABLE(t109)) OR NOT FIREABLE(t11))))
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(t226)))
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(t226)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t226)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-2 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(t185)))
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(t185)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t185)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-ReachabilityFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-3 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(t212)))
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(t212)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t212)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-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: 310 markings, 392 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t141)))
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(t141)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t141)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-3-0.sara
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t120)))
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(t120)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(t120)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t190) AND FIREABLE(t96) AND (FIREABLE(t18) OR NOT FIREABLE(t165)))))
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(t190) AND FIREABLE(t96) AND (FIREABLE(t18) OR NOT FIREABLE(t165)))))
lola: processed formula length: 85
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t190) AND FIREABLE(t96) AND (FIREABLE(t18) OR NOT FIREABLE(t165)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-ReachabilityFireability-5-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-11 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 ((NOT FIREABLE(t205) AND FIREABLE(t95) AND FIREABLE(t80) AND FIREABLE(t6))))
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(t205) AND FIREABLE(t95) AND FIREABLE(t80) AND FIREABLE(t6))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t205) AND FIREABLE(t95) AND FIREABLE(t80) AND FIREABLE(t6))
lola: state equation: Generated DNF with 22 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-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 DES-PT-00b-ReachabilityFireability-6 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: A (G ((NOT FIREABLE(t217) AND NOT FIREABLE(t178) AND NOT FIREABLE(t65) AND NOT FIREABLE(t148))))
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(t217) AND NOT FIREABLE(t178) AND NOT FIREABLE(t65) AND NOT FIREABLE(t148))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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(t217) OR FIREABLE(t178) OR FIREABLE(t65) OR FIREABLE(t148))
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-14 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: E (F ((FIREABLE(t96) AND (FIREABLE(t133) OR FIREABLE(t54) OR FIREABLE(t138)) AND NOT FIREABLE(t67))))
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(t96) AND (FIREABLE(t133) OR FIREABLE(t54) OR FIREABLE(t138)) AND NOT FIREABLE(t67))))
lola: processed formula length: 103
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t96) AND (FIREABLE(t133) OR FIREABLE(t54) OR FIREABLE(t138)) AND NOT FIREABLE(t67))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-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: 40 markings, 39 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t32) OR NOT FIREABLE(t181) OR (NOT FIREABLE(t210) AND FIREABLE(t109)) OR NOT FIREABLE(t11))))
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(t32) OR NOT FIREABLE(t181) OR (NOT FIREABLE(t210) AND FIREABLE(t109)) OR NOT FIREABLE(t11))))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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(t32) AND FIREABLE(t181) AND (FIREABLE(t210) OR NOT FIREABLE(t109)) AND FIREABLE(t11))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t65) AND FIREABLE(t157)) OR NOT FIREABLE(t196) OR NOT FIREABLE(t113) OR NOT FIREABLE(t180) 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 (((FIREABLE(t65) AND FIREABLE(t157)) OR NOT FIREABLE(t196) OR NOT FIREABLE(t113) OR NOT FIREABLE(t180) OR NOT FIREABLE(t5))))
lola: processed formula length: 134
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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(t65) OR NOT FIREABLE(t157)) AND FIREABLE(t196) AND FIREABLE(t113) AND FIREABLE(t180) AND FIREABLE(t5))
lola: state equation: Generated DNF with 28 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-ReachabilityFireability-10-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.

FORMULA DES-PT-00b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t28) AND ((FIREABLE(t192) AND FIREABLE(t128)) OR (FIREABLE(t123) AND FIREABLE(t182))) AND 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(t28) AND ((FIREABLE(t192) AND FIREABLE(t128)) OR (FIREABLE(t123) AND FIREABLE(t182))) AND FIREABLE(t57))))
lola: processed formula length: 123
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t28) AND ((FIREABLE(t192) AND FIREABLE(t128)) OR (FIREABLE(t123) AND FIREABLE(t182))) AND FIREABLE(t57))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-ReachabilityFireability-11-0.sara.
lola: ========================================
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-00b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t49) OR NOT FIREABLE(t68) OR (NOT FIREABLE(t207) AND NOT FIREABLE(t213)) OR (FIREABLE(t79) AND NOT FIREABLE(t75)))))
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(t49) OR NOT FIREABLE(t68) OR (NOT FIREABLE(t207) AND NOT FIREABLE(t213)) OR (FIREABLE(t79) AND NOT FIREABLE(t75)))))
lola: processed formula length: 139
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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(t49) AND FIREABLE(t68) AND (FIREABLE(t207) OR FIREABLE(t213)) AND (NOT FIREABLE(t79) OR FIREABLE(t75)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-12-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: 297 markings, 379 edges

FORMULA DES-PT-00b-ReachabilityFireability-0 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: E (F ((FIREABLE(t222) AND FIREABLE(t144) AND NOT FIREABLE(t67) AND (FIREABLE(t10) OR (FIREABLE(t95) AND FIREABLE(t20))) AND FIREABLE(t47))))
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(t222) AND FIREABLE(t144) AND NOT FIREABLE(t67) AND (FIREABLE(t10) OR (FIREABLE(t95) AND FIREABLE(t20))) AND FIREABLE(t47))))
lola: processed formula length: 141
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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: ========================================
lola: formula 0: (FIREABLE(t222) AND FIREABLE(t144) AND NOT FIREABLE(t67) AND (FIREABLE(t10) OR (FIREABLE(t95) AND FIREABLE(t20))) AND FIREABLE(t47))
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-13-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: 100 markings, 99 edges
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-7 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(t148) OR (FIREABLE(t111) AND FIREABLE(t139))) AND (FIREABLE(t229) OR FIREABLE(t64) OR FIREABLE(t163)) AND ((NOT FIREABLE(t64) AND NOT FIREABLE(t3)) OR (NOT FIREABLE(t24) AND FIREABLE(t200))))))
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(t148) OR (FIREABLE(t111) AND FIREABLE(t139))) AND (FIREABLE(t229) OR FIREABLE(t64) OR FIREABLE(t163)) AND ((NOT FIREABLE(t64) AND NOT FIREABLE(t3)) OR (NOT FIREABLE(t24) AND FIREABLE(t200))))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file DES-PT-00b-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(t148) OR (FIREABLE(t111) AND FIREABLE(t139))) AND (FIREABLE(t229) OR FIREABLE(t64) OR FIREABLE(t163)) AND ((NOT FIREABLE(t64) AND NOT FIREABLE(t3)) OR (NOT FIREABLE(t24) AND FIREABLE(t200))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 99 literals and 14 conjunctive subformulas
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t160) AND NOT FIREABLE(t197) AND (NOT FIREABLE(t201) OR NOT FIREABLE(t195)) AND (FIREABLE(t223) OR FIREABLE(t227) OR NOT FIREABLE(t120) OR (FIREABLE(t108) AND FIREABLE(t10) AND (FIREABLE(t36) OR FIREABLE(t167)))))))
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(t160) AND NOT FIREABLE(t197) AND (NOT FIREABLE(t201) OR NOT FIREABLE(t195)) AND (FIREABLE(t223) OR FIREABLE(t227) OR NOT FIREABLE(t120) OR (FIREABLE(t108) AND FIREABLE(t10) AND (FIREABLE(t36) OR FIREABLE(t167)))))))
lola: processed formula length: 240
lola: 2 rewrites
lola: closed formula file DES-PT-00b-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(t160) OR FIREABLE(t197) OR (FIREABLE(t201) AND FIREABLE(t195)) OR (NOT FIREABLE(t223) AND NOT FIREABLE(t227) AND FIREABLE(t120) AND (NOT FIREABLE(t108) OR NOT FIREABLE(t10) OR (NOT FIREABLE(t36) AND NOT FIREABLE(t167)))))
lola: state equation: Generated DNF with 41 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA DES-PT-00b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no yes yes yes yes yes yes no no yes
lola:
preliminary result: no no yes yes yes no no yes yes yes yes yes yes no no yes
sara: try reading problem file DES-PT-00b-ReachabilityFireability-15-0.sara.
lola: memory consumption: 15076 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526563775647

--------------------
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-00b"
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-00b.tgz
mv DES-PT-00b 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-00b, 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-152646380000168"
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 ;