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 376K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 195K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RwMutex-PT-r0100w0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100150
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526953320477

info: Time: 3600 - MCC
===========================================================================================
prep: translating RwMutex-PT-r0100w0010 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 RwMutex-PT-r0100w0010 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ RwMutex-PT-r0100w0010 @ 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: 540/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 320
lola: finding significant places
lola: 320 places, 220 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 211 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0100w0010-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p7)
lola: LP says that atomic proposition is always false: (3 <= p306)
lola: LP says that atomic proposition is always false: (2 <= p55)
lola: LP says that atomic proposition is always false: (2 <= p241)
lola: LP says that atomic proposition is always false: (3 <= p165)
lola: LP says that atomic proposition is always false: (3 <= p186)
lola: LP says that atomic proposition is always false: (3 <= p22)
lola: LP says that atomic proposition is always false: (3 <= p14)
lola: LP says that atomic proposition is always false: (3 <= p89)
lola: LP says that atomic proposition is always false: (3 <= p93)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p143)
lola: LP says that atomic proposition is always false: (2 <= p243)
lola: LP says that atomic proposition is always false: (2 <= p80)
lola: LP says that atomic proposition is always false: (2 <= p250)
lola: LP says that atomic proposition is always false: (3 <= p155)
lola: LP says that atomic proposition is always false: (2 <= p290)
lola: LP says that atomic proposition is always false: (3 <= p151)
lola: LP says that atomic proposition is always false: (2 <= p301)
lola: LP says that atomic proposition is always false: (3 <= p262)
lola: LP says that atomic proposition is always false: (2 <= p278)
lola: LP says that atomic proposition is always false: (2 <= p218)
lola: A (G ((FALSE OR E (X ((p9 <= p242)))))) : (A (G (A (X ((p132 <= p244))))) AND (p242 <= p41)) : ((E (F (FALSE)) OR (E (X (FALSE)) AND ())) OR A (G (()))) : NOT((E (((1 <= p64) U FALSE)) AND E (F (TRUE)))) : E (X (NOT(A (F ((p258 <= p256)))))) : E (G (E (F (FALSE)))) : A (X (E (F (())))) : (A (X (A (F ((1 <= p291))))) OR (p219 <= p168)) : E (G (E (((1 <= p34) U FALSE)))) : NOT(NOT(E ((TRUE U FALSE)))) : E (((1 <= p26) U ())) : (A (G (((p88 + 1 <= p62)))) OR E (F (E (G ((1 <= p138)))))) : NOT((() OR E (((p160 <= p200) U FALSE)))) : ((E (((p241 <= p218) U FALSE)) AND ((p78 <= p267) AND (p83 <= p302))) AND E (F (A (G (FALSE))))) : (NOT(((p52 + 1 <= p32) OR A (G ((p201 <= p81))))) AND E ((TRUE U ((p219 <= p51) AND (1 <= p84))))) : NOT(A (G (((p114 <= p122) OR (p79 <= p297)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-2 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-3 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: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-5 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: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 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: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-13 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 (E (X ((p9 <= p242)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p9 <= p242)))))
lola: processed formula length: 36
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: 480336 markings, 3120547 edges, 96067 markings/sec, 0 secs
lola: 914956 markings, 6295261 edges, 86924 markings/sec, 5 secs
lola: 1335390 markings, 9428131 edges, 84087 markings/sec, 10 secs
lola: 1766841 markings, 12478634 edges, 86290 markings/sec, 15 secs
lola: 2171302 markings, 15567497 edges, 80892 markings/sec, 20 secs
lola: 2558809 markings, 18565967 edges, 77501 markings/sec, 25 secs
lola: 2957811 markings, 21577113 edges, 79800 markings/sec, 30 secs
lola: 3397637 markings, 24645040 edges, 87965 markings/sec, 35 secs
lola: 3811014 markings, 27701675 edges, 82675 markings/sec, 40 secs
lola: 4256187 markings, 30776895 edges, 89035 markings/sec, 45 secs
lola: 4635417 markings, 33717131 edges, 75846 markings/sec, 50 secs
lola: 4981548 markings, 36517986 edges, 69226 markings/sec, 55 secs
lola: 5333141 markings, 39281014 edges, 70319 markings/sec, 60 secs
lola: 5683620 markings, 42016965 edges, 70096 markings/sec, 65 secs
lola: 6052707 markings, 44826383 edges, 73817 markings/sec, 70 secs
lola: 6424089 markings, 47697206 edges, 74276 markings/sec, 75 secs
lola: 6776116 markings, 50536269 edges, 70405 markings/sec, 80 secs
lola: 7109163 markings, 53276468 edges, 66609 markings/sec, 85 secs
lola: 7429536 markings, 55978268 edges, 64075 markings/sec, 90 secs
lola: 7765299 markings, 58765547 edges, 67153 markings/sec, 95 secs
lola: 8093140 markings, 61578500 edges, 65568 markings/sec, 100 secs
lola: 8441543 markings, 64277799 edges, 69681 markings/sec, 105 secs
lola: 8781165 markings, 67013429 edges, 67924 markings/sec, 110 secs
lola: 9104221 markings, 69799419 edges, 64611 markings/sec, 115 secs
lola: 9431249 markings, 72460531 edges, 65406 markings/sec, 120 secs
lola: 9752677 markings, 75150676 edges, 64286 markings/sec, 125 secs
lola: 10071915 markings, 77857505 edges, 63848 markings/sec, 130 secs
lola: 10351744 markings, 80223010 edges, 55966 markings/sec, 135 secs
lola: 10666019 markings, 82769534 edges, 62855 markings/sec, 140 secs
lola: 10949295 markings, 85301885 edges, 56655 markings/sec, 145 secs
lola: 11279905 markings, 87958581 edges, 66122 markings/sec, 150 secs
lola: 11673583 markings, 90860743 edges, 78736 markings/sec, 155 secs
lola: 12059390 markings, 93866177 edges, 77161 markings/sec, 160 secs
lola: 12385299 markings, 96484227 edges, 65182 markings/sec, 165 secs
lola: 12680217 markings, 99071384 edges, 58984 markings/sec, 170 secs
lola: 13000877 markings, 101659687 edges, 64132 markings/sec, 175 secs
lola: 13292077 markings, 104115526 edges, 58240 markings/sec, 180 secs
lola: 13588495 markings, 106594709 edges, 59284 markings/sec, 185 secs
lola: 13927104 markings, 109243952 edges, 67722 markings/sec, 190 secs
lola: 14282379 markings, 111977682 edges, 71055 markings/sec, 195 secs
lola: 14674561 markings, 114939159 edges, 78436 markings/sec, 200 secs
lola: 15032890 markings, 117713504 edges, 71666 markings/sec, 205 secs
lola: 15363151 markings, 120375121 edges, 66052 markings/sec, 210 secs
lola: 15714877 markings, 123086800 edges, 70345 markings/sec, 215 secs
lola: 16082256 markings, 125866085 edges, 73476 markings/sec, 220 secs
lola: 16486871 markings, 128813107 edges, 80923 markings/sec, 225 secs
lola: 16855538 markings, 131666167 edges, 73733 markings/sec, 230 secs
lola: 17180841 markings, 134376390 edges, 65061 markings/sec, 235 secs
lola: 17511217 markings, 137102825 edges, 66075 markings/sec, 240 secs
lola: 17586472 markings, 137722863 edges, 15051 markings/sec, 245 secs
lola: 17593065 markings, 137770471 edges, 1319 markings/sec, 250 secs
lola: 17596290 markings, 137795750 edges, 645 markings/sec, 255 secs
lola: 17596315 markings, 137795962 edges, 5 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((p132 <= p244))))) AND (p242 <= p41))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p242 <= p41)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p242 <= p41)
lola: processed formula length: 13
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.task
lola: processed formula with 1 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 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p132 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p244 + 1 <= p132)
lola: processed formula length: 18
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= p291))))) OR (p219 <= p168))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p219 <= p168)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p219 <= p168)
lola: processed formula length: 14
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p291)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p291 <= 0)
lola: processed formula length: 11
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.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: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p256 + 1 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (p256 + 1 <= p258)
lola: processed formula length: 18
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.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: 2 markings, 2 edges
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p122 + 1 <= p114) AND (p297 + 1 <= p79))))
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 (((p122 + 1 <= p114) AND (p297 + 1 <= p79))))
lola: processed formula length: 50
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: ((p122 + 1 <= p114) AND (p297 + 1 <= p79))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p32 <= p52) AND (E (F ((p81 + 1 <= p201))) AND E (F (((p219 <= p51) AND (1 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p32 <= p52)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p32 <= p52)
lola: processed formula length: 12
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 3297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p81 + 1 <= p201)))
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 ((p81 + 1 <= p201)))
lola: processed formula length: 25
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: (p81 + 1 <= p201)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-CTLCardinality-15-0.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p88 + 1 <= p62)))) OR E (F (E (G ((1 <= p138))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p88 + 1 <= p62))))
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 (((p88 + 1 <= p62))))
lola: processed formula length: 26
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p62 <= p88))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p9 <= p242)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((p9 <= p242)))))
lola: processed formula length: 36
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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 RwMutex-PT-r0100w0010-CTLCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: 468296 markings, 3027788 edges, 93659 markings/sec, 0 secs
lola: 899768 markings, 6167485 edges, 86294 markings/sec, 5 secs
lola: 1309524 markings, 9243677 edges, 81951 markings/sec, 10 secs
lola: 1730543 markings, 12215746 edges, 84204 markings/sec, 15 secs
lola: 2128379 markings, 15236995 edges, 79567 markings/sec, 20 secs
lola: 2508691 markings, 18173323 edges, 76062 markings/sec, 25 secs
lola: 2882596 markings, 21090807 edges, 74781 markings/sec, 30 secs
lola: 3321556 markings, 24105393 edges, 87792 markings/sec, 35 secs
lola: 3724770 markings, 27087265 edges, 80643 markings/sec, 40 secs
lola: 4161225 markings, 30102656 edges, 87291 markings/sec, 45 secs
lola: 4548066 markings, 33016071 edges, 77368 markings/sec, 50 secs
lola: 4880822 markings, 35729844 edges, 66551 markings/sec, 55 secs
lola: 5235324 markings, 38439041 edges, 70900 markings/sec, 60 secs
lola: 5564896 markings, 41113908 edges, 65914 markings/sec, 65 secs
lola: 5913744 markings, 43790662 edges, 69770 markings/sec, 70 secs
lola: 6270310 markings, 46507766 edges, 71313 markings/sec, 75 secs
lola: 6630920 markings, 49333852 edges, 72122 markings/sec, 80 secs
lola: 6958079 markings, 52027805 edges, 65432 markings/sec, 85 secs
lola: 7268055 markings, 54614969 edges, 61995 markings/sec, 90 secs
lola: 7594945 markings, 57322585 edges, 65378 markings/sec, 95 secs
lola: 7912858 markings, 60021011 edges, 63583 markings/sec, 100 secs
lola: 8252070 markings, 62763691 edges, 67842 markings/sec, 105 secs
lola: 8566772 markings, 65300377 edges, 62940 markings/sec, 110 secs
lola: 8896650 markings, 67994037 edges, 65976 markings/sec, 115 secs
lola: 9211739 markings, 70680802 edges, 63018 markings/sec, 120 secs
lola: 9519577 markings, 73211360 edges, 61568 markings/sec, 125 secs
lola: 9838165 markings, 75866395 edges, 63718 markings/sec, 130 secs
lola: 10146157 markings, 78507014 edges, 61598 markings/sec, 135 secs
lola: 10465998 markings, 81160553 edges, 63968 markings/sec, 140 secs
lola: 10789444 markings, 83840241 edges, 64689 markings/sec, 145 secs
lola: 11105709 markings, 86590583 edges, 63253 markings/sec, 150 secs
lola: 11460471 markings, 89386245 edges, 70952 markings/sec, 155 secs
lola: 11885320 markings, 92466489 edges, 84970 markings/sec, 160 secs
lola: 12243151 markings, 95365422 edges, 71566 markings/sec, 165 secs
lola: 12559613 markings, 98012095 edges, 63292 markings/sec, 170 secs
lola: 12891773 markings, 100699022 edges, 66432 markings/sec, 175 secs
lola: 13197892 markings, 103338427 edges, 61224 markings/sec, 180 secs
lola: 13512468 markings, 105926538 edges, 62915 markings/sec, 185 secs
lola: 13838835 markings, 108557870 edges, 65273 markings/sec, 190 secs
lola: 14193584 markings, 111327847 edges, 70950 markings/sec, 195 secs
lola: 14592103 markings, 114272018 edges, 79704 markings/sec, 200 secs
lola: 14956739 markings, 117182266 edges, 72927 markings/sec, 205 secs
lola: 15297472 markings, 119840441 edges, 68147 markings/sec, 210 secs
lola: 15639602 markings, 122518606 edges, 68426 markings/sec, 215 secs
lola: 16004686 markings, 125247912 edges, 73017 markings/sec, 220 secs
lola: 16392555 markings, 128137655 edges, 77574 markings/sec, 225 secs
lola: 16771853 markings, 131045827 edges, 75860 markings/sec, 230 secs
lola: 17115063 markings, 133828481 edges, 68642 markings/sec, 235 secs
lola: 17454406 markings, 136636904 edges, 67869 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((p32 <= p52) AND (E (F ((p81 + 1 <= p201))) AND E (F (((p219 <= p51) AND (1 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p32 <= p52)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p32 <= p52)
lola: processed formula length: 12
lola: 77 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-CTLCardinality.task
lola: processed formula with 1 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: E (F ((p81 + 1 <= p201)))
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 ((p81 + 1 <= p201)))
lola: processed formula length: 25
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: formula 0: (p81 + 1 <= p201)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((p219 <= p51) AND (1 <= p84))))
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 (((p219 <= p51) AND (1 <= p84))))
lola: processed formula length: 38
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (G (((p88 + 1 <= p62)))) OR E (F (E (G ((1 <= p138))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((p88 + 1 <= p62))))
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 (((p88 + 1 <= p62))))
lola: processed formula length: 26
lola: 79 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p62 <= p88))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= p138)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (1 <= p138)
lola: processed formula length: 11
lola: 78 rewrites
lola: closed formula file RwMutex-PT-r0100w0010-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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RwMutex-PT-r0100w0010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown no yes yes yes no no no no no no yes yes no yes yes
lola:
preliminary result: unknown no yes yes yes no no no no no no yes yes no yes yes
lola: memory consumption: 23944 KB
lola: time consumption: 521 seconds

BK_STOP 1526953841940

--------------------
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="RwMutex-PT-r0100w0010"
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/RwMutex-PT-r0100w0010.tgz
mv RwMutex-PT-r0100w0010 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 RwMutex-PT-r0100w0010, 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 r148-smll-152685547100150"
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 ;