Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r110-oct2-155272242100006.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is NQueens-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242100006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K Feb 11 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 06:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 06:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 60K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553031660933

info: Time: 3600 - MCC
===========================================================================================
prep: translating NQueens-PT-08 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating NQueens-PT-08 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ NQueens-PT-08 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 176/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 112
lola: finding significant places
lola: 112 places, 64 transitions, 64 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 65 transition conflict sets
lola: TASK
lola: reading formula from NQueens-PT-08-LTLFireability.task
lola: A (FIREABLE(T_8_6_3_2)) : A (F (G ((G (FIREABLE(T_4_4_0_3)) U G (FIREABLE(T_6_2_0_1)))))) : A ((F (X (X (FIREABLE(T_11_9_6_2)))) U F (G (G (FIREABLE(T_3_9_2_6)))))) : A (F ((F (G (FIREABLE(T_10_4_3_0))) U G (G (FIREABLE(T_10_6_4_1)))))) : A (FIREABLE(T_11_7_5_1)) : A (X ((X (X (FIREABLE(T_13_7_6_0))) U (FIREABLE(T_7_3_1_1) U FIREABLE(T_3_11_3_7))))) : A (G (G (G (FIREABLE(T_4_8_2_5))))) : A (F ((F (X (FIREABLE(T_8_8_4_3))) U FIREABLE(T_5_13_5_7)))) : A (FIREABLE(T_7_15_7_7)) : A (((G (FIREABLE(T_5_3_0_2)) U G (FIREABLE(T_5_9_3_5))) U F ((FIREABLE(T_9_9_5_3) U FIREABLE(T_7_7_3_3))))) : A (G (FIREABLE(T_7_3_1_1))) : A ((X (FIREABLE(T_13_7_6_0)) U FIREABLE(T_3_7_1_5))) : A (X ((G (FIREABLE(T_5_11_4_6)) U X (F (FIREABLE(T_8_12_6_5)))))) : A (X (FIREABLE(T_11_11_7_3))) : A (X ((G (G (FIREABLE(T_8_4_2_1))) U FIREABLE(T_10_8_5_2)))) : A (FIREABLE(T_14_8_7_0))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T_8_6_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_8_6_3_2)
lola: processed formula length: 19
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

lola: FORMULA NQueens-PT-08-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T_11_7_5_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_11_7_5_1)
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA NQueens-PT-08-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T_7_15_7_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_7_15_7_7)
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola:
========================================FORMULA NQueens-PT-08-LTLFireability-8 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: FIREABLE(T_14_8_7_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_14_8_7_0)
lola: processed formula length: 20
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA NQueens-PT-08-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (FIREABLE(T_13_7_6_0)) U FIREABLE(T_3_7_1_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(T_13_7_6_0)) U FIREABLE(T_3_7_1_5)))
lola: processed formula length: 52
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-11 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 (X ((X (F (FIREABLE(T_8_12_6_5))) OR (G (FIREABLE(T_5_11_4_6)) AND X (F (FIREABLE(T_8_12_6_5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F (FIREABLE(T_8_12_6_5))) OR (G (FIREABLE(T_5_11_4_6)) AND X (F (FIREABLE(T_8_12_6_5)))))))
lola: processed formula length: 101
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T_11_11_7_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(T_11_11_7_3)))
lola: processed formula length: 29
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(T_10_8_5_2) OR (G (FIREABLE(T_8_4_2_1)) AND F (FIREABLE(T_10_8_5_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(T_10_8_5_2) OR (G (FIREABLE(T_8_4_2_1)) AND F (FIREABLE(T_10_8_5_2))))))
lola: processed formula length: 88
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (X (FIREABLE(T_13_7_6_0))) U (FIREABLE(T_7_3_1_1) U FIREABLE(T_3_11_3_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (X (FIREABLE(T_13_7_6_0))) U (FIREABLE(T_7_3_1_1) U FIREABLE(T_3_11_3_7)))))
lola: processed formula length: 85
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T_7_3_1_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 (FIREABLE(T_7_3_1_1)))
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.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_7_3_1_1)
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-08-LTLFireability-9-0.sara
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T_4_8_2_5)))
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_4_8_2_5)))
lola: processed formula length: 27
lola: 25 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.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: formula 0: NOT FIREABLE(T_4_8_2_5)
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: 2 markings, 1 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T_5_13_5_7)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(T_5_13_5_7)
lola: processed formula length: 24
lola: 25 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T_7_7_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(T_7_7_3_3)
lola: processed formula length: 23
lola: 25 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(T_3_9_2_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(T_3_9_2_6))))
lola: processed formula length: 31
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((G (FIREABLE(T_6_2_0_1)) OR (G (FIREABLE(T_4_4_0_3)) AND F (G (FIREABLE(T_6_2_0_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((G (FIREABLE(T_6_2_0_1)) OR (G (FIREABLE(T_4_4_0_3)) AND F (G (FIREABLE(T_6_2_0_1))))))))
lola: processed formula length: 98
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 24 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (FIREABLE(T_10_6_4_1)) OR (F (G (FIREABLE(T_10_6_4_1))) AND F (G (FIREABLE(T_10_4_3_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (FIREABLE(T_10_6_4_1)) OR (F (G (FIREABLE(T_10_6_4_1))) AND F (G (FIREABLE(T_10_4_3_0)))))))
lola: processed formula length: 101
lola: 23 rewrites
lola: closed formula file NQueens-PT-08-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: ========================================

FORMULA NQueens-PT-08-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes yes yes no yes no no no yes
lola:
preliminary result: yes no no no yes no no yes yes yes no yes no no no yes
lola: memory consumption: 14668 KB
lola: time consumption: 0 seconds

BK_STOP 1553031661158

--------------------
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="NQueens-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is NQueens-PT-08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r110-oct2-155272242100006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;