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 172K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SwimmingPool-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512700255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527320073746

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-07 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-07 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SwimmingPool-PT-07 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-07-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: E (F (((2 <= Entered) AND (Undress <= Entered) AND (Out + 1 <= Dress) AND ((3 <= WaitBag) OR (1 <= Cabins) OR ((1 <= Cabins) AND (Dressed <= InBath)))))) : E (G (A (G ((3 <= Bags))))) : A (G (((1 <= Dress) OR (WaitBag <= Out) OR ((2 <= Dressed) AND (2 <= Cabins)) OR (3 <= Entered)))) : A (F (E (F (((Out <= Dress) AND (2 <= WaitBag)))))) : A (G ((2 <= Out))) : A (G ((E (F ((3 <= Cabins))) OR A (X ((1 <= Undress)))))) : E (((((1 <= Out)) AND ((1 <= InBath) OR (2 <= Out))) U ((Out <= 2) OR (Out + 1 <= Dress)))) : E ((((Undress <= Bags) AND ((Cabins <= Bags) OR (3 <= Dress))) U A (G (TRUE)))) : (E (((Undress <= 0) U ((1 <= Dressed) AND (3 <= Dressed)))) AND E (F (E (X ((2 <= Dress)))))) : ((A (G ((2 <= Cabins))) AND (E (X ((1 <= Out))) OR ((1 <= Entered)))) AND (Dress <= 1)) : (((A (F ((3 <= Dress))) AND A (X ((3 <= WaitBag)))) AND E (((3 <= Dress) U (1 <= WaitBag)))) OR A (G (((Out <= Undress) OR (2 <= Cabins) OR ((Out <= Dress)))))) : A (F (E (X (((1 <= InBath) OR (Cabins <= InBath)))))) : E (G (((Undress <= InBath) AND (Dress <= WaitBag)))) : A (F ((1 <= WaitBag))) : NOT(A (X (E (F ((Cabins <= Entered)))))) : ((Dressed <= WaitBag) AND ((E (G ((Undress <= InBath))) AND E (G (TRUE))) AND ((Cabins + 1 <= Bags) OR (Undress <= Entered) OR ((3 <= Undress) AND (2 <= InBath)) OR ((1 <= Out) AND (2 <= Out)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:449
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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 SwimmingPool-PT-07-CTLCardinality-7 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: A (G ((E (F ((3 <= Cabins))) OR A (X ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
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: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (3 <= Cabins))) AND NOT(AX((1 <= Undress))))))
lola: processed formula length: 73
lola: 23 rewrites
lola: closed formula file SwimmingPool-PT-07-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: 1722130 markings, 6837330 edges, 344426 markings/sec, 0 secs
lola: 3216452 markings, 13133133 edges, 298864 markings/sec, 5 secs
lola: 4591691 markings, 19051683 edges, 275048 markings/sec, 10 secs
lola: 5898190 markings, 24744381 edges, 261300 markings/sec, 15 secs
lola: 7160045 markings, 30264405 edges, 252371 markings/sec, 20 secs
lola: 8395506 markings, 35678383 edges, 247092 markings/sec, 25 secs
lola: 9601498 markings, 40999479 edges, 241198 markings/sec, 30 secs
lola: 10781387 markings, 46233127 edges, 235978 markings/sec, 35 secs
lola: 11935646 markings, 51389696 edges, 230852 markings/sec, 40 secs
lola: 13069804 markings, 56472851 edges, 226832 markings/sec, 45 secs
lola: 14188936 markings, 61494983 edges, 223826 markings/sec, 50 secs
lola: 15298041 markings, 66482278 edges, 221821 markings/sec, 55 secs
lola: 16394497 markings, 71422986 edges, 219291 markings/sec, 60 secs
lola: 17484515 markings, 76318022 edges, 218004 markings/sec, 65 secs
lola: 18560042 markings, 81172307 edges, 215105 markings/sec, 70 secs
lola: 19627576 markings, 85995831 edges, 213507 markings/sec, 75 secs
lola: 20684295 markings, 90773723 edges, 211344 markings/sec, 80 secs
lola: 21733137 markings, 95535723 edges, 209768 markings/sec, 85 secs
lola: 22776494 markings, 100265235 edges, 208671 markings/sec, 90 secs
lola: 23805329 markings, 104949974 edges, 205767 markings/sec, 95 secs
lola: 24833048 markings, 109630005 edges, 205544 markings/sec, 100 secs
lola: 25855085 markings, 114283172 edges, 204407 markings/sec, 105 secs
lola: 26872459 markings, 118926392 edges, 203475 markings/sec, 110 secs
lola: 27877302 markings, 123514137 edges, 200969 markings/sec, 115 secs
lola: 28876433 markings, 128084359 edges, 199826 markings/sec, 120 secs
lola: 29874819 markings, 132643746 edges, 199677 markings/sec, 125 secs
lola: 30862109 markings, 137171175 edges, 197458 markings/sec, 130 secs
lola: 31843598 markings, 141679315 edges, 196298 markings/sec, 135 secs
lola: 32828135 markings, 146182343 edges, 196907 markings/sec, 140 secs
lola: 33808929 markings, 150672212 edges, 196159 markings/sec, 145 secs
lola: 34773761 markings, 155103110 edges, 192966 markings/sec, 150 secs
lola: 35734236 markings, 159525531 edges, 192095 markings/sec, 155 secs
lola: 36696846 markings, 163950980 edges, 192522 markings/sec, 160 secs
lola: 37649222 markings, 168341231 edges, 190475 markings/sec, 165 secs
lola: 38601533 markings, 172732347 edges, 190462 markings/sec, 170 secs
lola: 39548265 markings, 177097052 edges, 189346 markings/sec, 175 secs
lola: 40484982 markings, 181430015 edges, 187343 markings/sec, 180 secs
lola: 41430200 markings, 185792118 edges, 189044 markings/sec, 185 secs
lola: 42361727 markings, 190096619 edges, 186305 markings/sec, 190 secs
lola: 43290241 markings, 194394847 edges, 185703 markings/sec, 195 secs
lola: 44219004 markings, 198686610 edges, 185753 markings/sec, 200 secs
lola: 45141477 markings, 202966163 edges, 184495 markings/sec, 205 secs
lola: 46065646 markings, 207240275 edges, 184834 markings/sec, 210 secs
lola: 46978382 markings, 211487247 edges, 182547 markings/sec, 215 secs
lola: 47899437 markings, 215752955 edges, 184211 markings/sec, 220 secs
lola: 48817733 markings, 220006198 edges, 183659 markings/sec, 225 secs
lola: 49731436 markings, 224243830 edges, 182741 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 7069940 KB
lola: time consumption: 238 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((Undress <= 0) U ((1 <= Dressed) AND (3 <= Dressed)))) AND E (X (E (F ((2 <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((Undress <= 0) U ((1 <= Dressed) AND (3 <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((Undress <= 0) U ((1 <= Dressed) AND (3 <= Dressed))))
lola: processed formula length: 58
lola: 22 rewrites
lola: closed formula file SwimmingPool-PT-07-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((1 <= Dressed) AND (3 <= Dressed))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SwimmingPool-PT-07-CTLCardinality-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 7526 markings, 14840 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= Cabins))) AND ((E (X ((1 <= Out))) OR ((1 <= Entered))) AND (Dress <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Dress <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dress <= 1)
lola: processed formula length: 12
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Cabins)))
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 ((2 <= Cabins)))
lola: processed formula length: 21
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: (Cabins <= 1)
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: 139 markings, 138 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-4-0.sara

FORMULA SwimmingPool-PT-07-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((3 <= Dress))) AND (A (X ((3 <= WaitBag))) AND E (((3 <= Dress) U (1 <= WaitBag))))) OR A (G (((Out <= Undress) OR (2 <= Cabins) OR ((Out <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= Dress)))
sara: try reading problem file SwimmingPool-PT-07-CTLCardinality-4-0.sara.
lola: ========================================
lola: SUBTASK
lola: sara: place or transition ordering is non-deterministic
checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Dress <= 2)
lola:
processed formula length: 12
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: 146 markings, 146 edges
lola: lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: A (G (((Out <= Undress) OR (2 <= Cabins) OR ((Out <= Dress)))))
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 (((Out <= Undress) OR (2 <= Cabins) OR ((Out <= Dress)))))
lola: processed formula length: 65
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: ((Undress + 1 <= Out) AND (Cabins <= 1) AND ((Dress + 1 <= Out)))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 139 markings, 138 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-5-0.sara
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (((1 <= InBath) OR (Cabins <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX(((1 <= InBath) OR (Cabins <= InBath))))
lola: processed formula length: 52
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14698 markings, 21872 edges
lola:
FORMULA SwimmingPool-PT-07-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((Entered + 1 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: EX(NOT(E(TRUE U (Cabins <= Entered))))
lola: processed formula length: 38
lola: 22 rewrites
lola: closed formula file SwimmingPool-PT-07-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 70 markings, 69 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Out)))
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 ((2 <= Out)))
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: (Out <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 140 markings, 139 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Bags)))
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 ((3 <= Bags)))
lola: processed formula length: 19
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: (Bags <= 2)
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: 343 markings, 342 edges
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-8-0.sara

