About the Execution of LoLA for S_SmallOperatingSystem-PT-MT8192DC2048
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15951.730 | 1030526.00 | 1007695.00 | 615.70 | FFFTT???FF?TFFTF | 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)
................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SmallOperatingSystem-PT-MT8192DC2048, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900048
=====================================================================
--------------------
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-MT8192DC2048-CTLCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496557469044
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC2048: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT8192DC2048: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SmallOperatingSystem-PT-MT8192DC2048 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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-MT8192DC2048-CTLCardinality.task
lola: E (F (((TaskSuspended <= 0) AND ((1 <= TaskOnDisk)) AND (TaskOnDisk + 1 <= ExecutingTask)))) : A (G (((3 <= TransferToDisk) OR (2 <= TaskReady) OR (3 <= FreeMemSegment)))) : E (G (((TaskReady <= 0) OR (TaskOnDisk <= DiskControllerUnit)))) : (((2 <= FreeMemSegment) AND (A (G ((3 <= DiskControllerUnit))) AND ((TaskSuspended <= LoadingMem) OR (LoadingMem <= TaskReady) OR (TaskSuspended + 1 <= LoadingMem)))) OR A (X (E (X ((CPUUnit <= TaskReady)))))) : A (G (E (F (((ExecutingTask <= CPUUnit) AND (DiskControllerUnit <= LoadingMem)))))) : A (G ((CPUUnit <= TaskOnDisk))) : ((((3 <= TaskOnDisk) OR (TaskOnDisk <= 2) OR ((TaskSuspended <= LoadingMem) AND (TaskOnDisk + 1 <= TaskSuspended))) OR A (X ((1 <= TaskOnDisk)))) AND A (G (((ExecutingTask <= LoadingMem) OR (1 <= DiskControllerUnit) OR ((TaskOnDisk <= LoadingMem) AND (TaskOnDisk <= LoadingMem)))))) : (A (G (((FreeMemSegment <= LoadingMem) AND (TransferToDisk <= ExecutingTask) AND (LoadingMem <= DiskControllerUnit) AND (CPUUnit <= FreeMemSegment)))) OR NOT(E (F ((CPUUnit <= 0))))) : E (G (NOT(A (G ((2 <= FreeMemSegment)))))) : A (G (NOT(A (X ((FreeMemSegment <= LoadingMem)))))) : NOT(A (G (TRUE))) : E (F (((TransferToDisk <= TaskSuspended) AND (DiskControllerUnit <= 2) AND ((CPUUnit <= TaskReady) OR (FreeMemSegment <= TransferToDisk))))) : NOT(A (G (((TransferToDisk + 1 <= TaskReady) OR (LoadingMem + 1 <= FreeMemSegment))))) : E (((ExecutingTask <= FreeMemSegment) U (TaskOnDisk <= 1))) : (A (G (A (F ((3 <= TaskOnDisk))))) OR ((TransferToDisk <= LoadingMem) AND A (X ((1 <= TaskReady))))) : ((((ExecutingTask <= 2) AND (TaskReady + 1 <= ExecutingTask) AND ((3 <= LoadingMem) OR (1 <= FreeMemSegment)) AND (TaskReady <= 1)) AND A (F (((1 <= TaskOnDisk) AND (TransferToDisk <= CPUUnit))))) OR E (F ((((LoadingMem <= TaskOnDisk) OR (3 <= TransferToDisk)) AND (DiskControllerUnit <= TransferToDisk)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskSuspended <= 0) AND ((1 <= TaskOnDisk)) AND (TaskOnDisk + 1 <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= TransferToDisk) OR (2 <= TaskReady) OR (3 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((TaskReady <= 0) OR (TaskOnDisk <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= TaskReady) AND (DiskControllerUnit + 1 <= TaskOnDisk))))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= FreeMemSegment) AND (A (G ((3 <= DiskControllerUnit))) AND ((TaskSuspended <= LoadingMem) OR (LoadingMem <= TaskReady) OR (TaskSuspended + 1 <= LoadingMem)))) OR A (X (E (X ((CPUUnit <= TaskReady))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= FreeMemSegment)
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
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: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-4.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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((CPUUnit <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((CPUUnit <= TaskReady)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((ExecutingTask <= CPUUnit) AND (DiskControllerUnit <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((ExecutingTask <= CPUUnit) AND (DiskControllerUnit <= LoadingMem))))))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: 976200 markings, 3397510 edges, 3096145029224202240 markings/sec, 0 secs
lola: 1922312 markings, 6709324 edges, 189222 markings/sec, 5 secs
lola: 2872603 markings, 10035117 edges, 190058 markings/sec, 10 secs
lola: 3812932 markings, 13327026 edges, 188066 markings/sec, 15 secs
lola: 4752689 markings, 16616651 edges, 187951 markings/sec, 20 secs
lola: 5692452 markings, 19906294 edges, 187953 markings/sec, 25 secs
lola: 6638520 markings, 23218013 edges, 189214 markings/sec, 30 secs
lola: 7601163 markings, 26586989 edges, 192529 markings/sec, 35 secs
lola: 8572675 markings, 29988301 edges, 194302 markings/sec, 40 secs
lola: 9547274 markings, 33398883 edges, 194920 markings/sec, 45 secs
lola: 10513621 markings, 36782376 edges, 193269 markings/sec, 50 secs
lola: 11478280 markings, 40158821 edges, 192932 markings/sec, 55 secs
lola: 12440591 markings, 43527125 edges, 192462 markings/sec, 60 secs
lola: 13311380 markings, 46556180 edges, 174158 markings/sec, 65 secs
lola: 14125995 markings, 49407985 edges, 162923 markings/sec, 70 secs
lola: 14936827 markings, 52246117 edges, 162166 markings/sec, 75 secs
lola: 15724594 markings, 55003311 edges, 157553 markings/sec, 80 secs
lola: 16528498 markings, 57817039 edges, 160781 markings/sec, 85 secs
lola: 17304397 markings, 60534038 edges, 155180 markings/sec, 90 secs
lola: 18118007 markings, 63381472 edges, 162722 markings/sec, 95 secs
lola: 18942994 markings, 66269274 edges, 164997 markings/sec, 100 secs
lola: 19772325 markings, 69172422 edges, 165866 markings/sec, 105 secs
lola: 20602394 markings, 72078510 edges, 166014 markings/sec, 110 secs
lola: 21436790 markings, 74998846 edges, 166879 markings/sec, 115 secs
lola: 22267564 markings, 77907491 edges, 166155 markings/sec, 120 secs
lola: 23084656 markings, 80767477 edges, 163418 markings/sec, 125 secs
lola: 23908745 markings, 83651523 edges, 164818 markings/sec, 130 secs
lola: 24736976 markings, 86551072 edges, 165646 markings/sec, 135 secs
lola: 25675161 markings, 89817192 edges, 187637 markings/sec, 140 secs
lola: 26638253 markings, 93188358 edges, 192618 markings/sec, 145 secs
lola: 27575634 markings, 96468940 edges, 187476 markings/sec, 150 secs
lola: 28498577 markings, 99700956 edges, 184589 markings/sec, 155 secs
lola: 29427069 markings, 102950684 edges, 185698 markings/sec, 160 secs
lola: 30357469 markings, 106207830 edges, 186080 markings/sec, 165 secs
lola: 31291197 markings, 109476863 edges, 186746 markings/sec, 170 secs
lola: 32225855 markings, 112748333 edges, 186932 markings/sec, 175 secs
lola: 33160616 markings, 116019720 edges, 186952 markings/sec, 180 secs
lola: 34089613 markings, 119272893 edges, 185799 markings/sec, 185 secs
lola: 35005201 markings, 122478440 edges, 183118 markings/sec, 190 secs
lola: 35917198 markings, 125669865 edges, 182399 markings/sec, 195 secs
lola: 36815249 markings, 128814569 edges, 179610 markings/sec, 200 secs
lola: 37709505 markings, 131944108 edges, 178851 markings/sec, 205 secs
lola: 38528051 markings, 134792190 edges, 163709 markings/sec, 210 secs
lola: 39306959 markings, 137518567 edges, 155782 markings/sec, 215 secs
lola: 40079056 markings, 140220771 edges, 154419 markings/sec, 220 secs
lola: 40847126 markings, 142909923 edges, 153614 markings/sec, 225 secs
lola: 41613433 markings, 145592029 edges, 153261 markings/sec, 230 secs
lola: 42382329 markings, 148284483 edges, 153779 markings/sec, 235 secs
lola: 43161341 markings, 151011275 edges, 155802 markings/sec, 240 secs
lola: 43938781 markings, 153731953 edges, 155488 markings/sec, 245 secs
lola: 44707843 markings, 156424904 edges, 153812 markings/sec, 250 secs
lola: 45474151 markings, 159107014 edges, 153262 markings/sec, 255 secs
lola: 46240803 markings, 161790496 edges, 153330 markings/sec, 260 secs
lola: 47004733 markings, 164466153 edges, 152786 markings/sec, 265 secs
lola: 47775499 markings, 167163033 edges, 154153 markings/sec, 270 secs
lola: 48545865 markings, 169861026 edges, 154073 markings/sec, 275 secs
lola: 49314337 markings, 172550566 edges, 153694 markings/sec, 280 secs
lola: 50096413 markings, 175288115 edges, 156415 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CPUUnit <= TaskOnDisk)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-5.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: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= TaskOnDisk) OR (TaskOnDisk <= 2) OR ((TaskSuspended <= LoadingMem) AND (TaskOnDisk + 1 <= TaskSuspended))) OR A (X ((1 <= TaskOnDisk)))) AND A (G (((ExecutingTask <= LoadingMem) OR (1 <= DiskControllerUnit) OR ((TaskOnDisk <= LoadingMem) AND (TaskOnDisk <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= TaskOnDisk) OR (TaskOnDisk <= 2) OR ((TaskSuspended <= LoadingMem) AND (TaskOnDisk + 1 <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= TaskOnDisk) OR (TaskOnDisk <= 2) OR ((TaskSuspended <= LoadingMem) AND (TaskOnDisk + 1 <= TaskSuspended)))
lola: processed formula length: 115
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: processed formula with 4 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: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((ExecutingTask <= LoadingMem) OR (1 <= DiskControllerUnit) OR ((TaskOnDisk <= LoadingMem) AND (TaskOnDisk <= LoadingMem)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-7.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((FreeMemSegment <= LoadingMem) AND (TransferToDisk <= ExecutingTask) AND (LoadingMem <= DiskControllerUnit) AND (CPUUnit <= FreeMemSegment)))) OR NOT(E (F ((CPUUnit <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FreeMemSegment <= LoadingMem) AND (TransferToDisk <= ExecutingTask) AND (LoadingMem <= DiskControllerUnit) AND (CPUUnit <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2785093 markings, 4177638 edges, 557019 markings/sec, 0 secs
lola: sara is running 5 secs || 5185564 markings, 7778343 edges, 480094 markings/sec, 5 secs
lola: sara is running 10 secs || 7430194 markings, 11145290 edges, 448926 markings/sec, 10 secs
lola: sara is running 15 secs || 9607935 markings, 14411901 edges, 435548 markings/sec, 15 secs
lola: sara is running 20 secs || 11748271 markings, 17622405 edges, 428067 markings/sec, 20 secs
lola: sara is running 25 secs || 13842757 markings, 20791711 edges, 418897 markings/sec, 25 secs
lola: sara is running 30 secs || 15849395 markings, 23950309 edges, 401328 markings/sec, 30 secs
lola: sara is running 35 secs || 17771999 markings, 27078717 edges, 384521 markings/sec, 35 secs
lola: sara is running 40 secs || 19631282 markings, 30188056 edges, 371857 markings/sec, 40 secs
lola: sara is running 45 secs || 21444538 markings, 33286659 edges, 362651 markings/sec, 45 secs
lola: sara is running 50 secs || 23152700 markings, 36263240 edges, 341632 markings/sec, 50 secs
lola: sara is running 55 secs || 24871407 markings, 39303988 edges, 343741 markings/sec, 55 secs
lola: sara is running 60 secs || 26560068 markings, 42337327 edges, 337732 markings/sec, 60 secs
lola: sara is running 65 secs || 28222057 markings, 45360254 edges, 332398 markings/sec, 65 secs
lola: sara is running 70 secs || 29853831 markings, 48358977 edges, 326355 markings/sec, 70 secs
lola: sara is running 75 secs || 31463574 markings, 51349996 edges, 321949 markings/sec, 75 secs
lola: sara is running 80 secs || 33061038 markings, 54345389 edges, 319493 markings/sec, 80 secs
lola: sara is running 85 secs || 34634430 markings, 57319620 edges, 314678 markings/sec, 85 secs
lola: sara is running 90 secs || 36194037 markings, 60291369 edges, 311921 markings/sec, 90 secs
lola: sara is running 95 secs || 37736552 markings, 63255627 edges, 308503 markings/sec, 95 secs
lola: sara is running 100 secs || 39258957 markings, 66196134 edges, 304481 markings/sec, 100 secs
lola: sara is running 105 secs || 40775168 markings, 69141783 edges, 303242 markings/sec, 105 secs
lola: sara is running 110 secs || 42264146 markings, 72052752 edges, 297796 markings/sec, 110 secs
lola: sara is running 115 secs || 43751604 markings, 74979715 edges, 297492 markings/sec, 115 secs
lola: sara is running 120 secs || 45233656 markings, 77908171 edges, 296410 markings/sec, 120 secs
lola: sara is running 125 secs || 46707111 markings, 80832489 edges, 294691 markings/sec, 125 secs
lola: sara is running 130 secs || 48171862 markings, 83759898 edges, 292950 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT
========================================lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((2 <= FreeMemSegment))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FreeMemSegment <= 1)))))
lola: processed formula length: 51
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((FreeMemSegment <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((LoadingMem + 1 <= FreeMemSegment)))))
lola: processed formula length: 58
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 518 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-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: ========================================
lola: subprocess 11 will run for 621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TransferToDisk <= TaskSuspended) AND (DiskControllerUnit <= 2) AND ((CPUUnit <= TaskReady) OR (FreeMemSegment <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-11.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: ========================================
lola: subprocess 12 will run for 777 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((TransferToDisk + 1 <= TaskReady) OR (LoadingMem + 1 <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-12.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: ========================================
lola: subprocess 13 will run for 1036 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ExecutingTask <= FreeMemSegment) U (TaskOnDisk <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((ExecutingTask <= FreeMemSegment) U (TaskOnDisk <= 1))
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: 2363833 markings, 4711665 edges, 2573839347757350912 markings/sec, 0 secs
lola: 4507435 markings, 8999216 edges, 428720 markings/sec, 5 secs
lola: 6764811 markings, 13514338 edges, 451475 markings/sec, 10 secs
lola: 9041241 markings, 18067572 edges, 455286 markings/sec, 15 secs
lola: 11291586 markings, 22568634 edges, 450069 markings/sec, 20 secs
lola: 13334711 markings, 26640871 edges, 408625 markings/sec, 25 secs
lola: 15021663 markings, 30015046 edges, 337390 markings/sec, 30 secs
lola: 16702845 markings, 33377684 edges, 336236 markings/sec, 35 secs
lola: 18403846 markings, 36779963 edges, 340200 markings/sec, 40 secs
lola: 20106343 markings, 40185236 edges, 340499 markings/sec, 45 secs
lola: 21824008 markings, 43620846 edges, 343533 markings/sec, 50 secs
lola: 23545728 markings, 47064565 edges, 344344 markings/sec, 55 secs
lola: 25337909 markings, 50634880 edges, 358436 markings/sec, 60 secs
lola: 27712591 markings, 55384630 edges, 474936 markings/sec, 65 secs
lola: 29943799 markings, 59847411 edges, 446242 markings/sec, 70 secs
lola: 32141314 markings, 64242793 edges, 439503 markings/sec, 75 secs
lola: 34341653 markings, 68643828 edges, 440068 markings/sec, 80 secs
lola: 36462163 markings, 72885197 edges, 424102 markings/sec, 85 secs
lola: 38416529 markings, 76779910 edges, 390873 markings/sec, 90 secs
lola: 40066171 markings, 80079465 edges, 329928 markings/sec, 95 secs
lola: 41668773 markings, 83284928 edges, 320520 markings/sec, 100 secs
lola: 43232335 markings, 86412307 edges, 312712 markings/sec, 105 secs
lola: 44797802 markings, 89543496 edges, 313093 markings/sec, 110 secs
lola: 46347750 markings, 92643645 edges, 309990 markings/sec, 115 secs
lola: 47884837 markings, 95718071 edges, 307417 markings/sec, 120 secs
lola: 49419691 markings, 98788029 edges, 306971 markings/sec, 125 secs
lola: 51326933 markings, 102588484 edges, 381448 markings/sec, 130 secs
lola: 53490064 markings, 106915097 edges, 432626 markings/sec, 135 secs
lola: 55590494 markings, 111116301 edges, 420086 markings/sec, 140 secs
lola: 57679905 markings, 115295464 edges, 417882 markings/sec, 145 secs
lola: 59763252 markings, 119462495 edges, 416669 markings/sec, 150 secs
lola: 61777459 markings, 123491240 edges, 402841 markings/sec, 155 secs
lola: 63608137 markings, 127138552 edges, 366136 markings/sec, 160 secs
lola: 65135270 markings, 130193067 edges, 305427 markings/sec, 165 secs
lola: 66631600 markings, 133185974 edges, 299266 markings/sec, 170 secs
lola: 68115452 markings, 136153921 edges, 296770 markings/sec, 175 secs
lola: 69594211 markings, 139111679 edges, 295752 markings/sec, 180 secs
lola: 71062517 markings, 142048529 edges, 293661 markings/sec, 185 secs
lola: 72543245 markings, 145010227 edges, 296146 markings/sec, 190 secs
lola: 74022732 markings, 147969443 edges, 295897 markings/sec, 195 secs
lola: 75549931 markings, 151010515 edges, 305440 markings/sec, 200 secs
lola: 77797321 markings, 155504899 edges, 449478 markings/sec, 205 secs
lola: 79895539 markings, 159701677 edges, 419644 markings/sec, 210 secs
lola: 81957961 markings, 163826856 edges, 412484 markings/sec, 215 secs
lola: 84017938 markings, 167947148 edges, 411995 markings/sec, 220 secs
lola: 86032959 markings, 171977516 edges, 403004 markings/sec, 225 secs
lola: 87988188 markings, 175888294 edges, 391046 markings/sec, 230 secs
lola: 89562298 markings, 179022433 edges, 314822 markings/sec, 235 secs
lola: 91038413 markings, 181974905 edges, 295223 markings/sec, 240 secs
lola: 91769120 markings, 183436435 edges, 146141 markings/sec, 245 secs
lola: 91769120 markings, 183436435 edges, 0 markings/sec, 250 secs
lola: 91769120 markings, 183436435 edges, 0 markings/sec, 255 secs
lola: 91769120 markings, 183436435 edges, 0 markings/sec, 260 secs
lola: 91769120 markings, 183436435 edges, 0 markings/sec, 265 secs
lola: 91769120 markings, 183436435 edges, 0 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((3 <= TaskOnDisk))))) OR ((TransferToDisk <= LoadingMem) AND A (X ((1 <= TaskReady)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= TaskOnDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= TaskOnDisk)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
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: 1840277 markings, 5504756 edges, 2170488592349003776 markings/sec, 0 secs
lola: 3577891 markings, 10717876 edges, 347523 markings/sec, 5 secs
lola: 5257817 markings, 15757918 edges, 335985 markings/sec, 10 secs
lola: 6965607 markings, 20881566 edges, 341558 markings/sec, 15 secs
lola: 8707125 markings, 26106402 edges, 348304 markings/sec, 20 secs
lola: 10439528 markings, 31303894 edges, 346481 markings/sec, 25 secs
lola: 12198336 markings, 36580605 edges, 351762 markings/sec, 30 secs
lola: 13678318 markings, 41006452 edges, 295996 markings/sec, 35 secs
lola: 14999306 markings, 44969632 edges, 264198 markings/sec, 40 secs
lola: 16296369 markings, 48861030 edges, 259413 markings/sec, 45 secs
lola: 17589166 markings, 52739632 edges, 258559 markings/sec, 50 secs
lola: 18883601 markings, 56623149 edges, 258887 markings/sec, 55 secs
lola: 20189883 markings, 60542208 edges, 261256 markings/sec, 60 secs
lola: 21507188 markings, 64494336 edges, 263461 markings/sec, 65 secs
lola: 22825027 markings, 68448069 edges, 263568 markings/sec, 70 secs
lola: 24151584 markings, 72427953 edges, 265311 markings/sec, 75 secs
lola: 25643878 markings, 76890741 edges, 298459 markings/sec, 80 secs
lola: 27440053 markings, 82279560 edges, 359235 markings/sec, 85 secs
lola: 29186508 markings, 87519206 edges, 349291 markings/sec, 90 secs
lola: 30846620 markings, 92499814 edges, 332022 markings/sec, 95 secs
lola: 32495415 markings, 97446467 edges, 329759 markings/sec, 100 secs
lola: 34138330 markings, 102375481 edges, 328583 markings/sec, 105 secs
lola: 35739587 markings, 107179513 edges, 320251 markings/sec, 110 secs
lola: 37313829 markings, 111902494 edges, 314848 markings/sec, 115 secs
lola: 38680055 markings, 115987055 edges, 273245 markings/sec, 120 secs
lola: 39904131 markings, 119659483 edges, 244815 markings/sec, 125 secs
lola: 41157904 markings, 123421006 edges, 250755 markings/sec, 130 secs
lola: 42469355 markings, 127355573 edges, 262290 markings/sec, 135 secs
lola: 43620612 markings, 130809532 edges, 230251 markings/sec, 140 secs
lola: 44868480 markings, 134553339 edges, 249574 markings/sec, 145 secs
lola: 46112718 markings, 138286257 edges, 248848 markings/sec, 150 secs
lola: 47342615 markings, 141976149 edges, 245979 markings/sec, 155 secs
lola: 48557593 markings, 145621277 edges, 242996 markings/sec, 160 secs
lola: 49785720 markings, 149305859 edges, 245625 markings/sec, 165 secs
lola: 51369426 markings, 154042896 edges, 316741 markings/sec, 170 secs
lola: 53113935 markings, 159276709 edges, 348902 markings/sec, 175 secs
lola: 54791502 markings, 164309681 edges, 335513 markings/sec, 180 secs
lola: 56436467 markings, 169244847 edges, 328993 markings/sec, 185 secs
lola: 58071883 markings, 174151361 edges, 327083 markings/sec, 190 secs
lola: 59682807 markings, 178984395 edges, 322185 markings/sec, 195 secs
lola: 61277329 markings, 183768220 edges, 318904 markings/sec, 200 secs
lola: 62864791 markings, 188530866 edges, 317492 markings/sec, 205 secs
lola: 64157416 markings, 192394616 edges, 258525 markings/sec, 210 secs
lola: 65365448 markings, 196018906 edges, 241606 markings/sec, 215 secs
lola: 66561694 markings, 199607842 edges, 239249 markings/sec, 220 secs
lola: 67760148 markings, 203203399 edges, 239691 markings/sec, 225 secs
lola: 68957532 markings, 206795745 edges, 239477 markings/sec, 230 secs
lola: 70154978 markings, 210388276 edges, 239489 markings/sec, 235 secs
lola: 71347771 markings, 213966852 edges, 238559 markings/sec, 240 secs
lola: 72523818 markings, 217495183 edges, 235209 markings/sec, 245 secs
lola: 73692762 markings, 221002207 edges, 233789 markings/sec, 250 secs
lola: 74873759 markings, 224545391 edges, 236199 markings/sec, 255 secs
lola: 76382804 markings, 229058433 edges, 301809 markings/sec, 260 secs
lola: 78085654 markings, 234167259 edges, 340570 markings/sec, 265 secs
lola: 79732903 markings, 239109274 edges, 329450 markings/sec, 270 secs
lola: 81335694 markings, 243917911 edges, 320558 markings/sec, 275 secs
lola: 82930039 markings, 248701205 edges, 318869 markings/sec, 280 secs
lola: 84516879 markings, 253461983 edges, 317368 markings/sec, 285 secs
lola: 86081771 markings, 258156917 edges, 312978 markings/sec, 290 secs
lola: 87634847 markings, 262816397 edges, 310615 markings/sec, 295 secs
lola: 88988571 markings, 266863454 edges, 270745 markings/sec, 300 secs
lola: 90188118 markings, 270462289 edges, 239909 markings/sec, 305 secs
lola: 91366089 markings, 273996393 edges, 235594 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (TransferToDisk <= LoadingMem)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TransferToDisk <= LoadingMem)
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-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: 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: subprocess 15 will run for 2510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((ExecutingTask <= 2) AND (TaskReady + 1 <= ExecutingTask) AND ((3 <= LoadingMem) OR (1 <= FreeMemSegment)) AND (TaskReady <= 1)) AND A (F (((1 <= TaskOnDisk) AND (TransferToDisk <= CPUUnit))))) OR E (F ((((LoadingMem <= TaskOnDisk) OR (3 <= TransferToDisk)) AND (DiskControllerUnit <= TransferToDisk)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ExecutingTask <= 2) AND (TaskReady + 1 <= ExecutingTask) AND ((3 <= LoadingMem) OR (1 <= FreeMemSegment)) AND (TaskReady <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ExecutingTask <= 2) AND (TaskReady + 1 <= ExecutingTask) AND ((3 <= LoadingMem) OR (1 <= FreeMemSegment)) AND (TaskReady <= 1))
lola: processed formula length: 130
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality.task
lola: processed formula with 5 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: ========================================
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: RESULT
lola:
SUMMARY: no no no no unknown yes no no yes no no yes yes unknown unknown unknown
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC2048-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496558499570
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_SmallOperatingSystem-PT-MT8192DC2048"
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/S_SmallOperatingSystem-PT-MT8192DC2048.tgz
mv S_SmallOperatingSystem-PT-MT8192DC2048 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SmallOperatingSystem-PT-MT8192DC2048, 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 r158-ebro-149443463900048"
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 ;