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 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258100666
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528193358482

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-09 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-09 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ SwimmingPool-PT-09 @ 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-09-LTLFireability.task
lola: A (F (G (F (FIREABLE(GetK))))) : A (G (G (F (X (G (FIREABLE(GetK))))))) : A (G ((X (G (FIREABLE(RKey))) U FIREABLE(RBag)))) : A (G (FIREABLE(RBag))) : A ((G ((FIREABLE(RelK) U FIREABLE(GetK))) U (X (FIREABLE(RBag)) U F (FIREABLE(RBag))))) : A ((F (F (F (FIREABLE(GetK2)))) U FIREABLE(RBag))) : A (F ((FIREABLE(RelK) U (FIREABLE(GetK) U FIREABLE(RelK))))) : A (X (((FIREABLE(GetB) U FIREABLE(RBag)) U FIREABLE(RBag)))) : A (G (FIREABLE(GetB))) : A (FIREABLE(GetK2)) : A ((FIREABLE(GetK2) U (G (FIREABLE(GetB)) U F (FIREABLE(GetK))))) : A (FIREABLE(RKey)) : A (F (G (G (F (X (FIREABLE(GetK))))))) : A (G (X (FIREABLE(Enter)))) : A (G (G (G (F (G (FIREABLE(Enter))))))) : A (F ((FIREABLE(RelK) U F (X (FIREABLE(RelK))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:488
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:482
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetK2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetK2)
lola: processed formula length: 15
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.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 SwimmingPool-PT-09-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(RKey)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(RKey)
lola: processed formula length: 14
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.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 SwimmingPool-PT-09-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(RBag)))) AND A (G ((X (G (FIREABLE(RKey))) OR FIREABLE(RBag)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(RBag))))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 57062 markings, 80414 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G (FIREABLE(RKey))) OR FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G (FIREABLE(RKey))) OR FIREABLE(RBag))))
lola: processed formula length: 50
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 366 markings, 366 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-2 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: A (X ((FIREABLE(GetB) U FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(GetB) U FIREABLE(RBag))))
lola: processed formula length: 41
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 366 markings, 366 edges
lola: ========================================

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

