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 180K
-rw-r--r-- 1 mcc users 3.3K May 30 21:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 21:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 28 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 06:38 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 2.7K May 27 04:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 04:07 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 27K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NQueens-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800310
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527790037740

info: Time: 3600 - MCC
===========================================================================================
prep: translating NQueens-PT-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NQueens-PT-05 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ NQueens-PT-05 @ 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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1760
lola: finding significant places
lola: 55 places, 25 transitions, 25 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from NQueens-PT-05-CTLFireability.task
lola: E (G ((NOT(E (G (FIREABLE(T_8_5_4_0)))) OR A (X ((FIREABLE(T_8_5_4_0) OR FIREABLE(T_6_5_3_1))))))) : A (F ((NOT(E (F (FIREABLE(T_5_6_3_2)))) AND E (X ((FIREABLE(T_2_3_0_2) AND FIREABLE(T_8_5_4_0))))))) : E (G (E ((FIREABLE(T_2_7_2_4) U NOT FIREABLE(T_3_2_0_1))))) : NOT(A (F (E (G ((FIREABLE(T_4_9_4_4) AND FIREABLE(T_3_2_0_1))))))) : E (X (E (G ((FIREABLE(T_4_5_2_2) OR FIREABLE(T_8_5_4_0) OR NOT FIREABLE(T_4_7_3_3)))))) : A (F (((E (G (FIREABLE(T_6_3_2_0))) AND (FIREABLE(T_0_5_0_4) AND FIREABLE(T_3_4_1_2) AND NOT FIREABLE(T_4_5_2_2))) OR E (G (NOT FIREABLE(T_4_7_3_3)))))) : A (X (A (F (A (G (FIREABLE(T_5_8_4_3))))))) : (NOT(E (G (A (F (FIREABLE(T_6_7_4_2)))))) OR NOT(NOT((E (G (FIREABLE(T_3_6_2_3))) OR A (G (FIREABLE(T_3_8_3_4))))))) : NOT(A (F ((A (G (FIREABLE(T_5_4_2_1))) AND ((FIREABLE(T_3_6_2_3) OR FIREABLE(T_5_6_3_2)) AND (FIREABLE(T_3_6_2_3) OR FIREABLE(T_2_5_1_3))))))) : (E (G ((A (X (FIREABLE(T_5_2_1_0))) OR FIREABLE(T_4_9_4_4)))) AND (FIREABLE(T_3_6_2_3) AND E (F (((FIREABLE(T_4_5_2_2) OR FIREABLE(T_7_4_3_0)) AND FIREABLE(T_5_4_2_1)))))) : (A (F (FIREABLE(T_1_4_0_3))) AND E (G ((A (F (FIREABLE(T_1_4_0_3))) OR E (X (FIREABLE(T_5_6_3_2))))))) : ((A (G (FIREABLE(T_0_5_0_4))) AND NOT(A ((FIREABLE(T_5_2_1_0) U FIREABLE(T_6_7_4_2))))) AND (NOT((E (F (FIREABLE(T_5_4_2_1))) AND A (G (FIREABLE(T_7_4_3_0))))) AND A (X (E (F (FIREABLE(T_3_8_3_4))))))) : FIREABLE(T_4_5_2_2) : E (((FIREABLE(T_4_1_0_0) OR (NOT FIREABLE(T_1_4_0_3) AND NOT FIREABLE(T_1_6_1_4))) U NOT FIREABLE(T_1_4_0_3))) : (FIREABLE(T_3_4_1_2) AND FIREABLE(T_3_8_3_4) AND FIREABLE(T_8_5_4_0)) : FIREABLE(T_3_6_2_3)
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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_4_5_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_4_5_2_2)
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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-05-CTLFireability-12 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: (FIREABLE(T_3_4_1_2) AND FIREABLE(T_3_8_3_4) AND FIREABLE(T_8_5_4_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(T_3_4_1_2) AND FIREABLE(T_3_8_3_4) AND FIREABLE(T_8_5_4_0))
lola: processed formula length: 69
lola: 49 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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-05-CTLFireability-14 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: FIREABLE(T_3_6_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_3_6_2_3)
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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-05-CTLFireability-15 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: A (X (A (F (A (G (FIREABLE(T_5_8_4_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(A(TRUE U NOT(E(TRUE U NOT FIREABLE(T_5_8_4_3)))))
lola: processed formula length: 52
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 8 edges
lola:
FORMULA NQueens-PT-05-CTLFireability-6 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 (G ((A (X (FIREABLE(T_5_2_1_0))) OR FIREABLE(T_4_9_4_4)))) AND (FIREABLE(T_3_6_2_3) AND E (F (((FIREABLE(T_4_5_2_2) OR FIREABLE(T_7_4_3_0)) AND FIREABLE(T_5_4_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(T_3_6_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_3_6_2_3)
lola: processed formula length: 19
lola: 49 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T_4_5_2_2) OR FIREABLE(T_7_4_3_0)) AND FIREABLE(T_5_4_2_1))))
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_4_5_2_2) OR FIREABLE(T_7_4_3_0)) AND FIREABLE(T_5_4_2_1))))
lola: processed formula length: 79
lola: 50 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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_4_5_2_2) OR FIREABLE(T_7_4_3_0)) AND FIREABLE(T_5_4_2_1))
lola: state equation: Generated DNF with 16 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-05-CTLFireability-5-0.sara
lola: SUBRESULT
lola: state equation: calling and running sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X (FIREABLE(T_5_2_1_0))) OR FIREABLE(T_4_9_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(AX(FIREABLE(T_5_2_1_0))) AND NOT FIREABLE(T_4_9_4_4))))
lola: processed formula length: 73
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(T_1_4_0_3))) AND E (G ((A (F (FIREABLE(T_1_4_0_3))) OR E (X (FIREABLE(T_5_6_3_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(T_1_4_0_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_1_4_0_3)
lola: processed formula length: 23
lola: 51 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (FIREABLE(T_1_4_0_3))) OR E (X (FIREABLE(T_5_6_3_2))))))
lola: sara: try reading problem file NQueens-PT-05-CTLFireability-5-0.sara.
========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U FIREABLE(T_1_4_0_3))) AND NOT(EX(FIREABLE(T_5_6_3_2))))))
lola: processed formula length: 84
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 364 markings, 996 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-10 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 (G (FIREABLE(T_0_5_0_4))) AND (E ((NOT FIREABLE(T_5_2_1_0) R NOT FIREABLE(T_6_7_4_2))) AND ((A (G (NOT FIREABLE(T_5_4_2_1))) OR E (F (NOT FIREABLE(T_7_4_3_0)))) AND A (X (E (F (FIREABLE(T_3_8_3_4))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(T_7_4_3_0)))
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: sara: place or transition ordering is non-deterministic
processed formula: E (F (NOT FIREABLE(T_7_4_3_0)))
lola: processed formula length: 31
lola: 50 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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_7_4_3_0)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-05-CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T_0_5_0_4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(T_0_5_0_4)))
lola: processed formula length: 27
lola: 51 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: sara: try reading problem file NQueens-PT-05-CTLFireability-6-0.sara.
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_0_5_0_4)
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-05-CTLFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-11 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: E (G ((A (F (NOT FIREABLE(T_8_5_4_0))) OR A (X ((FIREABLE(T_8_5_4_0) OR FIREABLE(T_6_5_3_1)))))))
lola: ========================================
lola: SUBTASK
sara: place or transition ordering is non-deterministic
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U NOT FIREABLE(T_8_5_4_0))) AND NOT(AX((FIREABLE(T_8_5_4_0) OR FIREABLE(T_6_5_3_1)))))))
lola: processed formula length: 114
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 244 markings, 306 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================

