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-306, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961200052
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496530036555


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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-306: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-306 @ 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: 5678/65536 symbol table entries, 638 collisions
lola: preprocessing...
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2707 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-306-ReachabilityCardinality.task
lola: A (G (((p1629 + 1 <= p1615) OR (p944 + 1 <= p537) OR ((p2126 <= 1) AND (p2432 <= 0))))) : E (F (((p608 <= p1372) AND (p125 <= p2304) AND (1 <= p2507) AND (p915 <= p1328) AND (p2508 <= p1349)))) : A (G ((p1202 <= 0))) : A (G ((((p791 <= p2446) OR (2 <= p933)) AND (p1591 <= 0) AND ((3 <= p2366) OR (p2003 <= p431) OR (p2191 <= p551) OR (p2121 <= p1736))))) : E (F ((p1267 + 1 <= p224))) : A (G ((p278 <= p1399))) : A (G ((((p1169 <= p1316) AND (p277 <= p2124)) OR (p537 <= p2563) OR ((p1565 <= p2410) AND (p1824 <= p1801) AND (p610 + 1 <= p1256))))) : E (F (((p1391 <= p1079) AND (3 <= p812) AND ((p2006 <= p1338) OR (2 <= p1201) OR (p1094 <= 1))))) : E (F (((((1 <= p697) OR (2 <= p2407)) AND (p2266 <= 2)) OR (p475 + 1 <= p403)))) : E (F ((((p116 + 1 <= p918) OR ((p128 <= p2430) AND (1 <= p1704))) AND (1 <= p495)))) : E (F (((3 <= p1129) AND (3 <= p926)))) : A (G (((p2436 <= p1547) OR (p2543 <= p1744)))) : E (F ((2 <= p2174))) : E (F (((p26 <= p1874) AND (p2414 <= p1916) AND (1 <= p208) AND (p2338 <= 2) AND (p537 <= 0)))) : A (G ((p956 <= p1524))) : E (F ((p677 + 1 <= p570)))
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 (((p1629 + 1 <= p1615) OR (p944 + 1 <= p537) OR ((p2126 <= 1) AND (p2432 <= 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 12 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-306-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 (((p608 <= p1372) AND (p125 <= p2304) AND (1 <= p2507) AND (p915 <= p1328) AND (p2508 <= p1349))))
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 12 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 CloudReconfiguration-PT-306-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: A (G ((p1202 <= 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 12 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-306-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p791 <= p2446) OR (2 <= p933)) AND (p1591 <= 0) AND ((3 <= p2366) OR (p2003 <= p431) OR (p2191 <= p551) OR (p2121 <= p1736)))))
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 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-306-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1267 + 1 <= p224)))
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 12 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-306-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p278 <= p1399)))
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 12 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-306-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1169 <= p1316) AND (p277 <= p2124)) OR (p537 <= p2563) OR ((p1565 <= p2410) AND (p1824 <= p1801) AND (p610 + 1 <= p1256)))))
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 12 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 CloudReconfiguration-PT-306-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 85725 markings, 166058 edges, 17145 markings/sec, 0 secs
lola: sara is running 5 secs || 177776 markings, 375763 edges, 18410 markings/sec, 5 secs
lola: sara is running 10 secs || 267827 markings, 579317 edges, 18010 markings/sec, 10 secs
lola: sara is running 15 secs || 353046 markings, 777646 edges, 17044 markings/sec, 15 secs
lola: sara is running 20 secs || 439084 markings, 968099 edges, 17208 markings/sec, 20 secs
lola: sara is running 25 secs || 527210 markings, 1164992 edges, 17625 markings/sec, 25 secs
lola: sara is running 30 secs || 615169 markings, 1358047 edges, 17592 markings/sec, 30 secs
lola: sara is running 35 secs || 707291 markings, 1562352 edges, 18424 markings/sec, 35 secs
lola: sara is running 40 secs || 793526 markings, 1754599 edges, 17247 markings/sec, 40 secs
lola: sara is running 45 secs || 884271 markings, 1960364 edges, 18149 markings/sec, 45 secs
lola: sara is running 50 secs || 969822 markings, 2149507 edges, 17110 markings/sec, 50 secs
lola: sara is running 55 secs || 1052354 markings, 2334975 edges, 16506 markings/sec, 55 secs
lola: sara is running 60 secs || 1142944 markings, 2530593 edges, 18118 markings/sec, 60 secs
lola: sara is running 65 secs || 1233339 markings, 2739799 edges, 18079 markings/sec, 65 secs
lola: sara is running 70 secs || 1324521 markings, 2946132 edges, 18236 markings/sec, 70 secs
lola: sara is running 75 secs || 1414819 markings, 3125026 edges, 18060 markings/sec, 75 secs
lola: sara is running 80 secs || 1499569 markings, 3316553 edges, 16950 markings/sec, 80 secs
lola: sara is running 85 secs || 1582954 markings, 3503698 edges, 16677 markings/sec, 85 secs
lola: sara is running 90 secs || 1664357 markings, 3696021 edges, 16281 markings/sec, 90 secs
lola: sara is running 95 secs || 1744863 markings, 3877836 edges, 16101 markings/sec, 95 secs
lola: sara is running 100 secs || 1822560 markings, 4054445 edges, 15539 markings/sec, 100 secs
lola: sara is running 105 secs || 1902918 markings, 4235577 edges, 16072 markings/sec, 105 secs
lola: sara is running 110 secs || 1983121 markings, 4416148 edges, 16041 markings/sec, 110 secs
lola: sara is running 115 secs || 2062780 markings, 4619936 edges, 15932 markings/sec, 115 secs
lola: sara is running 120 secs || 2149388 markings, 4814505 edges, 17322 markings/sec, 120 secs
lola: sara is running 125 secs || 2241227 markings, 5022230 edges, 18368 markings/sec, 125 secs
lola: sara is running 130 secs || 2335263 markings, 5231107 edges, 18807 markings/sec, 130 secs
lola: sara is running 135 secs || 2423647 markings, 5418088 edges, 17677 markings/sec, 135 secs
lola: sara is running 140 secs || 2512481 markings, 5625824 edges, 17767 markings/sec, 140 secs
lola: sara is running 145 secs || 2603852 markings, 5830249 edges, 18274 markings/sec, 145 secs
lola: sara is running 150 secs || 2686868 markings, 6027183 edges, 16603 markings/sec, 150 secs
lola: sara is running 155 secs || 2769046 markings, 6216144 edges, 16436 markings/sec, 155 secs
lola: sara is running 160 secs || 2855006 markings, 6411627 edges, 17192 markings/sec, 160 secs
lola: sara is running 165 secs || 2943340 markings, 6607082 edges, 17667 markings/sec, 165 secs
lola: sara is running 170 secs || 3029884 markings, 6801856 edges, 17309 markings/sec, 170 secs
lola: sara is running 175 secs || 3110970 markings, 6986069 edges, 16217 markings/sec, 175 secs
lola: sara is running 180 secs || 3196015 markings, 7174772 edges, 17009 markings/sec, 180 secs
lola: sara is running 185 secs || 3281149 markings, 7352841 edges, 17027 markings/sec, 185 secs
lola: sara is running 190 secs || 3355742 markings, 7491837 edges, 14919 markings/sec, 190 secs
lola: sara is running 195 secs || 3441907 markings, 7698181 edges, 17233 markings/sec, 195 secs
lola: sara is running 200 secs || 3504924 markings, 7918224 edges, 12603 markings/sec, 200 secs
lola: sara is running 205 secs || 3584249 markings, 8096685 edges, 15865 markings/sec, 205 secs
lola: sara is running 210 secs || 3658001 markings, 8263660 edges, 14750 markings/sec, 210 secs
lola: sara is running 215 secs || 3733597 markings, 8433469 edges, 15119 markings/sec, 215 secs
lola: sara is running 220 secs || 3810040 markings, 8614868 edges, 15289 markings/sec, 220 secs
lola: sara is running 225 secs || 3886102 markings, 8786123 edges, 15212 markings/sec, 225 secs
lola: sara is running 230 secs || 3963437 markings, 8960909 edges, 15467 markings/sec, 230 secs
lola: sara is running 235 secs || 4036807 markings, 9126516 edges, 14674 markings/sec, 235 secs
lola: sara is running 240 secs || 4118554 markings, 9310409 edges, 16349 markings/sec, 240 secs
lola: sara is running 245 secs || 4199078 markings, 9516309 edges, 16105 markings/sec, 245 secs
lola: sara is running 250 secs || 4287092 markings, 9714672 edges, 17603 markings/sec, 250 secs
lola: sara is running 255 secs || 4375545 markings, 9914018 edges, 17691 markings/sec, 255 secs
lola: sara is running 260 secs || 4465270 markings, 10114470 edges, 17945 markings/sec, 260 secs
lola: sara is running 265 secs || 4554862 markings, 10316242 edges, 17918 markings/sec, 265 secs
lola: sara is running 270 secs || 4645673 markings, 10520903 edges, 18162 markings/sec, 270 secs
lola: sara is running 275 secs || 4726509 markings, 10722466 edges, 16167 markings/sec, 275 secs
lola: sara is running 280 secs || 4800661 markings, 10927703 edges, 14830 markings/sec, 280 secs
lola: sara is running 285 secs || 4879384 markings, 11117348 edges, 15745 markings/sec, 285 secs
lola: sara is running 290 secs || 4957545 markings, 11296636 edges, 15632 markings/sec, 290 secs
lola: sara is running 295 secs || 5035492 markings, 11470502 edges, 15589 markings/sec, 295 secs
lola: sara is running 300 secs || 5115473 markings, 11649940 edges, 15996 markings/sec, 300 secs
lola: sara is running 305 secs || 5201169 markings, 11851825 edges, 17139 markings/sec, 305 secs
lola: sara is running 310 secs || 5288082 markings, 12046031 edges, 17383 markings/sec, 310 secs
lola: sara is running 315 secs || 5370774 markings, 12244144 edges, 16538 markings/sec, 315 secs
lola: sara is running 320 secs || 5447124 markings, 12446843 edges, 15270 markings/sec, 320 secs
lola: sara is running 325 secs || 5525308 markings, 12611629 edges, 15637 markings/sec, 325 secs
lola: sara is running 330 secs || 5604455 markings, 12773898 edges, 15829 markings/sec, 330 secs
lola: sara is running 335 secs || 5682333 markings, 12949075 edges, 15576 markings/sec, 335 secs
lola: sara is running 340 secs || 5759142 markings, 13122535 edges, 15362 markings/sec, 340 secs
lola: sara is running 345 secs || 5838377 markings, 13302171 edges, 15847 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1391 <= p1079) AND (3 <= p812) AND ((p2006 <= p1338) OR (2 <= p1201) OR (p1094 <= 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 12 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 CloudReconfiguration-PT-306-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-7.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 8 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p697) OR (2 <= p2407)) AND (p2266 <= 2)) OR (p475 + 1 <= p403))))
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 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-306-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 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p116 + 1 <= p918) OR ((p128 <= p2430) AND (1 <= p1704))) AND (1 <= p495))))
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 12 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 CloudReconfiguration-PT-306-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1129) AND (3 <= p926))))
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 12 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-306-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-10.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 11 will run for 635 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2436 <= p1547) OR (p2543 <= p1744))))
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 12 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-306-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-11.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 12 will run for 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2174)))
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 12 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-306-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-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 1056 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p26 <= p1874) AND (p2414 <= p1916) AND (1 <= p208) AND (p2338 <= 2) AND (p537 <= 0))))
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 12 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 CloudReconfiguration-PT-306-ReachabilityCardinality-13.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 14 will run for 1585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p956 <= p1524)))
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 12 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-306-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3170 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p677 + 1 <= p570)))
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 12 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-306-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-306-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no yes no no yes no unknown no yes yes no yes no yes no yes
lola: ========================================
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-306-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496530406190

--------------------
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-306"
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-306.tgz
mv CloudReconfiguration-PT-306 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-306, 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-149580961200052"
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 ;