FORMULA SwimmingPool-PT-09-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(RelK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(RelK))))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 24571 markings, 36675 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(RBag)))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(RBag)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(GetB)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(GetB)))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(GetB)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-LTLFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola:
FORMULA SwimmingPool-PT-09-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(RelK)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(RelK)
lola: processed formula length: 18
lola: 37 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 271 markings, 270 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetK))))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: try reading problem file SwimmingPool-PT-09-LTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: 3331380 markings, 5903868 edges, 666276 markings/sec, 0 secs
lola: 6006563 markings, 10789762 edges, 535037 markings/sec, 5 secs
lola: 8653831 markings, 15636257 edges, 529454 markings/sec, 10 secs
lola: 11505183 markings, 20865420 edges, 570270 markings/sec, 15 secs
lola: 14308192 markings, 26027212 edges, 560602 markings/sec, 20 secs
lola: 17077680 markings, 31141929 edges, 553898 markings/sec, 25 secs
lola: 19817948 markings, 36207371 edges, 548054 markings/sec, 30 secs
lola: 22511364 markings, 41212663 edges, 538683 markings/sec, 35 secs
lola: 25192597 markings, 46195519 edges, 536247 markings/sec, 40 secs
lola: 27872170 markings, 51177027 edges, 535915 markings/sec, 45 secs
lola: 30531256 markings, 56128206 edges, 531817 markings/sec, 50 secs
lola: 33162496 markings, 61052312 edges, 526248 markings/sec, 55 secs
lola: 35811460 markings, 65980903 edges, 529793 markings/sec, 60 secs
lola: 38262825 markings, 70557302 edges, 490273 markings/sec, 65 secs
lola: 40879859 markings, 75447194 edges, 523407 markings/sec, 70 secs
lola: 43497689 markings, 80335403 edges, 523566 markings/sec, 75 secs
lola: 46105839 markings, 85205586 edges, 521630 markings/sec, 80 secs
lola: 48599778 markings, 89870673 edges, 498788 markings/sec, 85 secs
lola: 51109926 markings, 94551381 edges, 502030 markings/sec, 90 secs
lola: 53597869 markings, 99201878 edges, 497589 markings/sec, 95 secs
lola: 56210373 markings, 104072536 edges, 522501 markings/sec, 100 secs
lola: 58821915 markings, 108948628 edges, 522308 markings/sec, 105 secs
lola: 61440771 markings, 113825294 edges, 523771 markings/sec, 110 secs
lola: 64071291 markings, 118718955 edges, 526104 markings/sec, 115 secs
lola: 66702526 markings, 123607396 edges, 526247 markings/sec, 120 secs
lola: 69345256 markings, 128526684 edges, 528546 markings/sec, 125 secs
lola: 71994222 markings, 133473553 edges, 529793 markings/sec, 130 secs
lola: 74670775 markings, 138470247 edges, 535311 markings/sec, 135 secs
lola: 77440238 markings, 143621701 edges, 553893 markings/sec, 140 secs
lola: 78504011 markings, 148105662 edges, 212755 markings/sec, 145 secs
lola: 79240231 markings, 151883513 edges, 147244 markings/sec, 150 secs
lola: 79982765 markings, 155519149 edges, 148507 markings/sec, 155 secs
lola: 80733268 markings, 159066681 edges, 150101 markings/sec, 160 secs
lola: 81486390 markings, 162562555 edges, 150624 markings/sec, 165 secs
lola: 82242459 markings, 166023995 edges, 151214 markings/sec, 170 secs
lola: 83000829 markings, 169444076 edges, 151674 markings/sec, 175 secs
lola: 83759619 markings, 172846867 edges, 151758 markings/sec, 180 secs
lola: 84517843 markings, 176232818 edges, 151645 markings/sec, 185 secs
lola: 85281609 markings, 179626776 edges, 152753 markings/sec, 190 secs
lola: 86046183 markings, 183013561 edges, 152915 markings/sec, 195 secs
lola: 86806839 markings, 186382378 edges, 152131 markings/sec, 200 secs
lola: 87569654 markings, 189759835 edges, 152563 markings/sec, 205 secs
lola: 88333015 markings, 193139601 edges, 152672 markings/sec, 210 secs
lola: 89100789 markings, 196530982 edges, 153555 markings/sec, 215 secs
lola: 89865814 markings, 199905653 edges, 153005 markings/sec, 220 secs
lola: 90632720 markings, 203278023 edges, 153381 markings/sec, 225 secs
lola: 91402698 markings, 206658907 edges, 153996 markings/sec, 230 secs
lola: 92177505 markings, 210049617 edges, 154961 markings/sec, 235 secs
lola: 92961140 markings, 213469487 edges, 156727 markings/sec, 240 secs
lola: 93759262 markings, 216924613 edges, 159624 markings/sec, 245 secs
lola: 94583619 markings, 220484756 edges, 164871 markings/sec, 250 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 95456507 markings, 224209651 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(GetK))))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 368 markings, 370 edges
lola:
FORMULA SwimmingPool-PT-09-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(Enter))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(Enter))))
lola: processed formula length: 27
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1522 markings, 1791 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetK))))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3499516 markings, 6209860 edges, 699903 markings/sec, 0 secs
lola: 6500362 markings, 11688244 edges, 600169 markings/sec, 5 secs
lola: 9414871 markings, 17028480 edges, 582902 markings/sec, 10 secs
lola: 12282202 markings, 22285839 edges, 573466 markings/sec, 15 secs
lola: 15080365 markings, 27456598 edges, 559633 markings/sec, 20 secs
lola: 17865246 markings, 32588059 edges, 556976 markings/sec, 25 secs
lola: 20604365 markings, 37671510 edges, 547824 markings/sec, 30 secs
lola: 23307055 markings, 42694969 edges, 540538 markings/sec, 35 secs
lola: 25906339 markings, 47515222 edges, 519857 markings/sec, 40 secs
lola: 28587637 markings, 52514766 edges, 536260 markings/sec, 45 secs
lola: 31265882 markings, 57501885 edges, 535649 markings/sec, 50 secs
lola: 33936700 markings, 62478065 edges, 534164 markings/sec, 55 secs
lola: 36596170 markings, 67436698 edges, 531894 markings/sec, 60 secs
lola: 39223704 markings, 72358474 edges, 525507 markings/sec, 65 secs
lola: 41866824 markings, 77292119 edges, 528624 markings/sec, 70 secs
lola: 44499713 markings, 82207289 edges, 526578 markings/sec, 75 secs
lola: 47125024 markings, 87118163 edges, 525062 markings/sec, 80 secs
lola: 49743849 markings, 92010090 edges, 523765 markings/sec, 85 secs
lola: 52370987 markings, 96905795 edges, 525428 markings/sec, 90 secs
lola: 54931738 markings, 101686286 edges, 512150 markings/sec, 95 secs
lola: 57478489 markings, 106433839 edges, 509350 markings/sec, 100 secs
lola: 59953549 markings, 111042167 edges, 495012 markings/sec, 105 secs
lola: 62569379 markings, 115924056 edges, 523166 markings/sec, 110 secs
lola: 65216446 markings, 120843364 edges, 529413 markings/sec, 115 secs
lola: 67863282 markings, 125763898 edges, 529367 markings/sec, 120 secs
lola: 70296442 markings, 130300503 edges, 486632 markings/sec, 125 secs
lola: 72772489 markings, 134926879 edges, 495209 markings/sec, 130 secs
lola: 75279210 markings, 139606170 edges, 501344 markings/sec, 135 secs
lola: 77970855 markings, 144673022 edges, 538329 markings/sec, 140 secs
lola: 78619854 markings, 148728734 edges, 129800 markings/sec, 145 secs
lola: 79342423 markings, 152399175 edges, 144514 markings/sec, 150 secs
lola: 80073465 markings, 155950437 edges, 146208 markings/sec, 155 secs
lola: 80808724 markings, 159421548 edges, 147052 markings/sec, 160 secs
lola: 81554164 markings, 162877719 edges, 149088 markings/sec, 165 secs
lola: 82312494 markings, 166337200 edges, 151666 markings/sec, 170 secs
lola: 83070319 markings, 169763492 edges, 151565 markings/sec, 175 secs
lola: 83829858 markings, 173163045 edges, 151908 markings/sec, 180 secs
lola: 84591812 markings, 176560806 edges, 152391 markings/sec, 185 secs
lola: 85355910 markings, 179954639 edges, 152820 markings/sec, 190 secs
lola: 86119122 markings, 183336727 edges, 152642 markings/sec, 195 secs
lola: 86883207 markings, 186723271 edges, 152817 markings/sec, 200 secs
lola: 87646596 markings, 190102712 edges, 152678 markings/sec, 205 secs
lola: 88412504 markings, 193490011 edges, 153182 markings/sec, 210 secs
lola: 89179454 markings, 196877216 edges, 153390 markings/sec, 215 secs
lola: 89944352 markings, 200251919 edges, 152980 markings/sec, 220 secs
lola: 90713617 markings, 203634026 edges, 153853 markings/sec, 225 secs
lola: 91485001 markings, 207018765 edges, 154277 markings/sec, 230 secs
lola: 92260786 markings, 210414196 edges, 155157 markings/sec, 235 secs
lola: 93032712 markings, 213780805 edges, 154385 markings/sec, 240 secs
lola: 93810974 markings, 217149480 edges, 155652 markings/sec, 245 secs
lola: 94613682 markings, 220612699 edges, 160542 markings/sec, 250 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 95456507 markings, 224209651 edges

