fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r160-smll-152705512400032
Last Updated
June 26, 2018

About the Execution of LoLA for SmallOperatingSystem-PT-MT0064DC0032

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1485.560 168998.00 171944.00 446.90 FFFTTFFFFTTFTFFT normal

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 188K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K 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 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K 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 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0064DC0032, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400032
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527200463019

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0032 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0032 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT0064DC0032 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: E (F (NOT(E (F (FIREABLE(startNext)))))) : (NOT(A (F (FIREABLE(startFirst)))) OR (NOT FIREABLE(startLoading) AND NOT FIREABLE(startNext))) : E (F ((A (G ((FIREABLE(suspend)))) AND E (F ((FIREABLE(endUnload) OR FIREABLE(startLoading))))))) : ((NOT(E (G (NOT FIREABLE(startUnload)))) OR A (F ((FIREABLE(freeMemory) AND (FIREABLE(freeMemory) OR FIREABLE(startLoading)))))) OR A (G (FIREABLE(startLoading)))) : ((NOT(A ((FIREABLE(startLoading) U FIREABLE(freeMemory)))) OR FIREABLE(endLoading)) OR FIREABLE(startFirst)) : E (F (NOT((E (G (FIREABLE(suspend))) OR E (F (FIREABLE(startFirst))))))) : (A (G (FIREABLE(startLoading))) AND A (F ((E (F (FIREABLE(startUnload))) OR E (F (FIREABLE(endLoading))))))) : NOT(A (F (FIREABLE(startFirst)))) : (((E (X ((FIREABLE(startUnload) AND FIREABLE(suspend)))) AND (NOT FIREABLE(startUnload) OR NOT FIREABLE(startFirst) OR (NOT FIREABLE(endLoading) AND NOT FIREABLE(startUnload)))) OR (() AND E (G (NOT FIREABLE(startFirst))))) AND FIREABLE(startLoading)) : NOT((A (X (FIREABLE(freeMemory))) OR E (G ((NOT FIREABLE(suspend) AND NOT FIREABLE(freeMemory)))))) : E (G (((A (F (FIREABLE(freeMemory))) AND (NOT FIREABLE(endUnload))) OR FIREABLE(freeMemory)))) : A (G (E (G (NOT FIREABLE(endLoading))))) : (NOT(A (F (((FIREABLE(suspend) AND FIREABLE(endLoading)) OR FIREABLE(startLoading))))) OR FIREABLE(startLoading)) : FIREABLE(startUnload) : FIREABLE(startNext) : (E (G (E (G ((FIREABLE(endLoading) OR FIREABLE(startLoading)))))) AND A ((FIREABLE(startFirst) U NOT FIREABLE(freeMemory))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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(startUnload)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startUnload)
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.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 SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-13 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(startNext)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startNext)
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((E (X ((FIREABLE(startUnload) AND FIREABLE(suspend)))) AND (NOT FIREABLE(startUnload) OR NOT FIREABLE(startFirst) OR (NOT FIREABLE(endLoading) AND NOT FIREABLE(startUnload)))) OR E (G (NOT FIREABLE(startFirst)))) AND FIREABLE(startLoading))
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: (NOT FIREABLE(startUnload) OR NOT FIREABLE(startFirst) OR (NOT FIREABLE(endLoading) AND NOT FIREABLE(startUnload)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(startUnload) OR NOT FIREABLE(startFirst) OR (NOT FIREABLE(endLoading) AND NOT FIREABLE(startUnload)))
lola: processed formula length: 117
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(startLoading)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startLoading)
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(startFirst)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(startFirst)))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(startUnload) AND FIREABLE(suspend))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FIREABLE(startUnload) AND FIREABLE(suspend)))
lola: processed formula length: 49
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-8 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: (E (X (NOT FIREABLE(freeMemory))) AND A (F ((FIREABLE(suspend) OR FIREABLE(freeMemory)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(suspend) OR FIREABLE(freeMemory))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (NOT FIREABLE(suspend) AND NOT FIREABLE(freeMemory))
lola: processed formula length: 52
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(freeMemory)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(freeMemory))
lola: processed formula length: 28
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-9 TRUE 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 (G (NOT FIREABLE(endLoading)))
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 (NOT FIREABLE(endLoading)))
lola: processed formula length: 32
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(endLoading)
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: 2 markings, 1 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-4-0.sara
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(startFirst)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(startFirst)))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-7 FALSE 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: E (F (A (G (NOT FIREABLE(startNext)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(startNext)
lola: processed formula length: 19
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3043917 markings, 8252154 edges, 608783 markings/sec, 0 secs
lola: 5783027 markings, 16203388 edges, 547822 markings/sec, 5 secs
lola: 8514059 markings, 24264183 edges, 546206 markings/sec, 10 secs
lola: 8856885 markings, 32392545 edges, 68565 markings/sec, 15 secs
lola: 8985185 markings, 39979595 edges, 25660 markings/sec, 20 secs
lola: 9039472 markings, 46593892 edges, 10857 markings/sec, 25 secs
lola: 9099903 markings, 54077570 edges, 12086 markings/sec, 30 secs
lola: 9109079 markings, 62279354 edges, 1835 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 9132088 markings, 65160663 edges
lola: ========================================

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

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F (NOT FIREABLE(suspend))) AND A (G (NOT FIREABLE(startFirst))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: E(TRUE U (A(TRUE U NOT FIREABLE(suspend)) AND NOT(E(TRUE U FIREABLE(startFirst)))))
lola: processed formula length: 83
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1509632 markings, 7265619 edges, 301926 markings/sec, 0 secs
lola: 2998308 markings, 14575703 edges, 297735 markings/sec, 5 secs
lola: 4446296 markings, 21685660 edges, 289598 markings/sec, 10 secs
lola: 5661531 markings, 27673703 edges, 243047 markings/sec, 15 secs
lola: 6946341 markings, 34021958 edges, 256962 markings/sec, 20 secs
lola: 8413190 markings, 41294161 edges, 293370 markings/sec, 25 secs
lola: 9127732 markings, 48787311 edges, 142908 markings/sec, 30 secs
lola: 9128734 markings, 55060044 edges, 200 markings/sec, 35 secs
lola: 9129291 markings, 60812262 edges, 111 markings/sec, 40 secs
lola: 9129930 markings, 66390419 edges, 128 markings/sec, 45 secs
lola: 9132497 markings, 71444353 edges, 513 markings/sec, 50 secs
lola: 9132564 markings, 77210964 edges, 13 markings/sec, 55 secs
lola: 9133641 markings, 83468166 edges, 215 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9133641 markings, 86594651 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((FIREABLE(suspend)))) AND E (F ((FIREABLE(endUnload) OR FIREABLE(startLoading)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(E(TRUE U (NOT FIREABLE(suspend)))) AND E(TRUE U (FIREABLE(endUnload) OR FIREABLE(startLoading)))))
lola: processed formula length: 113
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1819525 markings, 7959721 edges, 363905 markings/sec, 0 secs
lola: 3462255 markings, 15833432 edges, 328546 markings/sec, 5 secs
lola: 5031551 markings, 23495652 edges, 313859 markings/sec, 10 secs
lola: 6580877 markings, 31110080 edges, 309865 markings/sec, 15 secs
lola: 8117634 markings, 38702217 edges, 307351 markings/sec, 20 secs
lola: 9127158 markings, 46286027 edges, 201905 markings/sec, 25 secs
lola: 9128428 markings, 52756558 edges, 254 markings/sec, 30 secs
lola: 9129164 markings, 59058522 edges, 147 markings/sec, 35 secs
lola: 9129849 markings, 65492476 edges, 137 markings/sec, 40 secs
lola: 9132513 markings, 72000138 edges, 533 markings/sec, 45 secs
lola: 9133181 markings, 78707121 edges, 134 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9133641 markings, 85465545 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(startFirst))) OR (NOT FIREABLE(startLoading) AND NOT FIREABLE(startNext)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(startLoading) AND NOT FIREABLE(startNext))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(startLoading) AND NOT FIREABLE(startNext))
lola: processed formula length: 56
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.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: lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
========================================lola: ...considering subproblem: E (G (NOT FIREABLE(startFirst)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(startFirst)))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING

lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((NOT FIREABLE(suspend) OR NOT FIREABLE(endLoading)) AND NOT FIREABLE(startLoading)))) OR FIREABLE(startLoading))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(startLoading)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(startLoading)
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((NOT FIREABLE(startLoading) R NOT FIREABLE(freeMemory))) OR (FIREABLE(endLoading) OR FIREABLE(startFirst)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(endLoading) OR FIREABLE(startFirst))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: (FIREABLE(endLoading) OR FIREABLE(startFirst))
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.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: ========================================
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(startLoading) R NOT FIREABLE(freeMemory)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((NOT FIREABLE(startLoading) R NOT FIREABLE(freeMemory)))
lola: processed formula length: 59
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 32 markings, 31 edges
lola: lola: SUBRESULT
lola: result: yes========================================

