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-3254
Executing tool lola
Input is CloudReconfiguration-PT-315, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961400133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496533319374


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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-315: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-315 @ 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: 5680/65536 symbol table entries, 639 collisions
lola: preprocessing...
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2708 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-315-ReachabilityCardinality.task
lola: A (G ((p805 <= p1313))) : E (F (((p582 <= p843) AND ((p1729 <= p2416) OR (p129 <= p1774)) AND (p1970 + 1 <= p1099)))) : E (F (((2 <= p1577) AND ((1 <= p683) OR (p2188 <= 1))))) : A (G ((((p928 <= 0) OR (p1647 <= 0)) AND ((p1596 <= 1) OR (p897 <= 0))))) : A (G (((p2188 <= p906) AND (p274 <= p267)))) : A (G (((p1005 <= p2180) OR (3 <= p2287) OR ((p673 <= p821) AND (p1367 <= p1885)) OR ((p2242 <= p900) AND (p2554 <= p2467) AND (p1303 <= 1))))) : E (F ((((p1484 <= 1) OR (p260 + 1 <= p170)) AND (1 <= p54)))) : A (G ((p2254 <= p2012))) : E (F (((1 <= p1139) OR (2 <= p765)))) : E (F (((p315 + 1 <= p531) AND (p2403 <= 2) AND (p2162 <= p254)))) : A (G (((p399 <= p2223) OR (1 <= p1650) OR (p1852 <= p751) OR ((p2063 + 1 <= p1995) AND (p1592 + 1 <= p2384))))) : E (F ((p335 + 1 <= p2478))) : E (F (((1 <= p767) AND (p817 <= p170)))) : E (F ((((p1651 + 1 <= p872) AND (p2093 + 1 <= p489)) OR ((1 <= p1067) AND (3 <= p1408) AND (p1053 <= p1233) AND (2 <= p51))))) : E (F ((((p1234 + 1 <= p1699) OR (3 <= p40)) AND ((p547 <= p2365) OR (p1528 <= p1219) OR ((p1999 <= p772) AND (3 <= p727)))))) : E (F ((((2 <= p558) OR (2 <= p433) OR (p1940 + 1 <= p2248)) AND (((p1174 <= p2084) AND (3 <= p1834)) OR (2 <= p958)))))
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 ((p805 <= p1313)))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-315-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: E (F (((p582 <= p843) AND ((p1729 <= p2416) OR (p129 <= p1774)) AND (p1970 + 1 <= p1099))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1577) AND ((1 <= p683) OR (p2188 <= 1)))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-2.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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p928 <= 0) OR (p1647 <= 0)) AND ((p1596 <= 1) OR (p897 <= 0)))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2188 <= p906) AND (p274 <= p267))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================
subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1005 <= p2180) OR (3 <= p2287) OR ((p673 <= p821) AND (p1367 <= p1885)) OR ((p2242 <= p900) AND (p2554 <= p2467) AND (p1303 <= 1)))))
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 324 bytes per marking, with 11 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 104320 markings, 165928 edges, 20864 markings/sec, 0 secs
lola: sara is running 5 secs || 187496 markings, 288038 edges, 16635 markings/sec, 5 secs
lola: sara is running 10 secs || 266679 markings, 412344 edges, 15837 markings/sec, 10 secs
lola: sara is running 15 secs || 350541 markings, 520152 edges, 16772 markings/sec, 15 secs
lola: sara is running 20 secs || 451619 markings, 660479 edges, 20216 markings/sec, 20 secs
lola: sara is running 25 secs || 542815 markings, 813784 edges, 18239 markings/sec, 25 secs
lola: sara is running 30 secs || 621929 markings, 930962 edges, 15823 markings/sec, 30 secs
lola: sara is running 35 secs || 720123 markings, 1069362 edges, 19639 markings/sec, 35 secs
lola: sara is running 40 secs || 862987 markings, 1247608 edges, 28573 markings/sec, 40 secs
lola: sara is running 45 secs || 961832 markings, 1389784 edges, 19769 markings/sec, 45 secs
lola: sara is running 50 secs || 1042662 markings, 1524643 edges, 16166 markings/sec, 50 secs
lola: sara is running 55 secs || 1123663 markings, 1674482 edges, 16200 markings/sec, 55 secs
lola: sara is running 60 secs || 1220329 markings, 1821231 edges, 19333 markings/sec, 60 secs
lola: sara is running 65 secs || 1330090 markings, 1965963 edges, 21952 markings/sec, 65 secs
lola: sara is running 70 secs || 1445803 markings, 2111115 edges, 23143 markings/sec, 70 secs
lola: sara is running 75 secs || 1568742 markings, 2263456 edges, 24588 markings/sec, 75 secs
lola: sara is running 80 secs || 1690810 markings, 2417829 edges, 24414 markings/sec, 80 secs
lola: sara is running 85 secs || 1808604 markings, 2565697 edges, 23559 markings/sec, 85 secs
lola: sara is running 90 secs || 1952584 markings, 2749411 edges, 28796 markings/sec, 90 secs
lola: sara is running 95 secs || 2090978 markings, 2925596 edges, 27679 markings/sec, 95 secs
lola: sara is running 100 secs || 2189359 markings, 3069485 edges, 19676 markings/sec, 100 secs
lola: sara is running 105 secs || 2274668 markings, 3191797 edges, 17062 markings/sec, 105 secs
lola: sara is running 110 secs || 2360782 markings, 3340137 edges, 17223 markings/sec, 110 secs
lola: sara is running 115 secs || 2456446 markings, 3470215 edges, 19133 markings/sec, 115 secs
lola: sara is running 120 secs || 2530353 markings, 3574203 edges, 14781 markings/sec, 120 secs
lola: sara is running 125 secs || 2610758 markings, 3677734 edges, 16081 markings/sec, 125 secs
lola: sara is running 130 secs || 2702344 markings, 3807693 edges, 18317 markings/sec, 130 secs
lola: sara is running 135 secs || 2775723 markings, 3903449 edges, 14676 markings/sec, 135 secs
lola: sara is running 140 secs || 2857570 markings, 4011444 edges, 16369 markings/sec, 140 secs
lola: sara is running 145 secs || 2940182 markings, 4118021 edges, 16522 markings/sec, 145 secs
lola: sara is running 150 secs || 3036442 markings, 4240523 edges, 19252 markings/sec, 150 secs
lola: sara is running 155 secs || 3113213 markings, 4359002 edges, 15354 markings/sec, 155 secs
lola: sara is running 160 secs || 3184575 markings, 4449429 edges, 14272 markings/sec, 160 secs
lola: sara is running 165 secs || 3255169 markings, 4542487 edges, 14119 markings/sec, 165 secs
lola: sara is running 170 secs || 3333646 markings, 4640731 edges, 15695 markings/sec, 170 secs
lola: sara is running 175 secs || 3414429 markings, 4748442 edges, 16157 markings/sec, 175 secs
lola: sara is running 180 secs || 3496048 markings, 4853646 edges, 16324 markings/sec, 180 secs
lola: sara is running 185 secs || 3584972 markings, 4968024 edges, 17785 markings/sec, 185 secs
lola: sara is running 190 secs || 3670107 markings, 5072898 edges, 17027 markings/sec, 190 secs
lola: sara is running 195 secs || 3753899 markings, 5176134 edges, 16758 markings/sec, 195 secs
lola: sara is running 200 secs || 3834053 markings, 5275170 edges, 16031 markings/sec, 200 secs
lola: sara is running 205 secs || 3915426 markings, 5376756 edges, 16275 markings/sec, 205 secs
lola: sara is running 210 secs || 3996214 markings, 5477047 edges, 16158 markings/sec, 210 secs
lola: sara is running 215 secs || 4078418 markings, 5581466 edges, 16441 markings/sec, 215 secs
lola: sara is running 220 secs || 4157203 markings, 5679570 edges, 15757 markings/sec, 220 secs
lola: sara is running 225 secs || 4235938 markings, 5777140 edges, 15747 markings/sec, 225 secs
lola: sara is running 230 secs || 4312190 markings, 5872218 edges, 15250 markings/sec, 230 secs
lola: sara is running 235 secs || 4387701 markings, 5966389 edges, 15102 markings/sec, 235 secs
lola: sara is running 240 secs || 4461027 markings, 6057983 edges, 14665 markings/sec, 240 secs
lola: sara is running 245 secs || 4538239 markings, 6168367 edges, 15442 markings/sec, 245 secs
lola: sara is running 250 secs || 4618698 markings, 6268200 edges, 16092 markings/sec, 250 secs
lola: sara is running 255 secs || 4697050 markings, 6365876 edges, 15670 markings/sec, 255 secs
lola: sara is running 260 secs || 4780081 markings, 6470363 edges, 16606 markings/sec, 260 secs
lola: sara is running 265 secs || 4867405 markings, 6578679 edges, 17465 markings/sec, 265 secs
lola: sara is running 270 secs || 4952804 markings, 6684386 edges, 17080 markings/sec, 270 secs
lola: sara is running 275 secs || 5035412 markings, 6787682 edges, 16522 markings/sec, 275 secs
lola: sara is running 280 secs || 5112404 markings, 6896565 edges, 15398 markings/sec, 280 secs
lola: sara is running 285 secs || 5184288 markings, 6995620 edges, 14377 markings/sec, 285 secs
lola: sara is running 290 secs || 5255128 markings, 7095404 edges, 14168 markings/sec, 290 secs
lola: sara is running 295 secs || 5313182 markings, 7221117 edges, 11611 markings/sec, 295 secs
lola: sara is running 300 secs || 5378505 markings, 7314957 edges, 13065 markings/sec, 300 secs
lola: sara is running 305 secs || 5449280 markings, 7404249 edges, 14155 markings/sec, 305 secs
lola: sara is running 310 secs || 5512275 markings, 7507757 edges, 12599 markings/sec, 310 secs
lola: sara is running 315 secs || 5580816 markings, 7608938 edges, 13708 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1484 <= 1) OR (p260 + 1 <= p170)) AND (1 <= p54))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2254 <= p2012)))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-315-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-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 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1139) OR (2 <= p765))))
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 324 bytes per marking, with 11 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p315 + 1 <= p531) AND (p2403 <= 2) AND (p2162 <= p254))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-315-ReachabilityCardinality-9.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 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p399 <= p2223) OR (1 <= p1650) OR (p1852 <= p751) OR ((p2063 + 1 <= p1995) AND (p1592 + 1 <= p2384)))))
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 324 bytes per marking, with 11 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-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 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p335 + 1 <= p2478)))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-315-ReachabilityCardinality-11.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 12 will run for 803 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p767) AND (p817 <= p170))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-315-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1651 + 1 <= p872) AND (p2093 + 1 <= p489)) OR ((1 <= p1067) AND (3 <= p1408) AND (p1053 <= p1233) AND (2 <= p51)))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1607 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1234 + 1 <= p1699) OR (3 <= p40)) AND ((p547 <= p2365) OR (p1528 <= p1219) OR ((p1999 <= p772) AND (3 <= p727))))))
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 324 bytes per marking, with 11 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 14 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3214 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p558) OR (2 <= p433) OR (p1940 + 1 <= p2248)) AND (((p1174 <= p2084) AND (3 <= p1834)) OR (2 <= p958)))))
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 324 bytes per marking, with 11 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 15 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-315-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-315-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 137365 markings, 165958 edges, 27473 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no unknown yes no yes yes no yes yes yes yes no
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-315-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496533654958

--------------------
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="CloudReconfiguration-PT-315"
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/CloudReconfiguration-PT-315.tgz
mv CloudReconfiguration-PT-315 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is CloudReconfiguration-PT-315, 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 r178-csrt-149580961400133"
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 ;