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.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 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 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 963K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCround-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-smll-152649735200070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526619643796

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCround-PT-07b 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 DLCround-PT-07b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCround-PT-07b @ 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: 6774/65536 symbol table entries, 1176 collisions
lola: preprocessing...
lola: Size of bit vector: 2703
lola: finding significant places
lola: 2703 places, 4071 transitions, 2571 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5634 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-07b-ReachabilityFireability.task
lola: E (F (FIREABLE(t2795))) : E (F (FIREABLE(t2671))) : E (F (((NOT FIREABLE(t2714) OR NOT FIREABLE(t777)) AND (NOT FIREABLE(t294) OR NOT FIREABLE(t1822)) AND FIREABLE(t761)))) : E (F (FIREABLE(t3708))) : E (F (FIREABLE(t1839))) : E (F ((FIREABLE(t273) AND NOT FIREABLE(t1926)))) : E (F (((FIREABLE(t1090) OR FIREABLE(t3889) OR NOT FIREABLE(t3920)) AND FIREABLE(t1878) AND (FIREABLE(t1078) OR FIREABLE(t1047))))) : E (F (FIREABLE(t1393))) : E (F ((FIREABLE(t1291) OR (FIREABLE(t1817) AND FIREABLE(t1138) AND (FIREABLE(t1693) OR FIREABLE(t128)) AND (NOT FIREABLE(t36) OR FIREABLE(t2054)))))) : A (G ((FIREABLE(t1262) OR (FIREABLE(t3940) AND FIREABLE(t3356)) OR NOT FIREABLE(t2010) OR NOT FIREABLE(t3936) OR FIREABLE(t272)))) : E (F ((NOT FIREABLE(t3942) AND NOT FIREABLE(t488) AND NOT FIREABLE(t1253) AND (FIREABLE(t2923) OR FIREABLE(t1260)) AND (NOT FIREABLE(t2976) OR NOT FIREABLE(t3825) OR NOT FIREABLE(t2578) OR NOT FIREABLE(t1926))))) : A (G ((NOT FIREABLE(t3904) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t3622))))) : A (G ((NOT FIREABLE(t1696) OR NOT FIREABLE(t1242) OR NOT FIREABLE(t792) OR NOT FIREABLE(t1016) OR NOT FIREABLE(t1278) OR FIREABLE(t3657)))) : A (G (NOT FIREABLE(t1036))) : E (F ((FIREABLE(t3199) AND FIREABLE(t2017)))) : E (F ((FIREABLE(t2240) OR FIREABLE(t1281) OR FIREABLE(t3785) OR (FIREABLE(t2139) AND FIREABLE(t3550) AND (FIREABLE(t1447) OR FIREABLE(t2874))) OR ((NOT FIREABLE(t345) OR NOT FIREABLE(t2859)) AND FIREABLE(t1273)))))
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(t2795)))
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(t2795)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t2795)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-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: 76 markings, 75 edges
lola: ========================================

FORMULA DLCround-PT-07b-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: E (F (FIREABLE(t2671)))
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(t2671)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t2671)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================

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

FORMULA DLCround-PT-07b-ReachabilityFireability-3 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(t1839)))
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(t1839)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t1839)
lola: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas

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

FORMULA DLCround-PT-07b-ReachabilityFireability-7 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: A (G (NOT FIREABLE(t1036)))
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(t1036)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file DLCround-PT-07b-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(t1036)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 143 markings, 142 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-13 FALSE 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(t273) AND NOT FIREABLE(t1926))))
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(t273) AND NOT FIREABLE(t1926))))
lola: processed formula length: 48
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t273) AND NOT FIREABLE(t1926))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-6-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: 31 markings, 30 edges
lola: ========================================

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

FORMULA DLCround-PT-07b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3904) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t3622)))))
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(t3904) AND (NOT FIREABLE(t311) OR NOT FIREABLE(t3622)))))
lola: processed formula length: 78
lola: 2 rewrites
lola: closed formula file DLCround-PT-07b-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(t3904) OR (FIREABLE(t311) AND FIREABLE(t3622)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-11 FALSE 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: E (F (((NOT FIREABLE(t2714) OR NOT FIREABLE(t777)) AND (NOT FIREABLE(t294) OR NOT FIREABLE(t1822)) AND FIREABLE(t761))))
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(t2714) OR NOT FIREABLE(t777)) AND (NOT FIREABLE(t294) OR NOT FIREABLE(t1822)) AND FIREABLE(t761))))
lola: processed formula length: 122
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t2714) OR NOT FIREABLE(t777)) AND (NOT FIREABLE(t294) OR NOT FIREABLE(t1822)) AND FIREABLE(t761))
lola: state equation: Generated DNF with 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 78 markings, 77 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-2 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 ((NOT FIREABLE(t1696) OR NOT FIREABLE(t1242) OR NOT FIREABLE(t792) OR NOT FIREABLE(t1016) OR NOT FIREABLE(t1278) OR FIREABLE(t3657))))
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(t1696) OR NOT FIREABLE(t1242) OR NOT FIREABLE(t792) OR NOT FIREABLE(t1016) OR NOT FIREABLE(t1278) OR FIREABLE(t3657))))
lola: processed formula length: 144
lola: 2 rewrites
lola: closed formula file DLCround-PT-07b-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(t1696) AND FIREABLE(t1242) AND FIREABLE(t792) AND FIREABLE(t1016) AND FIREABLE(t1278) AND NOT FIREABLE(t3657))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 78573 markings, 89556 edges, 15715 markings/sec, 0 secs

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

