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 1.2M
-rw-r--r-- 1 mcc users 3.5K May 29 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 29 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 28 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 28 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.0K May 27 05:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 27 05:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 26 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 06:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 996K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-3a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700387
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528088209565

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-3a 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 DLCflexbar-PT-3a formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCflexbar-PT-3a @ 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: 4472/65536 symbol table entries, 846 collisions
lola: preprocessing...
lola: Size of bit vector: 581
lola: finding significant places
lola: 581 places, 3891 transitions, 226 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3352 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-3a-ReachabilityFireability.task
lola: E (F (FIREABLE(t2099))) : A (G (((NOT FIREABLE(t2023) AND NOT FIREABLE(t1116)) OR ((FIREABLE(t645) OR FIREABLE(t2643)) AND FIREABLE(t3216)) OR FIREABLE(t515) OR FIREABLE(t74)))) : A (G (NOT FIREABLE(t1787))) : E (F ((FIREABLE(t1512) AND FIREABLE(t1316) AND FIREABLE(t3831) AND NOT FIREABLE(t2520) AND NOT FIREABLE(t223) AND FIREABLE(t2762)))) : E (F ((NOT FIREABLE(t1814) AND NOT FIREABLE(t3280) AND FIREABLE(t2039) AND FIREABLE(t1650)))) : E (F (FIREABLE(t3572))) : E (F ((FIREABLE(t271) AND FIREABLE(t3274) AND NOT FIREABLE(t2609) AND FIREABLE(t1195) AND FIREABLE(t1481)))) : E (F (FIREABLE(t1941))) : A (G ((FIREABLE(t26) OR FIREABLE(t1272) OR NOT FIREABLE(t3586)))) : E (F (FIREABLE(t2120))) : E (F (((NOT FIREABLE(t3606) OR FIREABLE(t1013)) AND FIREABLE(t2332) AND ((FIREABLE(t3826) AND FIREABLE(t1173)) OR NOT FIREABLE(t756) OR NOT FIREABLE(t921))))) : E (F ((FIREABLE(t325) AND FIREABLE(t3241)))) : A (G ((NOT FIREABLE(t2249) OR NOT FIREABLE(t2264) OR (NOT FIREABLE(t2750) AND NOT FIREABLE(t1518)) OR NOT FIREABLE(t566)))) : E (F (FIREABLE(t778))) : E (F (((FIREABLE(t2050) OR NOT FIREABLE(t477)) AND FIREABLE(t1312) AND FIREABLE(t3168) AND FIREABLE(t3437) AND (FIREABLE(t2622) OR FIREABLE(t3414)) AND (NOT FIREABLE(t260) OR FIREABLE(t1428))))) : E (F ((NOT FIREABLE(t2198) AND (FIREABLE(t3723) OR FIREABLE(t3306) OR (FIREABLE(t2491) AND FIREABLE(t1312))) AND FIREABLE(t643) AND FIREABLE(t761) AND FIREABLE(t3302) AND FIREABLE(t3213) AND NOT FIREABLE(t2502) AND NOT FIREABLE(t2672))))
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(t2099)))
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(t2099)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2099)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-0 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: A (G (NOT FIREABLE(t1787)))
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(t1787)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t1787)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola:
FORMULA DLCflexbar-PT-3a-ReachabilityFireability-2 FALSE 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(t3572)))
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(t3572)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t3572)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-5 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(t1941)))
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(t1941)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t1941)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-3-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: 5 markings, 4 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-7 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(t2120)))
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(t2120)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2120)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-9 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(t778)))
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(t778)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t778)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-13 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(t325) AND FIREABLE(t3241))))
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(t325) AND FIREABLE(t3241))))
lola: processed formula length: 44
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t325) AND FIREABLE(t3241))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t26) OR FIREABLE(t1272) OR NOT FIREABLE(t3586))))
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(t26) OR FIREABLE(t1272) OR NOT FIREABLE(t3586))))
lola: processed formula length: 67
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t26) AND NOT FIREABLE(t1272) AND FIREABLE(t3586))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-7-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-8 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 ((NOT FIREABLE(t1814) AND NOT FIREABLE(t3280) AND FIREABLE(t2039) AND FIREABLE(t1650))))
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(t1814) AND NOT FIREABLE(t3280) AND FIREABLE(t2039) AND FIREABLE(t1650))))
lola: processed formula length: 93
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t1814) AND NOT FIREABLE(t3280) AND FIREABLE(t2039) AND FIREABLE(t1650))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-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: 6 markings, 5 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-4 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 ((NOT FIREABLE(t2249) OR NOT FIREABLE(t2264) OR (NOT FIREABLE(t2750) AND NOT FIREABLE(t1518)) OR NOT FIREABLE(t566))))
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(t2249) OR NOT FIREABLE(t2264) OR (NOT FIREABLE(t2750) AND NOT FIREABLE(t1518)) OR NOT FIREABLE(t566))))
lola: processed formula length: 126
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2249) AND FIREABLE(t2264) AND (FIREABLE(t2750) OR FIREABLE(t1518)) AND FIREABLE(t566))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3a-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 DLCflexbar-PT-3a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t271) AND FIREABLE(t3274) AND NOT FIREABLE(t2609) AND FIREABLE(t1195) AND FIREABLE(t1481))))
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(t271) AND FIREABLE(t3274) AND NOT FIREABLE(t2609) AND FIREABLE(t1195) AND FIREABLE(t1481))))
lola: processed formula length: 108
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t271) AND FIREABLE(t3274) AND NOT FIREABLE(t2609) AND FIREABLE(t1195) AND FIREABLE(t1481))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3a-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 DLCflexbar-PT-3a-ReachabilityFireability-6 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: E (F ((FIREABLE(t1512) AND FIREABLE(t1316) AND FIREABLE(t3831) AND NOT FIREABLE(t2520) AND NOT FIREABLE(t223) AND FIREABLE(t2762))))
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(t1512) AND FIREABLE(t1316) AND FIREABLE(t3831) AND NOT FIREABLE(t2520) AND NOT FIREABLE(t223) AND FIREABLE(t2762))))
lola: processed formula length: 132
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t1512) AND FIREABLE(t1316) AND FIREABLE(t3831) AND NOT FIREABLE(t2520) AND NOT FIREABLE(t223) AND FIREABLE(t2762))
lola: state equation: Generated DNF with 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-11-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: 5 markings, 4 edges

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t3606) OR FIREABLE(t1013)) AND FIREABLE(t2332) AND ((FIREABLE(t3826) AND FIREABLE(t1173)) OR NOT FIREABLE(t756) OR NOT FIREABLE(t921)))))
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(t3606) OR FIREABLE(t1013)) AND FIREABLE(t2332) AND ((FIREABLE(t3826) AND FIREABLE(t1173)) OR NOT FIREABLE(t756) OR NOT FIREABLE(t921)))))
lola: processed formula length: 161
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t3606) OR FIREABLE(t1013)) AND FIREABLE(t2332) AND ((FIREABLE(t3826) AND FIREABLE(t1173)) OR NOT FIREABLE(t756) OR NOT FIREABLE(t921)))
lola: state equation: Generated DNF with 71 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3a-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t2023) AND NOT FIREABLE(t1116)) OR ((FIREABLE(t645) OR FIREABLE(t2643)) AND FIREABLE(t3216)) OR FIREABLE(t515) OR FIREABLE(t74))))
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(t2023) AND NOT FIREABLE(t1116)) OR ((FIREABLE(t645) OR FIREABLE(t2643)) AND FIREABLE(t3216)) OR FIREABLE(t515) OR FIREABLE(t74))))
lola: processed formula length: 155
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2023) OR FIREABLE(t1116)) AND ((NOT FIREABLE(t645) AND NOT FIREABLE(t2643)) OR NOT FIREABLE(t3216)) AND NOT FIREABLE(t515) AND NOT FIREABLE(t74))
lola: state equation: Generated DNF with 136 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-13-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: 4 markings, 3 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2050) OR NOT FIREABLE(t477)) AND FIREABLE(t1312) AND FIREABLE(t3168) AND FIREABLE(t3437) AND (FIREABLE(t2622) OR FIREABLE(t3414)) AND (NOT FIREABLE(t260) OR FIREABLE(t1428)))))
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(t2050) OR NOT FIREABLE(t477)) AND FIREABLE(t1312) AND FIREABLE(t3168) AND FIREABLE(t3437) AND (FIREABLE(t2622) OR FIREABLE(t3414)) AND (NOT FIREABLE(t260) OR FIREABLE(t1428)))))
lola: processed formula length: 197
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2050) OR NOT FIREABLE(t477)) AND FIREABLE(t1312) AND FIREABLE(t3168) AND FIREABLE(t3437) AND (FIREABLE(t2622) OR FIREABLE(t3414)) AND (NOT FIREABLE(t260) OR FIREABLE(t1428)))
lola: state equation: Generated DNF with 130 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA DLCflexbar-PT-3a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2198) AND (FIREABLE(t3723) OR FIREABLE(t3306) OR (FIREABLE(t2491) AND FIREABLE(t1312))) AND FIREABLE(t643) AND FIREABLE(t761) AND FIREABLE(t3302) AND FIREABLE(t3213) AND NOT FIREABLE(t2502) AND NOT FIREABLE(t2672))))
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(t2198) AND (FIREABLE(t3723) OR FIREABLE(t3306) OR (FIREABLE(t2491) AND FIREABLE(t1312))) AND FIREABLE(t643) AND FIREABLE(t761) AND FIREABLE(t3302) AND FIREABLE(t3213) AND NOT FIREABLE(t2502) AND NOT FIREABLE(t2672))))
lola: processed formula length: 239
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-3a-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(t2198) AND (FIREABLE(t3723) OR FIREABLE(t3306) OR (FIREABLE(t2491) AND FIREABLE(t1312))) AND FIREABLE(t643) AND FIREABLE(t761) AND FIREABLE(t3302) AND FIREABLE(t3213) AND NOT FIREABLE(t2502) AND NOT FIREABLE(t2672))
lola: state equation: Generated DNF with 328 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-3a-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-3a-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 DLCflexbar-PT-3a-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no yes no yes yes yes yes yes yes no
lola:
preliminary result: yes no no yes yes yes no yes no yes yes yes yes yes yes no
lola: memory consumption: 29112 KB
lola: time consumption: 9 seconds

BK_STOP 1528088218780

--------------------
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="DLCflexbar-PT-3a"
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/DLCflexbar-PT-3a.tgz
mv DLCflexbar-PT-3a 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 DLCflexbar-PT-3a, 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 r268-smll-152749145700387"
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 ;