fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r178-csrt-149580961400124
Last Updated
June 27, 2017

About the Execution of LoLA for CloudReconfiguration-PT-314

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1644.280 472084.00 930706.00 45.10 FTFTFTFTFFTTFF?T normal

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

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

=== Now, execution of the tool begins

BK_START 1496533115905


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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-314: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-314 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 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: 2709 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-314-ReachabilityCardinality.task
lola: E (F ((3 <= p173))) : E (F ((1 <= p2429))) : E (F ((2 <= p653))) : E (F ((((p1542 <= p119) OR (p1351 <= p2438) OR (p2170 <= p359)) AND (2 <= p1601)))) : E (F ((p558 + 1 <= p1756))) : E (F ((1 <= p1746))) : A (G (((p1413 <= 0) OR (2 <= p1469) OR ((3 <= p221) AND (1 <= p213)) OR (p315 + 1 <= p2276)))) : E (F (((p2377 <= p817) AND (p689 <= p1686) AND (2 <= p1575) AND (p1537 <= p1257)))) : E (F (((p1835 <= 0) AND (p1429 <= 2) AND (p305 <= 0) AND (p1295 + 1 <= p2021)))) : E (F (((2 <= p921) OR (2 <= p1480) OR (1 <= p1836) OR (2 <= p157)))) : E (F ((3 <= p1207))) : A (G ((p609 <= 1))) : E (F ((3 <= p1215))) : E (F (((p1453 <= 2) AND (p274 + 1 <= p2456) AND (p1502 <= 2)))) : E (F (((p2508 + 1 <= p977) AND (3 <= p2372) AND (3 <= p1570)))) : E (F ((p1650 + 1 <= p2252)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p173)))
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-314-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p2429)))
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-314-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-ReachabilityCardinality.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 <= p653)))
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-314-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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: E (F ((((p1542 <= p119) OR (p1351 <= p2438) OR (p2170 <= p359)) AND (2 <= p1601))))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-314-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 103009 markings, 183271 edges, 20602 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: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p558 + 1 <= p1756)))
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-314-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1746)))
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-314-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1413 <= 0) OR (2 <= p1469) OR ((3 <= p221) AND (1 <= p213)) OR (p315 + 1 <= p2276))))
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-314-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2377 <= p817) AND (p689 <= p1686) AND (2 <= p1575) AND (p1537 <= p1257))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-314-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1835 <= 0) AND (p1429 <= 2) AND (p305 <= 0) AND (p1295 + 1 <= p2021))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-314-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 94483 markings, 213251 edges, 18897 markings/sec, 0 secs
lola: sara is running 5 secs || 187925 markings, 423818 edges, 18688 markings/sec, 5 secs
lola: sara is running 10 secs || 280869 markings, 637072 edges, 18589 markings/sec, 10 secs
lola: sara is running 15 secs || 377561 markings, 859207 edges, 19338 markings/sec, 15 secs
lola: sara is running 20 secs || 476174 markings, 1085453 edges, 19723 markings/sec, 20 secs
lola: sara is running 25 secs || 571895 markings, 1306281 edges, 19144 markings/sec, 25 secs
lola: sara is running 30 secs || 669541 markings, 1530700 edges, 19529 markings/sec, 30 secs
lola: sara is running 35 secs || 767026 markings, 1754717 edges, 19497 markings/sec, 35 secs
lola: sara is running 40 secs || 864661 markings, 1978959 edges, 19527 markings/sec, 40 secs
lola: sara is running 45 secs || 961963 markings, 2202371 edges, 19460 markings/sec, 45 secs
lola: sara is running 50 secs || 1058818 markings, 2424428 edges, 19371 markings/sec, 50 secs
lola: sara is running 55 secs || 1153764 markings, 2644006 edges, 18989 markings/sec, 55 secs
lola: sara is running 60 secs || 1245908 markings, 2859342 edges, 18429 markings/sec, 60 secs
lola: sara is running 65 secs || 1337292 markings, 3073679 edges, 18277 markings/sec, 65 secs
lola: sara is running 70 secs || 1430774 markings, 3292650 edges, 18696 markings/sec, 70 secs
lola: sara is running 75 secs || 1519075 markings, 3500501 edges, 17660 markings/sec, 75 secs
lola: sara is running 80 secs || 1609833 markings, 3710731 edges, 18152 markings/sec, 80 secs
lola: sara is running 85 secs || 1704717 markings, 3928294 edges, 18977 markings/sec, 85 secs
lola: sara is running 90 secs || 1794299 markings, 4131340 edges, 17916 markings/sec, 90 secs
lola: sara is running 95 secs || 1886777 markings, 4344858 edges, 18496 markings/sec, 95 secs
lola: sara is running 100 secs || 1967068 markings, 4525303 edges, 16058 markings/sec, 100 secs
lola: sara is running 105 secs || 2053999 markings, 4719576 edges, 17386 markings/sec, 105 secs
lola: sara is running 110 secs || 2150085 markings, 4940461 edges, 19217 markings/sec, 110 secs
lola: sara is running 115 secs || 2245094 markings, 5160561 edges, 19002 markings/sec, 115 secs
lola: sara is running 120 secs || 2328463 markings, 5345989 edges, 16674 markings/sec, 120 secs
lola: sara is running 125 secs || 2424019 markings, 5565459 edges, 19111 markings/sec, 125 secs
lola: sara is running 130 secs || 2510370 markings, 5764597 edges, 17270 markings/sec, 130 secs
lola: sara is running 135 secs || 2589501 markings, 5937913 edges, 15826 markings/sec, 135 secs
lola: sara is running 140 secs || 2669888 markings, 6118247 edges, 16077 markings/sec, 140 secs
lola: sara is running 145 secs || 2752865 markings, 6302556 edges, 16595 markings/sec, 145 secs
lola: sara is running 150 secs || 2840109 markings, 6496523 edges, 17449 markings/sec, 150 secs
lola: sara is running 155 secs || 2927888 markings, 6694225 edges, 17556 markings/sec, 155 secs
lola: sara is running 160 secs || 3012790 markings, 6882735 edges, 16980 markings/sec, 160 secs
lola: sara is running 165 secs || 3092020 markings, 7064814 edges, 15846 markings/sec, 165 secs
lola: sara is running 170 secs || 3169617 markings, 7243473 edges, 15519 markings/sec, 170 secs
lola: sara is running 175 secs || 3248293 markings, 7423824 edges, 15735 markings/sec, 175 secs
lola: sara is running 180 secs || 3329348 markings, 7605850 edges, 16211 markings/sec, 180 secs
lola: sara is running 185 secs || 3410451 markings, 7786470 edges, 16221 markings/sec, 185 secs
lola: sara is running 190 secs || 3491431 markings, 7967024 edges, 16196 markings/sec, 190 secs
lola: sara is running 195 secs || 3571277 markings, 8147306 edges, 15969 markings/sec, 195 secs
lola: sara is running 200 secs || 3655899 markings, 8341758 edges, 16924 markings/sec, 200 secs
lola: sara is running 205 secs || 3737539 markings, 8522313 edges, 16328 markings/sec, 205 secs
lola: sara is running 210 secs || 3819404 markings, 8709131 edges, 16373 markings/sec, 210 secs
lola: sara is running 215 secs || 3900181 markings, 8890000 edges, 16155 markings/sec, 215 secs
lola: sara is running 220 secs || 3984376 markings, 9077165 edges, 16839 markings/sec, 220 secs
lola: sara is running 225 secs || 4065003 markings, 9258395 edges, 16125 markings/sec, 225 secs
lola: sara is running 230 secs || 4144100 markings, 9441071 edges, 15819 markings/sec, 230 secs
lola: sara is running 235 secs || 4223739 markings, 9625821 edges, 15928 markings/sec, 235 secs
lola: sara is running 240 secs || 4310427 markings, 9825273 edges, 17338 markings/sec, 240 secs
lola: sara is running 245 secs || 4395314 markings, 10021255 edges, 16977 markings/sec, 245 secs
lola: sara is running 250 secs || 4475631 markings, 10205108 edges, 16063 markings/sec, 250 secs
lola: sara is running 255 secs || 4555925 markings, 10388364 edges, 16059 markings/sec, 255 secs
lola: sara is running 260 secs || 4632815 markings, 10566409 edges, 15378 markings/sec, 260 secs
lola: sara is running 265 secs || 4709791 markings, 10744507 edges, 15395 markings/sec, 265 secs
lola: sara is running 270 secs || 4787625 markings, 10924342 edges, 15567 markings/sec, 270 secs
lola: sara is running 275 secs || 4869267 markings, 11113362 edges, 16328 markings/sec, 275 secs
lola: sara is running 280 secs || 4956023 markings, 11314283 edges, 17351 markings/sec, 280 secs
lola: sara is running 285 secs || 5043825 markings, 11510254 edges, 17560 markings/sec, 285 secs
lola: sara is running 290 secs || 5124352 markings, 11691557 edges, 16105 markings/sec, 290 secs
lola: sara is running 295 secs || 5203110 markings, 11873499 edges, 15752 markings/sec, 295 secs
lola: sara is running 300 secs || 5281170 markings, 12055021 edges, 15612 markings/sec, 300 secs
lola: sara is running 305 secs || 5361867 markings, 12240389 edges, 16139 markings/sec, 305 secs
lola: sara is running 310 secs || 5448411 markings, 12440751 edges, 17309 markings/sec, 310 secs
lola: sara is running 315 secs || 5528343 markings, 12620102 edges, 15986 markings/sec, 315 secs
lola: sara is running 320 secs || 5606560 markings, 12800535 edges, 15643 markings/sec, 320 secs
lola: sara is running 325 secs || 5685650 markings, 12984420 edges, 15818 markings/sec, 325 secs
lola: sara is running 330 secs || 5763289 markings, 13163698 edges, 15528 markings/sec, 330 secs
lola: sara is running 335 secs || 5842821 markings, 13347231 edges, 15906 markings/sec, 335 secs
lola: sara is running 340 secs || 5923815 markings, 13528626 edges, 16199 markings/sec, 340 secs
lola: sara is running 345 secs || 6010586 markings, 13729217 edges, 17354 markings/sec, 345 secs
lola: sara is running 350 secs || 6089684 markings, 13907399 edges, 15820 markings/sec, 350 secs
lola: sara is running 355 secs || 6166444 markings, 14084977 edges, 15352 markings/sec, 355 secs
lola: sara is running 360 secs || 6243178 markings, 14262191 edges, 15347 markings/sec, 360 secs
lola: sara is running 365 secs || 6329799 markings, 14461747 edges, 17324 markings/sec, 365 secs
lola: sara is running 370 secs || 6415396 markings, 14660185 edges, 17119 markings/sec, 370 secs
lola: sara is running 375 secs || 6490299 markings, 14834740 edges, 14981 markings/sec, 375 secs
lola: sara is running 380 secs || 6564105 markings, 14998406 edges, 14761 markings/sec, 380 secs
lola: sara is running 385 secs || 6637486 markings, 15168774 edges, 14676 markings/sec, 385 secs
lola: sara is running 390 secs || 6709941 markings, 15336266 edges, 14491 markings/sec, 390 secs
lola: sara is running 395 secs || 6782769 markings, 15505020 edges, 14566 markings/sec, 395 secs
lola: sara is running 400 secs || 6855252 markings, 15673295 edges, 14497 markings/sec, 400 secs
lola: sara is running 405 secs || 6928937 markings, 15843611 edges, 14737 markings/sec, 405 secs
lola: sara is running 410 secs || 7004666 markings, 16019117 edges, 15146 markings/sec, 410 secs
lola: sara is running 415 secs || 7080593 markings, 16194576 edges, 15185 markings/sec, 415 secs
lola: sara is running 420 secs || 7168218 markings, 16397242 edges, 17525 markings/sec, 420 secs
lola: sara is running 425 secs || 7248937 markings, 16577924 edges, 16144 markings/sec, 425 secs
lola: sara is running 430 secs || 7323053 markings, 16749918 edges, 14823 markings/sec, 430 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p921) OR (2 <= p1480) OR (1 <= p1836) OR (2 <= p157))))
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 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-314-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1207)))
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-314-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 615 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p609 <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-314-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1215)))
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-314-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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: subprocess 13 will run for 1023 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1453 <= 2) AND (p274 + 1 <= p2456) AND (p1502 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-314-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 1535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2508 + 1 <= p977) AND (3 <= p2372) AND (3 <= p1570))))
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-314-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 3068 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1650 + 1 <= p2252)))
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-314-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-314-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 yes no no unknown yes no yes no yes no yes
lola: ========================================
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-314-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496533587989

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