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-MT8192DC4096, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008200063
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494929591203


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ SmallOperatingSystem-PT-MT8192DC4096 @ 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-MT8192DC4096-ReachabilityFireability.task
lola: A (G (())) : E (F ((FIREABLE(freeMemory) AND NOT FIREABLE(startFirst)))) : E (F (((NOT FIREABLE(endLoading) OR NOT FIREABLE(freeMemory)) AND (NOT FIREABLE(startLoading) OR NOT FIREABLE(startNext)) AND FIREABLE(startUnload)))) : A (G (())) : E (F (((NOT FIREABLE(startUnload)) AND FIREABLE(endUnload) AND NOT FIREABLE(startLoading)))) : E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endUnload) AND (NOT FIREABLE(suspend))))) : A (G ((FIREABLE(startNext) OR FIREABLE(endLoading) OR NOT FIREABLE(endUnload) OR (FIREABLE(startNext) AND FIREABLE(endUnload)) OR ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading)) AND (FIREABLE(startLoading) OR FIREABLE(startNext) OR NOT FIREABLE(freeMemory)))))) : A (G (FIREABLE(startLoading))) : A (G (())) : A (G (FIREABLE(startLoading))) : A (G ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext) OR FIREABLE(startLoading) OR (NOT FIREABLE(startLoading) AND FIREABLE(startFirst) AND ((FIREABLE(freeMemory) AND FIREABLE(suspend)) OR FIREABLE(startLoading)))))) : E (F ((((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading) AND FIREABLE(suspend))) AND FIREABLE(startFirst) AND NOT FIREABLE(freeMemory)))) : E (F ((FIREABLE(startLoading) AND FIREABLE(startUnload) AND NOT FIREABLE(startNext)))) : A (G ((FIREABLE(startLoading) OR FIREABLE(startFirst) OR NOT FIREABLE(suspend)))) : E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endLoading) AND (NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading) OR FIREABLE(suspend))))) : A (G (FIREABLE(startLoading)))
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 (()))
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-MT8192DC4096-ReachabilityFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(freeMemory) AND NOT FIREABLE(startFirst))))
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-MT8192DC4096-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(endLoading) OR NOT FIREABLE(freeMemory)) AND (NOT FIREABLE(startLoading) OR NOT FIREABLE(startNext)) AND FIREABLE(startUnload))))
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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2989492 markings, 4485757 edges, 597898 markings/sec, 0 secs
lola: sara is running 5 secs || 5848628 markings, 8775070 edges, 571827 markings/sec, 5 secs
lola: sara is running 10 secs || 8628447 markings, 12945259 edges, 555964 markings/sec, 10 secs
lola: sara is running 15 secs || 11528612 markings, 17295912 edges, 580033 markings/sec, 15 secs
lola: sara is running 20 secs || 14355766 markings, 21536988 edges, 565431 markings/sec, 20 secs
lola: sara is running 25 secs || 17161027 markings, 25745193 edges, 561052 markings/sec, 25 secs
lola: sara is running 30 secs || 19932079 markings, 29902056 edges, 554210 markings/sec, 30 secs
lola: sara is running 35 secs || 22719229 markings, 34083046 edges, 557430 markings/sec, 35 secs
lola: sara is running 40 secs || 25457660 markings, 38190939 edges, 547686 markings/sec, 40 secs
lola: sara is running 45 secs || 28187637 markings, 42286139 edges, 545995 markings/sec, 45 secs
lola: sara is running 50 secs || 30868552 markings, 46307729 edges, 536183 markings/sec, 50 secs
lola: sara is running 55 secs || 33525766 markings, 50293758 edges, 531443 markings/sec, 55 secs
lola: sara is running 60 secs || 35300187 markings, 53549463 edges, 354884 markings/sec, 60 secs
lola: sara is running 65 secs || 36657190 markings, 56672555 edges, 271401 markings/sec, 65 secs
lola: sara is running 70 secs || 37952381 markings, 59718265 edges, 259038 markings/sec, 70 secs
lola: sara is running 75 secs || 39491617 markings, 62692422 edges, 307847 markings/sec, 75 secs
lola: sara is running 80 secs || 40780390 markings, 65682787 edges, 257755 markings/sec, 80 secs
lola: sara is running 85 secs || 42253727 markings, 68567123 edges, 294667 markings/sec, 85 secs
lola: sara is running 90 secs || 43347098 markings, 71537082 edges, 218674 markings/sec, 90 secs
lola: sara is running 95 secs || 45042686 markings, 74433209 edges, 339118 markings/sec, 95 secs
lola: sara is running 100 secs || 45882754 markings, 77305613 edges, 168014 markings/sec, 100 secs
lola: sara is running 105 secs || 47421739 markings, 80238831 edges, 307797 markings/sec, 105 secs
lola: sara is running 110 secs || 49087914 markings, 83092043 edges, 333235 markings/sec, 110 secs
lola: sara is running 115 secs || 49794019 markings, 85974208 edges, 141221 markings/sec, 115 secs
lola: sara is running 120 secs || 51279539 markings, 88895808 edges, 297104 markings/sec, 120 secs
lola: sara is running 125 secs || 52941237 markings, 91729149 edges, 332340 markings/sec, 125 secs
lola: sara is running 130 secs || 53981044 markings, 94533881 edges, 207961 markings/sec, 130 secs
lola: sara is running 135 secs || 54819005 markings, 97353910 edges, 167592 markings/sec, 135 secs
lola: sara is running 140 secs || 56524278 markings, 100217299 edges, 341055 markings/sec, 140 secs
lola: sara is running 145 secs || 58144915 markings, 102974163 edges, 324127 markings/sec, 145 secs
lola: sara is running 150 secs || 58990557 markings, 105742591 edges, 169128 markings/sec, 150 secs
lola: sara is running 155 secs || 59805971 markings, 108552993 edges, 163083 markings/sec, 155 secs
lola: sara is running 160 secs || 61510338 markings, 111406227 edges, 340873 markings/sec, 160 secs
lola: sara is running 165 secs || 63130857 markings, 114159747 edges, 324104 markings/sec, 165 secs
lola: sara is running 170 secs || 64287012 markings, 116923158 edges, 231231 markings/sec, 170 secs
lola: sara is running 175 secs || 64845952 markings, 119726829 edges, 111788 markings/sec, 175 secs
lola: sara is running 180 secs || 66263938 markings, 122532112 edges, 283597 markings/sec, 180 secs
lola: sara is running 185 secs || 67916356 markings, 125320640 edges, 330484 markings/sec, 185 secs
lola: sara is running 190 secs || 69509454 markings, 128018119 edges, 318620 markings/sec, 190 secs
lola: sara is running 195 secs || 70408990 markings, 130743563 edges, 179907 markings/sec, 195 secs
lola: sara is running 200 secs || 70960672 markings, 133515823 edges, 110336 markings/sec, 200 secs
lola: sara is running 205 secs || 72434927 markings, 136359619 edges, 294851 markings/sec, 205 secs
lola: sara is running 210 secs || 74097327 markings, 139159940 edges, 332480 markings/sec, 210 secs
lola: sara is running 215 secs || 75716400 markings, 141899130 edges, 323815 markings/sec, 215 secs
lola: sara is running 220 secs || 76836569 markings, 144626552 edges, 224034 markings/sec, 220 secs
lola: sara is running 225 secs || 77391487 markings, 147402282 edges, 110984 markings/sec, 225 secs
lola: sara is running 230 secs || 78415992 markings, 150197601 edges, 204901 markings/sec, 230 secs
lola: sara is running 235 secs || 80029817 markings, 152890854 edges, 322765 markings/sec, 235 secs
lola: sara is running 240 secs || 81547311 markings, 155463397 edges, 303499 markings/sec, 240 secs
lola: sara is running 245 secs || 83111919 markings, 158103550 edges, 312922 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 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-MT8192DC4096-ReachabilityFireability.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 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(startUnload)) AND FIREABLE(endUnload) AND NOT FIREABLE(startLoading))))
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 27 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endUnload) AND (NOT FIREABLE(suspend)))))
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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(startNext) OR FIREABLE(endLoading) OR NOT FIREABLE(endUnload) OR (FIREABLE(startNext) AND FIREABLE(endUnload)) OR ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading)) AND (FIREABLE(startLoading) OR FIREABLE(startNext) OR NOT FIREABLE(freeMemory))))))
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 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6.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 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 410 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-MT8192DC4096-ReachabilityFireability.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 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-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 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(endLoading) OR NOT FIREABLE(startNext) OR FIREABLE(startLoading) OR (NOT FIREABLE(startLoading) AND FIREABLE(startFirst) AND ((FIREABLE(freeMemory) AND FIREABLE(suspend)) OR FIREABLE(startLoading))))))
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 123 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 657 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(startNext) AND FIREABLE(startFirst)) OR (FIREABLE(startLoading) AND FIREABLE(suspend))) AND FIREABLE(startFirst) AND NOT FIREABLE(freeMemory))))
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: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 821 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(startLoading) AND FIREABLE(startUnload) AND NOT FIREABLE(startNext))))
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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12.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 13 will run for 1095 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(startLoading) OR FIREABLE(startFirst) OR NOT FIREABLE(suspend))))
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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(startLoading) AND NOT FIREABLE(endLoading) AND (NOT FIREABLE(endLoading) OR NOT FIREABLE(startLoading) OR FIREABLE(suspend)))))
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 45 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14.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 15 will run for 3287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(startLoading)))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes yes yes no no yes no no no no no yes no
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SmallOperatingSystem-PT-MT8192DC4096-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494929844242

--------------------
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-MT8192DC4096"
export BK_EXAMINATION="ReachabilityFireability"
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-MT8192DC4096.tgz
mv SmallOperatingSystem-PT-MT8192DC4096 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-MT8192DC4096, examination is ReachabilityFireability"
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-149441008200063"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;