FORMULA DLCround-PT-07b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1262) OR (FIREABLE(t3940) AND FIREABLE(t3356)) OR NOT FIREABLE(t2010) OR NOT FIREABLE(t3936) OR FIREABLE(t272))))
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(t1262) OR (FIREABLE(t3940) AND FIREABLE(t3356)) OR NOT FIREABLE(t2010) OR NOT FIREABLE(t3936) OR FIREABLE(t272))))
lola: processed formula length: 134
lola: 2 rewrites
lola: closed formula file DLCround-PT-07b-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(t1262) AND (NOT FIREABLE(t3940) OR NOT FIREABLE(t3356)) AND FIREABLE(t2010) AND FIREABLE(t3936) AND NOT FIREABLE(t272))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 199 markings, 200 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1090) OR FIREABLE(t3889) OR NOT FIREABLE(t3920)) AND FIREABLE(t1878) AND (FIREABLE(t1078) OR FIREABLE(t1047)))))
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(t1090) OR FIREABLE(t3889) OR NOT FIREABLE(t3920)) AND FIREABLE(t1878) AND (FIREABLE(t1078) OR FIREABLE(t1047)))))
lola: processed formula length: 133
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t1090) OR FIREABLE(t3889) OR NOT FIREABLE(t3920)) AND FIREABLE(t1878) AND (FIREABLE(t1078) OR FIREABLE(t1047)))
lola: state equation: Generated DNF with 26 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1291) OR (FIREABLE(t1817) AND FIREABLE(t1138) AND (FIREABLE(t1693) OR FIREABLE(t128)) AND (NOT FIREABLE(t36) OR FIREABLE(t2054))))))
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(t1291) OR (FIREABLE(t1817) AND FIREABLE(t1138) AND (FIREABLE(t1693) OR FIREABLE(t128)) AND (NOT FIREABLE(t36) OR FIREABLE(t2054))))))
lola: processed formula length: 152
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t1291) OR (FIREABLE(t1817) AND FIREABLE(t1138) AND (FIREABLE(t1693) OR FIREABLE(t128)) AND (NOT FIREABLE(t36) OR FIREABLE(t2054))))
lola: state equation: Generated DNF with 17 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-8 TRUE 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 ((NOT FIREABLE(t3942) AND NOT FIREABLE(t488) AND NOT FIREABLE(t1253) AND (FIREABLE(t2923) OR FIREABLE(t1260)) AND (NOT FIREABLE(t2976) OR NOT FIREABLE(t3825) OR NOT FIREABLE(t2578) OR NOT FIREABLE(t1926)))))
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(t3942) AND NOT FIREABLE(t488) AND NOT FIREABLE(t1253) AND (FIREABLE(t2923) OR FIREABLE(t1260)) AND (NOT FIREABLE(t2976) OR NOT FIREABLE(t3825) OR NOT FIREABLE(t2578) OR NOT FIREABLE(t1926)))))
lola: processed formula length: 216
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t3942) AND NOT FIREABLE(t488) AND NOT FIREABLE(t1253) AND (FIREABLE(t2923) OR FIREABLE(t1260)) AND (NOT FIREABLE(t2976) OR NOT FIREABLE(t3825) OR NOT FIREABLE(t2578) OR NOT FIREABLE(t1926)))
lola: state equation: Generated DNF with 132 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-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: 42 markings, 41 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2240) OR FIREABLE(t1281) OR FIREABLE(t3785) OR (FIREABLE(t2139) AND FIREABLE(t3550) AND (FIREABLE(t1447) OR FIREABLE(t2874))) OR ((NOT FIREABLE(t345) OR NOT FIREABLE(t2859)) AND FIREABLE(t1273)))))
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(t2240) OR FIREABLE(t1281) OR FIREABLE(t3785) OR (FIREABLE(t2139) AND FIREABLE(t3550) AND (FIREABLE(t1447) OR FIREABLE(t2874))) OR ((NOT FIREABLE(t345) OR NOT FIREABLE(t2859)) AND FIREABLE(t1273)))))
lola: processed formula length: 220
lola: 1 rewrites
lola: closed formula file DLCround-PT-07b-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(t2240) OR FIREABLE(t1281) OR FIREABLE(t3785) OR (FIREABLE(t2139) AND FIREABLE(t3550) AND (FIREABLE(t1447) OR FIREABLE(t2874))) OR ((NOT FIREABLE(t345) OR NOT FIREABLE(t2859)) AND FIREABLE(t1273)))
lola: state equation: Generated DNF with 19 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-07b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-07b-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 58 markings, 57 edges
lola: ========================================

FORMULA DLCround-PT-07b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes yes yes yes no yes no yes no yes yes
lola:
preliminary result: yes yes yes yes yes yes yes yes yes no yes no yes no yes yes
lola: memory consumption: 19968 KB
lola: time consumption: 6 seconds

BK_STOP 1526619650371

--------------------
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="DLCround-PT-07b"
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/DLCround-PT-07b.tgz
mv DLCround-PT-07b 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 DLCround-PT-07b, 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 r064-smll-152649735200070"
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 ;