FORMULA SwimmingPool-PT-07-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Out <= Dress) AND (2 <= WaitBag))))
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 (((Out <= Dress) AND (2 <= WaitBag))))
lola: processed formula length: 43
lola: 20 rewrites
lola: closed formula file SwimmingPool-PT-07-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: ((Out <= Dress) AND (2 <= WaitBag))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 143 markings, 142 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Dress) OR (WaitBag <= Out) OR ((2 <= Dressed) AND (2 <= Cabins)) OR (3 <= Entered))))
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 (((1 <= Dress) OR (WaitBag <= Out) OR ((2 <= Dressed) AND (2 <= Cabins)) OR (3 <= Entered))))
lola: processed formula length: 101
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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: ((Dress <= 0) AND (Out + 1 <= WaitBag) AND ((Dressed <= 1) OR (Cabins <= 1)) AND (Entered <= 2))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 142 markings, 141 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Entered) AND (Undress <= Entered) AND (Out + 1 <= Dress) AND ((3 <= WaitBag) OR (1 <= Cabins) OR ((1 <= Cabins) AND (Dressed <= InBath))))))
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 (((2 <= Entered) AND (Undress <= Entered) AND (Out + 1 <= Dress) AND ((3 <= WaitBag) OR (1 <= Cabins) OR ((1 <= Cabins) AND (Dressed <= InBath))))))
lola: processed formula length: 155
lola: 20 rewrites
lola: closed formula file SwimmingPool-PT-07-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: ((2 <= Entered) AND (Undress <= Entered) AND (Out + 1 <= Dress) AND ((3 <= WaitBag) OR (1 <= Cabins) OR ((1 <= Cabins) AND (Dressed <= InBath))))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
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: (WaitBag <= 0)
lola: processed formula length: 14
lola: 21 rewrites
lola: closed formula file SwimmingPool-PT-07-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 eventually occurs.
lola: 141 markings, 140 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1110 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((Undress <= InBath) AND (Dress <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((Undress <= InBath) AND (Dress <= WaitBag))))
lola: processed formula length: 52
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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 is not possibly preserved.
lola: 211 markings, 210 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= Out)) AND ((1 <= InBath) OR (2 <= Out))) U ((Out <= 2) OR (Out + 1 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((((1 <= Out)) AND ((1 <= InBath) OR (2 <= Out))) U ((Out <= 2) OR (Out + 1 <= Dress))))
lola: processed formula length: 93
lola: 22 rewrites
lola: closed formula file SwimmingPool-PT-07-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((Out <= 2) OR (Out + 1 <= Dress))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-07-CTLCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 138 markings, 137 edges
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Dressed <= WaitBag) AND (E (G ((Undress <= InBath))) AND ((Cabins + 1 <= Bags) OR (Undress <= Entered) OR ((3 <= Undress) AND (2 <= InBath)) OR ((1 <= Out) AND (2 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Dressed <= WaitBag)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= WaitBag)
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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: 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: ((Cabins + 1 <= Bags) OR (Undress <= Entered) OR ((3 <= Undress) AND (2 <= InBath)) OR ((1 <= Out) AND (2 <= Out)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Cabins + 1 <= Bags) OR (Undress <= Entered) OR ((3 <= Undress) AND (2 <= InBath)) OR ((1 <= Out) AND (2 <= Out)))
lola: processed formula length: 118
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-CTLCardinality.task
lola: processed formula with 6 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((3 <= Cabins))) OR A (X ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
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: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (3 <= Cabins))) AND NOT(AX((1 <= Undress))))))
lola: processed formula length: 73
lola: 23 rewrites
lola: closed formula file SwimmingPool-PT-07-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: 1608988 markings, 6367647 edges, 321798 markings/sec, 0 secs
lola: 2944395 markings, 11973597 edges, 267081 markings/sec, 5 secs
lola: 4145853 markings, 17117475 edges, 240292 markings/sec, 10 secs
lola: 5275619 markings, 22034669 edges, 225953 markings/sec, 15 secs
lola: 6363536 markings, 26780922 edges, 217583 markings/sec, 20 secs
lola: 7421916 markings, 31408273 edges, 211676 markings/sec, 25 secs
lola: 8453051 markings, 35931057 edges, 206227 markings/sec, 30 secs
lola: 9463985 markings, 40388511 edges, 202187 markings/sec, 35 secs
lola: 10454619 markings, 44780073 edges, 198127 markings/sec, 40 secs
lola: 11420593 markings, 49090226 edges, 193195 markings/sec, 45 secs
lola: 12376079 markings, 53356766 edges, 191097 markings/sec, 50 secs
lola: 13305808 markings, 57534782 edges, 185946 markings/sec, 55 secs
lola: 14233930 markings, 61695343 edges, 185624 markings/sec, 60 secs
lola: 15151294 markings, 65817560 edges, 183473 markings/sec, 65 secs
lola: 16053717 markings, 69886991 edges, 180485 markings/sec, 70 secs
lola: 16956766 markings, 73944011 edges, 180610 markings/sec, 75 secs
lola: 17849317 markings, 77963275 edges, 178510 markings/sec, 80 secs
lola: 18727850 markings, 81929604 edges, 175707 markings/sec, 85 secs
lola: 19602805 markings, 85884007 edges, 174991 markings/sec, 90 secs
lola: 20471204 markings, 89801945 edges, 173680 markings/sec, 95 secs
lola: 21330281 markings, 93706103 edges, 171815 markings/sec, 100 secs
lola: 22187577 markings, 97591415 edges, 171459 markings/sec, 105 secs
lola: 23035642 markings, 101441666 edges, 169613 markings/sec, 110 secs
lola: 23872472 markings, 105254737 edges, 167366 markings/sec, 115 secs
lola: 24710071 markings, 109071308 edges, 167520 markings/sec, 120 secs
lola: 25543601 markings, 112858008 edges, 166706 markings/sec, 125 secs
lola: 26369722 markings, 116633121 edges, 165224 markings/sec, 130 secs
lola: 27194617 markings, 120396564 edges, 164979 markings/sec, 135 secs
lola: 28007530 markings, 124108331 edges, 162583 markings/sec, 140 secs
lola: 28817940 markings, 127818415 edges, 162082 markings/sec, 145 secs
lola: 29627506 markings, 131513455 edges, 161913 markings/sec, 150 secs
lola: 30431587 markings, 135199924 edges, 160816 markings/sec, 155 secs
lola: 31233179 markings, 138871401 edges, 160318 markings/sec, 160 secs
lola: 32024431 markings, 142507329 edges, 158250 markings/sec, 165 secs
lola: 32822632 markings, 146157055 edges, 159640 markings/sec, 170 secs
lola: 33617298 markings, 149796017 edges, 158933 markings/sec, 175 secs
lola: 34400449 markings, 153390453 edges, 156630 markings/sec, 180 secs
lola: 35184831 markings, 156995501 edges, 156876 markings/sec, 185 secs
lola: 35964827 markings, 160579994 edges, 155999 markings/sec, 190 secs
lola: 36740481 markings, 164150640 edges, 155131 markings/sec, 195 secs
lola: 37509669 markings, 167697843 edges, 153838 markings/sec, 200 secs
lola: 38280869 markings, 171247476 edges, 154240 markings/sec, 205 secs
lola: 39046359 markings, 174782154 edges, 153098 markings/sec, 210 secs
lola: 39807531 markings, 178297923 edges, 152234 markings/sec, 215 secs
lola: 40562392 markings, 181789082 edges, 150972 markings/sec, 220 secs
lola: 41327532 markings, 185320117 edges, 153028 markings/sec, 225 secs
lola: 42080273 markings, 188799966 edges, 150548 markings/sec, 230 secs
lola: 42831287 markings, 192269771 edges, 150203 markings/sec, 235 secs
lola: 43563024 markings, 195659043 edges, 146347 markings/sec, 240 secs
lola: 44504711 markings, 200012517 edges, 188337 markings/sec, 245 secs
lola: 45447612 markings, 204377652 edges, 188580 markings/sec, 250 secs
lola: 46376683 markings, 208685601 edges, 185814 markings/sec, 255 secs
lola: 47307132 markings, 213008407 edges, 186090 markings/sec, 260 secs
lola: 48239410 markings, 217331089 edges, 186456 markings/sec, 265 secs
lola: 49172906 markings, 221650612 edges, 186699 markings/sec, 270 secs
lola: 50093904 markings, 225931649 edges, 184200 markings/sec, 275 secs
lola: 51006438 markings, 230169591 edges, 182507 markings/sec, 280 secs
lola: 51914478 markings, 234391520 edges, 181608 markings/sec, 285 secs
lola: 52825228 markings, 238625799 edges, 182150 markings/sec, 290 secs
lola: 53740956 markings, 242871386 edges, 183146 markings/sec, 295 secs
lola: 54642995 markings, 247065826 edges, 180408 markings/sec, 300 secs
lola: 55539641 markings, 251238550 edges, 179329 markings/sec, 305 secs
lola: 56447187 markings, 255451956 edges, 181509 markings/sec, 310 secs
lola: 57344463 markings, 259636112 edges, 179455 markings/sec, 315 secs
lola: 58243105 markings, 263816199 edges, 179728 markings/sec, 320 secs
lola: 59148788 markings, 268021097 edges, 181137 markings/sec, 325 secs
lola: 60050682 markings, 272211218 edges, 180379 markings/sec, 330 secs
lola: 60934807 markings, 276331374 edges, 176825 markings/sec, 335 secs
lola: 61825452 markings, 280476577 edges, 178129 markings/sec, 340 secs
lola: 62710678 markings, 284599072 edges, 177045 markings/sec, 345 secs
lola: 63603667 markings, 288743651 edges, 178598 markings/sec, 350 secs
lola: 64491062 markings, 292864190 edges, 177479 markings/sec, 355 secs
lola: 65384788 markings, 297016082 edges, 178745 markings/sec, 360 secs
lola: 66265322 markings, 301110480 edges, 176107 markings/sec, 365 secs
lola: 67136095 markings, 305183249 edges, 174155 markings/sec, 370 secs
lola: 68013242 markings, 309269202 edges, 175429 markings/sec, 375 secs
lola: 68886354 markings, 313343051 edges, 174622 markings/sec, 380 secs
lola: 69761243 markings, 317424510 edges, 174978 markings/sec, 385 secs
lola: 70620449 markings, 321455258 edges, 171841 markings/sec, 390 secs
lola: 71480657 markings, 325480039 edges, 172042 markings/sec, 395 secs
lola: 72343807 markings, 329520616 edges, 172630 markings/sec, 400 secs
lola: 73203360 markings, 333550434 edges, 171911 markings/sec, 405 secs
lola: 74062421 markings, 337580872 edges, 171812 markings/sec, 410 secs
lola: 74918571 markings, 341598336 edges, 171230 markings/sec, 415 secs
lola: 75782032 markings, 345637144 edges, 172692 markings/sec, 420 secs
lola: 76630679 markings, 349622633 edges, 169729 markings/sec, 425 secs
lola: 77486386 markings, 353631541 edges, 171141 markings/sec, 430 secs
lola: 78332892 markings, 357604793 edges, 169301 markings/sec, 435 secs
lola: 79183142 markings, 361596733 edges, 170050 markings/sec, 440 secs
lola: 80032747 markings, 365583764 edges, 169921 markings/sec, 445 secs
lola: 80877617 markings, 369552929 edges, 168974 markings/sec, 450 secs
lola: 81722779 markings, 373520628 edges, 169032 markings/sec, 455 secs
lola: 82574912 markings, 377510090 edges, 170427 markings/sec, 460 secs
lola: 83416637 markings, 381458501 edges, 168345 markings/sec, 465 secs
lola: 84252860 markings, 385387622 edges, 167245 markings/sec, 470 secs
lola: 85095331 markings, 389338226 edges, 168494 markings/sec, 475 secs
lola: 85935715 markings, 393277585 edges, 168077 markings/sec, 480 secs
lola: 86768033 markings, 397189813 edges, 166464 markings/sec, 485 secs
lola: 87599128 markings, 401104914 edges, 166219 markings/sec, 490 secs
lola: 88446543 markings, 405076130 edges, 169483 markings/sec, 495 secs
lola: 89286530 markings, 409017640 edges, 167997 markings/sec, 500 secs
lola: 90116686 markings, 412920492 edges, 166031 markings/sec, 505 secs
lola: 90951514 markings, 416847493 edges, 166966 markings/sec, 510 secs
lola: 91784581 markings, 420757014 edges, 166613 markings/sec, 515 secs
lola: 92606356 markings, 424637389 edges, 164355 markings/sec, 520 secs
lola: 93432210 markings, 428532592 edges, 165171 markings/sec, 525 secs
lola: 94260311 markings, 432425568 edges, 165620 markings/sec, 530 secs
lola: 95082046 markings, 436289791 edges, 164347 markings/sec, 535 secs
lola: 95902668 markings, 440148628 edges, 164124 markings/sec, 540 secs
lola: 96718211 markings, 443981690 edges, 163109 markings/sec, 545 secs
lola: 97532904 markings, 447807258 edges, 162939 markings/sec, 550 secs
lola: 98339781 markings, 451604761 edges, 161375 markings/sec, 555 secs
lola: 99146063 markings, 455392104 edges, 161256 markings/sec, 560 secs
lola: 99949307 markings, 459158881 edges, 160649 markings/sec, 565 secs
lola: 100745892 markings, 462901387 edges, 159317 markings/sec, 570 secs
lola: 101534432 markings, 466622052 edges, 157708 markings/sec, 575 secs
lola: 102319760 markings, 470324857 edges, 157066 markings/sec, 580 secs
lola: 103108752 markings, 474036282 edges, 157798 markings/sec, 585 secs
lola: 103896461 markings, 477736770 edges, 157542 markings/sec, 590 secs
lola: 104675209 markings, 481409394 edges, 155750 markings/sec, 595 secs
lola: 105455531 markings, 485073761 edges, 156064 markings/sec, 600 secs
lola: 106218677 markings, 488683530 edges, 152629 markings/sec, 605 secs
lola: 106995262 markings, 492333694 edges, 155317 markings/sec, 610 secs
lola: 107762723 markings, 495956541 edges, 153492 markings/sec, 615 secs
lola: 108524068 markings, 499552535 edges, 152269 markings/sec, 620 secs
lola: 109280604 markings, 503125369 edges, 151307 markings/sec, 625 secs
lola: 110042924 markings, 506720715 edges, 152464 markings/sec, 630 secs
lola: 110790083 markings, 510252801 edges, 149432 markings/sec, 635 secs
lola: 111541951 markings, 513797146 edges, 150374 markings/sec, 640 secs
lola: 112294330 markings, 517346624 edges, 150476 markings/sec, 645 secs
lola: 113042256 markings, 520873059 edges, 149585 markings/sec, 650 secs
lola: 113790180 markings, 524406934 edges, 149585 markings/sec, 655 secs
lola: 113964572 markings, 525227102 edges, 34878 markings/sec, 660 secs
lola: 113979879 markings, 525300779 edges, 3061 markings/sec, 665 secs
lola: 113998105 markings, 525386252 edges, 3645 markings/sec, 670 secs
lola: 114000061 markings, 525395025 edges, 391 markings/sec, 675 secs
lola: 114004575 markings, 525416917 edges, 903 markings/sec, 680 secs
lola: 114023074 markings, 525504375 edges, 3700 markings/sec, 685 secs
lola: 114026320 markings, 525519382 edges, 649 markings/sec, 690 secs
lola: 114028916 markings, 525532085 edges, 519 markings/sec, 695 secs
lola: 114039048 markings, 525580921 edges, 2026 markings/sec, 700 secs
lola: 114043525 markings, 525602401 edges, 895 markings/sec, 705 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA SwimmingPool-PT-07-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((Dressed <= WaitBag) AND (E (G ((Undress <= InBath))) AND ((Cabins + 1 <= Bags) OR (Undress <= Entered) OR ((3 <= Undress) AND (2 <= InBath)) OR ((1 <= Out) AND (2 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (Dressed <= WaitBag)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= WaitBag)
lola: processed formula length: 20
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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 (G ((Undress <= InBath)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((Undress <= InBath)))
lola: processed formula length: 27
lola: 19 rewrites
lola: closed formula file SwimmingPool-PT-07-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 is not possibly preserved.
lola: 211 markings, 210 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-07-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no unknown yes yes no no no yes no yes no no
lola:
preliminary result: yes no no yes no unknown yes yes no no no yes no yes no no
lola: memory consumption: 22412 KB
lola: time consumption: 953 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="SwimmingPool-PT-07"
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/SwimmingPool-PT-07.tgz
mv SwimmingPool-PT-07 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 SwimmingPool-PT-07, 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 r160-smll-152705512700255"
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 ;