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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169800336
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527790119703

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ 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-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= P_4_1)
lola: LP says that atomic proposition is always false: (2 <= P_11_9)
lola: LP says that atomic proposition is always false: (3 <= P_4_3)
lola: LP says that atomic proposition is always false: (2 <= P_5_7)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= L_23)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (2 <= P_11_8)
lola: LP says that atomic proposition is always false: (2 <= P_9_2)
lola: LP says that atomic proposition is always false: (3 <= P_10_5)
lola: LP says that atomic proposition is always false: (2 <= P_6_4)
lola: LP says that atomic proposition is always false: (2 <= P_9_0)
lola: LP says that atomic proposition is always false: (2 <= P_9_2)
lola: A (G (E (((P_10_9 <= P_11_7) U (P_4_1 <= R_13))))) : A (G ((((1 <= P_9_7) OR (P_4_2 + 1 <= R_5)) OR A (X ((P_0_3 <= cX_7)))))) : E (((1 <= P_10_5) U E (G ((P_1_8 <= P_0_2))))) : NOT((A (F (((1 <= P_6_6)))) OR E (X (())))) : NOT(A (F (E (G ((P_0_8 <= L_12)))))) : (A (F (A (G (FALSE)))) OR FALSE) : (E (X ((L_3 + 1 <= P_5_7))) OR E (X (A (X ((1 <= P_11_3)))))) : E (G (NOT(A (G (FALSE))))) : E (F (E (G ((P_7_10 <= R_11))))) : A (X (E (X (((1 <= P_4_1) OR (P_5_1 <= P_5_6)))))) : NOT(NOT((E (G ((P_3_1 <= P_1_10))) AND E (F ((P_6_6 <= L_1)))))) : ((A (F (((P_4_11 <= R_16) AND (L_18 <= P_2_2)))) AND E (X (TRUE))) AND A ((((L_5 <= L_4) AND (1 <= P_7_6)) U ((P_7_0 <= P_9_7))))) : A (F (NOT(A (F ((cY_0 <= L_5)))))) : E (G ((P_6_6 <= P_0_0))) : ((E (((1 <= R_18) U (L_18 <= P_2_11))) AND A (F (()))) AND (((P_3_10 <= 0) OR (L_0 + 1 <= P_4_10) OR ((cY_10 + 1 <= P_9_1) AND (P_6_2 <= 0))) OR (((P_8_9 + 1 <= L_1) OR (P_4_3 + 1 <= cX_9)) AND E (G ((P_6_2 <= cX_7)))))) : A (F (()))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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-CTLCardinality-5 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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-12-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 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: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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-CTLCardinality-14 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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-CTLCardinality-15 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: A (X (E (X (((1 <= P_4_1) OR (P_5_1 <= P_5_6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(EX(((1 <= P_4_1) OR (P_5_1 <= P_5_6))))
lola: processed formula length: 43
lola: 54 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-9 FALSE 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: (E (X ((L_3 + 1 <= P_5_7))) OR E (X (A (X ((1 <= P_11_3))))))
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: E (X ((L_3 + 1 <= P_5_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((L_3 + 1 <= P_5_7))
lola: processed formula length: 22
lola: 53 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((1 <= P_11_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(AX((1 <= P_11_3)))
lola: processed formula length: 21
lola: 54 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-6 TRUE 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 ((((1 <= P_9_7) OR (P_4_2 + 1 <= R_5)) OR A (X ((P_0_3 <= cX_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((P_9_7 <= 0) AND (R_5 <= P_4_2)) AND NOT(AX((P_0_3 <= cX_7))))))
lola: processed formula length: 79
lola: 56 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: 470954 markings, 2408464 edges, 94191 markings/sec, 0 secs
lola: 920741 markings, 4903868 edges, 89957 markings/sec, 5 secs
lola: 1346207 markings, 7369052 edges, 85093 markings/sec, 10 secs
lola: 1724204 markings, 9812941 edges, 75599 markings/sec, 15 secs
lola: 2058212 markings, 12073684 edges, 66802 markings/sec, 20 secs
lola: 2523848 markings, 14529852 edges, 93127 markings/sec, 25 secs
lola: 2926760 markings, 16840144 edges, 80582 markings/sec, 30 secs
lola: 3299461 markings, 19095922 edges, 74540 markings/sec, 35 secs
lola: 3598094 markings, 21303861 edges, 59727 markings/sec, 40 secs
lola: 3956099 markings, 23196793 edges, 71601 markings/sec, 45 secs
lola: 4281449 markings, 25044528 edges, 65070 markings/sec, 50 secs
lola: 4594395 markings, 26868221 edges, 62589 markings/sec, 55 secs
lola: 4865914 markings, 28672427 edges, 54304 markings/sec, 60 secs
lola: 5150072 markings, 30577096 edges, 56832 markings/sec, 65 secs
lola: 5572190 markings, 32860047 edges, 84424 markings/sec, 70 secs
lola: 5962908 markings, 35108418 edges, 78144 markings/sec, 75 secs
lola: 6290362 markings, 37303985 edges, 65491 markings/sec, 80 secs
lola: 6668767 markings, 39618845 edges, 75681 markings/sec, 85 secs
lola: 7081621 markings, 41961865 edges, 82571 markings/sec, 90 secs
lola: 7456395 markings, 44243812 edges, 74955 markings/sec, 95 secs
lola: 7775236 markings, 46465798 edges, 63768 markings/sec, 100 secs
lola: 8163445 markings, 48819252 edges, 77642 markings/sec, 105 secs
lola: 8563008 markings, 51182495 edges, 79913 markings/sec, 110 secs
lola: 8883683 markings, 53409846 edges, 64135 markings/sec, 115 secs
lola: 9294294 markings, 55768453 edges, 82122 markings/sec, 120 secs
lola: 9713368 markings, 58233704 edges, 83815 markings/sec, 125 secs
lola: 10091975 markings, 60633518 edges, 75721 markings/sec, 130 secs
lola: 10413740 markings, 62997653 edges, 64353 markings/sec, 135 secs
lola: 10829918 markings, 65367567 edges, 83236 markings/sec, 140 secs
lola: 11214071 markings, 67636809 edges, 76831 markings/sec, 145 secs
lola: 11526716 markings, 69843976 edges, 62529 markings/sec, 150 secs
lola: 11886103 markings, 72049025 edges, 71877 markings/sec, 155 secs
lola: 12265525 markings, 74298572 edges, 75884 markings/sec, 160 secs
lola: 12592694 markings, 76415670 edges, 65434 markings/sec, 165 secs
lola: 12885888 markings, 78558513 edges, 58639 markings/sec, 170 secs
lola: 13316056 markings, 80980182 edges, 86034 markings/sec, 175 secs
lola: 13719703 markings, 83336915 edges, 80729 markings/sec, 180 secs
lola: 14094455 markings, 85712634 edges, 74950 markings/sec, 185 secs
lola: 14415158 markings, 88148499 edges, 64141 markings/sec, 190 secs
lola: 14797265 markings, 90491097 edges, 76421 markings/sec, 195 secs
lola: 15100251 markings, 92751518 edges, 60597 markings/sec, 200 secs
lola: 15502891 markings, 95171689 edges, 80528 markings/sec, 205 secs
lola: 15863088 markings, 97528066 edges, 72039 markings/sec, 210 secs
lola: 16179675 markings, 99829611 edges, 63317 markings/sec, 215 secs
lola: 16548499 markings, 102083365 edges, 73765 markings/sec, 220 secs
lola: 16872552 markings, 104316616 edges, 64811 markings/sec, 225 secs
lola: 17200810 markings, 106648090 edges, 65652 markings/sec, 230 secs
lola: 17585929 markings, 109097644 edges, 77024 markings/sec, 235 secs
lola: 17900831 markings, 111411222 edges, 62980 markings/sec, 240 secs
lola: 18264193 markings, 113694994 edges, 72672 markings/sec, 245 secs
lola: 18575068 markings, 115913481 edges, 62175 markings/sec, 250 secs
lola: 18937515 markings, 118111905 edges, 72489 markings/sec, 255 secs
lola: 19247031 markings, 120245247 edges, 61903 markings/sec, 260 secs
lola: 19585896 markings, 122497935 edges, 67773 markings/sec, 265 secs
lola: 19927423 markings, 124736623 edges, 68305 markings/sec, 270 secs
lola: 20223880 markings, 126955321 edges, 59291 markings/sec, 275 secs
lola: 20571952 markings, 129357782 edges, 69614 markings/sec, 280 secs
lola: 20911240 markings, 131581732 edges, 67858 markings/sec, 285 secs
lola: 21223411 markings, 133822563 edges, 62434 markings/sec, 290 secs
lola: 21574717 markings, 136087092 edges, 70261 markings/sec, 295 secs
lola: 21875737 markings, 138306784 edges, 60204 markings/sec, 300 secs
lola: 22215084 markings, 140506324 edges, 67869 markings/sec, 305 secs
lola: 22489665 markings, 142550520 edges, 54916 markings/sec, 310 secs
lola: 22794424 markings, 144651585 edges, 60952 markings/sec, 315 secs
lola: 23084030 markings, 146768420 edges, 57921 markings/sec, 320 secs
lola: 23385081 markings, 148951509 edges, 60210 markings/sec, 325 secs
lola: 23718568 markings, 151235900 edges, 66697 markings/sec, 330 secs
lola: 24011764 markings, 153463507 edges, 58639 markings/sec, 335 secs
lola: 24310990 markings, 155776316 edges, 59845 markings/sec, 340 secs
lola: 24631765 markings, 158050555 edges, 64155 markings/sec, 345 secs
lola: 24915454 markings, 160187220 edges, 56738 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown no yes yes unknown no unknown unknown unknown unknown no no
lola: memory consumption: 2699100 KB
lola: time consumption: 357 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((P_6_6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((P_6_6 <= 0))))
lola: processed formula length: 22
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((P_7_10 <= R_11)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (P_7_10 <= R_11)
lola: processed formula length: 16
lola: 53 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((P_6_6 <= P_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((P_6_6 <= P_0_0)))
lola: processed formula length: 24
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((L_5 + 1 <= cY_0)))))
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 (cY_0 <= L_5))))
lola: processed formula length: 38
lola: 55 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: 21 markings, 32 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((L_12 + 1 <= P_0_8)))))
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 (L_12 + 1 <= P_0_8)))))
lola: processed formula length: 49
lola: 54 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: 11 markings, 11 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 803 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= P_10_5) U E (G ((P_1_8 <= P_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((1 <= P_10_5) U NOT(A(TRUE U (P_0_2 + 1 <= P_1_8))))
lola: processed formula length: 54
lola: 55 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: 11 markings, 11 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1071 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((P_10_9 <= P_11_7) U (P_4_1 <= R_13)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((P_10_9 <= P_11_7) U (P_4_1 <= R_13)))))
lola: processed formula length: 59
lola: 54 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: 265337 markings, 1633816 edges
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((P_3_1 <= P_1_10))) AND E (F ((P_6_6 <= L_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P_6_6 <= L_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 ((P_6_6 <= L_1)))
lola: processed formula length: 22
lola: 53 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: (P_6_6 <= L_1)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NQueens-PT-12-CTLCardinality-14-0.sara
lola: subprocess 15 will run for 3211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((P_3_1 <= P_1_10)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((P_3_1 <= P_1_10)))
lola: processed formula length: 25
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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 is possibly preserved.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((P_4_11 <= R_16) AND (L_18 <= P_2_2)))) AND (NOT DEADLOCK AND A ((((L_5 <= L_4) AND (1 <= P_7_6)) U ((P_7_0 <= P_9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: state equation: calling and running sara
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 ((((L_5 <= L_4) AND (1 <= P_7_6)) U ((P_7_0 <= P_9_7))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((L_5 <= L_4) AND (1 <= P_7_6)) U ((P_7_0 <= P_9_7))))
lola: processed formula length: 58
lola: 56 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= P_9_7) OR (P_4_2 + 1 <= R_5)) OR A (X ((P_0_3 <= cX_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (((P_9_7 <= 0) AND (R_5 <= P_4_2)) AND NOT(AX((P_0_3 <= cX_7))))))
lola: processed formula length: 79
lola: 56 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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).
sara: try reading problem file NQueens-PT-12-CTLCardinality-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: 509145 markings, 2617595 edges, 101829 markings/sec, 0 secs
lola: 994770 markings, 5318680 edges, 97125 markings/sec, 5 secs
lola: 1441315 markings, 7956377 edges, 89309 markings/sec, 10 secs
lola: 1816752 markings, 10478174 edges, 75087 markings/sec, 15 secs
lola: 2221787 markings, 12913102 edges, 81007 markings/sec, 20 secs
lola: 2698183 markings, 15530359 edges, 95279 markings/sec, 25 secs
lola: 3136487 markings, 18064213 edges, 87661 markings/sec, 30 secs
lola: 3512702 markings, 20548252 edges, 75243 markings/sec, 35 secs
lola: 3871673 markings, 22740879 edges, 71794 markings/sec, 40 secs
lola: 4235537 markings, 24780078 edges, 72773 markings/sec, 45 secs
lola: 4583368 markings, 26809208 edges, 69566 markings/sec, 50 secs
lola: 4876242 markings, 28747487 edges, 58575 markings/sec, 55 secs
lola: 5195249 markings, 30791486 edges, 63801 markings/sec, 60 secs
lola: 5639446 markings, 33244883 edges, 88839 markings/sec, 65 secs
lola: 6047715 markings, 35659897 edges, 81654 markings/sec, 70 secs
lola: 6371604 markings, 37967410 edges, 64778 markings/sec, 75 secs
lola: 6826236 markings, 40494152 edges, 90926 markings/sec, 80 secs
lola: 7257736 markings, 42999084 edges, 86300 markings/sec, 85 secs
lola: 7634813 markings, 45434078 edges, 75415 markings/sec, 90 secs
lola: 7994683 markings, 47862175 edges, 71974 markings/sec, 95 secs
lola: 8446227 markings, 50465825 edges, 90309 markings/sec, 100 secs
lola: 8807077 markings, 52829618 edges, 72170 markings/sec, 105 secs
lola: 9206152 markings, 55260333 edges, 79815 markings/sec, 110 secs
lola: 9627030 markings, 57731828 edges, 84176 markings/sec, 115 secs
lola: 10019382 markings, 60140301 edges, 78470 markings/sec, 120 secs
lola: 10339287 markings, 62456724 edges, 63981 markings/sec, 125 secs
lola: 10749054 markings, 64883165 edges, 81953 markings/sec, 130 secs
lola: 11164368 markings, 67328467 edges, 83063 markings/sec, 135 secs
lola: 11509569 markings, 69702941 edges, 69040 markings/sec, 140 secs
lola: 11889000 markings, 72063972 edges, 75886 markings/sec, 145 secs
lola: 12281434 markings, 74406191 edges, 78487 markings/sec, 150 secs
lola: 12627272 markings, 76652305 edges, 69168 markings/sec, 155 secs
lola: 12949436 markings, 78930394 edges, 64433 markings/sec, 160 secs
lola: 13398062 markings, 81449368 edges, 89725 markings/sec, 165 secs
lola: 13806845 markings, 83856389 edges, 81757 markings/sec, 170 secs
lola: 14178310 markings, 86253326 edges, 74293 markings/sec, 175 secs
lola: 14498774 markings, 88645413 edges, 64093 markings/sec, 180 secs
lola: 14854831 markings, 90886104 edges, 71211 markings/sec, 185 secs
lola: 15167095 markings, 93143155 edges, 62453 markings/sec, 190 secs
lola: 15560492 markings, 95520416 edges, 78679 markings/sec, 195 secs
lola: 15902620 markings, 97807256 edges, 68426 markings/sec, 200 secs
lola: 16236001 markings, 100140059 edges, 66676 markings/sec, 205 secs
lola: 16599779 markings, 102415745 edges, 72756 markings/sec, 210 secs
lola: 16914267 markings, 104623961 edges, 62898 markings/sec, 215 secs
lola: 17258364 markings, 106993605 edges, 68819 markings/sec, 220 secs
lola: 17627223 markings, 109389179 edges, 73772 markings/sec, 225 secs
lola: 17945712 markings, 111675680 edges, 63698 markings/sec, 230 secs
lola: 18300711 markings, 113945325 edges, 71000 markings/sec, 235 secs
lola: 18612903 markings, 116143939 edges, 62438 markings/sec, 240 secs
lola: 18968317 markings, 118301694 edges, 71083 markings/sec, 245 secs
lola: 19265824 markings, 120402277 edges, 59501 markings/sec, 250 secs
lola: 19609270 markings, 122658805 edges, 68689 markings/sec, 255 secs
lola: 19957825 markings, 124942432 edges, 69711 markings/sec, 260 secs
lola: 20240310 markings, 127140877 edges, 56497 markings/sec, 265 secs
lola: 20597232 markings, 129564949 edges, 71384 markings/sec, 270 secs
lola: 20946647 markings, 131821454 edges, 69883 markings/sec, 275 secs
lola: 21256231 markings, 134095116 edges, 61917 markings/sec, 280 secs
lola: 21612981 markings, 136349757 edges, 71350 markings/sec, 285 secs
lola: 21917767 markings, 138559293 edges, 60957 markings/sec, 290 secs
lola: 22267335 markings, 140867921 edges, 69914 markings/sec, 295 secs
lola: 22545240 markings, 143045265 edges, 55581 markings/sec, 300 secs
lola: 22888623 markings, 145299741 edges, 68677 markings/sec, 305 secs
lola: 23199435 markings, 147549957 edges, 62162 markings/sec, 310 secs
lola: 23489813 markings, 149688194 edges, 58076 markings/sec, 315 secs
lola: 23814919 markings, 151972396 edges, 65021 markings/sec, 320 secs
lola: 24103878 markings, 154086547 edges, 57792 markings/sec, 325 secs
lola: 24377971 markings, 156213453 edges, 54819 markings/sec, 330 secs
lola: 24666537 markings, 158361730 edges, 57713 markings/sec, 335 secs
lola: 24948209 markings, 160468253 edges, 56334 markings/sec, 340 secs
lola: 25259212 markings, 162613703 edges, 62201 markings/sec, 345 secs
lola: 25502449 markings, 164590608 edges, 48647 markings/sec, 350 secs
lola: 25759021 markings, 166602148 edges, 51314 markings/sec, 355 secs
lola: 26056598 markings, 168868450 edges, 59515 markings/sec, 360 secs
lola: 26322438 markings, 170942306 edges, 53168 markings/sec, 365 secs
lola: 26584342 markings, 173043538 edges, 52381 markings/sec, 370 secs
lola: 26854411 markings, 175189829 edges, 54014 markings/sec, 375 secs
lola: 27120453 markings, 177264739 edges, 53208 markings/sec, 380 secs
lola: 27379485 markings, 179292906 edges, 51806 markings/sec, 385 secs
lola: 27638060 markings, 181404315 edges, 51715 markings/sec, 390 secs
lola: 27887804 markings, 183481423 edges, 49949 markings/sec, 395 secs
lola: 28119730 markings, 185348843 edges, 46385 markings/sec, 400 secs
lola: 28349216 markings, 187292885 edges, 45897 markings/sec, 405 secs
lola: 28584711 markings, 189305647 edges, 47099 markings/sec, 410 secs
lola: 28795622 markings, 191259011 edges, 42182 markings/sec, 415 secs
lola: 29005172 markings, 193219322 edges, 41910 markings/sec, 420 secs
lola: 29208222 markings, 195218801 edges, 40610 markings/sec, 425 secs
lola: 29392768 markings, 197129881 edges, 36909 markings/sec, 430 secs
lola: 29551136 markings, 199052093 edges, 31674 markings/sec, 435 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 29587206 markings, 199503453 edges

FORMULA NQueens-PT-12-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F (((P_4_11 <= R_16) AND (L_18 <= P_2_2)))) AND (NOT DEADLOCK AND A ((((L_5 <= L_4) AND (1 <= P_7_6)) U ((P_7_0 <= P_9_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: lola: ========================================
========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 52 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: ========================================
lola: ...considering subproblem: A (F (((P_4_11 <= R_16) AND (L_18 <= P_2_2))))
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: ((R_16 + 1 <= P_4_11) OR (P_2_2 + 1 <= L_18))
lola: processed formula length: 46
lola: 54 rewrites
lola: closed formula file NQueens-PT-12-CTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NQueens-PT-12-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes yes yes no yes no no yes no no
lola:
preliminary result: no no yes yes no no yes yes yes no yes no no yes no no
lola: memory consumption: 23840 KB
lola: time consumption: 801 seconds

BK_STOP 1527790920254

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