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 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K 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.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0512DC0256, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258000609
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528176685458

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0256 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0256 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT0512DC0256 @ 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-MT0512DC0256-LTLCardinality.task
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= CPUUnit)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (256 <= 0)
lola: always false
lola: A (F ((X ((3 <= FreeMemSegment)) U X ((TaskOnDisk <= FreeMemSegment))))) : A (G ((F ((DiskControllerUnit <= FreeMemSegment)) U X ((1 <= TaskSuspended))))) : A (F (G (X (X ((TaskOnDisk <= TransferToDisk)))))) : A (G ((F (TRUE) U F ((2 <= TaskSuspended))))) : A (F (X ((1 <= ExecutingTask)))) : A ((((1 <= TransferToDisk) U (LoadingMem <= TransferToDisk)) U X (X ((1 <= LoadingMem))))) : A ((F (G (TRUE)) U F (X ((LoadingMem <= FreeMemSegment))))) : A ((G (X ((TransferToDisk <= ExecutingTask))) U G (G ((TaskSuspended <= ExecutingTask))))) : A ((2 <= TaskSuspended)) : A (F ((F (TRUE) U G ((2 <= CPUUnit))))) : A (((TRUE U (2 <= LoadingMem)) U (1 <= FreeMemSegment))) : A ((3 <= ExecutingTask)) : A ((1 <= TaskSuspended)) : A (((TRUE U TRUE) U ((ExecutingTask <= TaskSuspended) U FALSE))) : A ((TaskReady <= TaskSuspended)) : A ((TaskSuspended <= DiskControllerUnit))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= TaskSuspended)
lola: processed formula length: 20
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-8 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: (3 <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ExecutingTask)
lola: processed formula length: 20
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= TaskSuspended)
lola: processed formula length: 20
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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-MT0512DC0256-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (TaskReady <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TaskReady <= TaskSuspended)
lola: processed formula length: 28
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-14 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: (TaskSuspended <= DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TaskSuspended <= DiskControllerUnit)
lola: processed formula length: 37
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((TaskOnDisk <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((TaskOnDisk <= FreeMemSegment))))
lola: processed formula length: 42
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-0 TRUE 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 (F ((1 <= TaskSuspended)))) AND A (G ((F ((DiskControllerUnit <= FreeMemSegment)) OR X ((1 <= TaskSuspended))))))
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: A (G (F ((1 <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= TaskSuspended))))
lola: processed formula length: 32
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= TransferToDisk) U (LoadingMem <= TransferToDisk)) U X (X ((1 <= LoadingMem)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= TransferToDisk) U (LoadingMem <= TransferToDisk)) U X (X ((1 <= LoadingMem)))))
lola: processed formula length: 90
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1034 markings, 1034 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-5 FALSE 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: A (X (F ((LoadingMem <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((LoadingMem <= FreeMemSegment))))
lola: processed formula length: 42
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-6 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 ((X (G ((TransferToDisk <= ExecutingTask))) U G ((TaskSuspended <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((TransferToDisk <= ExecutingTask))) U G ((TaskSuspended <= ExecutingTask))))
lola: processed formula length: 86
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 133635 markings, 264878 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= CPUUnit))))
lola: processed formula length: 26
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 7
lola: add low 4
lola: add low 7
lola: add low 2
lola: add low 1
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 277458 markings, 354492 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= TaskSuspended))))
lola: processed formula length: 32
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= LoadingMem)) U (1 <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= LoadingMem)) U (1 <= FreeMemSegment)))
lola: processed formula length: 51
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((TaskOnDisk <= TransferToDisk))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((TaskOnDisk <= TransferToDisk))))
lola: processed formula length: 42
lola: 49 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 259 markings, 260 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no yes no no no yes no no no yes yes
lola:
preliminary result: yes no no no no no yes no no no yes no no no yes yes
lola: memory consumption: 19928 KB
lola: time consumption: 1 seconds

BK_STOP 1528176686164

--------------------
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-MT0512DC0256"
export BK_EXAMINATION="LTLCardinality"
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-MT0512DC0256.tgz
mv SmallOperatingSystem-PT-MT0512DC0256 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-MT0512DC0256, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732258000609"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;