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 S_Railroad-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800052
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496437937485


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


checking for too many tokens
===========================================================================================
S_Railroad-PT-020: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Railroad-PT-020 @ 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: 724/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 218 places, 506 transitions, 87 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-020-ReachabilityCardinality.task
lola: A (G (((3 <= pl_P57_1) OR (pl_P100_4 <= 2) OR (3 <= pl_P100_13)))) : A (G (((1 <= pl_P21_8) OR (pl_P110_1 <= pl_P61_5) OR (pl_P61_4 <= pl_P20_1) OR (1 <= pl_P23_14) OR (pl_P100_15 <= pl_P21_5) OR (1 <= pl_P14_1) OR ((pl_P77_1 <= pl_P4_1) AND (3 <= pl_P39_1))))) : A (G (((pl_P59_13 <= pl_P23_14) OR (pl_P59_4 <= pl_P107_1)))) : A (G (((pl_P100_2 <= 0) OR (pl_P109_1 <= 2) OR ((pl_P21_6 <= 2) AND (pl_P85_1 + 1 <= pl_P37_1))))) : A (G (((pl_P53_1 <= 2) OR (pl_P59_21 <= 0) OR (3 <= pl_P75_1)))) : A (G ((pl_P23_19 <= pl_P6_1))) : A (G (((pl_P35_1 <= 1) AND (pl_P21_21 <= 0) AND (pl_P23_3 <= pl_P61_7)))) : E (F ((3 <= pl_P21_7))) : E (F (((pl_P59_17 + 1 <= pl_P100_18) AND (pl_P23_2 <= 1) AND (pl_P81_1 + 1 <= pl_P23_7)))) : E (F (((2 <= pl_P59_7) AND (pl_P111_1 <= pl_P82_1)))) : E (F ((((2 <= pl_P23_14) AND (pl_P21_21 + 1 <= pl_P23_11)) OR ((pl_P61_20 <= pl_P31_1) AND (3 <= pl_P59_4) AND (2 <= pl_P59_20))))) : E (F ((1 <= pl_P64_1))) : A (G (((1 <= pl_P17_1) OR ((pl_P21_20 <= 0) AND (pl_P112_1 <= 2))))) : A (G ((pl_P100_19 <= pl_P82_1))) : E (F ((3 <= pl_P100_14))) : A (G (((pl_P23_16 <= 1) OR (pl_P54_1 <= pl_P23_21) OR ((pl_P15_1 <= pl_P100_18) AND (pl_P100_4 <= pl_P111_1) AND (pl_P29_1 <= pl_P76_1)))))
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 (((3 <= pl_P57_1) OR (pl_P100_4 <= 2) OR (3 <= pl_P100_13))))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pl_P21_8) OR (pl_P110_1 <= pl_P61_5) OR (pl_P61_4 <= pl_P20_1) OR (1 <= pl_P23_14) OR (pl_P100_15 <= pl_P21_5) OR (1 <= pl_P14_1) OR ((pl_P77_1 <= pl_P4_1) AND (3 <= pl_P39_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P59_13 <= pl_P23_14) OR (pl_P59_4 <= pl_P107_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P100_2 <= 0) OR (pl_P109_1 <= 2) OR ((pl_P21_6 <= 2) AND (pl_P85_1 + 1 <= pl_P37_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P53_1 <= 2) OR (pl_P59_21 <= 0) OR (3 <= pl_P75_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P23_19 <= pl_P6_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P35_1 <= 1) AND (pl_P21_21 <= 0) AND (pl_P23_3 <= pl_P61_7))))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-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 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P21_7)))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 211784 markings, 479698 edges, 42357 markings/sec, 0 secs
lola: sara is running 5 secs || 421283 markings, 998592 edges, 41900 markings/sec, 5 secs
lola: sara is running 10 secs || 628615 markings, 1515765 edges, 41466 markings/sec, 10 secs
lola: sara is running 15 secs || 832708 markings, 2031660 edges, 40819 markings/sec, 15 secs
lola: sara is running 20 secs || 1035758 markings, 2544111 edges, 40610 markings/sec, 20 secs
lola: sara is running 25 secs || 1237261 markings, 3057641 edges, 40301 markings/sec, 25 secs
lola: sara is running 30 secs || 1437616 markings, 3576713 edges, 40071 markings/sec, 30 secs
lola: sara is running 35 secs || 1638379 markings, 4102216 edges, 40153 markings/sec, 35 secs
lola: sara is running 40 secs || 1842430 markings, 4641960 edges, 40810 markings/sec, 40 secs
lola: sara is running 45 secs || 2044930 markings, 5181572 edges, 40500 markings/sec, 45 secs
lola: sara is running 50 secs || 2247370 markings, 5715098 edges, 40488 markings/sec, 50 secs
lola: sara is running 55 secs || 2448637 markings, 6249744 edges, 40253 markings/sec, 55 secs
lola: sara is running 60 secs || 2647949 markings, 6781388 edges, 39862 markings/sec, 60 secs
lola: sara is running 65 secs || 2846397 markings, 7313984 edges, 39690 markings/sec, 65 secs
lola: sara is running 70 secs || 3045601 markings, 7854753 edges, 39841 markings/sec, 70 secs
lola: sara is running 75 secs || 3244185 markings, 8389454 edges, 39717 markings/sec, 75 secs
lola: sara is running 80 secs || 3443020 markings, 8918775 edges, 39767 markings/sec, 80 secs
lola: sara is running 85 secs || 3638630 markings, 9445447 edges, 39122 markings/sec, 85 secs
lola: sara is running 90 secs || 3836064 markings, 9969786 edges, 39487 markings/sec, 90 secs
lola: sara is running 95 secs || 4030838 markings, 10494488 edges, 38955 markings/sec, 95 secs
lola: sara is running 100 secs || 4221195 markings, 11009052 edges, 38071 markings/sec, 100 secs
lola: sara is running 105 secs || 4411011 markings, 11524561 edges, 37963 markings/sec, 105 secs
lola: sara is running 110 secs || 4599172 markings, 12037064 edges, 37632 markings/sec, 110 secs
lola: sara is running 115 secs || 4788521 markings, 12549274 edges, 37870 markings/sec, 115 secs
lola: sara is running 120 secs || 4978556 markings, 13057814 edges, 38007 markings/sec, 120 secs
lola: sara is running 125 secs || 5166803 markings, 13570163 edges, 37649 markings/sec, 125 secs
lola: sara is running 130 secs || 5355380 markings, 14084920 edges, 37715 markings/sec, 130 secs
lola: sara is running 135 secs || 5542792 markings, 14595671 edges, 37482 markings/sec, 135 secs
lola: sara is running 140 secs || 5731058 markings, 15109905 edges, 37653 markings/sec, 140 secs
lola: sara is running 145 secs || 5919329 markings, 15620369 edges, 37654 markings/sec, 145 secs
lola: sara is running 150 secs || 6105617 markings, 16134260 edges, 37258 markings/sec, 150 secs
lola: sara is running 155 secs || 6293573 markings, 16644013 edges, 37591 markings/sec, 155 secs
lola: sara is running 160 secs || 6480271 markings, 17156235 edges, 37340 markings/sec, 160 secs
lola: sara is running 165 secs || 6666510 markings, 17664823 edges, 37248 markings/sec, 165 secs
lola: sara is running 170 secs || 6852491 markings, 18173889 edges, 37196 markings/sec, 170 secs
lola: sara is running 175 secs || 7039213 markings, 18685574 edges, 37344 markings/sec, 175 secs
lola: sara is running 180 secs || 7225743 markings, 19199542 edges, 37306 markings/sec, 180 secs
lola: sara is running 185 secs || 7412400 markings, 19713879 edges, 37331 markings/sec, 185 secs
lola: sara is running 190 secs || 7603121 markings, 20229554 edges, 38144 markings/sec, 190 secs
lola: sara is running 195 secs || 7788183 markings, 20742295 edges, 37012 markings/sec, 195 secs
lola: sara is running 200 secs || 7978019 markings, 21261491 edges, 37967 markings/sec, 200 secs
lola: sara is running 205 secs || 8168830 markings, 21792615 edges, 38162 markings/sec, 205 secs
lola: sara is running 210 secs || 8359039 markings, 22322271 edges, 38042 markings/sec, 210 secs
lola: sara is running 215 secs || 8549171 markings, 22855357 edges, 38026 markings/sec, 215 secs
lola: sara is running 220 secs || 8737112 markings, 23377714 edges, 37588 markings/sec, 220 secs
lola: sara is running 225 secs || 8927109 markings, 23908252 edges, 37999 markings/sec, 225 secs
lola: sara is running 230 secs || 9119216 markings, 24439808 edges, 38421 markings/sec, 230 secs
lola: sara is running 235 secs || 9313507 markings, 24979517 edges, 38858 markings/sec, 235 secs
lola: sara is running 240 secs || 9508835 markings, 25526955 edges, 39066 markings/sec, 240 secs
lola: sara is running 245 secs || 9701406 markings, 26061493 edges, 38514 markings/sec, 245 secs
lola: sara is running 250 secs || 9897275 markings, 26607485 edges, 39174 markings/sec, 250 secs
lola: sara is running 255 secs || 10090336 markings, 27150502 edges, 38612 markings/sec, 255 secs
lola: sara is running 260 secs || 10285874 markings, 27698258 edges, 39108 markings/sec, 260 secs
lola: sara is running 265 secs || 10475743 markings, 28232150 edges, 37974 markings/sec, 265 secs
lola: sara is running 270 secs || 10666874 markings, 28769658 edges, 38226 markings/sec, 270 secs
lola: sara is running 275 secs || 10863897 markings, 29321483 edges, 39405 markings/sec, 275 secs
lola: sara is running 280 secs || 11059667 markings, 29869981 edges, 39154 markings/sec, 280 secs
lola: sara is running 285 secs || 11252706 markings, 30412202 edges, 38608 markings/sec, 285 secs
lola: sara is running 290 secs || 11445295 markings, 30949032 edges, 38518 markings/sec, 290 secs
lola: sara is running 295 secs || 11637315 markings, 31490350 edges, 38404 markings/sec, 295 secs
lola: sara is running 300 secs || 11829375 markings, 32033470 edges, 38412 markings/sec, 300 secs
lola: sara is running 305 secs || 12020623 markings, 32575347 edges, 38250 markings/sec, 305 secs
lola: sara is running 310 secs || 12207956 markings, 33101919 edges, 37467 markings/sec, 310 secs
lola: sara is running 315 secs || 12396391 markings, 33630949 edges, 37687 markings/sec, 315 secs
lola: sara is running 320 secs || 12583470 markings, 34159672 edges, 37416 markings/sec, 320 secs
lola: sara is running 325 secs || 12774380 markings, 34694493 edges, 38182 markings/sec, 325 secs
lola: sara is running 330 secs || 12960851 markings, 35221060 edges, 37294 markings/sec, 330 secs
lola: sara is running 335 secs || 13151696 markings, 35755676 edges, 38169 markings/sec, 335 secs
lola: sara is running 340 secs || 13339263 markings, 36287765 edges, 37513 markings/sec, 340 secs
lola: sara is running 345 secs || 13529089 markings, 36828448 edges, 37965 markings/sec, 345 secs
lola: sara is running 350 secs || 13721864 markings, 37376085 edges, 38555 markings/sec, 350 secs
lola: sara is running 355 secs || 13908760 markings, 37906339 edges, 37379 markings/sec, 355 secs
lola: sara is running 360 secs || 14093833 markings, 38432918 edges, 37015 markings/sec, 360 secs
lola: sara is running 365 secs || 14286212 markings, 38980233 edges, 38476 markings/sec, 365 secs
lola: sara is running 370 secs || 14476798 markings, 39520776 edges, 38117 markings/sec, 370 secs
lola: sara is running 375 secs || 14660755 markings, 40044292 edges, 36791 markings/sec, 375 secs
lola: sara is running 380 secs || 14846928 markings, 40572081 edges, 37235 markings/sec, 380 secs
lola: sara is running 385 secs || 15034935 markings, 41106862 edges, 37601 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P59_17 + 1 <= pl_P100_18) AND (pl_P23_2 <= 1) AND (pl_P81_1 + 1 <= pl_P23_7))))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-8.sara
lola: lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)lola:
========================================
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P59_7) AND (pl_P111_1 <= pl_P82_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
state equation: calling and running sara
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= pl_P23_14) AND (pl_P21_21 + 1 <= pl_P23_11)) OR ((pl_P61_20 <= pl_P31_1) AND (3 <= pl_P59_4) AND (2 <= pl_P59_20)))))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-8.sara.
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 Railroad-PT-020-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

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 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P64_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= pl_P17_1) OR ((pl_P21_20 <= 0) AND (pl_P112_1 <= 2)))))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P100_19 <= pl_P82_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-13.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 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P100_14)))
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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-14.sara
lola: The predicate is unreachable.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P23_16 <= 1) OR (pl_P54_1 <= pl_P23_21) OR ((pl_P15_1 <= pl_P100_18) AND (pl_P100_4 <= pl_P111_1) AND (pl_P29_1 <= pl_P76_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 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-14.sara.
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: SUBRESULT
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityCardinality-15.sara
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no unknown no no no no no yes no yes
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file Railroad-PT-020-ReachabilityCardinality-15.sara.
FORMULA Railroad-PT-020-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496438332040

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_Railroad-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_Railroad-PT-020.tgz
mv S_Railroad-PT-020 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 S_Railroad-PT-020, 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 r148-csrt-149443432800052"
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 ;