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 284K
-rw-r--r-- 1 mcc users 3.3K May 30 21:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 21:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 28 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 28 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.2K May 28 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 28 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 27 04:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 04:08 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 127K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NQueens-PT-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800342
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527790135091

info: Time: 3600 - MCC
===========================================================================================
prep: translating NQueens-PT-12 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NQueens-PT-12 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ NQueens-PT-12 @ 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: 360/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6912
lola: finding significant places
lola: 216 places, 144 transitions, 144 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from NQueens-PT-12-ReachabilityFireability.task
lola: E (F (())) : A (G ((NOT FIREABLE(T_19_15_11_3) AND NOT FIREABLE(T_9_17_7_9) AND FIREABLE(T_14_6_4_1)))) : A (G (FIREABLE(T_13_17_9_7))) : A (G ((NOT FIREABLE(T_13_5_3_1) OR ((NOT FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_9_13_5_7)) AND (NOT FIREABLE(T_19_15_11_3) OR NOT FIREABLE(T_16_18_11_6)))))) : E (F ((((NOT FIREABLE(T_12_10_5_4) AND NOT FIREABLE(T_2_10_0_9)) OR (NOT FIREABLE(T_6_6_0_5) AND NOT FIREABLE(T_6_16_5_10))) AND (FIREABLE(T_14_10_6_3) OR FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_6_10_2_7) OR (FIREABLE(T_13_5_3_1) AND FIREABLE(T_18_12_9_2)) OR FIREABLE(T_13_15_8_6))))) : A (G ((FIREABLE(T_15_11_7_3) OR FIREABLE(T_11_7_3_3)))) : A (G (FIREABLE(T_17_13_9_3))) : A (G (((NOT FIREABLE(T_19_11_9_1) OR FIREABLE(T_16_12_8_3)) AND NOT FIREABLE(T_13_15_8_6)))) : A (G ((FIREABLE(T_18_10_8_1) OR FIREABLE(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8) OR NOT FIREABLE(T_15_19_11_7) OR NOT FIREABLE(T_6_14_4_9)))) : E (F ((((NOT FIREABLE(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8)) AND FIREABLE(T_17_7_6_0)) OR NOT FIREABLE(T_17_17_11_5)))) : E (F ((NOT FIREABLE(T_13_15_8_6) OR NOT FIREABLE(T_10_18_8_9)))) : E (F ((FIREABLE(T_9_19_8_10) AND NOT FIREABLE(T_13_15_8_6) AND FIREABLE(T_7_13_4_8) AND (FIREABLE(T_11_23_11_11) OR (FIREABLE(T_8_16_6_9) AND FIREABLE(T_12_16_8_7)))))) : A (G (NOT FIREABLE(T_6_8_1_6))) : E (F ((NOT FIREABLE(T_12_10_5_4) AND NOT FIREABLE(T_14_18_10_7) AND NOT FIREABLE(T_6_16_5_10) AND NOT FIREABLE(T_2_10_0_9)))) : E (F (((NOT FIREABLE(T_10_10_4_5) OR (FIREABLE(T_15_15_9_5) AND FIREABLE(T_11_9_4_4))) AND (FIREABLE(T_14_12_7_4) OR FIREABLE(T_7_7_1_5) OR (FIREABLE(T_10_6_2_3) AND FIREABLE(T_12_18_9_8))) AND (NOT FIREABLE(T_7_9_2_6) OR NOT FIREABLE(T_8_10_3_6) OR FIREABLE(T_4_14_3_10))))) : E (F (((NOT FIREABLE(T_7_15_5_9) AND NOT FIREABLE(T_11_5_2_2)) OR (NOT FIREABLE(T_8_10_3_6) AND NOT FIREABLE(T_12_2_1_0)) OR FIREABLE(T_17_9_7_1) OR FIREABLE(T_6_10_2_7))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file NQueens-PT-12-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

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

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

FORMULA NQueens-PT-12-ReachabilityFireability-6 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: A (G (NOT FIREABLE(T_6_8_1_6)))
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(T_6_8_1_6)))
lola: processed formula length: 31
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T_13_15_8_6) OR NOT FIREABLE(T_10_18_8_9))))
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(T_13_15_8_6) OR NOT FIREABLE(T_10_18_8_9))))
lola: processed formula length: 65
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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(T_13_15_8_6) OR NOT FIREABLE(T_10_18_8_9))
lola: state equation: Generated DNF with 8 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges

FORMULA NQueens-PT-12-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_15_11_7_3) OR FIREABLE(T_11_7_3_3))))
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(T_15_11_7_3) OR FIREABLE(T_11_7_3_3))))
lola: processed formula length: 56
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-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(T_15_11_7_3) AND NOT FIREABLE(T_11_7_3_3))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: Generated DNF with 32 literals and 16 conjunctive subformulas
lola:
FORMULA NQueens-PT-12-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-5-0.sara
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T_19_15_11_3) AND NOT FIREABLE(T_9_17_7_9) AND FIREABLE(T_14_6_4_1))))
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(T_19_15_11_3) AND NOT FIREABLE(T_9_17_7_9) AND FIREABLE(T_14_6_4_1))))
lola: processed formula length: 90
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-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(T_19_15_11_3) OR FIREABLE(T_9_17_7_9) OR NOT FIREABLE(T_14_6_4_1))
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-6-0.sara

FORMULA NQueens-PT-12-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(T_19_11_9_1) OR FIREABLE(T_16_12_8_3)) AND NOT FIREABLE(T_13_15_8_6))))
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(T_19_11_9_1) OR FIREABLE(T_16_12_8_3)) AND NOT FIREABLE(T_13_15_8_6))))
lola: processed formula length: 93
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: 0 markings, 0 edges
lola: formula 0: ((FIREABLE(T_19_11_9_1) AND NOT FIREABLE(T_16_12_8_3)) OR FIREABLE(T_13_15_8_6))
lola: state equation: Generated DNF with 24 literals and 5 conjunctive subformulas
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-7 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(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8)) AND FIREABLE(T_17_7_6_0)) OR NOT FIREABLE(T_17_17_11_5))))
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(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8)) AND FIREABLE(T_17_7_6_0)) OR NOT FIREABLE(T_17_17_11_5))))
lola: processed formula length: 124
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8)) AND FIREABLE(T_17_7_6_0)) OR NOT FIREABLE(T_17_17_11_5))
lola: state equation: Generated DNF with 44 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges

FORMULA NQueens-PT-12-ReachabilityFireability-9 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: E (F ((NOT FIREABLE(T_12_10_5_4) AND NOT FIREABLE(T_14_18_10_7) AND NOT FIREABLE(T_6_16_5_10) AND NOT FIREABLE(T_2_10_0_9))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(T_12_10_5_4) AND NOT FIREABLE(T_14_18_10_7) AND NOT FIREABLE(T_6_16_5_10) AND NOT FIREABLE(T_2_10_0_9))))
lola: processed formula length: 125
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)sara: try reading problem file NQueens-PT-12-ReachabilityFireability-6-0.sara.

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(T_12_10_5_4) AND NOT FIREABLE(T_14_18_10_7) AND NOT FIREABLE(T_6_16_5_10) AND NOT FIREABLE(T_2_10_0_9))
lola: state equation: Generated DNF with 1024 literals and 256 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges

FORMULA NQueens-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T_13_5_3_1) OR ((NOT FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_9_13_5_7)) AND (NOT FIREABLE(T_19_15_11_3) OR NOT FIREABLE(T_16_18_11_6))))))
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(T_13_5_3_1) OR ((NOT FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_9_13_5_7)) AND (NOT FIREABLE(T_19_15_11_3) OR NOT FIREABLE(T_16_18_11_6))))))
lola: processed formula length: 162
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola:
FORMULA NQueens-PT-12-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T_18_10_8_1) OR FIREABLE(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8) OR NOT FIREABLE(T_15_19_11_7) OR NOT FIREABLE(T_6_14_4_9))))
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(T_18_10_8_1) OR FIREABLE(T_12_8_4_3) OR NOT FIREABLE(T_10_16_7_8) OR NOT FIREABLE(T_15_19_11_7) OR NOT FIREABLE(T_6_14_4_9))))
lola: processed formula length: 146
lola: 5 rewrites
lola: closed formula file NQueens-PT-12-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: lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
formula 0: (FIREABLE(T_13_5_3_1) AND ((FIREABLE(T_14_20_11_8) AND FIREABLE(T_9_13_5_7)) OR (FIREABLE(T_19_15_11_3) AND FIREABLE(T_16_18_11_6))))
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(T_18_10_8_1) AND NOT FIREABLE(T_12_8_4_3) AND FIREABLE(T_10_16_7_8) AND FIREABLE(T_15_19_11_7) AND FIREABLE(T_6_14_4_9))
state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-10-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file NQueens-PT-12-ReachabilityFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: Generated DNF with 168 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T_9_19_8_10) AND NOT FIREABLE(T_13_15_8_6) AND FIREABLE(T_7_13_4_8) AND (FIREABLE(T_11_23_11_11) OR (FIREABLE(T_8_16_6_9) AND FIREABLE(T_12_16_8_7))))))
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(T_9_19_8_10) AND NOT FIREABLE(T_13_15_8_6) AND FIREABLE(T_7_13_4_8) AND (FIREABLE(T_11_23_11_11) OR (FIREABLE(T_8_16_6_9) AND FIREABLE(T_12_16_8_7))))))
lola: processed formula length: 169
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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(T_9_19_8_10) AND NOT FIREABLE(T_13_15_8_6) AND FIREABLE(T_7_13_4_8) AND (FIREABLE(T_11_23_11_11) OR (FIREABLE(T_8_16_6_9) AND FIREABLE(T_12_16_8_7))))
lola: state equation: Generated DNF with 90 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NQueens-PT-12-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes

lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(T_7_15_5_9) AND NOT FIREABLE(T_11_5_2_2)) OR (NOT FIREABLE(T_8_10_3_6) AND NOT FIREABLE(T_12_2_1_0)) OR FIREABLE(T_17_9_7_1) OR FIREABLE(T_6_10_2_7))))
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(T_7_15_5_9) AND NOT FIREABLE(T_11_5_2_2)) OR (NOT FIREABLE(T_8_10_3_6) AND NOT FIREABLE(T_12_2_1_0)) OR FIREABLE(T_17_9_7_1) OR FIREABLE(T_6_10_2_7))))
lola: processed formula length: 175
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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: 0 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(T_10_10_4_5) OR (FIREABLE(T_15_15_9_5) AND FIREABLE(T_11_9_4_4))) AND (FIREABLE(T_14_12_7_4) OR FIREABLE(T_7_7_1_5) OR (FIREABLE(T_10_6_2_3) AND FIREABLE(T_12_18_9_8))) AND (NOT FIREABLE(T_7_9_2_6) OR NOT FIREABLE(T_8_10_3_6) OR FIREABLE(T_4_14_3_10)))))
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(T_10_10_4_5) OR (FIREABLE(T_15_15_9_5) AND FIREABLE(T_11_9_4_4))) AND (FIREABLE(T_14_12_7_4) OR FIREABLE(T_7_7_1_5) OR (FIREABLE(T_10_6_2_3) AND FIREABLE(T_12_18_9_8))) AND (NOT FIREABLE(T_7_9_2_6) OR NOT FIREABLE(T_8_10_3_6) OR FIREABLE(T_4_14_3_10)))))
lola: processed formula length: 280
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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(T_10_10_4_5) OR (FIREABLE(T_15_15_9_5) AND FIREABLE(T_11_9_4_4))) AND (FIREABLE(T_14_12_7_4) OR FIREABLE(T_7_7_1_5) OR (FIREABLE(T_10_6_2_3) AND FIREABLE(T_12_18_9_8))) AND (NOT FIREABLE(T_7_9_2_6) OR NOT FIREABLE(T_8_10_3_6) OR FIREABLE(T_4_14_3_10)))
lola: state equation: Generated DNF with 953 literals and 106 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file NQueens-PT-12-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-12-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(T_12_10_5_4) AND NOT FIREABLE(T_2_10_0_9)) OR (NOT FIREABLE(T_6_6_0_5) AND NOT FIREABLE(T_6_16_5_10))) AND (FIREABLE(T_14_10_6_3) OR FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_6_10_2_7) OR (FIREABLE(T_13_5_3_1) AND FIREABLE(T_18_12_9_2)) OR FIREABLE(T_13_15_8_6)))))
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(T_12_10_5_4) AND NOT FIREABLE(T_2_10_0_9)) OR (NOT FIREABLE(T_6_6_0_5) AND NOT FIREABLE(T_6_16_5_10))) AND (FIREABLE(T_14_10_6_3) OR FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_6_10_2_7) OR (FIREABLE(T_13_5_3_1) AND FIREABLE(T_18_12_9_2)) OR FIREABLE(T_13_15_8_6)))))
lola: processed formula length: 291
lola: 4 rewrites
lola: closed formula file NQueens-PT-12-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(T_12_10_5_4) AND NOT FIREABLE(T_2_10_0_9)) OR (NOT FIREABLE(T_6_6_0_5) AND NOT FIREABLE(T_6_16_5_10))) AND (FIREABLE(T_14_10_6_3) OR FIREABLE(T_14_20_11_8) OR NOT FIREABLE(T_6_10_2_7) OR (FIREABLE(T_13_5_3_1) AND FIREABLE(T_18_12_9_2)) OR FIREABLE(T_13_15_8_6)))
lola: state equation: Generated DNF with 1238 literals and 249 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-ReachabilityFireability-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola:
FORMULA NQueens-PT-12-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no yes yes yes no yes yes yes
lola:
preliminary result: no no no no yes no no no no yes yes yes no yes yes yes
========================================
lola: memory consumption: 14844 KB
lola: time consumption: 0 seconds


BK_TIME_CONFINEMENT_REACHED

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="NQueens-PT-12"
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/NQueens-PT-12.tgz
mv NQueens-PT-12 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 NQueens-PT-12, 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 r280-csrt-152749169800342"
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 ;