FORMULA SwimmingPool-PT-09-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(GetK2)) U FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(GetK2)) U FIREABLE(RBag)))
lola: processed formula length: 42
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31411 markings, 42929 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(GetK2) U (F (FIREABLE(GetK)) OR (G (FIREABLE(GetB)) AND F (FIREABLE(GetK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(GetK2) U (F (FIREABLE(GetK)) OR (G (FIREABLE(GetB)) AND F (FIREABLE(GetK))))))
lola: processed formula length: 91
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola:
FORMULA SwimmingPool-PT-09-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3050 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(RBag)) OR (G ((F (FIREABLE(GetK)) AND (FIREABLE(RelK) OR FIREABLE(GetK)))) AND F (FIREABLE(RBag)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(RBag)) OR (G ((F (FIREABLE(GetK)) AND (FIREABLE(RelK) OR FIREABLE(GetK)))) AND F (FIREABLE(RBag)))))
lola: processed formula length: 116
lola: 35 rewrites
lola: closed formula file SwimmingPool-PT-09-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2695018 markings, 6160769 edges, 539004 markings/sec, 0 secs
lola: 5001760 markings, 11802995 edges, 461348 markings/sec, 5 secs
lola: 7234089 markings, 17278905 edges, 446466 markings/sec, 10 secs
lola: 9417083 markings, 22620278 edges, 436599 markings/sec, 15 secs
lola: 11572047 markings, 27901959 edges, 430993 markings/sec, 20 secs
lola: 13702323 markings, 33112050 edges, 426055 markings/sec, 25 secs
lola: 15796576 markings, 38244681 edges, 418851 markings/sec, 30 secs
lola: 17803335 markings, 43150636 edges, 401352 markings/sec, 35 secs
lola: 19783937 markings, 48001651 edges, 396120 markings/sec, 40 secs
lola: 21870271 markings, 53101851 edges, 417267 markings/sec, 45 secs
lola: 23969116 markings, 58233538 edges, 419769 markings/sec, 50 secs
lola: 26163002 markings, 63595259 edges, 438777 markings/sec, 55 secs
lola: 28322892 markings, 68889274 edges, 431978 markings/sec, 60 secs
lola: 30486810 markings, 74178406 edges, 432784 markings/sec, 65 secs
lola: 32648737 markings, 79458040 edges, 432385 markings/sec, 70 secs
lola: 34788570 markings, 84679141 edges, 427967 markings/sec, 75 secs
lola: 36924581 markings, 89902059 edges, 427202 markings/sec, 80 secs
lola: 39059756 markings, 95109406 edges, 427035 markings/sec, 85 secs
lola: 41156808 markings, 100229886 edges, 419410 markings/sec, 90 secs
lola: 43271775 markings, 105384371 edges, 422993 markings/sec, 95 secs
lola: 45361201 markings, 110488961 edges, 417885 markings/sec, 100 secs
lola: 47419293 markings, 115508991 edges, 411618 markings/sec, 105 secs
lola: 49477329 markings, 120536655 edges, 411607 markings/sec, 110 secs
lola: 51521305 markings, 125526416 edges, 408795 markings/sec, 115 secs
lola: 53586880 markings, 130556175 edges, 413115 markings/sec, 120 secs
lola: 55627786 markings, 135540259 edges, 408181 markings/sec, 125 secs
lola: 57708823 markings, 140609237 edges, 416207 markings/sec, 130 secs
lola: 59935854 markings, 146024516 edges, 445406 markings/sec, 135 secs
lola: 62367859 markings, 151889224 edges, 486401 markings/sec, 140 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 63014998 markings, 153402491 edges
lola: ========================================

FORMULA SwimmingPool-PT-09-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes no no no yes no yes no no yes
lola:
preliminary result: yes no no no yes yes yes no no no yes no yes no no yes
lola: memory consumption: 14544 KB
lola: time consumption: 666 seconds

BK_STOP 1528194024833

--------------------
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-09"
export BK_EXAMINATION="LTLFireability"
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-09.tgz
mv SwimmingPool-PT-09 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-09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732258100666"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;