Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0064DC0032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400031
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527196836416

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0032 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0032 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT0064DC0032 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always true: (LoadingMem <= CPUUnit)
lola: always true
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: always true
lola: NOT(A (G ((2 <= CPUUnit)))) : E (F (((FreeMemSegment <= 0) AND (TaskReady <= 0)))) : (A (X (A (G ((2 <= FreeMemSegment))))) AND (((ExecutingTask <= 2) OR ((2 <= TransferToDisk) AND (1 <= LoadingMem)) OR ((3 <= CPUUnit) AND ((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit)))) OR A (((LoadingMem <= TransferToDisk) U (1 <= TransferToDisk))))) : E (F ((TaskOnDisk <= TransferToDisk))) : A (G ((E (G ((1 <= DiskControllerUnit))) OR ((TaskReady + 1 <= CPUUnit))))) : E (F (((CPUUnit <= TaskReady) AND A (F ((LoadingMem <= FreeMemSegment)))))) : E (F ((((FreeMemSegment <= LoadingMem)) AND A (X ((DiskControllerUnit <= LoadingMem)))))) : ((ExecutingTask <= TaskReady) AND NOT(E (F ((CPUUnit <= LoadingMem))))) : ((2 <= LoadingMem) OR NOT(E ((TRUE U (FreeMemSegment <= TaskReady))))) : E (G ((TaskReady <= TransferToDisk))) : ((1 <= CPUUnit) AND E (G (E (F ((CPUUnit <= DiskControllerUnit)))))) : E (F ((E (G ((TaskOnDisk <= TaskSuspended))) OR A (X ((CPUUnit <= FreeMemSegment)))))) : A (F (A (G (((2 <= TransferToDisk) OR (TaskReady <= DiskControllerUnit)))))) : E (F (A (X (((CPUUnit <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit)))))) : (NOT(E (X ((CPUUnit <= 2)))) AND (E (((TaskOnDisk <= CPUUnit) U (FreeMemSegment <= TransferToDisk))) AND A (F (((ExecutingTask <= TransferToDisk) OR (ExecutingTask <= FreeMemSegment)))))) : A (F (E (X ((TaskSuspended + 1 <= ExecutingTask)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((2 <= FreeMemSegment))))) AND (((ExecutingTask <= 2) OR ((2 <= TransferToDisk) AND (1 <= LoadingMem)) OR ((3 <= CPUUnit) AND ((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit)))) OR A (((LoadingMem <= TransferToDisk) U (1 <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((LoadingMem <= TransferToDisk) U (1 <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((LoadingMem <= TransferToDisk) U (1 <= TransferToDisk)))
lola: processed formula length: 60
lola: 19 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ExecutingTask <= 2) OR ((2 <= TransferToDisk) AND (1 <= LoadingMem)) OR ((3 <= CPUUnit) AND ((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ExecutingTask <= 2) OR ((2 <= TransferToDisk) AND (1 <= LoadingMem)) OR ((3 <= CPUUnit) AND ((2 <= DiskControllerUnit) OR (2 <= DiskControllerUnit))))
lola: processed formula length: 155
lola: 15 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((2 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FreeMemSegment <= 1)
lola: processed formula length: 21
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 94 markings, 93 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-2 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: E (F ((((FreeMemSegment <= LoadingMem)) AND A (X ((DiskControllerUnit <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((FreeMemSegment <= LoadingMem)) AND AX((DiskControllerUnit <= LoadingMem))))
lola: processed formula length: 87
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((TaskOnDisk <= TaskSuspended))))) OR E (F (A (X ((CPUUnit <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((TaskOnDisk <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (TaskOnDisk <= TaskSuspended)
lola: processed formula length: 29
lola: 16 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 1466128 markings, 7121386 edges, 293226 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 1476113 markings, 7783361 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((CPUUnit <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((CPUUnit <= FreeMemSegment)))
lola: processed formula length: 41
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2658162 markings, 7124153 edges, 531632 markings/sec, 0 secs
lola: 4753920 markings, 13169026 edges, 419152 markings/sec, 5 secs
lola: 6931727 markings, 19532651 edges, 435561 markings/sec, 10 secs
lola: 9125526 markings, 26299696 edges, 438760 markings/sec, 15 secs
lola: 9128131 markings, 33354690 edges, 521 markings/sec, 20 secs
lola: 9128997 markings, 39924304 edges, 173 markings/sec, 25 secs
lola: 9129665 markings, 46378996 edges, 134 markings/sec, 30 secs
lola: 9132469 markings, 52789822 edges, 561 markings/sec, 35 secs
lola: 9132555 markings, 59142893 edges, 17 markings/sec, 40 secs
lola: 9133641 markings, 65745410 edges, 217 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9133641 markings, 67762816 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((CPUUnit <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(((CPUUnit <= FreeMemSegment) AND (TaskSuspended <= DiskControllerUnit))))
lola: processed formula length: 85
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2446437 markings, 6516553 edges, 489287 markings/sec, 0 secs
lola: 4607129 markings, 12741698 edges, 432138 markings/sec, 5 secs
lola: 6632045 markings, 18653891 edges, 404983 markings/sec, 10 secs
lola: 8648008 markings, 24602337 edges, 403193 markings/sec, 15 secs
lola: 9127820 markings, 31141764 edges, 95962 markings/sec, 20 secs
lola: 9128656 markings, 36908767 edges, 167 markings/sec, 25 secs
lola: 9129247 markings, 42686297 edges, 118 markings/sec, 30 secs
lola: 9129885 markings, 48461115 edges, 128 markings/sec, 35 secs
lola: 9132471 markings, 54056643 edges, 517 markings/sec, 40 secs
lola: 9132796 markings, 60389355 edges, 65 markings/sec, 45 secs
lola: 9133641 markings, 67570567 edges, 169 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9133641 markings, 67762816 edges
lola:
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((3 <= CPUUnit))) AND (E (((TaskOnDisk <= CPUUnit) U (FreeMemSegment <= TransferToDisk))) AND A (F (((ExecutingTask <= TransferToDisk) OR (ExecutingTask <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((ExecutingTask <= TransferToDisk) OR (ExecutingTask <= FreeMemSegment))))
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: ((TransferToDisk + 1 <= ExecutingTask) AND (FreeMemSegment + 1 <= ExecutingTask))
lola: processed formula length: 81
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: lola: ========================================
subprocess 5 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((TaskOnDisk <= CPUUnit) U (FreeMemSegment <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((TaskOnDisk <= CPUUnit) U (FreeMemSegment <= TransferToDisk)))
lola: processed formula length: 66
lola: 18 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FreeMemSegment <= TransferToDisk)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 96 markings, 95 edges
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((3 <= CPUUnit))
lola: processed formula length: 18
lola: 16 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((TaskSuspended + 1 <= ExecutingTask)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX((TaskSuspended + 1 <= ExecutingTask)))
lola: processed formula length: 50
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 65 markings, 64 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((CPUUnit <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((CPUUnit <= 1)))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (CPUUnit <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11257 markings, 19383 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((TaskOnDisk <= TransferToDisk)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((TaskOnDisk <= TransferToDisk)))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (TaskOnDisk <= TransferToDisk)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 318 markings, 411 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-7-0.sara
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)

lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((FreeMemSegment <= 0) AND (TaskReady <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((FreeMemSegment <= 0) AND (TaskReady <= 0))))
lola: processed formula length: 52
lola: 16 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FreeMemSegment <= 0) AND (TaskReady <= 0))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 129 markings, 128 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================

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

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((1 <= DiskControllerUnit))) OR ((TaskReady + 1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (A(TRUE U (DiskControllerUnit <= 0)) AND ((CPUUnit <= TaskReady)))))
lola: processed formula length: 81
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1667115 markings, 7602529 edges, 333423 markings/sec, 0 secs
lola: 3281953 markings, 15368910 edges, 322968 markings/sec, 5 secs
lola: 4829567 markings, 22903128 edges, 309523 markings/sec, 10 secs
lola: 6373061 markings, 30463265 edges, 308699 markings/sec, 15 secs
lola: 7881147 markings, 37899761 edges, 301617 markings/sec, 20 secs
lola: 9126716 markings, 45695724 edges, 249114 markings/sec, 25 secs
lola: 9128313 markings, 52369113 edges, 319 markings/sec, 30 secs
lola: 9129062 markings, 58444078 edges, 150 markings/sec, 35 secs
lola: 9129704 markings, 64679675 edges, 128 markings/sec, 40 secs
lola: 9132470 markings, 70953720 edges, 553 markings/sec, 45 secs
lola: 9132555 markings, 77537070 edges, 17 markings/sec, 50 secs
lola: 9133641 markings, 84524257 edges, 217 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9133641 markings, 85832098 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= TaskReady) AND A (F ((LoadingMem <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U ((CPUUnit <= TaskReady) AND A(TRUE U (LoadingMem <= FreeMemSegment))))
lola: processed formula length: 79
lola: 17 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 129 markings, 129 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= CPUUnit) AND E (G (E (F ((CPUUnit <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no yes yes yes yes unknown unknown no unknown no unknown no yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 22284 KB
lola: time consumption: 1023 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes yes no yes yes yes yes unknown unknown no unknown no unknown no yes yes
lola:
preliminary result: yes yes no yes yes yes yes unknown unknown no unknown no unknown no yes yes
lola: memory consumption: 22284 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0064DC0032"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0064DC0032.tgz
mv SmallOperatingSystem-PT-MT0064DC0032 execution
cd execution
pwd
ls -lh

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