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 192K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.9K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT1024DC0512, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258000613
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528176758531

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT1024DC0512 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT1024DC0512 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT1024DC0512 @ 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-MT1024DC0512-LTLCardinality.task
lola: LP says that atomic proposition is always true: (TransferToDisk <= CPUUnit)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 512)
lola: always true
lola: LP says that atomic proposition is always true: (TaskReady <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskReady <= CPUUnit)
lola: A (G (G (X ((3 <= TransferToDisk))))) : A (X ((2 <= DiskControllerUnit))) : A (F (((LoadingMem <= TaskSuspended) U X (TRUE)))) : A ((G (F ((CPUUnit <= DiskControllerUnit))) U X (X (TRUE)))) : A (TRUE) : A (X (X ((2 <= ExecutingTask)))) : A (X (F (X (X ((1 <= TaskSuspended)))))) : A (G ((1 <= TaskSuspended))) : A (X (G (X ((CPUUnit <= LoadingMem))))) : A ((((1 <= CPUUnit) U (DiskControllerUnit <= TaskSuspended)) U (TRUE U (1 <= CPUUnit)))) : A ((F (X ((3 <= TransferToDisk))) U (TaskOnDisk <= LoadingMem))) : A (((3 <= FreeMemSegment) U X (G ((2 <= DiskControllerUnit))))) : A ((FreeMemSegment <= ExecutingTask)) : A (G (F (X (X (TRUE))))) : A (X (G (X (G ((2 <= CPUUnit)))))) : A ((2 <= FreeMemSegment))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: 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: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.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-MT1024DC0512-LTLCardinality-4 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: (FreeMemSegment <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FreeMemSegment <= ExecutingTask)
lola: processed formula length: 33
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-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-MT1024DC0512-LTLCardinality-12 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: (2 <= FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= FreeMemSegment)
lola: processed formula length: 21
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-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-MT1024DC0512-LTLCardinality-15 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: A ((X (TRUE) OR (G (F ((CPUUnit <= DiskControllerUnit))) AND X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) OR (G (F ((CPUUnit <= DiskControllerUnit))) AND X (TRUE))))
lola: processed formula length: 72
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 4 markings, 3 edges
lola: ========================================

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

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((2 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= ExecutingTask))))
lola: processed formula length: 32
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 2050 markings, 2050 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-5 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 (X (X (F ((1 <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((1 <= TaskSuspended))))))
lola: processed formula length: 40
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 2050 markings, 2050 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-6 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 (X (X (G ((CPUUnit <= LoadingMem)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((CPUUnit <= LoadingMem)))))
lola: processed formula length: 39
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 2050 markings, 2050 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-8 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 ((3 <= TransferToDisk))) U (TaskOnDisk <= LoadingMem)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= TransferToDisk))) U (TaskOnDisk <= LoadingMem)))
lola: processed formula length: 64
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-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: 2050 markings, 2050 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-10 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 (((3 <= FreeMemSegment) U X (G ((2 <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= FreeMemSegment) U X (G ((2 <= DiskControllerUnit)))))
lola: processed formula length: 63
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3583 markings, 4601 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-11 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 ((2 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= DiskControllerUnit)))
lola: processed formula length: 33
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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-MT1024DC0512-LTLCardinality-1 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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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-MT1024DC0512-LTLCardinality-13 TRUE 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 (X (X (G ((2 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= CPUUnit)))))
lola: processed formula length: 30
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 3765728 markings, 7510411 edges, 753146 markings/sec, 0 secs
lola: 7551182 markings, 15060953 edges, 757091 markings/sec, 5 secs
lola: 11224283 markings, 22388376 edges, 734620 markings/sec, 10 secs
lola: 14857188 markings, 29635516 edges, 726581 markings/sec, 15 secs
lola: 18469198 markings, 36839485 edges, 722402 markings/sec, 20 secs
lola: 22051985 markings, 43985139 edges, 716557 markings/sec, 25 secs
lola: 25442558 markings, 50747866 edges, 678115 markings/sec, 30 secs
lola: 28936471 markings, 57716004 edges, 698783 markings/sec, 35 secs
lola: 32440205 markings, 64703944 edges, 700747 markings/sec, 40 secs
lola: 35924485 markings, 71653122 edges, 696856 markings/sec, 45 secs
lola: 39391854 markings, 78568621 edges, 693474 markings/sec, 50 secs
lola: 42862937 markings, 85490263 edges, 694217 markings/sec, 55 secs
lola: 46322495 markings, 92389027 edges, 691912 markings/sec, 60 secs
lola: 49771509 markings, 99266815 edges, 689803 markings/sec, 65 secs
lola: 53227478 markings, 106157400 edges, 691194 markings/sec, 70 secs
lola: 56667502 markings, 113016227 edges, 688005 markings/sec, 75 secs
lola: 60113626 markings, 119887467 edges, 689225 markings/sec, 80 secs
lola: 63424348 markings, 126487994 edges, 662144 markings/sec, 85 secs
lola: 66886492 markings, 133390326 edges, 692429 markings/sec, 90 secs
lola: 70356274 markings, 140306807 edges, 693956 markings/sec, 95 secs
lola: 73804760 markings, 147180941 edges, 689697 markings/sec, 100 secs
lola: 77265219 markings, 154077943 edges, 692092 markings/sec, 105 secs
lola: 80716827 markings, 160957538 edges, 690322 markings/sec, 110 secs
lola: 84184037 markings, 167867322 edges, 693442 markings/sec, 115 secs
lola: 84572983 markings, 168641610 edges, 77789 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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-MT1024DC0512-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= TaskSuspended)))
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= CPUUnit)))
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: (CPUUnit <= 0)
lola: processed formula length: 14
lola: 33 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.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: ========================================

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((2 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= CPUUnit)))))
lola: processed formula length: 30
lola: 31 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality.task
lola: the resulting Büchi automaton has 4 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: 3739625 markings, 7458188 edges, 747925 markings/sec, 0 secs
lola: 7532377 markings, 15024855 edges, 758550 markings/sec, 5 secs
lola: 11224130 markings, 22388074 edges, 738351 markings/sec, 10 secs
lola: 14865876 markings, 29652896 edges, 728349 markings/sec, 15 secs
lola: 18487132 markings, 36875366 edges, 724251 markings/sec, 20 secs
lola: 22075636 markings, 44032457 edges, 717701 markings/sec, 25 secs
lola: 25631956 markings, 51125313 edges, 711264 markings/sec, 30 secs
lola: 29186728 markings, 58215224 edges, 710954 markings/sec, 35 secs
lola: 32709426 markings, 65241116 edges, 704540 markings/sec, 40 secs
lola: 36221726 markings, 72246364 edges, 702460 markings/sec, 45 secs
lola: 39740870 markings, 79264011 edges, 703829 markings/sec, 50 secs
lola: 43247122 markings, 86256042 edges, 701250 markings/sec, 55 secs
lola: 46736695 markings, 93214882 edges, 697915 markings/sec, 60 secs
lola: 50220503 markings, 100160939 edges, 696762 markings/sec, 65 secs
lola: 53706496 markings, 107112992 edges, 697199 markings/sec, 70 secs
lola: 57162650 markings, 114004118 edges, 691231 markings/sec, 75 secs
lola: 60642020 markings, 120940501 edges, 695874 markings/sec, 80 secs
lola: 64113948 markings, 127862225 edges, 694386 markings/sec, 85 secs
lola: 67570984 markings, 134754389 edges, 691407 markings/sec, 90 secs
lola: 71027393 markings, 141644162 edges, 691282 markings/sec, 95 secs
lola: 74481626 markings, 148529849 edges, 690847 markings/sec, 100 secs
lola: 77940657 markings, 155424056 edges, 691806 markings/sec, 105 secs
lola: 81393430 markings, 162306041 edges, 690555 markings/sec, 110 secs
lola: 84493447 markings, 168483793 edges, 620003 markings/sec, 115 secs
lola: 84570202 markings, 168636725 edges, 15351 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA SmallOperatingSystem-PT-MT1024DC0512-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no no no yes no no no yes unknown yes
lola:
preliminary result: no yes yes yes yes no no no no yes no no no yes unknown yes
lola: memory consumption: 16988 KB
lola: time consumption: 253 seconds

BK_STOP 1528177011168

--------------------
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-MT1024DC0512"
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-MT1024DC0512.tgz
mv SmallOperatingSystem-PT-MT1024DC0512 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-MT1024DC0512, 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-152732258000613"
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 ;