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

About the Execution of LoLA for SmallOperatingSystem-PT-MT2048DC1024

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15917.380 916538.00 876246.00 6728.50 TFFTTTTT?TTFFTFF 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 184K
-rw-r--r-- 1 mcc users 4.0K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT2048DC1024, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512500101
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527236742425

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT2048DC1024 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT2048DC1024 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT2048DC1024 @ 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-MT2048DC1024-CTLCardinality.task
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TransferToDisk <= CPUUnit)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (FreeMemSegment <= CPUUnit)
lola: always true
lola: LP says that atomic proposition is always true: (TransferToDisk <= CPUUnit)
lola: NOT(A (G (((LoadingMem <= FreeMemSegment))))) : (A (X (A (G ((3 <= FreeMemSegment))))) AND A (F ((1 <= DiskControllerUnit)))) : (E ((((TaskReady <= FreeMemSegment) OR (LoadingMem <= TransferToDisk)) U (TaskSuspended <= 1))) AND A (F (A (G ((2 <= FreeMemSegment)))))) : (A (X (A (G (TRUE)))) OR A (G ((1 <= ExecutingTask)))) : (((2 <= DiskControllerUnit) OR (E (F ((TaskOnDisk <= TaskReady))) AND ((TaskReady <= LoadingMem) OR (CPUUnit <= TaskReady)))) AND A (G (E (X (TRUE))))) : A (X ((A (G (TRUE)) OR (((1 <= TransferToDisk)))))) : A ((E (X (TRUE)) U A (G (TRUE)))) : A (F (NOT(A (G ((ExecutingTask <= FreeMemSegment)))))) : A (G (E (F (((1 <= ExecutingTask)))))) : E (X (E (F (((2 <= TransferToDisk) AND (TaskOnDisk <= TaskReady)))))) : A (((2 <= FreeMemSegment) U A (G (TRUE)))) : (A (X ((3 <= FreeMemSegment))) AND E (X (A (G ((LoadingMem <= DiskControllerUnit)))))) : A (F (A (G ((DiskControllerUnit + 1 <= CPUUnit))))) : NOT(A (G (((2 <= DiskControllerUnit) OR (1 <= TransferToDisk) OR (1 <= ExecutingTask) OR (3 <= TaskSuspended))))) : ((1 <= TaskReady) OR A (F (E (G ((TaskReady <= TransferToDisk)))))) : (NOT(E (F ((FreeMemSegment <= 2)))) AND (E (((FreeMemSegment <= DiskControllerUnit) U (3 <= ExecutingTask))) OR E (X ((1 <= DiskControllerUnit)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:208
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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 SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-3 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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 SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-5 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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 SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-6 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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 SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-10 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: E (X (E (F (((2 <= TransferToDisk) AND (TaskOnDisk <= TaskReady))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: ((2 <= TransferToDisk) AND (TaskOnDisk <= TaskReady))
lola: processed formula length: 53
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13839 markings, 20501 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-9 TRUE 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 (A (G ((3 <= FreeMemSegment))))) AND A (F ((1 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= DiskControllerUnit)))
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: (DiskControllerUnit <= 0)
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FreeMemSegment <= 2)
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 3068 markings, 3067 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-1 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: (A (X ((3 <= FreeMemSegment))) AND E (X (A (G ((LoadingMem <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((3 <= FreeMemSegment))
lola: processed formula length: 25
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((LoadingMem <= DiskControllerUnit)))))
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:297
lola: processed formula: EX(NOT(E(TRUE U (DiskControllerUnit + 1 <= LoadingMem))))
lola: processed formula length: 57
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 513 markings, 512 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-11 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 ((3 <= FreeMemSegment))) AND (E (((FreeMemSegment <= DiskControllerUnit) U (3 <= ExecutingTask))) OR E (X ((1 <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FreeMemSegment <= DiskControllerUnit) U (3 <= ExecutingTask)))
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 (((FreeMemSegment <= DiskControllerUnit) U (3 <= ExecutingTask)))
lola: processed formula length: 67
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: (3 <= ExecutingTask)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= FreeMemSegment)))
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:695
lola: processed formula: A (G ((3 <= FreeMemSegment)))
lola: processed formula length: 29
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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:695
lola: formula 0: (FreeMemSegment <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-8-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: 3069 markings, 3068 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FreeMemSegment + 1 <= LoadingMem))))
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 (((FreeMemSegment + 1 <= LoadingMem))))
lola: processed formula length: 44
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: ((FreeMemSegment + 1 <= LoadingMem))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1027 markings, 1026 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-0 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: E (F ((FreeMemSegment + 1 <= ExecutingTask)))
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 ((FreeMemSegment + 1 <= ExecutingTask)))
lola: processed formula length: 45
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: (FreeMemSegment + 1 <= ExecutingTask)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3587 markings, 4098 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit <= 1) AND (TransferToDisk <= 0) AND (ExecutingTask <= 0) AND (TaskSuspended <= 2))))
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 (((DiskControllerUnit <= 1) AND (TransferToDisk <= 0) AND (ExecutingTask <= 0) AND (TaskSuspended <= 2))))
lola: processed formula length: 111
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: ((DiskControllerUnit <= 1) AND (TransferToDisk <= 0) AND (ExecutingTask <= 0) AND (TaskSuspended <= 2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1024 markings, 1023 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((1 <= ExecutingTask))
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.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: 2465972 markings, 6685917 edges, 493194 markings/sec, 0 secs
lola: 4648267 markings, 12845632 edges, 436459 markings/sec, 5 secs
lola: 6756825 markings, 18819900 edges, 421712 markings/sec, 10 secs
lola: 8755415 markings, 24479451 edges, 399718 markings/sec, 15 secs
lola: 10690246 markings, 29937669 edges, 386966 markings/sec, 20 secs
lola: 12651813 markings, 35564483 edges, 392313 markings/sec, 25 secs
lola: 14635384 markings, 41253247 edges, 396714 markings/sec, 30 secs
lola: 16402822 markings, 46344641 edges, 353488 markings/sec, 35 secs
lola: 18191210 markings, 51492248 edges, 357678 markings/sec, 40 secs
lola: 20116842 markings, 56891465 edges, 385126 markings/sec, 45 secs
lola: 21942885 markings, 62160273 edges, 365209 markings/sec, 50 secs
lola: 23757456 markings, 67401927 edges, 362914 markings/sec, 55 secs
lola: 25633117 markings, 72795437 edges, 375132 markings/sec, 60 secs
lola: 27510532 markings, 78207216 edges, 375483 markings/sec, 65 secs
lola: 29329930 markings, 83384545 edges, 363880 markings/sec, 70 secs
lola: 31102111 markings, 88528105 edges, 354436 markings/sec, 75 secs
lola: 32951050 markings, 93870566 edges, 369788 markings/sec, 80 secs
lola: 34737103 markings, 99063068 edges, 357211 markings/sec, 85 secs
lola: 36553719 markings, 104326862 edges, 363323 markings/sec, 90 secs
lola: 38397908 markings, 109625252 edges, 368838 markings/sec, 95 secs
lola: 40224806 markings, 114909029 edges, 365380 markings/sec, 100 secs
lola: 41826310 markings, 119602675 edges, 320301 markings/sec, 105 secs
lola: 43407541 markings, 124208131 edges, 316246 markings/sec, 110 secs
lola: 45068555 markings, 129035279 edges, 332203 markings/sec, 115 secs
lola: 46732774 markings, 133882643 edges, 332844 markings/sec, 120 secs
lola: 48415167 markings, 138774626 edges, 336479 markings/sec, 125 secs
lola: 50115110 markings, 143720188 edges, 339989 markings/sec, 130 secs
lola: 51889031 markings, 148860275 edges, 354784 markings/sec, 135 secs
lola: 53598680 markings, 153838244 edges, 341930 markings/sec, 140 secs
lola: 55219669 markings, 158583093 edges, 324198 markings/sec, 145 secs
lola: 56869797 markings, 163411009 edges, 330026 markings/sec, 150 secs
lola: 58537915 markings, 168278586 edges, 333624 markings/sec, 155 secs
lola: 60299768 markings, 173389200 edges, 352371 markings/sec, 160 secs
lola: 61973679 markings, 178281037 edges, 334782 markings/sec, 165 secs
lola: 63785165 markings, 183503073 edges, 362297 markings/sec, 170 secs
lola: 65449146 markings, 188372109 edges, 332796 markings/sec, 175 secs
lola: 67100936 markings, 193177610 edges, 330358 markings/sec, 180 secs
lola: 68806981 markings, 198144442 edges, 341209 markings/sec, 185 secs
lola: 70533342 markings, 203097419 edges, 345272 markings/sec, 190 secs
lola: 72240292 markings, 208071321 edges, 341390 markings/sec, 195 secs
lola: 73928971 markings, 212995591 edges, 337736 markings/sec, 200 secs
lola: 75629234 markings, 217953708 edges, 340053 markings/sec, 205 secs
lola: 77278821 markings, 222789088 edges, 329917 markings/sec, 210 secs
lola: 78922408 markings, 227593884 edges, 328717 markings/sec, 215 secs
lola: 80609076 markings, 232499487 edges, 337334 markings/sec, 220 secs
lola: 82309852 markings, 237451488 edges, 340155 markings/sec, 225 secs
lola: 84012138 markings, 242410506 edges, 340457 markings/sec, 230 secs
lola: 85706974 markings, 247353762 edges, 338967 markings/sec, 235 secs
lola: 87396165 markings, 252290630 edges, 337838 markings/sec, 240 secs
lola: 89079138 markings, 257208478 edges, 336595 markings/sec, 245 secs
lola: 90753471 markings, 262107169 edges, 334867 markings/sec, 250 secs
lola: 92357058 markings, 266817910 edges, 320717 markings/sec, 255 secs
lola: 94037564 markings, 271723451 edges, 336101 markings/sec, 260 secs
lola: 95664799 markings, 276488163 edges, 325447 markings/sec, 265 secs
lola: 97265131 markings, 281185668 edges, 320066 markings/sec, 270 secs
lola: 98885241 markings, 285930850 edges, 324022 markings/sec, 275 secs
lola: 100528728 markings, 290741457 edges, 328697 markings/sec, 280 secs
lola: 102153118 markings, 295501651 edges, 324878 markings/sec, 285 secs
lola: 103802512 markings, 300329126 edges, 329879 markings/sec, 290 secs
lola: 105440931 markings, 305128283 edges, 327684 markings/sec, 295 secs
lola: 107017666 markings, 309768612 edges, 315347 markings/sec, 300 secs
lola: 108647711 markings, 314540846 edges, 326009 markings/sec, 305 secs
lola: 110215774 markings, 319150493 edges, 313613 markings/sec, 310 secs
lola: 111958952 markings, 324214352 edges, 348636 markings/sec, 315 secs
lola: 113687319 markings, 329237401 edges, 345673 markings/sec, 320 secs
lola: 115366327 markings, 334144149 edges, 335802 markings/sec, 325 secs
lola: 116924526 markings, 338742441 edges, 311640 markings/sec, 330 secs
lola: 118569934 markings, 343553775 edges, 329082 markings/sec, 335 secs
lola: 120151585 markings, 348202007 edges, 316330 markings/sec, 340 secs
lola: 121788013 markings, 352990972 edges, 327286 markings/sec, 345 secs
lola: 123352560 markings, 357587364 edges, 312909 markings/sec, 350 secs
lola: 124928391 markings, 362222981 edges, 315166 markings/sec, 355 secs
lola: 126519127 markings, 366893836 edges, 318147 markings/sec, 360 secs
lola: 128073193 markings, 371472401 edges, 310813 markings/sec, 365 secs
lola: 129722369 markings, 376292985 edges, 329835 markings/sec, 370 secs
lola: 131390997 markings, 381165139 edges, 333726 markings/sec, 375 secs
lola: 132964549 markings, 385794829 edges, 314710 markings/sec, 380 secs
lola: 134499122 markings, 390317720 edges, 306915 markings/sec, 385 secs
lola: 136042087 markings, 394869526 edges, 308593 markings/sec, 390 secs
lola: 137624571 markings, 399511409 edges, 316497 markings/sec, 395 secs
lola: 139248475 markings, 404264437 edges, 324781 markings/sec, 400 secs
lola: 140865028 markings, 409001853 edges, 323311 markings/sec, 405 secs
lola: 142560878 markings, 413943460 edges, 339170 markings/sec, 410 secs
lola: 143140506 markings, 415658349 edges, 115926 markings/sec, 415 secs
lola: 143181412 markings, 415770126 edges, 8181 markings/sec, 420 secs
lola: 143182629 markings, 415773858 edges, 243 markings/sec, 425 secs
lola: 143186804 markings, 415785980 edges, 835 markings/sec, 430 secs
lola: 143200461 markings, 415826692 edges, 2731 markings/sec, 435 secs
lola: 143205383 markings, 415841210 edges, 984 markings/sec, 440 secs
lola: 143221074 markings, 415887213 edges, 3138 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= TaskReady) OR A (F (E (G ((TaskReady <= TransferToDisk))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= TaskReady)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= TaskReady)
lola: processed formula length: 16
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((TaskReady <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U (TransferToDisk + 1 <= TaskReady))))
lola: processed formula length: 58
lola: 41 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5121 markings, 10244 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1037 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((DiskControllerUnit + 1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (CPUUnit <= DiskControllerUnit)
lola: processed formula length: 31
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 4224032 markings, 5294145 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= DiskControllerUnit) OR (E (F ((TaskOnDisk <= TaskReady))) AND ((TaskReady <= LoadingMem) OR (CPUUnit <= TaskReady)))) AND A (G (NOT DEADLOCK)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= DiskControllerUnit)
lola: processed formula length: 25
lola: 38 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3109 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking absence of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 4533247 markings, 6799974 edges, 906649 markings/sec, 0 secs
lola: 7314016 markings, 13001266 edges, 556154 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net is deadlock-free.
lola: 8392706 markings, 16781314 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((TaskReady <= FreeMemSegment) OR (LoadingMem <= TransferToDisk)) U (TaskSuspended <= 1))) AND A (F (A (G ((2 <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FreeMemSegment <= 1)
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 4097 markings, 4097 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (G (E (F (((1 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((1 <= ExecutingTask))
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality.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: 2413947 markings, 6538785 edges, 482789 markings/sec, 0 secs
lola: 4612155 markings, 12743598 edges, 439642 markings/sec, 5 secs
lola: 6669742 markings, 18572471 edges, 411517 markings/sec, 10 secs
lola: 8581430 markings, 23987537 edges, 382338 markings/sec, 15 secs
lola: 10454841 markings, 29298540 edges, 374682 markings/sec, 20 secs
lola: 12282147 markings, 34498126 edges, 365461 markings/sec, 25 secs
lola: 14092598 markings, 39691034 edges, 362090 markings/sec, 30 secs
lola: 15798147 markings, 44604094 edges, 341110 markings/sec, 35 secs
lola: 17673446 markings, 49994663 edges, 375060 markings/sec, 40 secs
lola: 19641772 markings, 55517734 edges, 393665 markings/sec, 45 secs
lola: 21482478 markings, 60830601 edges, 368141 markings/sec, 50 secs
lola: 23280291 markings, 66016145 edges, 359563 markings/sec, 55 secs
lola: 25081156 markings, 71203089 edges, 360173 markings/sec, 60 secs
lola: 26867203 markings, 76372394 edges, 357209 markings/sec, 65 secs
lola: 28685493 markings, 81625520 edges, 363658 markings/sec, 70 secs
lola: 30518875 markings, 86830833 edges, 366676 markings/sec, 75 secs
lola: 32315474 markings, 92040678 edges, 359320 markings/sec, 80 secs
lola: 34070955 markings, 97131409 edges, 351096 markings/sec, 85 secs
lola: 35821079 markings, 102200710 edges, 350025 markings/sec, 90 secs
lola: 37530044 markings, 107167401 edges, 341793 markings/sec, 95 secs
lola: 39266399 markings, 112149099 edges, 347271 markings/sec, 100 secs
lola: 40991480 markings, 117142703 edges, 345016 markings/sec, 105 secs
lola: 42633754 markings, 121947750 edges, 328455 markings/sec, 110 secs
lola: 44254542 markings, 126668956 edges, 324158 markings/sec, 115 secs
lola: 45908949 markings, 131474807 edges, 330881 markings/sec, 120 secs
lola: 47491106 markings, 136094698 edges, 316431 markings/sec, 125 secs
lola: 49169823 markings, 140961725 edges, 335743 markings/sec, 130 secs
lola: 50772652 markings, 145636093 edges, 320566 markings/sec, 135 secs
lola: 52441050 markings, 150472509 edges, 333680 markings/sec, 140 secs
lola: 54058489 markings, 155185961 edges, 323488 markings/sec, 145 secs
lola: 55632251 markings, 159782230 edges, 314752 markings/sec, 150 secs
lola: 57218872 markings, 164427933 edges, 317324 markings/sec, 155 secs
lola: 58876283 markings, 169251947 edges, 331482 markings/sec, 160 secs
lola: 60561366 markings, 174156265 edges, 337017 markings/sec, 165 secs
lola: 62222318 markings, 179007755 edges, 332190 markings/sec, 170 secs
lola: 64028050 markings, 184212527 edges, 361146 markings/sec, 175 secs
lola: 65661508 markings, 188995368 edges, 326692 markings/sec, 180 secs
lola: 67331206 markings, 193846345 edges, 333940 markings/sec, 185 secs
lola: 69009553 markings, 198739831 edges, 335669 markings/sec, 190 secs
lola: 70772645 markings, 203789102 edges, 352618 markings/sec, 195 secs
lola: 72489155 markings, 208784595 edges, 343302 markings/sec, 200 secs
lola: 74141201 markings, 213617666 edges, 330409 markings/sec, 205 secs
lola: 75854837 markings, 218616232 edges, 342727 markings/sec, 210 secs
lola: 77526558 markings, 223508529 edges, 334344 markings/sec, 215 secs
lola: 79162888 markings, 228299957 edges, 327266 markings/sec, 220 secs
lola: 80851995 markings, 233211283 edges, 337821 markings/sec, 225 secs
lola: 82549075 markings, 238156351 edges, 339416 markings/sec, 230 secs
lola: 84284030 markings, 243205383 edges, 346991 markings/sec, 235 secs
lola: 86001651 markings, 248211670 edges, 343524 markings/sec, 240 secs
lola: 87724006 markings, 253239058 edges, 344471 markings/sec, 245 secs
lola: 89376562 markings, 258079100 edges, 330511 markings/sec, 250 secs
lola: 91055445 markings, 262993386 edges, 335777 markings/sec, 255 secs
lola: 92669118 markings, 267733942 edges, 322735 markings/sec, 260 secs
lola: 94350362 markings, 272644705 edges, 336249 markings/sec, 265 secs
lola: 95999742 markings, 277472816 edges, 329876 markings/sec, 270 secs
lola: 97607820 markings, 282191425 edges, 321616 markings/sec, 275 secs
lola: 99243307 markings, 286984467 edges, 327097 markings/sec, 280 secs
lola: 100910820 markings, 291856363 edges, 333503 markings/sec, 285 secs
lola: 102542591 markings, 296641516 edges, 326354 markings/sec, 290 secs
lola: 104184757 markings, 301454890 edges, 328433 markings/sec, 295 secs
lola: 105834333 markings, 306285350 edges, 329915 markings/sec, 300 secs
lola: 107422670 markings, 310958835 edges, 317667 markings/sec, 305 secs
lola: 109071378 markings, 315782447 edges, 329742 markings/sec, 310 secs
lola: 110738407 markings, 320652278 edges, 333406 markings/sec, 315 secs
lola: 112421337 markings, 325566352 edges, 336586 markings/sec, 320 secs
lola: 114169406 markings, 330646157 edges, 349614 markings/sec, 325 secs
lola: 115818549 markings, 335478671 edges, 329829 markings/sec, 330 secs
lola: 117405230 markings, 340154681 edges, 317336 markings/sec, 335 secs
lola: 119064091 markings, 345011104 edges, 331772 markings/sec, 340 secs
lola: 120700035 markings, 349799666 edges, 327189 markings/sec, 345 secs
lola: 122334598 markings, 354593036 edges, 326913 markings/sec, 350 secs
lola: 123900853 markings, 359199920 edges, 313251 markings/sec, 355 secs
lola: 125523226 markings, 363959002 edges, 324475 markings/sec, 360 secs
lola: 127107318 markings, 368619474 edges, 316818 markings/sec, 365 secs
lola: 128718771 markings, 373349223 edges, 322291 markings/sec, 370 secs
lola: 130310620 markings, 378021756 edges, 318370 markings/sec, 375 secs
lola: 131978557 markings, 382895933 edges, 333587 markings/sec, 380 secs
lola: 133570535 markings, 387578879 edges, 318396 markings/sec, 385 secs
lola: 135116672 markings, 392139684 edges, 309227 markings/sec, 390 secs
lola: 136675481 markings, 396733555 edges, 311762 markings/sec, 395 secs
lola: 138330560 markings, 401561370 edges, 331016 markings/sec, 400 secs
lola: 139934537 markings, 406271317 edges, 320795 markings/sec, 405 secs
lola: 141565811 markings, 411048895 edges, 326255 markings/sec, 410 secs
lola: 142936471 markings, 415052626 edges, 274132 markings/sec, 415 secs
lola: 143143663 markings, 415658509 edges, 41438 markings/sec, 420 secs
lola: 143202594 markings, 415832870 edges, 11786 markings/sec, 425 secs
lola: 143207656 markings, 415848108 edges, 1012 markings/sec, 430 secs
lola: 143232649 markings, 415922786 edges, 4999 markings/sec, 435 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA SmallOperatingSystem-PT-MT2048DC1024-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes yes yes unknown yes yes no no yes no no
lola:
preliminary result: yes no no yes yes yes yes yes unknown yes yes no no yes no no
lola: memory consumption: 18996 KB
lola: time consumption: 916 seconds

BK_STOP 1527237658963

--------------------
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-MT2048DC1024"
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/SmallOperatingSystem-PT-MT2048DC1024.tgz
mv SmallOperatingSystem-PT-MT2048DC1024 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-MT2048DC1024, 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-152705512500101"
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 ;