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 196K
-rw-r--r-- 1 mcc users 4.1K 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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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-MT0256DC0064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400054
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527209568383

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0256DC0064 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0256DC0064 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ SmallOperatingSystem-PT-MT0256DC0064 @ 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-MT0256DC0064-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: always true
lola: LP says that atomic proposition is always true: (TransferToDisk <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= ExecutingTask)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: E (F ((CPUUnit <= TaskSuspended))) : A (G ((2 <= CPUUnit))) : E (F (((TransferToDisk <= ExecutingTask) AND (3 <= TransferToDisk)))) : E (F ((((CPUUnit <= 2) AND (FreeMemSegment <= 2))))) : A (G (((ExecutingTask + 1 <= TaskReady) OR (TransferToDisk + 1 <= DiskControllerUnit) OR (LoadingMem <= 2)))) : A (G ((((1 <= TaskSuspended) AND (ExecutingTask <= CPUUnit)) OR (3 <= FreeMemSegment)))) : E (F (((FreeMemSegment <= CPUUnit) AND ((TaskReady <= 2) OR (TransferToDisk <= 0))))) : E (F (((CPUUnit <= TaskReady) AND (FreeMemSegment <= LoadingMem) AND ((1 <= TaskSuspended) OR (1 <= TransferToDisk)) AND ((LoadingMem <= 0) OR (FreeMemSegment + 1 <= DiskControllerUnit))))) : E (F ((FreeMemSegment + 1 <= DiskControllerUnit))) : A (G ((DiskControllerUnit <= FreeMemSegment))) : A (G (())) : A (G ((TaskSuspended <= FreeMemSegment))) : E (F ((CPUUnit <= 1))) : E (F (())) : A (G (TRUE)) : A (G (((3 <= ExecutingTask) OR (2 <= CPUUnit) OR ((TaskReady <= TransferToDisk) AND (1 <= LoadingMem)) OR ((TransferToDisk <= TaskSuspended) AND ((ExecutingTask <= DiskControllerUnit) OR (FreeMemSegment <= ExecutingTask))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: 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: 9 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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-MT0256DC0064-ReachabilityCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-13 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 9 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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-MT0256DC0064-ReachabilityCardinality-14 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 (G ((2 <= CPUUnit)))
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 ((2 <= CPUUnit)))
lola: processed formula length: 22
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: (CPUUnit <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-1 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: 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: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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-MT0256DC0064-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((DiskControllerUnit <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((DiskControllerUnit <= FreeMemSegment)))
lola: processed formula length: 46
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: (FreeMemSegment + 1 <= DiskControllerUnit)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-5-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 387 markings, 386 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-9 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: E (F ((CPUUnit <= TaskSuspended)))
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 <= TaskSuspended)))
lola: processed formula length: 34
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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 <= TaskSuspended)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-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: 385 markings, 384 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((TaskSuspended <= FreeMemSegment)))
lola: processed formula length: 41
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: (FreeMemSegment + 1 <= TaskSuspended)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 451 markings, 451 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((TransferToDisk <= ExecutingTask) AND (3 <= 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 (((TransferToDisk <= ExecutingTask) AND (3 <= TransferToDisk))))
lola: processed formula length: 69
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: ((TransferToDisk <= ExecutingTask) AND (3 <= TransferToDisk))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5177 markings, 8437 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((CPUUnit <= 2) AND (FreeMemSegment <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((CPUUnit <= 2) AND (FreeMemSegment <= 2)))))
lola: processed formula length: 52
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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 <= 2) AND (FreeMemSegment <= 2)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment + 1 <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FreeMemSegment + 1 <= DiskControllerUnit)))
lola: processed formula length: 50
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FreeMemSegment + 1 <= DiskControllerUnit)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 387 markings, 386 edges
lola:
FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-8 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: E (F (((FreeMemSegment <= CPUUnit) AND ((TaskReady <= 2) OR (TransferToDisk <= 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 <= CPUUnit) AND ((TaskReady <= 2) OR (TransferToDisk <= 0)))))
lola: processed formula length: 86
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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 <= CPUUnit) AND ((TaskReady <= 2) OR (TransferToDisk <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-11-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: 193 markings, 192 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-6 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 (G ((((1 <= TaskSuspended) AND (ExecutingTask <= CPUUnit)) OR (3 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((1 <= TaskSuspended) AND (ExecutingTask <= CPUUnit)) OR (3 <= FreeMemSegment))))
lola: processed formula length: 89
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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 <= 0) OR (CPUUnit + 1 <= ExecutingTask)) AND (FreeMemSegment <= 2))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 445 markings, 444 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask + 1 <= TaskReady) OR (TransferToDisk + 1 <= DiskControllerUnit) OR (LoadingMem <= 2))))
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 (((ExecutingTask + 1 <= TaskReady) OR (TransferToDisk + 1 <= DiskControllerUnit) OR (LoadingMem <= 2))))
lola: processed formula length: 111
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: ((TaskReady <= ExecutingTask) AND (DiskControllerUnit <= TransferToDisk) AND (3 <= LoadingMem))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-13-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 65 markings, 64 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CPUUnit <= TaskReady) AND (FreeMemSegment <= LoadingMem) AND ((1 <= TaskSuspended) OR (1 <= TransferToDisk)) AND ((LoadingMem <= 0) OR (FreeMemSegment + 1 <= DiskControllerUnit)))))
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 <= TaskReady) AND (FreeMemSegment <= LoadingMem) AND ((1 <= TaskSuspended) OR (1 <= TransferToDisk)) AND ((LoadingMem <= 0) OR (FreeMemSegment + 1 <= DiskControllerUnit)))))
lola: processed formula length: 191
lola: 10 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.task
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-12-0.sara.
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 <= TaskReady) AND (FreeMemSegment <= LoadingMem) AND ((1 <= TaskSuspended) OR (1 <= TransferToDisk)) AND ((LoadingMem <= 0) OR (FreeMemSegment + 1 <= DiskControllerUnit)))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-14-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 423 markings, 424 edges

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= ExecutingTask) OR (2 <= CPUUnit) OR ((TaskReady <= TransferToDisk) AND (1 <= LoadingMem)) OR ((TransferToDisk <= TaskSuspended) AND ((ExecutingTask <= DiskControllerUnit) OR (FreeMemSegment <= ExecutingTask))))))
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 (((3 <= ExecutingTask) OR (2 <= CPUUnit) OR ((TaskReady <= TransferToDisk) AND (1 <= LoadingMem)) OR ((TransferToDisk <= TaskSuspended) AND ((ExecutingTask <= DiskControllerUnit) OR (FreeMemSegment <= ExecutingTask))))))
lola: processed formula length: 229
lola: 11 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality.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: ((ExecutingTask <= 2) AND (CPUUnit <= 1) AND ((TransferToDisk + 1 <= TaskReady) OR (LoadingMem <= 0)) AND ((TaskSuspended + 1 <= TransferToDisk) OR ((DiskControllerUnit + 1 <= ExecutingTask) AND (ExecutingTask + 1 <= FreeMemSegment))))
lola: state equation: Generated DNF with 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA SmallOperatingSystem-PT-MT0256DC0064-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no yes yes yes no yes no yes no yes yes
lola:
preliminary result: yes no yes yes no no yes yes yes no yes no yes no yes yes
lola: memory consumption: 23064 KB
lola: time consumption: 0 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-MT0256DC0064"
export BK_EXAMINATION="ReachabilityCardinality"
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-MT0256DC0064.tgz
mv SmallOperatingSystem-PT-MT0256DC0064 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-MT0256DC0064, examination is ReachabilityCardinality"
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-152705512400054"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;