About the Execution of LoLA for SmallOperatingSystem-PT-MT0512DC0128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.070 | 3600000.00 | 987006.00 | 16307.30 | FF?FTTFTFT?TTFFT | 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 192K
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K 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.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K 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 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.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-MT0512DC0128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400066
=====================================================================
--------------------
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-MT0512DC0128-CTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527216932414
info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0128 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0512DC0128 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SmallOperatingSystem-PT-MT0512DC0128 @ 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-MT0512DC0128-CTLCardinality.task
lola: LP says that atomic proposition is always false: (TaskOnDisk <= CPUUnit)
lola: LP says that atomic proposition is always true: (3 <= TaskOnDisk)
lola: LP says that atomic proposition is always false: (TaskOnDisk <= ExecutingTask)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 384)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (DiskControllerUnit <= TaskOnDisk)
lola: after: (0 <= 384)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (384 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: always true
lola: E (F (FALSE)) : ((A (G (((3 <= TaskReady) AND (CPUUnit <= ExecutingTask)))) OR NOT(A (G (TRUE)))) OR (NOT(A (F ((1 <= LoadingMem)))) OR NOT(E (F ((1 <= FreeMemSegment)))))) : A (G (E (F (((ExecutingTask <= TaskSuspended) OR (3 <= TaskSuspended)))))) : A (G (A ((FALSE U (1 <= FreeMemSegment))))) : ((TransferToDisk <= TaskSuspended) AND E (F ((DiskControllerUnit <= LoadingMem)))) : (((E (G (TRUE)) OR (3 <= TaskReady)) AND ((ExecutingTask + 1 <= FreeMemSegment) OR ((CPUUnit <= TaskSuspended)))) AND A (F (((1 <= TaskReady) AND (ExecutingTask <= TaskSuspended) AND (ExecutingTask <= 0))))) : A (G (E (G (((2 <= ExecutingTask) OR (3 <= DiskControllerUnit)))))) : E ((E (X ((ExecutingTask <= FreeMemSegment))) U (((FreeMemSegment <= TaskSuspended) OR (LoadingMem <= CPUUnit)) AND (DiskControllerUnit + 1 <= TaskSuspended)))) : A (G (((TransferToDisk <= FreeMemSegment) AND E (F ((TaskSuspended <= DiskControllerUnit)))))) : A (G ((E (G (TRUE)) OR (3 <= TransferToDisk)))) : A (G (A (((FreeMemSegment <= TaskReady) U (1 <= CPUUnit))))) : ((3 <= TaskSuspended) OR E ((() U (FreeMemSegment + 1 <= CPUUnit)))) : E (((ExecutingTask <= TaskReady) U E (X ((FreeMemSegment <= ExecutingTask))))) : E (F (A (F (())))) : A (G (((LoadingMem + 1 <= DiskControllerUnit)))) : (NOT((A (F ((CPUUnit <= ExecutingTask))) AND A (F ((TaskReady <= ExecutingTask))))) AND E (F (((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit)))))
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: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.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-MT0512DC0128-CTLCardinality-0 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.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-MT0512DC0128-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.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-MT0512DC0128-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((ExecutingTask <= TaskReady) U E (X ((FreeMemSegment <= ExecutingTask)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((ExecutingTask <= TaskReady) U EX((FreeMemSegment <= ExecutingTask)))
lola: processed formula length: 71
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 895 markings, 894 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-12 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: E ((E (X ((ExecutingTask <= FreeMemSegment))) U (((FreeMemSegment <= TaskSuspended) OR (LoadingMem <= CPUUnit)) AND (DiskControllerUnit + 1 <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((ExecutingTask <= FreeMemSegment)) U (((FreeMemSegment <= TaskSuspended) OR (LoadingMem <= CPUUnit)) AND (DiskControllerUnit + 1 <= TaskSuspended)))
lola: processed formula length: 154
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 50050 markings, 99199 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-7 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 ((1 <= 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 <= FreeMemSegment)))
lola: processed formula length: 29
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FreeMemSegment <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 897 markings, 896 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= ExecutingTask) OR (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 (((2 <= ExecutingTask) OR (3 <= DiskControllerUnit))))
lola: processed formula length: 60
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((ExecutingTask <= 1) AND (DiskControllerUnit <= 2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 127 markings, 126 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((LoadingMem + 1 <= 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 (((LoadingMem + 1 <= DiskControllerUnit))))
lola: processed formula length: 48
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((DiskControllerUnit <= LoadingMem))
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: 65 markings, 64 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-14 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 (E (F (((ExecutingTask <= TaskSuspended) OR (3 <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((ExecutingTask <= TaskSuspended) OR (3 <= TaskSuspended))
lola: processed formula length: 59
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.task
sara: try reading problem file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-7-0.sara.
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: place or transition ordering is non-deterministic
lola: 4540266 markings, 8992901 edges, 908053 markings/sec, 0 secs
lola: 8903450 markings, 17428250 edges, 872637 markings/sec, 5 secs
lola: 12500488 markings, 25096453 edges, 719408 markings/sec, 10 secs
lola: 15826625 markings, 32750469 edges, 665227 markings/sec, 15 secs
lola: 19441118 markings, 39945479 edges, 722899 markings/sec, 20 secs
lola: 23093561 markings, 47452200 edges, 730489 markings/sec, 25 secs
lola: 26117612 markings, 54328047 edges, 604810 markings/sec, 30 secs
lola: 29441257 markings, 60925777 edges, 664729 markings/sec, 35 secs
lola: 32965751 markings, 67874201 edges, 704899 markings/sec, 40 secs
lola: 36518573 markings, 74984076 edges, 710564 markings/sec, 45 secs
lola: 40201156 markings, 82360828 edges, 736517 markings/sec, 50 secs
lola: 44170307 markings, 90138517 edges, 793830 markings/sec, 55 secs
lola: 47030093 markings, 98167401 edges, 571957 markings/sec, 60 secs
lola: 50334362 markings, 105719859 edges, 660854 markings/sec, 65 secs
lola: 53377148 markings, 112725231 edges, 608557 markings/sec, 70 secs
lola: 56308620 markings, 119640234 edges, 586294 markings/sec, 75 secs
lola: 59413292 markings, 126720314 edges, 620934 markings/sec, 80 secs
lola: 62857011 markings, 133531568 edges, 688744 markings/sec, 85 secs
lola: 66210392 markings, 140861093 edges, 670676 markings/sec, 90 secs
lola: 69069884 markings, 147498574 edges, 571898 markings/sec, 95 secs
lola: 71745515 markings, 153786399 edges, 535126 markings/sec, 100 secs
lola: 74346911 markings, 159849195 edges, 520279 markings/sec, 105 secs
lola: 77466945 markings, 166755587 edges, 624007 markings/sec, 110 secs
lola: 80609451 markings, 173002039 edges, 628501 markings/sec, 115 secs
lola: 83130855 markings, 179479065 edges, 504281 markings/sec, 120 secs
lola: 85572442 markings, 186322992 edges, 488317 markings/sec, 125 secs
lola: 88397650 markings, 192882904 edges, 565042 markings/sec, 130 secs
lola: 91068796 markings, 199116837 edges, 534229 markings/sec, 135 secs
lola: 93959808 markings, 205174987 edges, 578202 markings/sec, 140 secs
lola: 96183419 markings, 211763077 edges, 444722 markings/sec, 145 secs
lola: 98538994 markings, 217964654 edges, 471115 markings/sec, 150 secs
lola: 101522249 markings, 224535150 edges, 596651 markings/sec, 155 secs
lola: 104130283 markings, 230631072 edges, 521607 markings/sec, 160 secs
lola: 106814053 markings, 236782724 edges, 536754 markings/sec, 165 secs
lola: 109385653 markings, 243062208 edges, 514320 markings/sec, 170 secs
lola: 112113781 markings, 249350025 edges, 545626 markings/sec, 175 secs
lola: 115250960 markings, 255593293 edges, 627436 markings/sec, 180 secs
lola: 118351582 markings, 262362398 edges, 620124 markings/sec, 185 secs
lola: 120998875 markings, 268665455 edges, 529459 markings/sec, 190 secs
lola: 123862076 markings, 275224272 edges, 572640 markings/sec, 195 secs
lola: 126428807 markings, 281558503 edges, 513346 markings/sec, 200 secs
lola: 129043383 markings, 288073043 edges, 522915 markings/sec, 205 secs
lola: 131462075 markings, 294241708 edges, 483738 markings/sec, 210 secs
lola: 133685236 markings, 300622672 edges, 444632 markings/sec, 215 secs
lola: 136461363 markings, 306832219 edges, 555225 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((FreeMemSegment <= TaskReady) U (1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((FreeMemSegment <= TaskReady) U (1 <= CPUUnit)))))
lola: processed formula length: 69
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 3201834 markings, 9548987 edges, 640367 markings/sec, 0 secs
lola: 6360147 markings, 18920961 edges, 631663 markings/sec, 5 secs
lola: 9131750 markings, 27026899 edges, 554321 markings/sec, 10 secs
lola: 11672952 markings, 34858791 edges, 508240 markings/sec, 15 secs
lola: 13909786 markings, 42576818 edges, 447367 markings/sec, 20 secs
lola: 16340658 markings, 50104632 edges, 486174 markings/sec, 25 secs
lola: 18826931 markings, 57556366 edges, 497255 markings/sec, 30 secs
lola: 21348703 markings, 65099470 edges, 504354 markings/sec, 35 secs
lola: 23760864 markings, 72671891 edges, 482432 markings/sec, 40 secs
lola: 25884465 markings, 79631425 edges, 424720 markings/sec, 45 secs
lola: 28255350 markings, 86804147 edges, 474177 markings/sec, 50 secs
lola: 30596963 markings, 93809178 edges, 468323 markings/sec, 55 secs
lola: 33025837 markings, 101018624 edges, 485775 markings/sec, 60 secs
lola: 35377612 markings, 108116849 edges, 470355 markings/sec, 65 secs
lola: 37945897 markings, 115758249 edges, 513657 markings/sec, 70 secs
lola: 40468007 markings, 123356027 edges, 504422 markings/sec, 75 secs
lola: 43201831 markings, 131431798 edges, 546765 markings/sec, 80 secs
lola: 45477545 markings, 139035202 edges, 455143 markings/sec, 85 secs
lola: 47524141 markings, 147146428 edges, 409319 markings/sec, 90 secs
lola: 49906784 markings, 154564856 edges, 476529 markings/sec, 95 secs
lola: 52043485 markings, 161658685 edges, 427340 markings/sec, 100 secs
lola: 54145310 markings, 168715816 edges, 420365 markings/sec, 105 secs
lola: 56218079 markings, 175588082 edges, 414554 markings/sec, 110 secs
lola: 58361842 markings, 182782408 edges, 428753 markings/sec, 115 secs
lola: 60636753 markings, 189781860 edges, 454982 markings/sec, 120 secs
lola: 63013568 markings, 196853333 edges, 475363 markings/sec, 125 secs
lola: 65386350 markings, 204354049 edges, 474556 markings/sec, 130 secs
lola: 67461000 markings, 211238366 edges, 414930 markings/sec, 135 secs
lola: 69428180 markings, 217767230 edges, 393436 markings/sec, 140 secs
lola: 71326281 markings, 224131424 edges, 379620 markings/sec, 145 secs
lola: 73162226 markings, 230225779 edges, 367189 markings/sec, 150 secs
lola: 75102688 markings, 236681878 edges, 388092 markings/sec, 155 secs
lola: 77300189 markings, 243725631 edges, 439500 markings/sec, 160 secs
lola: 79498283 markings, 250262264 edges, 439619 markings/sec, 165 secs
lola: 81623267 markings, 256660465 edges, 424997 markings/sec, 170 secs
lola: 83284679 markings, 263221955 edges, 332282 markings/sec, 175 secs
lola: 84935000 markings, 269772007 edges, 330064 markings/sec, 180 secs
lola: 87051116 markings, 276800723 edges, 423223 markings/sec, 185 secs
lola: 88962637 markings, 283149528 edges, 382304 markings/sec, 190 secs
lola: 90858029 markings, 289470201 edges, 379078 markings/sec, 195 secs
lola: 92856860 markings, 295773565 edges, 399766 markings/sec, 200 secs
lola: 94692384 markings, 302046534 edges, 367105 markings/sec, 205 secs
lola: 96289083 markings, 308366610 edges, 319340 markings/sec, 210 secs
lola: 97925009 markings, 314665131 edges, 327185 markings/sec, 215 secs
lola: 99940079 markings, 320825374 edges, 403014 markings/sec, 220 secs
lola: 101929786 markings, 327410560 edges, 397941 markings/sec, 225 secs
lola: 103752242 markings, 333485356 edges, 364491 markings/sec, 230 secs
lola: 105646629 markings, 339540699 edges, 378877 markings/sec, 235 secs
lola: 106798962 markings, 343542682 edges, 230467 markings/sec, 240 secs
lola: 106827100 markings, 343637561 edges, 5628 markings/sec, 245 secs
lola: 106868552 markings, 343782142 edges, 8290 markings/sec, 250 secs
lola: 106899165 markings, 343892479 edges, 6123 markings/sec, 255 secs
lola: 106913497 markings, 343938899 edges, 2866 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= TaskSuspended) OR E (F ((FreeMemSegment + 1 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= TaskSuspended)
lola: processed formula length: 20
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment + 1 <= CPUUnit)))
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 <= CPUUnit)))
lola: processed formula length: 39
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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 + 1 <= CPUUnit)
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: 387 markings, 386 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((TransferToDisk <= TaskSuspended) AND E (F ((DiskControllerUnit <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (TransferToDisk <= TaskSuspended)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TransferToDisk <= TaskSuspended)
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DiskControllerUnit <= LoadingMem)))
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 ((DiskControllerUnit <= LoadingMem)))
lola: processed formula length: 42
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: (DiskControllerUnit <= LoadingMem)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((ExecutingTask + 1 <= FreeMemSegment) OR ((CPUUnit <= TaskSuspended))) AND A (F (((1 <= TaskReady) AND (ExecutingTask <= TaskSuspended) AND (ExecutingTask <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= TaskReady) AND (ExecutingTask <= TaskSuspended) AND (ExecutingTask <= 0))))
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: ((TaskReady <= 0) OR (TaskSuspended + 1 <= ExecutingTask) OR (1 <= ExecutingTask))
lola: processed formula length: 84
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 129 markings, 128 edges
lola: ========================================
lola: subprocess 13 will run for 1024 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ExecutingTask + 1 <= FreeMemSegment) OR ((CPUUnit <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ExecutingTask + 1 <= FreeMemSegment) OR ((CPUUnit <= TaskSuspended)))
lola: processed formula length: 72
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1024 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((TransferToDisk <= FreeMemSegment))) AND A (G (E (F ((TaskSuspended <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1024 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TransferToDisk <= 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 ((TransferToDisk <= FreeMemSegment)))
lola: processed formula length: 42
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FreeMemSegment + 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: 901 markings, 901 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-13-0.sara
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G ((ExecutingTask + 1 <= CPUUnit))) OR E (G ((ExecutingTask + 1 <= TaskReady)))) AND E (F (((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 14 will run for 1536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((ExecutingTask + 1 <= TaskReady)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((ExecutingTask + 1 <= TaskReady)))
lola: processed formula length: 40
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit <= 1) AND (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 (((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit))))
lola: processed formula length: 65
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: ((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 128 markings, 127 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= TaskReady) AND (CPUUnit <= ExecutingTask)))) OR (E (G ((LoadingMem <= 0))) OR A (G ((FreeMemSegment <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FreeMemSegment <= 0)))
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:695
lola: processed formula: A (G ((FreeMemSegment <= 0)))
lola: processed formula length: 29
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (1 <= FreeMemSegment)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-15-0.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= TaskReady) AND (CPUUnit <= 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 <= TaskReady) AND (CPUUnit <= ExecutingTask))))
lola: processed formula length: 57
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((TaskReady <= 2) OR (ExecutingTask + 1 <= CPUUnit))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: no
lola: state equation: calling and running sara
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((ExecutingTask <= TaskSuspended) OR (3 <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: ((ExecutingTask <= TaskSuspended) OR (3 <= TaskSuspended))
lola: processed formula length: 59
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: try reading problem file SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-17-0.sara.
sara: place or transition ordering is non-deterministic
lola: 4579431 markings, 9070580 edges, 915886 markings/sec, 0 secs
lola: 8902087 markings, 17425523 edges, 864531 markings/sec, 5 secs
lola: 12240116 markings, 24496487 edges, 667606 markings/sec, 10 secs
lola: 15538129 markings, 32185516 edges, 659603 markings/sec, 15 secs
lola: 19195484 markings, 39458693 edges, 731471 markings/sec, 20 secs
lola: 22902767 markings, 47031446 edges, 741457 markings/sec, 25 secs
lola: 25959000 markings, 53961473 edges, 611247 markings/sec, 30 secs
lola: 29434788 markings, 60912820 edges, 695158 markings/sec, 35 secs
lola: 32980285 markings, 67902726 edges, 709099 markings/sec, 40 secs
lola: 36561352 markings, 75069026 edges, 716213 markings/sec, 45 secs
lola: 40262798 markings, 82482668 edges, 740289 markings/sec, 50 secs
lola: 44269452 markings, 90333888 edges, 801331 markings/sec, 55 secs
lola: 47136878 markings, 98483033 edges, 573485 markings/sec, 60 secs
lola: 50485572 markings, 106022310 edges, 669739 markings/sec, 65 secs
lola: 53500665 markings, 113093666 edges, 603019 markings/sec, 70 secs
lola: 56451290 markings, 120022454 edges, 590125 markings/sec, 75 secs
lola: 59601834 markings, 127093981 edges, 630109 markings/sec, 80 secs
lola: 63103127 markings, 134015081 edges, 700259 markings/sec, 85 secs
lola: 66434478 markings, 141381358 edges, 666270 markings/sec, 90 secs
lola: 69297330 markings, 148080551 edges, 572570 markings/sec, 95 secs
lola: 72007281 markings, 154348149 edges, 541990 markings/sec, 100 secs
lola: 74680757 markings, 160534252 edges, 534695 markings/sec, 105 secs
lola: 77816579 markings, 167447752 edges, 627164 markings/sec, 110 secs
lola: 80958415 markings, 173692031 edges, 628367 markings/sec, 115 secs
lola: 83409160 markings, 180307934 edges, 490149 markings/sec, 120 secs
lola: 85998293 markings, 187304250 edges, 517827 markings/sec, 125 secs
lola: 88811193 markings, 193824183 edges, 562580 markings/sec, 130 secs
lola: 91463860 markings, 200156124 edges, 530533 markings/sec, 135 secs
lola: 94347210 markings, 206327821 edges, 576670 markings/sec, 140 secs
lola: 96571838 markings, 212918985 edges, 444926 markings/sec, 145 secs
lola: 99056404 markings, 218986075 edges, 496913 markings/sec, 150 secs
lola: 102035365 markings, 225742845 edges, 595792 markings/sec, 155 secs
lola: 104656193 markings, 231871441 edges, 524166 markings/sec, 160 secs
lola: 107345544 markings, 238095801 edges, 537870 markings/sec, 165 secs
lola: 109871631 markings, 244504976 edges, 505217 markings/sec, 170 secs
lola: 112844578 markings, 250787609 edges, 594589 markings/sec, 175 secs
lola: 115988722 markings, 257116562 edges, 628829 markings/sec, 180 secs
lola: 119011520 markings, 263867689 edges, 604560 markings/sec, 185 secs
lola: 121683885 markings, 270235677 edges, 534473 markings/sec, 190 secs
lola: 124616471 markings, 276735192 edges, 586517 markings/sec, 195 secs
lola: 127043965 markings, 283301413 edges, 485499 markings/sec, 200 secs
lola: 129618162 markings, 289782392 edges, 514839 markings/sec, 205 secs
lola: 132120211 markings, 295978374 edges, 500410 markings/sec, 210 secs
lola: 134303604 markings, 302348407 edges, 436679 markings/sec, 215 secs
lola: 137190015 markings, 308370687 edges, 577282 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (A (((FreeMemSegment <= TaskReady) U (1 <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((FreeMemSegment <= TaskReady) U (1 <= CPUUnit)))))
lola: processed formula length: 69
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 3071006 markings, 9158776 edges, 614201 markings/sec, 0 secs
lola: 6215285 markings, 18497686 edges, 628856 markings/sec, 5 secs
lola: 9007015 markings, 26642890 edges, 558346 markings/sec, 10 secs
lola: 11558610 markings, 34472760 edges, 510319 markings/sec, 15 secs
lola: 13781202 markings, 42065649 edges, 444518 markings/sec, 20 secs
lola: 16183433 markings, 49637003 edges, 480446 markings/sec, 25 secs
lola: 18658475 markings, 57054260 edges, 495008 markings/sec, 30 secs
lola: 21167967 markings, 64562200 edges, 501898 markings/sec, 35 secs
lola: 23600025 markings, 72167235 edges, 486412 markings/sec, 40 secs
lola: 25730243 markings, 79127470 edges, 426044 markings/sec, 45 secs
lola: 28078105 markings, 86277078 edges, 469572 markings/sec, 50 secs
lola: 30408785 markings, 93249549 edges, 466136 markings/sec, 55 secs
lola: 32851018 markings, 100497741 edges, 488447 markings/sec, 60 secs
lola: 35182372 markings, 107482001 edges, 466271 markings/sec, 65 secs
lola: 37739298 markings, 115141938 edges, 511385 markings/sec, 70 secs
lola: 40255527 markings, 122723624 edges, 503246 markings/sec, 75 secs
lola: 42975219 markings, 130763826 edges, 543938 markings/sec, 80 secs
lola: 45313789 markings, 138384519 edges, 467714 markings/sec, 85 secs
lola: 47336019 markings, 146406461 edges, 404446 markings/sec, 90 secs
lola: 49708722 markings, 153958398 edges, 474541 markings/sec, 95 secs
lola: 51848292 markings, 161021433 edges, 427914 markings/sec, 100 secs
lola: 53955665 markings, 168042907 edges, 421475 markings/sec, 105 secs
lola: 56017212 markings, 174919880 edges, 412309 markings/sec, 110 secs
lola: 58148865 markings, 182104176 edges, 426331 markings/sec, 115 secs
lola: 60415212 markings, 189121174 edges, 453269 markings/sec, 120 secs
lola: 62773802 markings, 196141417 edges, 471718 markings/sec, 125 secs
lola: 65179475 markings, 203665119 edges, 481135 markings/sec, 130 secs
lola: 67254790 markings, 210565833 edges, 415063 markings/sec, 135 secs
lola: 69226335 markings, 217130607 edges, 394309 markings/sec, 140 secs
lola: 71145988 markings, 223481461 edges, 383931 markings/sec, 145 secs
lola: 72969458 markings, 229611164 edges, 364694 markings/sec, 150 secs
lola: 74884842 markings, 235946593 edges, 383077 markings/sec, 155 secs
lola: 77064617 markings, 243023246 edges, 435955 markings/sec, 160 secs
lola: 79246455 markings, 249516380 edges, 436368 markings/sec, 165 secs
lola: 81378589 markings, 255902767 edges, 426427 markings/sec, 170 secs
lola: 83102124 markings, 262495443 edges, 344707 markings/sec, 175 secs
lola: 84731848 markings, 268968920 edges, 325945 markings/sec, 180 secs
lola: 86815305 markings, 276026201 edges, 416691 markings/sec, 185 secs
lola: 88736338 markings, 282395862 edges, 384207 markings/sec, 190 secs
lola: 90622850 markings, 288682933 edges, 377302 markings/sec, 195 secs
lola: 92585090 markings, 294969682 edges, 392448 markings/sec, 200 secs
lola: 94490638 markings, 301245134 edges, 381110 markings/sec, 205 secs
lola: 96092069 markings, 307583259 edges, 320286 markings/sec, 210 secs
lola: 97664587 markings, 313823829 edges, 314504 markings/sec, 215 secs
lola: 99633544 markings, 319834385 edges, 393791 markings/sec, 220 secs
lola: 101671662 markings, 326562850 edges, 407624 markings/sec, 225 secs
lola: 103496667 markings, 332645600 edges, 365001 markings/sec, 230 secs
lola: 105352286 markings, 338664442 edges, 371124 markings/sec, 235 secs
lola: 106787406 markings, 343501659 edges, 287024 markings/sec, 240 secs
lola: 106799827 markings, 343545282 edges, 2484 markings/sec, 245 secs
lola: 106812888 markings, 343592109 edges, 2612 markings/sec, 250 secs
lola: 106847592 markings, 343709161 edges, 6941 markings/sec, 255 secs
lola: 106887383 markings, 343848619 edges, 7958 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((E (G ((ExecutingTask + 1 <= CPUUnit))) OR E (G ((ExecutingTask + 1 <= TaskReady)))) AND E (F (((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((ExecutingTask + 1 <= TaskReady)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((ExecutingTask + 1 <= TaskReady)))
lola: processed formula length: 40
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit <= 1) AND (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 (((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit))))
lola: processed formula length: 65
lola: 44 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: ((DiskControllerUnit <= 1) AND (1 <= DiskControllerUnit))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 128 markings, 127 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((ExecutingTask + 1 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((ExecutingTask + 1 <= CPUUnit)))
lola: processed formula length: 38
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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 is possibly preserved.
lola: 1025 markings, 1025 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (((3 <= TaskReady) AND (CPUUnit <= ExecutingTask)))) OR (E (G ((LoadingMem <= 0))) OR A (G ((FreeMemSegment <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((FreeMemSegment <= 0)))
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:695
lola: processed formula: A (G ((FreeMemSegment <= 0)))
lola: processed formula length: 29
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((LoadingMem <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((LoadingMem <= 0)))
lola: processed formula length: 25
lola: 43 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= TaskReady) AND (CPUUnit <= 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 <= TaskReady) AND (CPUUnit <= ExecutingTask))))
lola: processed formula length: 57
lola: 45 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0512DC0128-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0512DC0128-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no unknown no yes yes no yes no yes unknown yes yes no no yes
lola:
preliminary result: no no unknown no yes yes no yes no yes unknown yes yes no no yes
lola: memory consumption: 20896 KB
lola: time consumption: 996 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-MT0512DC0128"
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-MT0512DC0128.tgz
mv SmallOperatingSystem-PT-MT0512DC0128 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-MT0512DC0128, 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-152705512400066"
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 '
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 ;