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 272K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.5K 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: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 115K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DES-PT-40b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r052-smll-152646380100266
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526629278444

info: Time: 3600 - MCC
===========================================================================================
prep: translating DES-PT-40b 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-40b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DES-PT-40b @ 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: 829/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 439
lola: finding significant places
lola: 439 places, 390 transitions, 374 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 487 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-40b-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t106) AND NOT FIREABLE(t20) AND NOT FIREABLE(t324) AND NOT FIREABLE(t223) AND NOT FIREABLE(t115)))) : A (G (NOT FIREABLE(t373))) : E (F ((((FIREABLE(t306) AND FIREABLE(t316)) OR FIREABLE(t2) OR FIREABLE(t184)) AND NOT FIREABLE(t67)))) : E (F (FIREABLE(t73))) : E (F (((NOT FIREABLE(t190) AND FIREABLE(t104)) OR (FIREABLE(t139) AND FIREABLE(t35) AND (FIREABLE(t115) OR FIREABLE(t173)) AND (NOT FIREABLE(t242) OR NOT FIREABLE(t68)))))) : A (G ((NOT FIREABLE(t383) OR NOT FIREABLE(t309)))) : A (G ((NOT FIREABLE(t7) OR (NOT FIREABLE(t190) AND NOT FIREABLE(t330)) OR FIREABLE(t47) OR FIREABLE(t202) OR FIREABLE(t49) OR FIREABLE(t372) OR NOT FIREABLE(t200) OR NOT FIREABLE(t175)))) : E (F ((FIREABLE(t98) AND (FIREABLE(t253) OR FIREABLE(t70)) AND FIREABLE(t333) AND (FIREABLE(t178) OR FIREABLE(t56)) AND (FIREABLE(t9) OR (NOT FIREABLE(t239) AND NOT FIREABLE(t88)))))) : A (G (NOT FIREABLE(t383))) : E (F ((FIREABLE(t123) AND FIREABLE(t245) AND (FIREABLE(t355) OR FIREABLE(t61))))) : E (F (FIREABLE(t111))) : E (F ((FIREABLE(t186) OR FIREABLE(t278) OR (FIREABLE(t281) AND FIREABLE(t351))))) : A (G ((NOT FIREABLE(t303) AND ((NOT FIREABLE(t266) AND NOT FIREABLE(t153)) OR (NOT FIREABLE(t98) AND NOT FIREABLE(t46)))))) : A (G ((NOT FIREABLE(t116) OR (NOT FIREABLE(t261) AND NOT FIREABLE(t97) AND (FIREABLE(t56) OR FIREABLE(t188) OR FIREABLE(t192)))))) : E (F (FIREABLE(t231))) : E (F (((FIREABLE(t3) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t182))) AND FIREABLE(t236))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t373)))
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(t373)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t373)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-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: 2185 markings, 2197 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-1 FALSE 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(t73)))
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(t73)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t73)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-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: 15 markings, 14 edges
lola: ========================================

