fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r160-smll-152705512400075
Last Updated
June 26, 2018

About the Execution of LoLA for SmallOperatingSystem-PT-MT0512DC0256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
148.610 399.00 50.00 0.00 TTTFFTFTTT?TTTFT normal

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 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.2K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT0512DC0256, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400075
=====================================================================


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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1527224261973

info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0256 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0256 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ SmallOperatingSystem-PT-MT0512DC0256 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0512DC0256-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: (1 <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 256)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: always true
lola: LP says that atomic proposition is always true: (TaskSuspended <= CPUUnit)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (256 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: A (G (())) : E (F (((TaskSuspended <= TransferToDisk) AND ((3 <= FreeMemSegment) OR (2 <= TransferToDisk)) AND (FreeMemSegment <= TransferToDisk)))) : A (G (())) : A (G ((((CPUUnit <= DiskControllerUnit) AND ((ExecutingTask <= DiskControllerUnit) OR (CPUUnit <= TaskSuspended))) OR ((DiskControllerUnit <= FreeMemSegment) AND (TaskReady + 1 <= TaskOnDisk))))) : A (G (((3 <= DiskControllerUnit)))) : E (F (((3 <= ExecutingTask) AND (CPUUnit <= TaskReady)))) : A (G ((TransferToDisk <= DiskControllerUnit))) : A (G (())) : E (F (((TaskSuspended <= DiskControllerUnit) AND (TransferToDisk <= ExecutingTask) AND (FreeMemSegment <= ExecutingTask)))) : A (G (TRUE)) : A (G (TRUE)) : E (F (((2 <= LoadingMem) AND ((CPUUnit <= TaskSuspended) OR (TaskOnDisk <= CPUUnit)) AND (1 <= ExecutingTask) AND (DiskControllerUnit <= CPUUnit) AND (FreeMemSegment <= 1)))) : A (G (())) : A (G ((((2 <= DiskControllerUnit) OR (3 <= CPUUnit) OR (3 <= LoadingMem) OR (2 <= ExecutingTask))))) : A (G (((TaskSuspended <= FreeMemSegment) AND ((1 <= TaskSuspended) OR (2 <= CPUUnit))))) : A (G (TRUE))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 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: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-7 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 356 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: 21 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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-MT0512DC0256-ReachabilityCardinality-15 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 (((3 <= DiskControllerUnit))))
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 <= DiskControllerUnit))))
lola: processed formula length: 35
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: ((DiskControllerUnit <= 2))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-7-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: 255 markings, 254 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TransferToDisk <= DiskControllerUnit)))
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 ((TransferToDisk <= DiskControllerUnit)))
lola: processed formula length: 46
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: (DiskControllerUnit + 1 <= TransferToDisk)
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: 773 markings, 773 edges

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended <= TransferToDisk) AND ((3 <= FreeMemSegment) OR (2 <= TransferToDisk)) AND (FreeMemSegment <= 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 (((TaskSuspended <= TransferToDisk) AND ((3 <= FreeMemSegment) OR (2 <= TransferToDisk)) AND (FreeMemSegment <= TransferToDisk))))
lola: processed formula length: 136
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: ((TaskSuspended <= TransferToDisk) AND ((3 <= FreeMemSegment) OR (2 <= TransferToDisk)) AND (FreeMemSegment <= TransferToDisk))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 779 markings, 786 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskSuspended <= FreeMemSegment) AND ((1 <= TaskSuspended) OR (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 (((TaskSuspended <= FreeMemSegment) AND ((1 <= TaskSuspended) OR (2 <= CPUUnit)))))
lola: processed formula length: 89
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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) OR ((TaskSuspended <= 0) AND (CPUUnit <= 1)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17027 markings, 25282 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ExecutingTask) AND (CPUUnit <= TaskReady))))
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 (((3 <= ExecutingTask) AND (CPUUnit <= TaskReady))))
lola: processed formula length: 57
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: ((3 <= ExecutingTask) AND (CPUUnit <= TaskReady))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-11-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: 6137 markings, 10215 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-5 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 ((((2 <= DiskControllerUnit) OR (3 <= CPUUnit) OR (3 <= LoadingMem) OR (2 <= 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 ((((2 <= DiskControllerUnit) OR (3 <= CPUUnit) OR (3 <= LoadingMem) OR (2 <= ExecutingTask)))))
lola: processed formula length: 103
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: (((DiskControllerUnit <= 1) AND (CPUUnit <= 2) AND (LoadingMem <= 2) AND (ExecutingTask <= 1)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-12-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.
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended <= DiskControllerUnit) AND (TransferToDisk <= ExecutingTask) AND (FreeMemSegment <= ExecutingTask))))
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 (((TaskSuspended <= DiskControllerUnit) AND (TransferToDisk <= ExecutingTask) AND (FreeMemSegment <= ExecutingTask))))
lola: processed formula length: 123
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: ((TaskSuspended <= DiskControllerUnit) AND (TransferToDisk <= ExecutingTask) AND (FreeMemSegment <= ExecutingTask))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-13-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: 895 markings, 1021 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((CPUUnit <= DiskControllerUnit) AND ((ExecutingTask <= DiskControllerUnit) OR (CPUUnit <= TaskSuspended))) OR ((DiskControllerUnit <= FreeMemSegment) AND (TaskReady + 1 <= TaskOnDisk)))))
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 ((((CPUUnit <= DiskControllerUnit) AND ((ExecutingTask <= DiskControllerUnit) OR (CPUUnit <= TaskSuspended))) OR ((DiskControllerUnit <= FreeMemSegment) AND (TaskReady + 1 <= TaskOnDisk)))))
lola: processed formula length: 197
lola: 23 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: (((DiskControllerUnit + 1 <= CPUUnit) OR ((DiskControllerUnit + 1 <= ExecutingTask) AND (TaskSuspended + 1 <= CPUUnit))) AND ((FreeMemSegment + 1 <= DiskControllerUnit) OR (TaskOnDisk <= TaskReady)))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 515 markings, 514 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= LoadingMem) AND ((CPUUnit <= TaskSuspended) OR (TaskOnDisk <= CPUUnit)) AND (1 <= ExecutingTask) AND (DiskControllerUnit <= CPUUnit) AND (FreeMemSegment <= 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 (((2 <= LoadingMem) AND ((CPUUnit <= TaskSuspended) OR (TaskOnDisk <= CPUUnit)) AND (1 <= ExecutingTask) AND (DiskControllerUnit <= CPUUnit) AND (FreeMemSegment <= 1))))
lola: processed formula length: 175
lola: 22 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0256-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: ((2 <= LoadingMem) AND ((CPUUnit <= TaskSuspended) OR (TaskOnDisk <= CPUUnit)) AND (1 <= ExecutingTask) AND (DiskControllerUnit <= CPUUnit) AND (FreeMemSegment <= 1))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 768 markings, 767 edges
lola: ========================================

FORMULA SmallOperatingSystem-PT-MT0512DC0256-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no yes yes yes yes yes yes yes no yes
lola:
preliminary result: yes yes yes no no yes no yes yes yes yes yes yes yes no yes
lola: memory consumption: 23764 KB
lola: time consumption: 0 seconds

BK_STOP 1527224262372

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmallOperatingSystem-PT-MT0512DC0256"
export BK_EXAMINATION="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-MT0512DC0256.tgz
mv SmallOperatingSystem-PT-MT0512DC0256 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is SmallOperatingSystem-PT-MT0512DC0256, examination is 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-152705512400075"
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 ;