lola: The Boolean predicate is true.

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((FIREABLE(endLoading) OR FIREABLE(startLoading)))) AND A ((FIREABLE(startFirst) U NOT FIREABLE(freeMemory))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: lola: RUNNING
========================================
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(startFirst) U NOT FIREABLE(freeMemory)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(startFirst) U NOT FIREABLE(freeMemory)))
lola: processed formula length: 53
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(endLoading) OR FIREABLE(startLoading))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(endLoading) OR FIREABLE(startLoading))))
lola: processed formula length: 57
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 34 markings, 34 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(startUnload))) OR (A (F ((FIREABLE(freeMemory) AND (FIREABLE(freeMemory) OR FIREABLE(startLoading))))) OR A (G (FIREABLE(startLoading)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(startUnload)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: NOT FIREABLE(startUnload)
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 34 markings, 34 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(startLoading))) AND A (F ((E (F (FIREABLE(startUnload))) OR E (F (FIREABLE(endLoading)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(startUnload))) OR (A (F ((FIREABLE(freeMemory) AND (FIREABLE(freeMemory) OR FIREABLE(startLoading))))) OR A (G (FIREABLE(startLoading)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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(startLoading)))
lola: processed formula length: 30
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(startLoading)
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-16-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(startUnload)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: NOT FIREABLE(startUnload)
lola: processed formula length: 25
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 34 markings, 34 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(freeMemory) AND (FIREABLE(freeMemory) OR FIREABLE(startLoading)))))
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(freeMemory) OR (NOT FIREABLE(freeMemory) AND NOT FIREABLE(startLoading)))
lola: processed formula length: 88
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no no no no yes yes no yes no no yes
lola:
preliminary result: no no no yes yes no no no no yes yes no yes no no yes
lola: memory consumption: 14888 KB
lola: time consumption: 169 seconds

BK_STOP 1527200632017

--------------------
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="SmallOperatingSystem-PT-MT0064DC0032"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

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