FORMULA DES-PT-40b-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: A (G (NOT FIREABLE(t383)))
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(t383)))
lola: processed formula length: 26
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t383)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t111)))
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(t111)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t111)
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: 25 markings, 24 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-10 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(t231)))
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(t231)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t231)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 815389 markings, 964565 edges, 163078 markings/sec, 0 secs

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-40b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t383) OR NOT FIREABLE(t309))))
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(t383) OR NOT FIREABLE(t309))))
lola: processed formula length: 51
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t383) AND FIREABLE(t309))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-5-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-40b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t186) OR FIREABLE(t278) OR (FIREABLE(t281) AND FIREABLE(t351)))))
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(t186) OR FIREABLE(t278) OR (FIREABLE(t281) AND FIREABLE(t351)))))
lola: processed formula length: 83
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t186) OR FIREABLE(t278) OR (FIREABLE(t281) AND FIREABLE(t351)))
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26813 markings, 60075 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t123) AND FIREABLE(t245) AND (FIREABLE(t355) OR FIREABLE(t61)))))
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(t123) AND FIREABLE(t245) AND (FIREABLE(t355) OR FIREABLE(t61)))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t123) AND FIREABLE(t245) AND (FIREABLE(t355) OR FIREABLE(t61)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-7-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-40b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t3) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t182))) AND FIREABLE(t236))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FIREABLE(t3) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t182))) AND FIREABLE(t236))))
lola: processed formula length: 91
lola: 1 rewrites
lola: closed formula file DES-PT-40b-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t3) OR (NOT FIREABLE(t175) AND NOT FIREABLE(t182))) AND FIREABLE(t236))
lola: state equation: Generated DNF with 20 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 874302 markings, 1037334 edges, 174860 markings/sec, 0 secs
lola: sara is running 5 secs || 1742078 markings, 2127085 edges, 173555 markings/sec, 5 secs
lola: sara is running 10 secs || 2613905 markings, 3220720 edges, 174365 markings/sec, 10 secs

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-40b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t303) AND ((NOT FIREABLE(t266) AND NOT FIREABLE(t153)) OR (NOT FIREABLE(t98) AND NOT FIREABLE(t46))))))
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(t303) AND ((NOT FIREABLE(t266) AND NOT FIREABLE(t153)) OR (NOT FIREABLE(t98) AND NOT FIREABLE(t46))))))
lola: processed formula length: 124
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t303) OR ((FIREABLE(t266) OR FIREABLE(t153)) AND (FIREABLE(t98) OR FIREABLE(t46))))
lola: state equation: Generated DNF with 12 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2173 markings, 5282 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t106) AND NOT FIREABLE(t20) AND NOT FIREABLE(t324) AND NOT FIREABLE(t223) AND NOT FIREABLE(t115))))
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(t106) AND NOT FIREABLE(t20) AND NOT FIREABLE(t324) AND NOT FIREABLE(t223) AND NOT FIREABLE(t115))))
lola: processed formula length: 119
lola: 2 rewrites
lola: closed formula file DES-PT-40b-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t306) AND FIREABLE(t316)) OR FIREABLE(t2) OR FIREABLE(t184)) 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(t306) AND FIREABLE(t316)) OR FIREABLE(t2) OR FIREABLE(t184)) AND NOT FIREABLE(t67))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t306) AND FIREABLE(t316)) OR FIREABLE(t2) OR FIREABLE(t184)) AND NOT FIREABLE(t67))
lola: state equation: Generated DNF with 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-11-0.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-40b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t116) OR (NOT FIREABLE(t261) AND NOT FIREABLE(t97) AND (FIREABLE(t56) OR FIREABLE(t188) OR FIREABLE(t192))))))
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(t116) OR (NOT FIREABLE(t261) AND NOT FIREABLE(t97) AND (FIREABLE(t56) OR FIREABLE(t188) OR FIREABLE(t192))))))
lola: processed formula length: 133
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t116) AND (FIREABLE(t261) OR FIREABLE(t97) OR (NOT FIREABLE(t56) AND NOT FIREABLE(t188) AND NOT FIREABLE(t192))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================

FORMULA DES-PT-40b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t190) AND FIREABLE(t104)) OR (FIREABLE(t139) AND FIREABLE(t35) AND (FIREABLE(t115) OR FIREABLE(t173)) AND (NOT FIREABLE(t242) OR NOT FIREABLE(t68))))))
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(t190) AND FIREABLE(t104)) OR (FIREABLE(t139) AND FIREABLE(t35) AND (FIREABLE(t115) OR FIREABLE(t173)) AND (NOT FIREABLE(t242) OR NOT FIREABLE(t68))))))
lola: processed formula length: 175
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t190) AND FIREABLE(t104)) OR (FIREABLE(t139) AND FIREABLE(t35) AND (FIREABLE(t115) OR FIREABLE(t173)) AND (NOT FIREABLE(t242) OR NOT FIREABLE(t68))))
lola: state equation: Generated DNF with 31 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 430658 markings, 1009889 edges, 86132 markings/sec, 0 secs
lola: sara is running 5 secs || 828188 markings, 1992227 edges, 79506 markings/sec, 5 secs
lola: sara is running 10 secs || 1161704 markings, 3080013 edges, 66703 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1210909 markings, 3291555 edges

FORMULA DES-PT-40b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t7) OR (NOT FIREABLE(t190) AND NOT FIREABLE(t330)) OR FIREABLE(t47) OR FIREABLE(t202) OR FIREABLE(t49) OR FIREABLE(t372) OR NOT FIREABLE(t200) OR NOT FIREABLE(t175))))
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(t7) OR (NOT FIREABLE(t190) AND NOT FIREABLE(t330)) OR FIREABLE(t47) OR FIREABLE(t202) OR FIREABLE(t49) OR FIREABLE(t372) OR NOT FIREABLE(t200) OR NOT FIREABLE(t175))))
lola: processed formula length: 194
lola: 2 rewrites
lola: closed formula file DES-PT-40b-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(t7) AND (FIREABLE(t190) OR FIREABLE(t330)) AND NOT FIREABLE(t47) AND NOT FIREABLE(t202) AND NOT FIREABLE(t49) AND NOT FIREABLE(t372) AND FIREABLE(t200) AND FIREABLE(t175))
lola: state equation: Generated DNF with 72 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-14-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-ReachabilityFireability-14-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 DES-PT-40b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t98) AND (FIREABLE(t253) OR FIREABLE(t70)) AND FIREABLE(t333) AND (FIREABLE(t178) OR FIREABLE(t56)) AND (FIREABLE(t9) OR (NOT FIREABLE(t239) AND NOT FIREABLE(t88))))))
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(t253) OR FIREABLE(t70)) AND FIREABLE(t333) AND (FIREABLE(t178) OR FIREABLE(t56)) AND (FIREABLE(t9) OR (NOT FIREABLE(t239) AND NOT FIREABLE(t88))))))
lola: processed formula length: 186
lola: 1 rewrites
lola: closed formula file DES-PT-40b-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(t253) OR FIREABLE(t70)) AND FIREABLE(t333) AND (FIREABLE(t178) OR FIREABLE(t56)) AND (FIREABLE(t9) OR (NOT FIREABLE(t239) AND NOT FIREABLE(t88))))
lola: state equation: Generated DNF with 96 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-40b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-40b-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-40b-ReachabilityFireability-7 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 yes no no yes yes yes no no yes yes
lola:
preliminary result: no no yes yes yes no yes no no yes yes yes no no yes yes
lola: memory consumption: 15296 KB
lola: time consumption: 48 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40b"
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-40b.tgz
mv DES-PT-40b 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-40b, 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-152646380100266"
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 ;