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 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.4K 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 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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258000617
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528177493136

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 LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ 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-LTLCardinality.task
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: A ((X (G ((3 <= LoadingMem))) U X (X ((2 <= TaskSuspended))))) : A (F (X ((TRUE U (TransferToDisk <= LoadingMem))))) : A (G (X (G (X ((3 <= TransferToDisk)))))) : A (G (X ((CPUUnit <= FreeMemSegment)))) : A (X (F (F (X ((3 <= LoadingMem)))))) : A ((((TaskOnDisk <= ExecutingTask) U (3 <= TaskSuspended)) U (CPUUnit <= DiskControllerUnit))) : A ((TaskOnDisk <= TaskSuspended)) : A ((3 <= LoadingMem)) : A (G ((TaskReady <= TaskSuspended))) : A ((G (F ((TaskReady <= TaskSuspended))) U X ((3 <= CPUUnit)))) : A (F (G (X (X ((2 <= ExecutingTask)))))) : A (G ((F ((TaskSuspended <= FreeMemSegment)) U X (TRUE)))) : A ((TaskOnDisk <= LoadingMem)) : A (F ((TransferToDisk <= ExecutingTask))) : A ((2 <= ExecutingTask)) : A (F (F ((1 <= LoadingMem))))
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:437
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (TaskOnDisk <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TaskOnDisk <= TaskSuspended)
lola: processed formula length: 29
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-6 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 <= LoadingMem)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= LoadingMem)
lola: processed formula length: 17
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-7 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: (TaskOnDisk <= LoadingMem)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TaskOnDisk <= LoadingMem)
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-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: (2 <= ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ExecutingTask)
lola: processed formula length: 20
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((3 <= LoadingMem)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((3 <= LoadingMem)))))
lola: processed formula length: 33
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 6144 markings, 6144 edges
lola:
FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-4 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 <= TaskSuspended)) OR (G ((3 <= LoadingMem)) AND X (F ((2 <= TaskSuspended)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((2 <= TaskSuspended)) OR (G ((3 <= LoadingMem)) AND X (F ((2 <= TaskSuspended)))))))
lola: processed formula length: 94
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 4098 markings, 4098 edges
lola:
FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-0 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 (F ((TransferToDisk <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((TransferToDisk <= LoadingMem))))
lola: processed formula length: 42
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-1 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 ((X ((3 <= CPUUnit)) OR (G (F ((TaskReady <= TaskSuspended))) AND X (F ((3 <= CPUUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= CPUUnit)) OR (G (F ((TaskReady <= TaskSuspended))) AND X (F ((3 <= CPUUnit))))))
lola: processed formula length: 93
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 3 markings, 2 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-9 TRUE 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 (TRUE)) AND A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 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: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE))))
lola: processed formula length: 59
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 3492234 markings, 6968191 edges, 698447 markings/sec, 0 secs
lola: 7175614 markings, 14321824 edges, 736676 markings/sec, 5 secs
lola: 10808499 markings, 21570379 edges, 726577 markings/sec, 10 secs
lola: 14310603 markings, 28562451 edges, 700421 markings/sec, 15 secs
lola: 17736573 markings, 35401227 edges, 685194 markings/sec, 20 secs
lola: 21241904 markings, 42394686 edges, 701066 markings/sec, 25 secs
lola: 24640943 markings, 49180637 edges, 679808 markings/sec, 30 secs
lola: 28015633 markings, 55916882 edges, 674938 markings/sec, 35 secs
lola: 31463868 markings, 62796185 edges, 689647 markings/sec, 40 secs
lola: 34781142 markings, 69418617 edges, 663455 markings/sec, 45 secs
lola: 38150679 markings, 76144600 edges, 673907 markings/sec, 50 secs
lola: 41522586 markings, 82876342 edges, 674381 markings/sec, 55 secs
lola: 44804127 markings, 89426332 edges, 656308 markings/sec, 60 secs
lola: 48201820 markings, 96204624 edges, 679539 markings/sec, 65 secs
lola: 51494934 markings, 102778793 edges, 658623 markings/sec, 70 secs
lola: 54651503 markings, 109078841 edges, 631314 markings/sec, 75 secs
lola: 57940997 markings, 115645793 edges, 657899 markings/sec, 80 secs
lola: 61160339 markings, 122071437 edges, 643868 markings/sec, 85 secs
lola: 64486513 markings, 128706756 edges, 665235 markings/sec, 90 secs
lola: 67690126 markings, 135101959 edges, 640723 markings/sec, 95 secs
lola: 70956599 markings, 141621926 edges, 653295 markings/sec, 100 secs
lola: 74198949 markings, 148094638 edges, 648470 markings/sec, 105 secs
lola: 77394003 markings, 154471771 edges, 639011 markings/sec, 110 secs
lola: 80677361 markings, 161026539 edges, 656672 markings/sec, 115 secs
lola: 83838879 markings, 167332593 edges, 632304 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((3 <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((3 <= TransferToDisk)))))
lola: processed formula length: 37
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 4098 markings, 4098 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((CPUUnit <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((CPUUnit <= FreeMemSegment))))
lola: processed formula length: 39
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 4098 markings, 4098 edges
lola:
FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskReady <= 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 ((TaskReady <= TaskSuspended)))
lola: processed formula length: 36
lola: 37 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (TaskSuspended + 1 <= TaskReady)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges

FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= LoadingMem)))
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: (LoadingMem <= 0)
lola: processed formula length: 17
lola: 37 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((TransferToDisk <= ExecutingTask)))
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: (ExecutingTask + 1 <= TransferToDisk)
lola: processed formula length: 37
lola: 37 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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-MT2048DC1024-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= ExecutingTask))))
lola: processed formula length: 32
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 4098 markings, 4099 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((TaskOnDisk <= ExecutingTask) U (3 <= TaskSuspended)) U (CPUUnit <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((TaskOnDisk <= ExecutingTask) U (3 <= TaskSuspended)) U (CPUUnit <= DiskControllerUnit)))
lola: processed formula length: 94
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 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: 8 markings, 8 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (X (TRUE)) AND A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
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: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((TaskSuspended <= FreeMemSegment)) OR X (TRUE))))
lola: processed formula length: 59
lola: 35 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT2048DC1024-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: 3454849 markings, 6893409 edges, 690970 markings/sec, 0 secs
lola: 7111683 markings, 14193942 edges, 731367 markings/sec, 5 secs
lola: 10729407 markings, 21412168 edges, 723545 markings/sec, 10 secs
lola: 14198851 markings, 28338909 edges, 693889 markings/sec, 15 secs
lola: 17623239 markings, 35174523 edges, 684878 markings/sec, 20 secs
lola: 21115078 markings, 42140993 edges, 698368 markings/sec, 25 secs
lola: 24474593 markings, 48847880 edges, 671903 markings/sec, 30 secs
lola: 27858641 markings, 55602846 edges, 676810 markings/sec, 35 secs
lola: 31264464 markings, 62402387 edges, 681165 markings/sec, 40 secs
lola: 34552368 markings, 68960993 edges, 657581 markings/sec, 45 secs
lola: 37947367 markings, 75737910 edges, 679000 markings/sec, 50 secs
lola: 41268651 markings, 82368389 edges, 664257 markings/sec, 55 secs
lola: 44566636 markings, 88951271 edges, 659597 markings/sec, 60 secs
lola: 47941776 markings, 95689503 edges, 675028 markings/sec, 65 secs
lola: 51183124 markings, 102155070 edges, 648270 markings/sec, 70 secs
lola: 54510295 markings, 108796377 edges, 665434 markings/sec, 75 secs
lola: 57786937 markings, 115337623 edges, 655328 markings/sec, 80 secs
lola: 61036392 markings, 121823501 edges, 649891 markings/sec, 85 secs
lola: 64362634 markings, 128463985 edges, 665248 markings/sec, 90 secs
lola: 67568228 markings, 134858123 edges, 641119 markings/sec, 95 secs
lola: 70866353 markings, 141441402 edges, 659625 markings/sec, 100 secs
lola: 74104711 markings, 147906131 edges, 647672 markings/sec, 105 secs
lola: 77323072 markings, 154329885 edges, 643672 markings/sec, 110 secs
lola: 80608594 markings, 160888982 edges, 657104 markings/sec, 115 secs
lola: 83776801 markings, 167208418 edges, 633641 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.

lola: ========================================FORMULA SmallOperatingSystem-PT-MT2048DC1024-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: RESULT
lola:
SUMMARY: no yes no no no no no no no yes no unknown no yes no yes
lola:
preliminary result: no yes no no no no no no no yes no unknown no yes no yes
lola: memory consumption: 17332 KB
lola: time consumption: 256 seconds

BK_STOP 1528177749066

--------------------
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="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-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 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-152732258000617"
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 ;