lola: state equation: calling and running sara
sara: try reading problem file NQueens-PT-05-CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (NOT FIREABLE(T_5_6_3_2))) AND E (X ((FIREABLE(T_2_3_0_2) AND FIREABLE(T_8_5_4_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U (NOT(E(TRUE U FIREABLE(T_5_6_3_2))) AND EX((FIREABLE(T_2_3_0_2) AND FIREABLE(T_8_5_4_0)))))
lola: processed formula length: 100
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 9 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-1 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: E (X (E (G ((FIREABLE(T_4_5_2_2) OR FIREABLE(T_8_5_4_0) OR NOT FIREABLE(T_4_7_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (FIREABLE(T_4_5_2_2) OR FIREABLE(T_8_5_4_0) OR NOT FIREABLE(T_4_7_3_3))
lola: processed formula length: 73
lola: 50 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((FIREABLE(T_2_7_2_4) U NOT FIREABLE(T_3_2_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E(FIREABLE(T_2_7_2_4) U NOT FIREABLE(T_3_2_0_1)))))
lola: processed formula length: 68
lola: 51 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7 markings, 17 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((NOT FIREABLE(T_4_9_4_4) OR NOT FIREABLE(T_3_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NOT FIREABLE(T_4_9_4_4) OR NOT FIREABLE(T_3_2_0_1))))))
lola: processed formula length: 83
lola: 51 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 86 markings, 97 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-3 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: E (G ((E (F (NOT FIREABLE(T_5_4_2_1))) OR ((NOT FIREABLE(T_3_6_2_3) AND NOT FIREABLE(T_5_6_3_2)) OR (NOT FIREABLE(T_3_6_2_3) AND NOT FIREABLE(T_2_5_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U NOT FIREABLE(T_5_4_2_1))) AND ((FIREABLE(T_3_6_2_3) OR FIREABLE(T_5_6_3_2)) AND (FIREABLE(T_3_6_2_3) OR FIREABLE(T_2_5_1_3))))))
lola: processed formula length: 157
lola: 53 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 10 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-8 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 (((E (G (FIREABLE(T_6_3_2_0))) AND (FIREABLE(T_0_5_0_4) AND FIREABLE(T_3_4_1_2) AND NOT FIREABLE(T_4_5_2_2))) OR E (G (NOT FIREABLE(T_4_7_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U ((NOT(A(TRUE U NOT FIREABLE(T_6_3_2_0))) AND (FIREABLE(T_0_5_0_4) AND FIREABLE(T_3_4_1_2) AND NOT FIREABLE(T_4_5_2_2))) OR NOT(A(TRUE U FIREABLE(T_4_7_3_3)))))
lola: processed formula length: 168
lola: 54 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 375 markings, 1234 edges
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-5 TRUE 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: E (((FIREABLE(T_4_1_0_0) OR (NOT FIREABLE(T_1_4_0_3) AND NOT FIREABLE(T_1_6_1_4))) U NOT FIREABLE(T_1_4_0_3)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((FIREABLE(T_4_1_0_0) OR (NOT FIREABLE(T_1_4_0_3) AND NOT FIREABLE(T_1_6_1_4))) U NOT FIREABLE(T_1_4_0_3)))
lola: processed formula length: 111
lola: 52 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: NOT FIREABLE(T_1_4_0_3)
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-05-CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 2 markings, 1 edges

FORMULA NQueens-PT-05-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (NOT FIREABLE(T_6_7_4_2))))) OR (E (G (FIREABLE(T_3_6_2_3))) OR A (G (FIREABLE(T_3_8_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(T_3_8_3_4)))
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_3_8_3_4)))
lola: processed formula length: 27
lola: 51 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.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_3_8_3_4)
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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (NOT FIREABLE(T_6_7_4_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U NOT(A(TRUE U FIREABLE(T_6_7_4_2))))
lola: processed formula length: 44
lola: 52 rewrites
lola: closed formula file NQueens-PT-05-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 353 markings, 829 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NQueens-PT-05-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no yes yes yes no no yes yes yes yes
lola:
preliminary result: yes no yes yes yes yes no yes yes yes no no yes yes yes yes
lola: memory consumption: 14712 KB
lola: time consumption: 1 seconds

BK_STOP 1527790038149

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