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

About the Execution of LoLA for S_Railroad-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15947.750 802887.00 786006.00 285.40 FF?FT?TF?FFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Railroad-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800048
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496437931701


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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: NOT(A (F (E (G ((pl_P80_1 <= pl_P24_1)))))) : E (X (A (((pl_P23_3 <= pl_P99_1) U (2 <= pl_P117_1))))) : NOT((A (F ((1 <= pl_P61_16))) AND E (((pl_P111_1 <= pl_P21_12) U (2 <= pl_P59_9))))) : A (F (((2 <= pl_P113_1) OR ((pl_P84_1 + 1 <= pl_P100_5) AND (pl_P21_15 + 1 <= pl_P62_1))))) : ((pl_P100_1 <= pl_P2_1) AND ((E (F ((3 <= pl_P41_1))) AND (((pl_P23_2 <= pl_P86_1) OR (2 <= pl_P59_3)) AND (pl_P100_4 <= pl_P100_20))) OR (3 <= pl_P108_1))) : ((pl_P21_10 <= pl_P50_1) AND A (F (((pl_P86_1 <= pl_P61_13) AND (2 <= pl_P59_16) AND ((pl_P62_1 <= pl_P72_1) OR (3 <= pl_P76_1)))))) : A (F ((E (X ((1 <= pl_P45_1))) OR ((1 <= pl_P16_1) AND (3 <= pl_P50_1) AND ((1 <= pl_P56_1) OR (2 <= pl_P31_1)))))) : (NOT(E (G ((pl_P110_1 <= pl_P23_18)))) OR (pl_P8_1 + 1 <= pl_P23_12)) : A ((((pl_P73_1 <= 2) OR ((pl_P70_1 <= pl_P14_1) AND (2 <= pl_P23_15))) U ((pl_P40_1 + 1 <= pl_P100_6) AND (pl_P100_6 + 1 <= pl_P100_2)))) : A (F (NOT(E (G ((pl_P59_13 <= pl_P27_1)))))) : (A ((((1 <= pl_P9_1) OR (1 <= pl_P61_5)) U (1 <= pl_P59_5))) OR ((1 <= pl_P23_3) OR E (((1 <= pl_P61_15) U (2 <= pl_P7_1))))) : NOT(E (G (((pl_P84_1 + 1 <= pl_P61_6) AND (pl_P71_1 <= pl_P14_1))))) : NOT((NOT(A (G ((pl_P59_17 <= pl_P100_3)))) OR ((pl_P103_1 + 1 <= pl_P100_13) AND (pl_P59_15 + 1 <= pl_P100_1) AND ((pl_P100_2 <= pl_P59_9) OR (pl_P35_1 <= pl_P97_1) OR (pl_P23_11 <= 0))))) : (((E (G ((pl_P2_1 <= pl_P18_1))) AND ((pl_P85_1 <= pl_P24_1) OR (pl_P23_3 <= pl_P43_1) OR ((3 <= pl_P100_7) AND (2 <= pl_P19_1)))) OR ((pl_P59_15 <= pl_P59_14) AND (pl_P61_12 <= pl_P59_9) AND ((2 <= pl_P23_8) OR (pl_P20_1 <= pl_P105_1)) AND (2 <= pl_P61_16) AND (pl_P84_1 <= pl_P23_3) AND (pl_P21_15 + 1 <= pl_P21_18))) AND ((pl_P2_1 <= 2) AND NOT(A (G ((2 <= pl_P61_7)))))) : E (G (NOT(A (X ((3 <= pl_P91_1)))))) : E (G (((pl_P20_1 <= pl_P21_13) AND A (F ((2 <= pl_P60_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: NOT(A (F (E (G ((pl_P80_1 <= pl_P24_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (pl_P24_1 + 1 <= pl_P80_1)))))
lola: processed formula length: 56
lola: 7 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((pl_P23_3 <= pl_P99_1) U (2 <= pl_P117_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((pl_P23_3 <= pl_P99_1) U (2 <= pl_P117_1)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((1 <= pl_P61_16))) AND E (((pl_P111_1 <= pl_P21_12) U (2 <= pl_P59_9)))))
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: E (G ((pl_P61_16 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= pl_P61_16)))
lola: processed formula length: 31
lola: 10 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pl_P21_12 + 1 <= pl_P111_1) R (pl_P59_9 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((pl_P111_1 <= pl_P21_12) U (2 <= pl_P59_9)))
lola: processed formula length: 50
lola: 11 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: 945279 markings, 2006700 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1780623 markings, 3926319 edges, 167069 markings/sec, 5 secs
lola: 2540569 markings, 5720858 edges, 151989 markings/sec, 10 secs
lola: 3297859 markings, 7450569 edges, 151458 markings/sec, 15 secs
lola: 3989750 markings, 9144444 edges, 138378 markings/sec, 20 secs
lola: 4696986 markings, 10861242 edges, 141447 markings/sec, 25 secs
lola: 5419988 markings, 12641516 edges, 144600 markings/sec, 30 secs
lola: 6133750 markings, 14401601 edges, 142752 markings/sec, 35 secs
lola: 6797830 markings, 16081909 edges, 132816 markings/sec, 40 secs
lola: 7550530 markings, 17875958 edges, 150540 markings/sec, 45 secs
lola: 8245124 markings, 19615458 edges, 138919 markings/sec, 50 secs
lola: 8914107 markings, 21319484 edges, 133797 markings/sec, 55 secs
lola: 9588805 markings, 23033750 edges, 134940 markings/sec, 60 secs
lola: 10271619 markings, 24760154 edges, 136563 markings/sec, 65 secs
lola: 10916969 markings, 26423261 edges, 129070 markings/sec, 70 secs
lola: 11577874 markings, 28125903 edges, 132181 markings/sec, 75 secs
lola: 12242887 markings, 29814981 edges, 133003 markings/sec, 80 secs
lola: 12895506 markings, 31493670 edges, 130524 markings/sec, 85 secs
lola: 13544074 markings, 33169150 edges, 129714 markings/sec, 90 secs
lola: 14316276 markings, 34975010 edges, 154440 markings/sec, 95 secs
lola: 15192520 markings, 36953775 edges, 175249 markings/sec, 100 secs
lola: 16030990 markings, 38844876 edges, 167694 markings/sec, 105 secs
lola: 16693399 markings, 40403664 edges, 132482 markings/sec, 110 secs
lola: 17366198 markings, 42016557 edges, 134560 markings/sec, 115 secs
lola: 18015258 markings, 43577746 edges, 129812 markings/sec, 120 secs
lola: 18660638 markings, 45141722 edges, 129076 markings/sec, 125 secs
lola: 19271144 markings, 46664579 edges, 122101 markings/sec, 130 secs
lola: 19879359 markings, 48184238 edges, 121643 markings/sec, 135 secs
lola: 20533214 markings, 49754615 edges, 130771 markings/sec, 140 secs
lola: 21146336 markings, 51281675 edges, 122624 markings/sec, 145 secs
lola: 21826095 markings, 52851013 edges, 135952 markings/sec, 150 secs
lola: 22423489 markings, 54361732 edges, 119479 markings/sec, 155 secs
lola: 23001760 markings, 55850502 edges, 115654 markings/sec, 160 secs
lola: 23578503 markings, 57324196 edges, 115349 markings/sec, 165 secs
lola: 24124770 markings, 58745326 edges, 109253 markings/sec, 170 secs
lola: 24670852 markings, 60176721 edges, 109216 markings/sec, 175 secs
lola: 25238749 markings, 61639683 edges, 113579 markings/sec, 180 secs
lola: 25769508 markings, 63061609 edges, 106152 markings/sec, 185 secs
lola: 26311625 markings, 64501989 edges, 108423 markings/sec, 190 secs
lola: 26881646 markings, 65967209 edges, 114004 markings/sec, 195 secs
lola: 27447942 markings, 67422550 edges, 113259 markings/sec, 200 secs
lola: 28037239 markings, 68925172 edges, 117859 markings/sec, 205 secs
lola: 28595780 markings, 70344299 edges, 111708 markings/sec, 210 secs
lola: 29148228 markings, 71823744 edges, 110490 markings/sec, 215 secs
lola: 29695016 markings, 73290410 edges, 109358 markings/sec, 220 secs
lola: 30249252 markings, 74764086 edges, 110847 markings/sec, 225 secs
lola: 30791589 markings, 76220394 edges, 108467 markings/sec, 230 secs
lola: 31361953 markings, 77726336 edges, 114073 markings/sec, 235 secs
lola: 31925691 markings, 79241789 edges, 112748 markings/sec, 240 secs
lola: 32508894 markings, 80745074 edges, 116641 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: 32753132 markings, 81351034 edges, 48848 markings/sec, 250 secs
lola: 32753132 markings, 81351034 edges, 0 markings/sec, 255 secs
lola: 32753132 markings, 81351034 edges, 0 markings/sec, 260 secs
lola: 32753132 markings, 81351034 edges, 0 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= pl_P113_1) OR ((pl_P84_1 + 1 <= pl_P100_5) AND (pl_P21_15 + 1 <= pl_P62_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((2 <= pl_P113_1) OR ((pl_P84_1 + 1 <= pl_P100_5) AND (pl_P21_15 + 1 <= pl_P62_1))))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pl_P100_1 <= pl_P2_1) AND ((E (F ((3 <= pl_P41_1))) AND (((pl_P23_2 <= pl_P86_1) OR (2 <= pl_P59_3)) AND (pl_P100_4 <= pl_P100_20))) OR (3 <= pl_P108_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pl_P100_1 <= pl_P2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P100_1 <= pl_P2_1)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P41_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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pl_P108_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pl_P108_1)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pl_P21_10 <= pl_P50_1) AND A (F (((pl_P86_1 <= pl_P61_13) AND (2 <= pl_P59_16) AND ((pl_P62_1 <= pl_P72_1) OR (3 <= pl_P76_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pl_P21_10 <= pl_P50_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P21_10 <= pl_P50_1)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pl_P86_1 <= pl_P61_13) AND (2 <= pl_P59_16) AND ((pl_P62_1 <= pl_P72_1) OR (3 <= pl_P76_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pl_P86_1 <= pl_P61_13) AND (2 <= pl_P59_16) AND ((pl_P62_1 <= pl_P72_1) OR (3 <= pl_P76_1))))
lola: processed formula length: 105
lola: 1 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((1 <= pl_P45_1))) OR ((1 <= pl_P16_1) AND (3 <= pl_P50_1) AND ((1 <= pl_P56_1) OR (2 <= pl_P31_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((1 <= pl_P45_1)) OR ((1 <= pl_P16_1) AND (3 <= pl_P50_1) AND ((1 <= pl_P56_1) OR (2 <= pl_P31_1)))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G ((pl_P110_1 <= pl_P23_18)))) OR (pl_P8_1 + 1 <= pl_P23_12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pl_P23_18 + 1 <= pl_P110_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pl_P23_18 + 1 <= pl_P110_1))
lola: processed formula length: 38
lola: 4 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: (pl_P8_1 + 1 <= pl_P23_12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P8_1 + 1 <= pl_P23_12)
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((pl_P73_1 <= 2) OR ((pl_P70_1 <= pl_P14_1) AND (2 <= pl_P23_15))) U ((pl_P40_1 + 1 <= pl_P100_6) AND (pl_P100_6 + 1 <= pl_P100_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((pl_P73_1 <= 2) OR ((pl_P70_1 <= pl_P14_1) AND (2 <= pl_P23_15))) U ((pl_P40_1 + 1 <= pl_P100_6) AND (pl_P100_6 + 1 <= pl_P100_2)))
lola: processed formula length: 135
lola: 1 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (G ((pl_P59_13 <= pl_P27_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (pl_P27_1 + 1 <= pl_P59_13))
lola: processed formula length: 37
lola: 5 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= pl_P9_1) OR (1 <= pl_P61_5)) U (1 <= pl_P59_5))) OR ((1 <= pl_P23_3) OR E (((1 <= pl_P61_15) U (2 <= pl_P7_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= pl_P9_1) OR (1 <= pl_P61_5)) U (1 <= pl_P59_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= pl_P9_1) OR (1 <= pl_P61_5)) U (1 <= pl_P59_5))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= pl_P23_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pl_P23_3)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= pl_P61_15) U (2 <= pl_P7_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= pl_P61_15) U (2 <= pl_P7_1))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: 975830 markings, 2220249 edges, 3110617900780617728 markings/sec, 0 secs
lola: 1834711 markings, 4356324 edges, 171776 markings/sec, 5 secs
lola: 2665992 markings, 6483122 edges, 166256 markings/sec, 10 secs
lola: 3540537 markings, 8629052 edges, 174909 markings/sec, 15 secs
lola: 4320549 markings, 10664232 edges, 156002 markings/sec, 20 secs
lola: 5115743 markings, 12742840 edges, 159039 markings/sec, 25 secs
lola: 5915975 markings, 14831986 edges, 160046 markings/sec, 30 secs
lola: 6683662 markings, 16860987 edges, 153537 markings/sec, 35 secs
lola: 7435600 markings, 18844619 edges, 150388 markings/sec, 40 secs
lola: 8154138 markings, 20810705 edges, 143708 markings/sec, 45 secs
lola: 8860702 markings, 22745035 edges, 141313 markings/sec, 50 secs
lola: 9568660 markings, 24668998 edges, 141592 markings/sec, 55 secs
lola: 10272655 markings, 26563264 edges, 140799 markings/sec, 60 secs
lola: 10979866 markings, 28499625 edges, 141442 markings/sec, 65 secs
lola: 11684850 markings, 30432120 edges, 140997 markings/sec, 70 secs
lola: 12386566 markings, 32342699 edges, 140343 markings/sec, 75 secs
lola: 13072076 markings, 34245687 edges, 137102 markings/sec, 80 secs
lola: 13740732 markings, 36104348 edges, 133731 markings/sec, 85 secs
lola: 14414791 markings, 37997751 edges, 134812 markings/sec, 90 secs
lola: 15085935 markings, 39887416 edges, 134229 markings/sec, 95 secs
lola: 15735551 markings, 41744983 edges, 129923 markings/sec, 100 secs
lola: 16385276 markings, 43597444 edges, 129945 markings/sec, 105 secs
lola: 17036081 markings, 45440768 edges, 130161 markings/sec, 110 secs
lola: 17694230 markings, 47319837 edges, 131630 markings/sec, 115 secs
lola: 18352187 markings, 49195799 edges, 131591 markings/sec, 120 secs
lola: 19180125 markings, 51307617 edges, 165588 markings/sec, 125 secs
lola: 19964446 markings, 53377831 edges, 156864 markings/sec, 130 secs
lola: 20597266 markings, 55172760 edges, 126564 markings/sec, 135 secs
lola: 21223186 markings, 56966698 edges, 125184 markings/sec, 140 secs
lola: 21853051 markings, 58769031 edges, 125973 markings/sec, 145 secs
lola: 22506503 markings, 60628853 edges, 130690 markings/sec, 150 secs
lola: 23149266 markings, 62480770 edges, 128553 markings/sec, 155 secs
lola: 23813233 markings, 64369150 edges, 132793 markings/sec, 160 secs
lola: 24445259 markings, 66202356 edges, 126405 markings/sec, 165 secs
lola: 25130955 markings, 68135395 edges, 137139 markings/sec, 170 secs
lola: 25760776 markings, 69995568 edges, 125964 markings/sec, 175 secs
lola: 26410895 markings, 71857522 edges, 130024 markings/sec, 180 secs
lola: 27052364 markings, 73713010 edges, 128294 markings/sec, 185 secs
lola: 27681550 markings, 75547256 edges, 125837 markings/sec, 190 secs
lola: 28305231 markings, 77372333 edges, 124736 markings/sec, 195 secs
lola: 28971009 markings, 79259604 edges, 133156 markings/sec, 200 secs
lola: 29594649 markings, 81080380 edges, 124728 markings/sec, 205 secs
lola: 30248859 markings, 82937946 edges, 130842 markings/sec, 210 secs
lola: 30875997 markings, 84770316 edges, 125428 markings/sec, 215 secs
lola: 31486549 markings, 86562824 edges, 122110 markings/sec, 220 secs
lola: 32104509 markings, 88379405 edges, 123592 markings/sec, 225 secs
lola: 32712005 markings, 90156216 edges, 121499 markings/sec, 230 secs
lola: 33427082 markings, 92089878 edges, 143015 markings/sec, 235 secs
lola: 34027777 markings, 93877146 edges, 120139 markings/sec, 240 secs
lola: 34641474 markings, 95685656 edges, 122739 markings/sec, 245 secs
lola: 35259405 markings, 97496771 edges, 123586 markings/sec, 250 secs
lola: 35876413 markings, 99309772 edges, 123402 markings/sec, 255 secs
lola: 36495506 markings, 101140867 edges, 123819 markings/sec, 260 secs
lola: 37096472 markings, 102945688 edges, 120193 markings/sec, 265 secs
lola: 37720090 markings, 104771880 edges, 124724 markings/sec, 270 secs
lola: 38329611 markings, 106581188 edges, 121904 markings/sec, 275 secs
lola: 38922674 markings, 108362000 edges, 118613 markings/sec, 280 secs
lola: 39552262 markings, 110189295 edges, 125918 markings/sec, 285 secs
lola: 40189705 markings, 112028074 edges, 127489 markings/sec, 290 secs
lola: 40790315 markings, 113820524 edges, 120122 markings/sec, 295 secs
lola: 41403071 markings, 115619266 edges, 122551 markings/sec, 300 secs
lola: 41993499 markings, 117407947 edges, 118086 markings/sec, 305 secs
lola: 42594309 markings, 119210043 edges, 120162 markings/sec, 310 secs
lola: 43193177 markings, 121010731 edges, 119774 markings/sec, 315 secs
lola: 43794525 markings, 122804815 edges, 120270 markings/sec, 320 secs
lola: 44394603 markings, 124588467 edges, 120016 markings/sec, 325 secs
lola: 45047043 markings, 126454327 edges, 130488 markings/sec, 330 secs
lola: 45638218 markings, 128235445 edges, 118235 markings/sec, 335 secs
lola: 46217183 markings, 129961641 edges, 115793 markings/sec, 340 secs
lola: 46782145 markings, 131671496 edges, 112992 markings/sec, 345 secs
lola: 47347971 markings, 133368832 edges, 113165 markings/sec, 350 secs
lola: 47910334 markings, 135077213 edges, 112473 markings/sec, 355 secs
lola: 48497954 markings, 136834302 edges, 117524 markings/sec, 360 secs
lola: 49082941 markings, 138582294 edges, 116997 markings/sec, 365 secs
lola: 49728542 markings, 140423270 edges, 129120 markings/sec, 370 secs
lola: 50423731 markings, 142321994 edges, 139038 markings/sec, 375 secs
lola: 51040206 markings, 144125858 edges, 123295 markings/sec, 380 secs
lola: 51661460 markings, 145951874 edges, 124251 markings/sec, 385 secs
lola: 52263001 markings, 147745400 edges, 120308 markings/sec, 390 secs
lola: 52843510 markings, 149494257 edges, 116102 markings/sec, 395 secs
lola: 53419333 markings, 151240788 edges, 115165 markings/sec, 400 secs
lola: 54009616 markings, 153027515 edges, 118057 markings/sec, 405 secs
lola: 54586192 markings, 154789665 edges, 115315 markings/sec, 410 secs
lola: 55194060 markings, 156604835 edges, 121574 markings/sec, 415 secs
lola: 55799273 markings, 158404955 edges, 121043 markings/sec, 420 secs
lola: 56374782 markings, 160151413 edges, 115102 markings/sec, 425 secs
lola: 56963635 markings, 161920285 edges, 117771 markings/sec, 430 secs
lola: 57526774 markings, 163658243 edges, 112628 markings/sec, 435 secs
lola: 58084324 markings, 165373234 edges, 111510 markings/sec, 440 secs
lola: 58665038 markings, 167131368 edges, 116143 markings/sec, 445 secs
lola: 59253909 markings, 168919627 edges, 117774 markings/sec, 450 secs
lola: 59829966 markings, 170641091 edges, 115211 markings/sec, 455 secs
lola: 60433170 markings, 172429063 edges, 120641 markings/sec, 460 secs
lola: 61026084 markings, 174164008 edges, 118583 markings/sec, 465 secs
lola: 61930852 markings, 176271740 edges, 180954 markings/sec, 470 secs
lola: 62741548 markings, 178261793 edges, 162139 markings/sec, 475 secs
lola: 63615596 markings, 180334546 edges, 174810 markings/sec, 480 secs
lola: 64371810 markings, 182269478 edges, 151243 markings/sec, 485 secs
lola: 65132762 markings, 184217382 edges, 152190 markings/sec, 490 secs
lola: 65883263 markings, 186156390 edges, 150100 markings/sec, 495 secs
lola: 66592462 markings, 188028776 edges, 141840 markings/sec, 500 secs
lola: 67324073 markings, 189947246 edges, 146322 markings/sec, 505 secs
lola: 68030270 markings, 191809194 edges, 141239 markings/sec, 510 secs
lola: 68712664 markings, 193636816 edges, 136479 markings/sec, 515 secs
lola: 69403738 markings, 195494622 edges, 138215 markings/sec, 520 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((pl_P84_1 + 1 <= pl_P61_6) AND (pl_P71_1 <= pl_P14_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((pl_P61_6 <= pl_P84_1) OR (pl_P14_1 + 1 <= pl_P71_1)))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 12 will run for 684 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (G ((pl_P59_17 <= pl_P100_3)))) OR ((pl_P103_1 + 1 <= pl_P100_13) AND (pl_P59_15 + 1 <= pl_P100_1) AND ((pl_P100_2 <= pl_P59_9) OR (pl_P35_1 <= pl_P97_1) OR (pl_P23_11 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 684 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P59_17 <= pl_P100_3)))
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-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-CTLCardinality-12.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 13 will run for 912 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pl_P100_13 <= pl_P103_1) OR (pl_P100_1 <= pl_P59_15) OR ((pl_P59_9 + 1 <= pl_P100_2) AND (pl_P97_1 + 1 <= pl_P35_1) AND (1 <= pl_P23_11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pl_P100_13 <= pl_P103_1) OR (pl_P100_1 <= pl_P59_15) OR ((pl_P59_9 + 1 <= pl_P100_2) AND (pl_P97_1 + 1 <= pl_P35_1) AND (1 <= pl_P23_11)))
lola: processed formula length: 142
lola: 8 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 912 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((pl_P2_1 <= pl_P18_1))) AND ((pl_P85_1 <= pl_P24_1) OR (pl_P23_3 <= pl_P43_1) OR ((3 <= pl_P100_7) AND (2 <= pl_P19_1)))) OR ((pl_P59_15 <= pl_P59_14) AND (pl_P61_12 <= pl_P59_9) AND ((2 <= pl_P23_8) OR (pl_P20_1 <= pl_P105_1)) AND (2 <= pl_P61_16) AND (pl_P84_1 <= pl_P23_3) AND (pl_P21_15 + 1 <= pl_P21_18))) AND ((pl_P2_1 <= 2) AND NOT(A (G ((2 <= pl_P61_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 912 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pl_P2_1 <= pl_P18_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pl_P18_1 + 1 <= pl_P2_1)))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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 14 will run for 1368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pl_P85_1 <= pl_P24_1) OR (pl_P23_3 <= pl_P43_1) OR ((3 <= pl_P100_7) AND (2 <= pl_P19_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pl_P85_1 <= pl_P24_1) OR (pl_P23_3 <= pl_P43_1) OR ((3 <= pl_P100_7) AND (2 <= pl_P19_1)))
lola: processed formula length: 94
lola: 3 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
lola: processed formula with 4 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 15 will run for 2737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pl_P2_1 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pl_P2_1 <= 2)
lola: processed formula length: 14
lola: 3 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 14 will run for 1368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((3 <= pl_P91_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((pl_P91_1 <= 2)))))
lola: processed formula length: 39
lola: 5 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((pl_P20_1 <= pl_P21_13) AND A (F ((2 <= pl_P60_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pl_P21_13 + 1 <= pl_P20_1) OR NOT(A(TRUE U (2 <= pl_P60_1))))))
lola: processed formula length: 78
lola: 4 rewrites
lola: formula mentions 0 of 218 places; total mentions: 0
lola: closed formula file Railroad-PT-020-CTLCardinality.task
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: 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no no no unknown no yes unknown yes no
lola: ========================================
FORMULA Railroad-PT-020-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496438734588

--------------------
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="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-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 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-149443432800048"
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 ;