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 SmallOperatingSystem-PT-MT4096DC2048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008200043
=====================================================================

--------------------
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-MT4096DC2048-ReachabilityCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494928547857


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ SmallOperatingSystem-PT-MT4096DC2048 @ 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-MT4096DC2048-ReachabilityCardinality.task
lola: A (G ((TaskSuspended <= FreeMemSegment))) : A (G ((2 <= CPUUnit))) : A (G ((FreeMemSegment <= CPUUnit))) : A (G (((3 <= TaskReady) OR (FreeMemSegment <= TaskOnDisk) OR (TransferToDisk <= TaskReady)))) : A (G (((TaskReady <= ExecutingTask) OR (1 <= TaskReady) OR ((CPUUnit <= ExecutingTask)) OR (TransferToDisk <= TaskSuspended)))) : A (G (())) : A (G ((LoadingMem + 1 <= FreeMemSegment))) : A (G ((1 <= CPUUnit))) : E (F (((DiskControllerUnit <= 1) AND (((2 <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem)))))) : A (G ((TransferToDisk <= DiskControllerUnit))) : A (G (((((3 <= FreeMemSegment) OR (FreeMemSegment <= TaskReady)) AND (2 <= ExecutingTask)) OR (TransferToDisk <= DiskControllerUnit)))) : E (F ((FreeMemSegment <= TaskSuspended))) : A (G (((TaskOnDisk <= 0) OR (TaskSuspended <= 1) OR (DiskControllerUnit <= TaskOnDisk)))) : A (G (((TaskOnDisk <= FreeMemSegment) OR (TaskSuspended <= TransferToDisk) OR (FreeMemSegment + 1 <= TaskSuspended) OR (((2 <= DiskControllerUnit) OR (CPUUnit <= TaskSuspended)))))) : E (F (((TaskOnDisk + 1 <= TaskReady) AND (CPUUnit + 1 <= TransferToDisk) AND (FreeMemSegment <= CPUUnit)))) : A (G ((TaskSuspended <= DiskControllerUnit)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended <= FreeMemSegment)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-MT4096DC2048-ReachabilityCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= CPUUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-MT4096DC2048-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2665518 markings, 3998276 edges, 533104 markings/sec, 0 secs
lola: sara is running 5 secs || 4951449 markings, 7427172 edges, 457186 markings/sec, 5 secs
lola: sara is running 10 secs || 7154272 markings, 10731405 edges, 440565 markings/sec, 10 secs
lola: sara is running 15 secs || 9316836 markings, 13975250 edges, 432513 markings/sec, 15 secs
lola: sara is running 20 secs || 11448166 markings, 17172245 edges, 426266 markings/sec, 20 secs
lola: sara is running 25 secs || 13536680 markings, 20320962 edges, 417703 markings/sec, 25 secs
lola: sara is running 30 secs || 15546308 markings, 23465111 edges, 401926 markings/sec, 30 secs
lola: sara is running 35 secs || 17484285 markings, 26605221 edges, 387595 markings/sec, 35 secs
lola: sara is running 40 secs || 19359301 markings, 29726827 edges, 375003 markings/sec, 40 secs
lola: sara is running 45 secs || 21183268 markings, 32835882 edges, 364793 markings/sec, 45 secs
lola: sara is running 50 secs || 22946431 markings, 35901778 edges, 352633 markings/sec, 50 secs
lola: sara is running 55 secs || 24671431 markings, 38948178 edges, 345000 markings/sec, 55 secs
lola: sara is running 60 secs || 26362158 markings, 41979018 edges, 338145 markings/sec, 60 secs
lola: sara is running 65 secs || 28039076 markings, 45022364 edges, 335384 markings/sec, 65 secs
lola: sara is running 70 secs || 29693433 markings, 48064160 edges, 330871 markings/sec, 70 secs
lola: sara is running 75 secs || 31330199 markings, 51103359 edges, 327353 markings/sec, 75 secs
lola: sara is running 80 secs || 32949813 markings, 54138071 edges, 323923 markings/sec, 80 secs
lola: sara is running 85 secs || 34546405 markings, 57152259 edges, 319318 markings/sec, 85 secs
lola: sara is running 90 secs || 36124016 markings, 60159547 edges, 315522 markings/sec, 90 secs
lola: sara is running 95 secs || 37688829 markings, 63158410 edges, 312963 markings/sec, 95 secs
lola: sara is running 100 secs || 39229807 markings, 66138377 edges, 308196 markings/sec, 100 secs
lola: sara is running 105 secs || 40761978 markings, 69119820 edges, 306434 markings/sec, 105 secs
lola: sara is running 110 secs || 42267036 markings, 72061421 edges, 301012 markings/sec, 110 secs
lola: sara is running 115 secs || 43770719 markings, 75018533 edges, 300737 markings/sec, 115 secs
lola: sara is running 120 secs || 45272874 markings, 77985087 edges, 300431 markings/sec, 120 secs
lola: sara is running 125 secs || 46754386 markings, 80929523 edges, 296302 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FreeMemSegment <= 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-MT4096DC2048-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2.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 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= TaskReady) OR (FreeMemSegment <= TaskOnDisk) OR (TransferToDisk <= TaskReady))))
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-MT4096DC2048-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-3.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 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskReady <= ExecutingTask) OR (1 <= TaskReady) OR ((CPUUnit <= ExecutingTask)) OR (TransferToDisk <= TaskSuspended))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-4.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 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((LoadingMem + 1 <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 378 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-MT4096DC2048-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2732770 markings, 4099153 edges, 546554 markings/sec, 0 secs
lola: sara is running 5 secs || 5093371 markings, 7640055 edges, 472120 markings/sec, 5 secs
lola: sara is running 10 secs || 7321926 markings, 10982886 edges, 445711 markings/sec, 10 secs
lola: sara is running 15 secs || 9495554 markings, 14243328 edges, 434726 markings/sec, 15 secs
lola: sara is running 20 secs || 11643063 markings, 17464592 edges, 429502 markings/sec, 20 secs
lola: sara is running 25 secs || 13745538 markings, 20642163 edges, 420495 markings/sec, 25 secs
lola: sara is running 30 secs || 15765114 markings, 23815482 edges, 403915 markings/sec, 30 secs
lola: sara is running 35 secs || 17713266 markings, 26982055 edges, 389630 markings/sec, 35 secs
lola: sara is running 40 secs || 19610715 markings, 30151506 edges, 379490 markings/sec, 40 secs
lola: sara is running 45 secs || 21453259 markings, 33303252 edges, 368509 markings/sec, 45 secs
lola: sara is running 50 secs || 23248190 markings, 36430092 edges, 358986 markings/sec, 50 secs
lola: sara is running 55 secs || 24996072 markings, 39528495 edges, 349576 markings/sec, 55 secs
lola: sara is running 60 secs || 26712987 markings, 42612924 edges, 343383 markings/sec, 60 secs
lola: sara is running 65 secs || 28400011 markings, 45684885 edges, 337405 markings/sec, 65 secs
lola: sara is running 70 secs || 30047677 markings, 48715583 edges, 329533 markings/sec, 70 secs
lola: sara is running 75 secs || 31664931 markings, 51726728 edges, 323451 markings/sec, 75 secs
lola: sara is running 80 secs || 33275230 markings, 54749101 edges, 322060 markings/sec, 80 secs
lola: sara is running 85 secs || 34859618 markings, 57750255 edges, 316878 markings/sec, 85 secs
lola: sara is running 90 secs || 36431638 markings, 60745657 edges, 314404 markings/sec, 90 secs
lola: sara is running 95 secs || 37996201 markings, 63757171 edges, 312913 markings/sec, 95 secs
lola: sara is running 100 secs || 39545539 markings, 66752068 edges, 309868 markings/sec, 100 secs
lola: sara is running 105 secs || 41085946 markings, 69746900 edges, 308081 markings/sec, 105 secs
lola: sara is running 110 secs || 42612683 markings, 72741493 edges, 305347 markings/sec, 110 secs
lola: sara is running 115 secs || 44125705 markings, 75717078 edges, 302604 markings/sec, 115 secs
lola: sara is running 120 secs || 45630802 markings, 78698570 edges, 301019 markings/sec, 120 secs
lola: sara is running 125 secs || 47117791 markings, 81656198 edges, 297398 markings/sec, 125 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((DiskControllerUnit <= 1) AND (((2 <= DiskControllerUnit) AND (ExecutingTask <= LoadingMem))))))
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-MT4096DC2048-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-8.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 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TransferToDisk <= DiskControllerUnit)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-MT4096DC2048-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((3 <= FreeMemSegment) OR (FreeMemSegment <= TaskReady)) AND (2 <= ExecutingTask)) OR (TransferToDisk <= 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-10.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 11 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FreeMemSegment <= TaskSuspended)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-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 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskOnDisk <= 0) OR (TaskSuspended <= 1) OR (DiskControllerUnit <= 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-12.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 13 will run for 1090 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TaskOnDisk <= FreeMemSegment) OR (TaskSuspended <= TransferToDisk) OR (FreeMemSegment + 1 <= TaskSuspended) OR (((2 <= DiskControllerUnit) OR (CPUUnit <= TaskSuspended))))))
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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-13.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: subprocess 14 will run for 1635 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((TaskOnDisk + 1 <= TaskReady) AND (CPUUnit + 1 <= TransferToDisk) AND (FreeMemSegment <= CPUUnit))))
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: lola: ========================================
RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-14.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 15 will run for 3271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended <= 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-MT4096DC2048-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no no yes yes yes yes no no no no no yes yes no no no
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494928816933

--------------------
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="SmallOperatingSystem-PT-MT4096DC2048"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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