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-100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800066
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496439139750


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


checking for too many tokens
===========================================================================================
S_Railroad-PT-100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_Railroad-PT-100 @ 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: 11524/65536 symbol table entries, 3643 collisions
lola: preprocessing...
lola: finding significant places
lola: 1018 places, 10506 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 612 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-100-CTLCardinality.task
lola: NOT(E (G (((pl_P435_25 <= 2) AND (pl_P218_40 + 1 <= pl_P435_87))))) : NOT(A (F (((pl_P39_1 + 1 <= pl_P489_1) AND ((2 <= pl_P435_94) OR (2 <= pl_P218_100)))))) : (((A (X ((3 <= pl_P218_6))) OR A (X ((pl_P502_59 <= pl_P29_36)))) AND ((((3 <= pl_P435_1) OR (3 <= pl_P435_95)) AND (pl_P29_87 <= 0)) OR ((pl_P19_1 + 1 <= pl_P238_1) AND (pl_P367_1 + 1 <= pl_P135_1)))) OR (((pl_P513_1 <= 1) OR (pl_P435_81 + 1 <= pl_P419_1) OR (3 <= pl_P304_79)) AND A (G (((pl_P326_1 <= pl_P218_49) OR (pl_P435_72 <= pl_P218_101)))))) : A (G (E (F ((1 <= pl_P435_77))))) : A (G ((pl_P29_49 <= pl_P25_1))) : (A (F (E (X ((3 <= pl_P352_1))))) OR (A (X (((3 <= pl_P363_1) AND (3 <= pl_P330_1)))) AND ((2 <= pl_P405_1) AND (3 <= pl_P304_69) AND (pl_P29_20 <= 1) AND (1 <= pl_P364_1)))) : (A (X (((pl_P418_1 + 1 <= pl_P74_1) AND (pl_P469_1 <= 2)))) OR NOT(A (((pl_P224_1 <= pl_P65_1) U (pl_P306_1 <= pl_P459_1))))) : A ((((pl_P38_1 <= 1) OR (pl_P304_47 <= 1)) U (((3 <= pl_P218_56) AND (pl_P422_1 <= pl_P435_87)) OR (1 <= pl_P218_61)))) : A (G (E (((1 <= pl_P502_36) U (pl_P218_5 <= pl_P218_63))))) : (((pl_P29_74 <= pl_P122_1) AND E (G ((pl_P218_43 <= 0)))) OR (1 <= pl_P506_1)) : E (F ((1 <= pl_P29_15))) : ((A (X ((pl_P160_1 <= pl_P296_1))) AND NOT(E (X ((pl_P502_15 <= pl_P345_1))))) OR E (F (A (G ((1 <= pl_P435_3)))))) : E (F ((pl_P243_1 + 1 <= pl_P386_1))) : E (F (((pl_P435_99 + 1 <= pl_P75_1) AND (pl_P218_40 + 1 <= pl_P502_16) AND (pl_P29_48 + 1 <= pl_P60_1) AND (pl_P331_1 <= 2)))) : (A (F (A (F ((3 <= pl_P363_1))))) OR (1 <= pl_P326_1)) : NOT(E (F (((pl_P9_1 <= pl_P218_64) AND (pl_P435_54 <= pl_P44_1) AND ((2 <= pl_P304_15) OR (1 <= pl_P29_65))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((pl_P435_25 <= 2) AND (pl_P218_40 + 1 <= pl_P435_87)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= pl_P435_25) OR (pl_P435_87 <= pl_P218_40)))
lola: processed formula length: 60
lola: 4 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((pl_P39_1 + 1 <= pl_P489_1) AND ((2 <= pl_P435_94) OR (2 <= pl_P218_100))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pl_P39_1 + 1 <= pl_P489_1) AND ((2 <= pl_P435_94) OR (2 <= pl_P218_100)))))
lola: processed formula length: 91
lola: 5 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (X ((3 <= pl_P218_6))) OR A (X ((pl_P502_59 <= pl_P29_36)))) AND ((((3 <= pl_P435_1) OR (3 <= pl_P435_95)) AND (pl_P29_87 <= 0)) OR ((pl_P19_1 + 1 <= pl_P238_1) AND (pl_P367_1 + 1 <= pl_P135_1)))) OR (((pl_P513_1 <= 1) OR (pl_P435_81 + 1 <= pl_P419_1) OR (3 <= pl_P304_79)) AND A (G (((pl_P326_1 <= pl_P218_49) OR (pl_P435_72 <= pl_P218_101))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= pl_P218_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= pl_P218_6))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pl_P502_59 <= pl_P29_36)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((pl_P502_59 <= pl_P29_36))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= pl_P435_1) OR (3 <= pl_P435_95)) AND (pl_P29_87 <= 0)) OR ((pl_P19_1 + 1 <= pl_P238_1) AND (pl_P367_1 + 1 <= pl_P135_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((3 <= pl_P435_1) OR (3 <= pl_P435_95)) AND (pl_P29_87 <= 0)) OR ((pl_P19_1 + 1 <= pl_P238_1) AND (pl_P367_1 + 1 <= pl_P135_1)))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pl_P513_1 <= 1) OR (pl_P435_81 + 1 <= pl_P419_1) OR (3 <= pl_P304_79))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pl_P513_1 <= 1) OR (pl_P435_81 + 1 <= pl_P419_1) OR (3 <= pl_P304_79))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P326_1 <= pl_P218_49) OR (pl_P435_72 <= pl_P218_101))))
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 1628 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-100-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= pl_P435_77)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (1 <= pl_P435_77)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 129342 markings, 378131 edges, 2977823834180157440 markings/sec, 0 secs
lola: 250389 markings, 758851 edges, 24209 markings/sec, 5 secs
lola: 380926 markings, 1177107 edges, 26107 markings/sec, 10 secs
lola: 511232 markings, 1596165 edges, 26061 markings/sec, 15 secs
lola: 644976 markings, 2016595 edges, 26749 markings/sec, 20 secs
lola: 777967 markings, 2428031 edges, 26598 markings/sec, 25 secs
lola: 908738 markings, 2834477 edges, 26154 markings/sec, 30 secs
lola: 1049823 markings, 3232379 edges, 28217 markings/sec, 35 secs
lola: 1188401 markings, 3640513 edges, 27716 markings/sec, 40 secs
lola: 1328954 markings, 4052732 edges, 28111 markings/sec, 45 secs
lola: 1469701 markings, 4471540 edges, 28149 markings/sec, 50 secs
lola: 1614816 markings, 4904826 edges, 29023 markings/sec, 55 secs
lola: 1754651 markings, 5331008 edges, 27967 markings/sec, 60 secs
lola: 1893963 markings, 5757452 edges, 27862 markings/sec, 65 secs
lola: 2033264 markings, 6183496 edges, 27860 markings/sec, 70 secs
lola: 2175383 markings, 6579885 edges, 28424 markings/sec, 75 secs
lola: 2318732 markings, 6982712 edges, 28670 markings/sec, 80 secs
lola: 2461335 markings, 7393965 edges, 28521 markings/sec, 85 secs
lola: 2604190 markings, 7811920 edges, 28571 markings/sec, 90 secs
lola: 2744350 markings, 8226398 edges, 28032 markings/sec, 95 secs
lola: 2885313 markings, 8646458 edges, 28193 markings/sec, 100 secs
lola: 3026045 markings, 9061678 edges, 28146 markings/sec, 105 secs
lola: 3163429 markings, 9478345 edges, 27477 markings/sec, 110 secs
lola: 3303518 markings, 9901455 edges, 28018 markings/sec, 115 secs
lola: 3444892 markings, 10328955 edges, 28275 markings/sec, 120 secs
lola: 3585662 markings, 10750444 edges, 28154 markings/sec, 125 secs
lola: 3727544 markings, 11180022 edges, 28376 markings/sec, 130 secs
lola: 3870094 markings, 11611124 edges, 28510 markings/sec, 135 secs
lola: 4012096 markings, 12046886 edges, 28400 markings/sec, 140 secs
lola: 4153415 markings, 12476532 edges, 28264 markings/sec, 145 secs
lola: 4293067 markings, 12904999 edges, 27930 markings/sec, 150 secs
lola: 4432090 markings, 13332030 edges, 27805 markings/sec, 155 secs
lola: 4572647 markings, 13760462 edges, 28111 markings/sec, 160 secs
lola: 4709323 markings, 14185832 edges, 27335 markings/sec, 165 secs
lola: 4851257 markings, 14619976 edges, 28387 markings/sec, 170 secs
lola: 4992474 markings, 15037097 edges, 28243 markings/sec, 175 secs
lola: 5138465 markings, 15435840 edges, 29198 markings/sec, 180 secs
lola: 5281433 markings, 15842054 edges, 28594 markings/sec, 185 secs
lola: 5424192 markings, 16248988 edges, 28552 markings/sec, 190 secs
lola: 5564564 markings, 16652933 edges, 28074 markings/sec, 195 secs
lola: 5705668 markings, 17066501 edges, 28221 markings/sec, 200 secs
lola: 5845729 markings, 17478895 edges, 28012 markings/sec, 205 secs
lola: 5984055 markings, 17891107 edges, 27665 markings/sec, 210 secs
lola: 6111486 markings, 18264772 edges, 25486 markings/sec, 215 secs
lola: 6246768 markings, 18666863 edges, 27056 markings/sec, 220 secs
lola: 6384144 markings, 19075177 edges, 27475 markings/sec, 225 secs
lola: 6524106 markings, 19490725 edges, 27992 markings/sec, 230 secs
lola: 6661913 markings, 19901688 edges, 27561 markings/sec, 235 secs
lola: 6799642 markings, 20317763 edges, 27546 markings/sec, 240 secs
lola: 6938044 markings, 20735323 edges, 27680 markings/sec, 245 secs
lola: 7076497 markings, 21150302 edges, 27691 markings/sec, 250 secs
lola: 7213954 markings, 21566709 edges, 27491 markings/sec, 255 secs
lola: 7350917 markings, 21985206 edges, 27393 markings/sec, 260 secs
lola: 7487247 markings, 22404030 edges, 27266 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P29_49 <= pl_P25_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 1628 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-100-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (X ((3 <= pl_P352_1))))) OR (A (X (((3 <= pl_P363_1) AND (3 <= pl_P330_1)))) AND ((2 <= pl_P405_1) AND (3 <= pl_P304_69) AND (pl_P29_20 <= 1) AND (1 <= pl_P364_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= pl_P352_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= pl_P352_1)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((3 <= pl_P363_1) AND (3 <= pl_P330_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((3 <= pl_P363_1) AND (3 <= pl_P330_1)))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((pl_P418_1 + 1 <= pl_P74_1) AND (pl_P469_1 <= 2)))) OR NOT(A (((pl_P224_1 <= pl_P65_1) U (pl_P306_1 <= pl_P459_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((pl_P418_1 + 1 <= pl_P74_1) AND (pl_P469_1 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((pl_P418_1 + 1 <= pl_P74_1) AND (pl_P469_1 <= 2)))
lola: processed formula length: 54
lola: 5 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pl_P65_1 + 1 <= pl_P224_1) R (pl_P459_1 + 1 <= pl_P306_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((pl_P224_1 <= pl_P65_1) U (pl_P306_1 <= pl_P459_1)))
lola: processed formula length: 58
lola: 7 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((pl_P38_1 <= 1) OR (pl_P304_47 <= 1)) U (((3 <= pl_P218_56) AND (pl_P422_1 <= pl_P435_87)) OR (1 <= pl_P218_61))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((pl_P38_1 <= 1) OR (pl_P304_47 <= 1)) U (((3 <= pl_P218_56) AND (pl_P422_1 <= pl_P435_87)) OR (1 <= pl_P218_61)))
lola: processed formula length: 118
lola: 1 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (((1 <= pl_P502_36) U (pl_P218_5 <= pl_P218_63)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E((1 <= pl_P502_36) U (pl_P218_5 <= pl_P218_63)))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 133849 markings, 392052 edges, 2531055701053145088 markings/sec, 0 secs
lola: 265917 markings, 809451 edges, 26414 markings/sec, 5 secs
lola: 395944 markings, 1223265 edges, 26005 markings/sec, 10 secs
lola: 526412 markings, 1645114 edges, 26094 markings/sec, 15 secs
lola: 657958 markings, 2054860 edges, 26309 markings/sec, 20 secs
lola: 782995 markings, 2444381 edges, 25007 markings/sec, 25 secs
lola: 914646 markings, 2852023 edges, 26330 markings/sec, 30 secs
lola: 1056316 markings, 3250697 edges, 28334 markings/sec, 35 secs
lola: 1193289 markings, 3653634 edges, 27395 markings/sec, 40 secs
lola: 1331511 markings, 4060575 edges, 27644 markings/sec, 45 secs
lola: 1471264 markings, 4476537 edges, 27951 markings/sec, 50 secs
lola: 1609753 markings, 4890010 edges, 27698 markings/sec, 55 secs
lola: 1747669 markings, 5309949 edges, 27583 markings/sec, 60 secs
lola: 1895671 markings, 5762901 edges, 29600 markings/sec, 65 secs
lola: 2045229 markings, 6220282 edges, 29912 markings/sec, 70 secs
lola: 2197216 markings, 6640309 edges, 30397 markings/sec, 75 secs
lola: 2346546 markings, 7062188 edges, 29866 markings/sec, 80 secs
lola: 2493510 markings, 7487187 edges, 29393 markings/sec, 85 secs
lola: 2637251 markings, 7910598 edges, 28748 markings/sec, 90 secs
lola: 2780485 markings, 8332875 edges, 28647 markings/sec, 95 secs
lola: 2915877 markings, 8736430 edges, 27078 markings/sec, 100 secs
lola: 3053226 markings, 9144908 edges, 27470 markings/sec, 105 secs
lola: 3193226 markings, 9568899 edges, 28000 markings/sec, 110 secs
lola: 3334898 markings, 9995696 edges, 28334 markings/sec, 115 secs
lola: 3474725 markings, 10416977 edges, 27965 markings/sec, 120 secs
lola: 3614412 markings, 10835972 edges, 27937 markings/sec, 125 secs
lola: 3754231 markings, 11262023 edges, 27964 markings/sec, 130 secs
lola: 3897954 markings, 11695066 edges, 28745 markings/sec, 135 secs
lola: 4039670 markings, 12132337 edges, 28343 markings/sec, 140 secs
lola: 4180971 markings, 12559835 edges, 28260 markings/sec, 145 secs
lola: 4320985 markings, 12991308 edges, 28003 markings/sec, 150 secs
lola: 4465538 markings, 13433260 edges, 28911 markings/sec, 155 secs
lola: 4609676 markings, 13874946 edges, 28828 markings/sec, 160 secs
lola: 4749994 markings, 14310181 edges, 28064 markings/sec, 165 secs
lola: 4886943 markings, 14730788 edges, 27390 markings/sec, 170 secs
lola: 5029236 markings, 15133581 edges, 28459 markings/sec, 175 secs
lola: 5173539 markings, 15532699 edges, 28861 markings/sec, 180 secs
lola: 5315716 markings, 15940386 edges, 28435 markings/sec, 185 secs
lola: 5457527 markings, 16343920 edges, 28362 markings/sec, 190 secs
lola: 5596435 markings, 16745340 edges, 27782 markings/sec, 195 secs
lola: 5735927 markings, 17155849 edges, 27898 markings/sec, 200 secs
lola: 5874931 markings, 17564360 edges, 27801 markings/sec, 205 secs
lola: 6014898 markings, 17982564 edges, 27993 markings/sec, 210 secs
lola: 6151724 markings, 18383715 edges, 27365 markings/sec, 215 secs
lola: 6291619 markings, 18802621 edges, 27979 markings/sec, 220 secs
lola: 6428528 markings, 19208066 edges, 27382 markings/sec, 225 secs
lola: 6568249 markings, 19622037 edges, 27944 markings/sec, 230 secs
lola: 6706038 markings, 20035080 edges, 27558 markings/sec, 235 secs
lola: 6846762 markings, 20458330 edges, 28145 markings/sec, 240 secs
lola: 6987494 markings, 20883569 edges, 28146 markings/sec, 245 secs
lola: 7127570 markings, 21303917 edges, 28015 markings/sec, 250 secs
lola: 7264371 markings, 21722722 edges, 27360 markings/sec, 255 secs
lola: 7400577 markings, 22138591 edges, 27241 markings/sec, 260 secs
lola: 7536281 markings, 22554196 edges, 27141 markings/sec, 265 secs
lola: 7673111 markings, 22970979 edges, 27366 markings/sec, 270 secs
lola: 7806537 markings, 23379065 edges, 26685 markings/sec, 275 secs
lola: 7942670 markings, 23796990 edges, 27227 markings/sec, 280 secs
lola: 8079531 markings, 24214432 edges, 27372 markings/sec, 285 secs
lola: 8217262 markings, 24637476 edges, 27546 markings/sec, 290 secs
lola: 8354846 markings, 25059092 edges, 27517 markings/sec, 295 secs
lola: 8492876 markings, 25480685 edges, 27606 markings/sec, 300 secs
lola: 8628289 markings, 25895009 edges, 27083 markings/sec, 305 secs
lola: 8765195 markings, 26313265 edges, 27381 markings/sec, 310 secs
lola: 8901858 markings, 26731660 edges, 27333 markings/sec, 315 secs
lola: 9037569 markings, 27147130 edges, 27142 markings/sec, 320 secs
lola: 9172621 markings, 27564042 edges, 27010 markings/sec, 325 secs
lola: 9308988 markings, 27984552 edges, 27273 markings/sec, 330 secs
lola: 9444675 markings, 28400157 edges, 27137 markings/sec, 335 secs
lola: 9580626 markings, 28820233 edges, 27190 markings/sec, 340 secs
lola: 9715246 markings, 29241338 edges, 26924 markings/sec, 345 secs
lola: 9855341 markings, 29673325 edges, 28019 markings/sec, 350 secs
lola: 9994376 markings, 30101251 edges, 27807 markings/sec, 355 secs
lola: 10132562 markings, 30527896 edges, 27637 markings/sec, 360 secs
lola: 10267993 markings, 30950714 edges, 27086 markings/sec, 365 secs
lola: 10402976 markings, 31371957 edges, 26997 markings/sec, 370 secs
lola: 10538479 markings, 31791993 edges, 27101 markings/sec, 375 secs
lola: 10673346 markings, 32214428 edges, 26973 markings/sec, 380 secs
lola: 10810514 markings, 32638350 edges, 27434 markings/sec, 385 secs
lola: 10946127 markings, 33058913 edges, 27123 markings/sec, 390 secs
lola: 11081087 markings, 33479924 edges, 26992 markings/sec, 395 secs
lola: 11216331 markings, 33897696 edges, 27049 markings/sec, 400 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 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pl_P29_74 <= pl_P122_1) AND E (G ((pl_P218_43 <= 0)))) OR (1 <= pl_P506_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pl_P29_74 <= pl_P122_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P29_74 <= pl_P122_1)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pl_P218_43 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= pl_P218_43)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= pl_P29_15)))
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 1628 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-100-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X ((pl_P160_1 <= pl_P296_1))) AND NOT(E (X ((pl_P502_15 <= pl_P345_1))))) OR E (F (A (G ((1 <= pl_P435_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pl_P160_1 <= pl_P296_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((pl_P160_1 <= pl_P296_1))
lola: processed formula length: 28
lola: 4 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= pl_P435_3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (pl_P435_3 <= 0))))
lola: processed formula length: 41
lola: 6 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 145081 markings, 282335 edges, 29016 markings/sec, 0 secs
lola: 280183 markings, 575148 edges, 27020 markings/sec, 5 secs
lola: 415775 markings, 871875 edges, 27118 markings/sec, 10 secs
lola: 550947 markings, 1174775 edges, 27034 markings/sec, 15 secs
lola: 696643 markings, 1476211 edges, 29139 markings/sec, 20 secs
lola: 841020 markings, 1791303 edges, 28875 markings/sec, 25 secs
lola: 992767 markings, 2083335 edges, 30349 markings/sec, 30 secs
lola: 1148127 markings, 2372260 edges, 31072 markings/sec, 35 secs
lola: 1304782 markings, 2678048 edges, 31331 markings/sec, 40 secs
lola: 1461702 markings, 2985132 edges, 31384 markings/sec, 45 secs
lola: 1616568 markings, 3293352 edges, 30973 markings/sec, 50 secs
lola: 1770582 markings, 3610194 edges, 30803 markings/sec, 55 secs
lola: 1926135 markings, 3928148 edges, 31111 markings/sec, 60 secs
lola: 2077813 markings, 4230511 edges, 30336 markings/sec, 65 secs
lola: 2231502 markings, 4504361 edges, 30738 markings/sec, 70 secs
lola: 2385254 markings, 4788183 edges, 30750 markings/sec, 75 secs
lola: 2538546 markings, 5080162 edges, 30658 markings/sec, 80 secs
lola: 2687947 markings, 5371185 edges, 29880 markings/sec, 85 secs
lola: 2836138 markings, 5663747 edges, 29638 markings/sec, 90 secs
lola: 2983998 markings, 5954769 edges, 29572 markings/sec, 95 secs
lola: 3134846 markings, 6256182 edges, 30170 markings/sec, 100 secs
lola: 3284325 markings, 6558748 edges, 29896 markings/sec, 105 secs
lola: 3433361 markings, 6860972 edges, 29807 markings/sec, 110 secs
lola: 3584087 markings, 7161444 edges, 30145 markings/sec, 115 secs
lola: 3731287 markings, 7459944 edges, 29440 markings/sec, 120 secs
lola: 3881648 markings, 7765685 edges, 30072 markings/sec, 125 secs
lola: 4028061 markings, 8068283 edges, 29283 markings/sec, 130 secs
lola: 4175094 markings, 8367774 edges, 29407 markings/sec, 135 secs
lola: 4320324 markings, 8668919 edges, 29046 markings/sec, 140 secs
lola: 4468955 markings, 8974108 edges, 29726 markings/sec, 145 secs
lola: 4617517 markings, 9282196 edges, 29712 markings/sec, 150 secs
lola: 4763708 markings, 9588203 edges, 29238 markings/sec, 155 secs
lola: 4909914 markings, 9892045 edges, 29241 markings/sec, 160 secs
lola: 5062798 markings, 10163889 edges, 30577 markings/sec, 165 secs
lola: 5217043 markings, 10439976 edges, 30849 markings/sec, 170 secs
lola: 5367745 markings, 10715569 edges, 30140 markings/sec, 175 secs
lola: 5514397 markings, 10993332 edges, 29330 markings/sec, 180 secs
lola: 5662305 markings, 11276324 edges, 29582 markings/sec, 185 secs
lola: 5811440 markings, 11564908 edges, 29827 markings/sec, 190 secs
lola: 5954943 markings, 11847064 edges, 28701 markings/sec, 195 secs
lola: 6096186 markings, 12124815 edges, 28249 markings/sec, 200 secs
lola: 6237786 markings, 12402386 edges, 28320 markings/sec, 205 secs
lola: 6378960 markings, 12681023 edges, 28235 markings/sec, 210 secs
lola: 6522249 markings, 12962828 edges, 28658 markings/sec, 215 secs
lola: 6664191 markings, 13244885 edges, 28388 markings/sec, 220 secs
lola: 6806446 markings, 13532048 edges, 28451 markings/sec, 225 secs
lola: 6947683 markings, 13817274 edges, 28247 markings/sec, 230 secs
lola: 7089528 markings, 14099620 edges, 28369 markings/sec, 235 secs
lola: 7229915 markings, 14386695 edges, 28077 markings/sec, 240 secs
lola: 7370453 markings, 14675281 edges, 28108 markings/sec, 245 secs
lola: 7511294 markings, 14966575 edges, 28168 markings/sec, 250 secs
lola: 7653775 markings, 15256807 edges, 28496 markings/sec, 255 secs
lola: 7792888 markings, 15543218 edges, 27823 markings/sec, 260 secs
lola: 7933124 markings, 15834477 edges, 28047 markings/sec, 265 secs
lola: 8072969 markings, 16121601 edges, 27969 markings/sec, 270 secs
lola: 8221154 markings, 16428329 edges, 29637 markings/sec, 275 secs
lola: 8367771 markings, 16730584 edges, 29323 markings/sec, 280 secs
lola: 8512681 markings, 17028464 edges, 28982 markings/sec, 285 secs
lola: 8653703 markings, 17321366 edges, 28204 markings/sec, 290 secs
lola: 8799172 markings, 17617824 edges, 29094 markings/sec, 295 secs
lola: 8944617 markings, 17918305 edges, 29089 markings/sec, 300 secs
lola: 9087768 markings, 18214227 edges, 28630 markings/sec, 305 secs
lola: 9230109 markings, 18509955 edges, 28468 markings/sec, 310 secs
lola: 9375057 markings, 18811930 edges, 28990 markings/sec, 315 secs
lola: 9517667 markings, 19107122 edges, 28522 markings/sec, 320 secs
lola: 9663919 markings, 19415014 edges, 29250 markings/sec, 325 secs
lola: 9807804 markings, 19720387 edges, 28777 markings/sec, 330 secs
lola: 9950399 markings, 20015422 edges, 28519 markings/sec, 335 secs
lola: 10091394 markings, 20310124 edges, 28199 markings/sec, 340 secs
lola: 10231083 markings, 20603668 edges, 27938 markings/sec, 345 secs
lola: 10369183 markings, 20896448 edges, 27620 markings/sec, 350 secs
lola: 10508987 markings, 21191108 edges, 27961 markings/sec, 355 secs
lola: 10648005 markings, 21487192 edges, 27804 markings/sec, 360 secs
lola: 10788634 markings, 21783352 edges, 28126 markings/sec, 365 secs
lola: 10932015 markings, 22083252 edges, 28676 markings/sec, 370 secs
lola: 11076724 markings, 22390043 edges, 28942 markings/sec, 375 secs
lola: 11221045 markings, 22691786 edges, 28864 markings/sec, 380 secs
lola: 11365181 markings, 22993570 edges, 28827 markings/sec, 385 secs
lola: 11507013 markings, 23294624 edges, 28366 markings/sec, 390 secs
lola: 11649259 markings, 23594729 edges, 28449 markings/sec, 395 secs
lola: 11792693 markings, 23894630 edges, 28687 markings/sec, 400 secs
lola: 11935250 markings, 24198524 edges, 28511 markings/sec, 405 secs
lola: 12077237 markings, 24503985 edges, 28397 markings/sec, 410 secs
lola: 12221833 markings, 24811231 edges, 28919 markings/sec, 415 secs
lola: 12362918 markings, 25112832 edges, 28217 markings/sec, 420 secs
lola: 12506820 markings, 25418409 edges, 28780 markings/sec, 425 secs
lola: 12652834 markings, 25730174 edges, 29203 markings/sec, 430 secs
lola: 12793274 markings, 26035401 edges, 28088 markings/sec, 435 secs
lola: 12930836 markings, 26334158 edges, 27512 markings/sec, 440 secs
lola: 13069600 markings, 26633292 edges, 27753 markings/sec, 445 secs
lola: 13209605 markings, 26927420 edges, 28001 markings/sec, 450 secs
lola: 13347018 markings, 27221348 edges, 27483 markings/sec, 455 secs
lola: 13492153 markings, 27530000 edges, 29027 markings/sec, 460 secs
lola: 13637733 markings, 27844242 edges, 29116 markings/sec, 465 secs
lola: 13784514 markings, 28157890 edges, 29356 markings/sec, 470 secs
lola: 13930650 markings, 28468897 edges, 29227 markings/sec, 475 secs
lola: 14073766 markings, 28781085 edges, 28623 markings/sec, 480 secs
lola: 14215452 markings, 29085575 edges, 28337 markings/sec, 485 secs
lola: 14358933 markings, 29397654 edges, 28696 markings/sec, 490 secs
lola: 14501314 markings, 29710766 edges, 28476 markings/sec, 495 secs
lola: 14640832 markings, 30012533 edges, 27904 markings/sec, 500 secs
lola: 14774832 markings, 30304092 edges, 26800 markings/sec, 505 secs
lola: 14916018 markings, 30610622 edges, 28237 markings/sec, 510 secs
lola: 15053754 markings, 30910606 edges, 27547 markings/sec, 515 secs
lola: 15190555 markings, 31211063 edges, 27360 markings/sec, 520 secs
lola: 15328993 markings, 31512966 edges, 27688 markings/sec, 525 secs
lola: 15465480 markings, 31815373 edges, 27297 markings/sec, 530 secs
lola: 15604611 markings, 32114316 edges, 27826 markings/sec, 535 secs
lola: 15742106 markings, 32415828 edges, 27499 markings/sec, 540 secs
lola: 15880954 markings, 32716747 edges, 27770 markings/sec, 545 secs
lola: 16019111 markings, 33017676 edges, 27631 markings/sec, 550 secs
lola: 16156561 markings, 33316463 edges, 27490 markings/sec, 555 secs
lola: 16294495 markings, 33618018 edges, 27587 markings/sec, 560 secs
lola: 16432570 markings, 33919851 edges, 27615 markings/sec, 565 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pl_P243_1 + 1 <= pl_P386_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 1628 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-100-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-12.sara.
lola: sara is running 0 secs || 5188 markings, 6267 edges, 1038 markings/sec, 0 secs
lola: sara is running 5 secs || 11550 markings, 14171 edges, 1272 markings/sec, 5 secs
lola: sara is running 10 secs || 17686 markings, 22042 edges, 1227 markings/sec, 10 secs
lola: sara is running 15 secs || 23863 markings, 30050 edges, 1235 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 20 secs || 30067 markings, 38186 edges, 1241 markings/sec, 20 secs
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 752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P435_99 + 1 <= pl_P75_1) AND (pl_P218_40 + 1 <= pl_P502_16) AND (pl_P29_48 + 1 <= pl_P60_1) AND (pl_P331_1 <= 2))))
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 1628 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-CTLCardinality-13.sara
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((3 <= pl_P363_1))))) OR (1 <= pl_P326_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1129 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= pl_P363_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-13.sara.
lola: processed formula: A(TRUE U (3 <= pl_P363_1))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= pl_P326_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pl_P326_1)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 1018 places; total mentions: 0
lola: closed formula file Railroad-PT-100-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((pl_P9_1 <= pl_P218_64) AND (pl_P435_54 <= pl_P44_1) AND ((2 <= pl_P304_15) OR (1 <= pl_P29_65))))))
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 1628 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-100-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown no no yes no unknown yes yes unknown no no no no
FORMULA Railroad-PT-100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496440422412

--------------------
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-100"
export BK_EXAMINATION="CTLCardinality"
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-100.tgz
mv S_Railroad-PT-100 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-100, examination is CTLCardinality"
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-149443432800066"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;