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

--------------------
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 1496557346618


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SmallOperatingSystem-PT-MT4096DC2048: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_SmallOperatingSystem-PT-MT4096DC2048: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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 || 2594135 markings, 3891201 edges, 518827 markings/sec, 0 secs
lola: sara is running 5 secs || 4792678 markings, 7189015 edges, 439709 markings/sec, 5 secs
lola: sara is running 10 secs || 6922045 markings, 10383065 edges, 425873 markings/sec, 10 secs
lola: sara is running 15 secs || 8993757 markings, 13490633 edges, 414342 markings/sec, 15 secs
lola: sara is running 20 secs || 11035321 markings, 16552979 edges, 408313 markings/sec, 20 secs
lola: sara is running 25 secs || 13038366 markings, 19561341 edges, 400609 markings/sec, 25 secs
lola: sara is running 30 secs || 14951090 markings, 22521915 edges, 382545 markings/sec, 30 secs
lola: sara is running 35 secs || 16670852 markings, 25275929 edges, 343952 markings/sec, 35 secs
lola: sara is running 40 secs || 18428018 markings, 28167522 edges, 351433 markings/sec, 40 secs
lola: sara is running 45 secs || 20187479 markings, 31131762 edges, 351892 markings/sec, 45 secs
lola: sara is running 50 secs || 21893201 markings, 34063749 edges, 341144 markings/sec, 50 secs
lola: sara is running 55 secs || 23564747 markings, 36986657 edges, 334309 markings/sec, 55 secs
lola: sara is running 60 secs || 25211964 markings, 39913975 edges, 329443 markings/sec, 60 secs
lola: sara is running 65 secs || 26830938 markings, 42824208 edges, 323795 markings/sec, 65 secs
lola: sara is running 70 secs || 28428925 markings, 45735298 edges, 319597 markings/sec, 70 secs
lola: sara is running 75 secs || 29996486 markings, 48621133 edges, 313512 markings/sec, 75 secs
lola: sara is running 80 secs || 31547082 markings, 51503307 edges, 310119 markings/sec, 80 secs
lola: sara is running 85 secs || 32983400 markings, 54196720 edges, 287264 markings/sec, 85 secs
lola: sara is running 90 secs || 34422548 markings, 56917601 edges, 287830 markings/sec, 90 secs
lola: sara is running 95 secs || 35858045 markings, 59650063 edges, 287099 markings/sec, 95 secs
lola: sara is running 100 secs || 37270001 markings, 62353868 edges, 282391 markings/sec, 100 secs
lola: sara is running 105 secs || 38662427 markings, 65042883 edges, 278485 markings/sec, 105 secs
lola: sara is running 110 secs || 40061492 markings, 67753784 edges, 279813 markings/sec, 110 secs
lola: sara is running 115 secs || 41464156 markings, 70486805 edges, 280533 markings/sec, 115 secs
lola: sara is running 120 secs || 42862914 markings, 73232663 edges, 279752 markings/sec, 120 secs
lola: sara is running 125 secs || 44245085 markings, 75954675 edges, 276434 markings/sec, 125 secs
lola: sara is running 130 secs || 45628050 markings, 78690314 edges, 276593 markings/sec, 130 secs
lola: sara is running 135 secs || 46996369 markings, 81408950 edges, 273664 markings/sec, 135 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 242 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 282 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 308 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 339 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 377 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 || 2555531 markings, 3833294 edges, 511106 markings/sec, 0 secs
lola: sara is running 5 secs || 4493359 markings, 6740035 edges, 387566 markings/sec, 5 secs
lola: sara is running 10 secs || 6260301 markings, 9390450 edges, 353388 markings/sec, 10 secs
lola: sara is running 15 secs || 7993148 markings, 11989720 edges, 346569 markings/sec, 15 secs
lola: sara is running 20 secs || 9669987 markings, 14504978 edges, 335368 markings/sec, 20 secs
lola: sara is running 25 secs || 11359905 markings, 17039855 edges, 337984 markings/sec, 25 secs
lola: sara is running 30 secs || 13020365 markings, 19533943 edges, 332092 markings/sec, 30 secs
lola: sara is running 35 secs || 14722642 markings, 22161705 edges, 340455 markings/sec, 35 secs
lola: sara is running 40 secs || 16334203 markings, 24729617 edges, 322312 markings/sec, 40 secs
lola: sara is running 45 secs || 17865516 markings, 27234185 edges, 306263 markings/sec, 45 secs
lola: sara is running 50 secs || 19350071 markings, 29712984 edges, 296911 markings/sec, 50 secs
lola: sara is running 55 secs || 20810622 markings, 32196508 edges, 292110 markings/sec, 55 secs
lola: sara is running 60 secs || 22252529 markings, 34688588 edges, 288381 markings/sec, 60 secs
lola: sara is running 65 secs || 23689687 markings, 37208218 edges, 287432 markings/sec, 65 secs
lola: sara is running 70 secs || 25093656 markings, 39700277 edges, 280794 markings/sec, 70 secs
lola: sara is running 75 secs || 26468655 markings, 42169919 edges, 275000 markings/sec, 75 secs
lola: sara is running 80 secs || 27804061 markings, 44596080 edges, 267081 markings/sec, 80 secs
lola: sara is running 85 secs || 29097392 markings, 46962324 edges, 258666 markings/sec, 85 secs
lola: sara is running 90 secs || 30390992 markings, 49351842 edges, 258720 markings/sec, 90 secs
lola: sara is running 95 secs || 31675253 markings, 51742211 edges, 256852 markings/sec, 95 secs
lola: sara is running 100 secs || 32953900 markings, 54143906 edges, 255729 markings/sec, 100 secs
lola: sara is running 105 secs || 34219073 markings, 56530746 edges, 253035 markings/sec, 105 secs
lola: sara is running 110 secs || 35545960 markings, 59054149 edges, 265377 markings/sec, 110 secs
lola: sara is running 115 secs || 36853004 markings, 61553934 edges, 261409 markings/sec, 115 secs
lola: sara is running 120 secs || 38121320 markings, 63996221 edges, 253663 markings/sec, 120 secs
lola: sara is running 125 secs || 39370751 markings, 66409302 edges, 249886 markings/sec, 125 secs
lola: sara is running 130 secs || 40615154 markings, 68834520 edges, 248881 markings/sec, 130 secs
lola: sara is running 135 secs || 41822396 markings, 71188767 edges, 241448 markings/sec, 135 secs
lola: sara is running 140 secs || 43046810 markings, 73590807 edges, 244883 markings/sec, 140 secs
lola: sara is running 145 secs || 44179745 markings, 75825882 edges, 226587 markings/sec, 145 secs
lola: sara is running 150 secs || 45409785 markings, 78258398 edges, 246008 markings/sec, 150 secs
lola: sara is running 155 secs || 46638283 markings, 80696492 edges, 245700 markings/sec, 155 secs
lola: sara is running 160 secs || 47961391 markings, 83338021 edges, 264622 markings/sec, 160 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 403 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 461 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 538 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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 645 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 807 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 1076 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: ========================================
lola: subprocess 14 will run for 1614 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: 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 3229 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 1496557657774

--------------------
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-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/S_SmallOperatingSystem-PT-MT4096DC2048.tgz
mv S_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 S_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 r158-ebro-149443463900043"
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 ;