fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for Railroad-PT-100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
463.140 541463.00 1082948.00 47.50 T?FFTTFTTFF?TTTT 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 Railroad-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r068-csrt-149440963100072
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494801599851


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ Railroad-PT-100 @ 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: 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-ReachabilityFireability.task
lola: E (F (FIREABLE(tr_T135_5934))) : E (F ((FIREABLE(tr_T135_6258) AND FIREABLE(tr_T135_8136) AND (NOT FIREABLE(tr_T135_5668) OR NOT FIREABLE(tr_T135_9918)) AND (NOT FIREABLE(tr_T135_3703) OR NOT FIREABLE(tr_T135_2393) OR FIREABLE(tr_T135_1273) OR FIREABLE(tr_T135_5808) OR NOT FIREABLE(tr_T135_8960))))) : E (F ((FIREABLE(tr_T135_5498) OR FIREABLE(tr_T135_2194) OR (FIREABLE(tr_T135_7933) AND FIREABLE(tr_T135_8583))))) : A (G (NOT FIREABLE(tr_T135_3412))) : A (G ((NOT FIREABLE(tr_T135_8394) OR FIREABLE(tr_T135_7609) OR (NOT FIREABLE(tr_T135_9616) AND FIREABLE(tr_T135_6864))))) : E (F ((FIREABLE(tr_T83_1) AND ((FIREABLE(tr_T135_9209) AND FIREABLE(tr_T135_1762)) OR FIREABLE(tr_T135_7623)) AND (FIREABLE(tr_T135_3484) OR FIREABLE(tr_T135_1361) OR (NOT FIREABLE(tr_T135_9074) AND FIREABLE(tr_T135_2822)))))) : E (F (FIREABLE(tr_T135_4509))) : E (F ((FIREABLE(tr_T135_2873) OR (FIREABLE(tr_T135_9991) AND FIREABLE(tr_T135_5541) AND (NOT FIREABLE(tr_T135_7350) OR NOT FIREABLE(tr_T135_338)))))) : E (F ((FIREABLE(tr_T135_1066) OR (FIREABLE(tr_T125_117) AND (NOT FIREABLE(tr_T135_4809) OR (FIREABLE(tr_T135_2041) AND FIREABLE(tr_T135_9493))))))) : E (F (FIREABLE(tr_T135_8947))) : A (G ((NOT FIREABLE(tr_T305_1) AND NOT FIREABLE(tr_T135_8627) AND NOT FIREABLE(tr_T51_99) AND NOT FIREABLE(tr_T135_7748)))) : A (G ((NOT FIREABLE(tr_T135_3610) OR FIREABLE(tr_T135_3046) OR FIREABLE(tr_T135_8718)))) : E (F (FIREABLE(tr_T135_2926))) : E (F (FIREABLE(tr_T135_5642))) : A (G (((FIREABLE(tr_T135_1022) AND FIREABLE(tr_T135_8705)) OR NOT FIREABLE(tr_T135_9416)))) : E (F ((FIREABLE(tr_T135_778) OR FIREABLE(tr_T135_1178) OR FIREABLE(tr_T135_952) OR FIREABLE(tr_T135_7007) OR ((FIREABLE(tr_T135_2540) OR FIREABLE(tr_T135_6296)) AND FIREABLE(tr_T135_3949)) OR FIREABLE(tr_T135_9122))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_5934)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_6258) AND FIREABLE(tr_T135_8136) AND (NOT FIREABLE(tr_T135_5668) OR NOT FIREABLE(tr_T135_9918)) AND (NOT FIREABLE(tr_T135_3703) OR NOT FIREABLE(tr_T135_2393) OR FIREABLE(tr_T135_1273) OR FIREABLE(tr_T135_5808) OR NOT FIREABLE(tr_T135_8960)))))
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 272 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability.sara.
lola: sara is running 0 secs || 4438 markings, 5552 edges, 888 markings/sec, 0 secs
lola: sara is running 5 secs || 8661 markings, 11297 edges, 845 markings/sec, 5 secs
lola: sara is running 10 secs || 12804 markings, 17181 edges, 829 markings/sec, 10 secs
lola: sara is running 15 secs || 17105 markings, 23159 edges, 860 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 21334 markings, 29057 edges, 846 markings/sec, 20 secs
lola: sara is running 25 secs || 25468 markings, 35123 edges, 827 markings/sec, 25 secs
lola: sara is running 30 secs || 29727 markings, 40889 edges, 852 markings/sec, 30 secs
lola: sara is running 35 secs || 34022 markings, 46681 edges, 859 markings/sec, 35 secs
lola: sara is running 40 secs || 38378 markings, 52527 edges, 871 markings/sec, 40 secs
lola: sara is running 45 secs || 42844 markings, 58432 edges, 893 markings/sec, 45 secs
lola: sara is running 50 secs || 47274 markings, 64569 edges, 886 markings/sec, 50 secs
lola: sara is running 55 secs || 51628 markings, 70767 edges, 871 markings/sec, 55 secs
lola: sara is running 60 secs || 56024 markings, 77027 edges, 879 markings/sec, 60 secs
lola: sara is running 65 secs || 60325 markings, 83187 edges, 860 markings/sec, 65 secs
lola: sara is running 70 secs || 64690 markings, 89236 edges, 873 markings/sec, 70 secs
lola: sara is running 75 secs || 68823 markings, 95336 edges, 827 markings/sec, 75 secs
lola: sara is running 80 secs || 73001 markings, 101513 edges, 836 markings/sec, 80 secs
lola: sara is running 85 secs || 77184 markings, 107811 edges, 837 markings/sec, 85 secs
lola: sara is running 90 secs || 81350 markings, 114279 edges, 833 markings/sec, 90 secs
lola: sara is running 95 secs || 85750 markings, 120715 edges, 880 markings/sec, 95 secs
lola: sara is running 100 secs || 90043 markings, 126990 edges, 859 markings/sec, 100 secs
lola: sara is running 105 secs || 94563 markings, 133226 edges, 904 markings/sec, 105 secs
lola: sara is running 110 secs || 98878 markings, 139522 edges, 863 markings/sec, 110 secs
lola: sara is running 115 secs || 103131 markings, 145667 edges, 851 markings/sec, 115 secs
lola: sara is running 120 secs || 107322 markings, 151725 edges, 838 markings/sec, 120 secs
lola: sara is running 125 secs || 111429 markings, 157752 edges, 821 markings/sec, 125 secs
lola: sara is running 130 secs || 115566 markings, 163958 edges, 827 markings/sec, 130 secs
lola: sara is running 135 secs || 119711 markings, 170129 edges, 829 markings/sec, 135 secs
lola: sara is running 140 secs || 123910 markings, 176398 edges, 840 markings/sec, 140 secs
lola: sara is running 145 secs || 128003 markings, 182465 edges, 819 markings/sec, 145 secs
lola: sara is running 150 secs || 132070 markings, 188688 edges, 813 markings/sec, 150 secs
lola: sara is running 155 secs || 136385 markings, 194704 edges, 863 markings/sec, 155 secs
lola: sara is running 160 secs || 140693 markings, 201035 edges, 862 markings/sec, 160 secs
lola: sara is running 165 secs || 144838 markings, 207384 edges, 829 markings/sec, 165 secs
lola: sara is running 170 secs || 149198 markings, 213398 edges, 872 markings/sec, 170 secs
lola: sara is running 175 secs || 153768 markings, 219466 edges, 914 markings/sec, 175 secs
lola: sara is running 180 secs || 158244 markings, 225653 edges, 895 markings/sec, 180 secs
lola: sara is running 185 secs || 162696 markings, 231960 edges, 890 markings/sec, 185 secs
lola: sara is running 190 secs || 167074 markings, 238075 edges, 876 markings/sec, 190 secs
lola: sara is running 195 secs || 171560 markings, 244725 edges, 897 markings/sec, 195 secs
lola: sara is running 200 secs || 175976 markings, 251055 edges, 883 markings/sec, 200 secs
lola: sara is running 205 secs || 180373 markings, 257446 edges, 879 markings/sec, 205 secs
lola: sara is running 210 secs || 185040 markings, 263803 edges, 933 markings/sec, 210 secs
lola: sara is running 215 secs || 189711 markings, 270183 edges, 934 markings/sec, 215 secs
lola: sara is running 220 secs || 194378 markings, 276628 edges, 933 markings/sec, 220 secs
lola: sara is running 225 secs || 198950 markings, 282992 edges, 914 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_5498) OR FIREABLE(tr_T135_2194) OR (FIREABLE(tr_T135_7933) AND FIREABLE(tr_T135_8583)))))
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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T135_3412)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_8394) OR FIREABLE(tr_T135_7609) OR (NOT FIREABLE(tr_T135_9616) AND FIREABLE(tr_T135_6864)))))
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 34 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T83_1) AND ((FIREABLE(tr_T135_9209) AND FIREABLE(tr_T135_1762)) OR FIREABLE(tr_T135_7623)) AND (FIREABLE(tr_T135_3484) OR FIREABLE(tr_T135_1361) OR (NOT FIREABLE(tr_T135_9074) AND FIREABLE(tr_T135_2822))))))
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 80 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 4620 markings, 5890 edges, 924 markings/sec, 0 secs
lola: sara is running 5 secs || 9141 markings, 11692 edges, 904 markings/sec, 5 secs
lola: sara is running 10 secs || 13524 markings, 17464 edges, 877 markings/sec, 10 secs
lola: sara is running 15 secs || 17878 markings, 23323 edges, 871 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 22569 markings, 29758 edges, 938 markings/sec, 20 secs
lola: sara is running 25 secs || 27491 markings, 36413 edges, 984 markings/sec, 25 secs
lola: sara is running 30 secs || 32149 markings, 42281 edges, 932 markings/sec, 30 secs
lola: sara is running 35 secs || 36911 markings, 48346 edges, 952 markings/sec, 35 secs
lola: sara is running 40 secs || 41785 markings, 54578 edges, 975 markings/sec, 40 secs
lola: sara is running 45 secs || 46849 markings, 61420 edges, 1013 markings/sec, 45 secs
lola: sara is running 50 secs || 51683 markings, 67655 edges, 967 markings/sec, 50 secs
lola: sara is running 55 secs || 56495 markings, 74075 edges, 962 markings/sec, 55 secs
lola: sara is running 60 secs || 61410 markings, 80622 edges, 983 markings/sec, 60 secs
lola: sara is running 65 secs || 66218 markings, 86983 edges, 962 markings/sec, 65 secs
lola: sara is running 70 secs || 70797 markings, 93238 edges, 916 markings/sec, 70 secs
lola: sara is running 75 secs || 75576 markings, 99475 edges, 956 markings/sec, 75 secs
lola: sara is running 80 secs || 80461 markings, 105929 edges, 977 markings/sec, 80 secs
lola: sara is running 85 secs || 85105 markings, 112057 edges, 929 markings/sec, 85 secs
lola: sara is running 90 secs || 90003 markings, 118878 edges, 980 markings/sec, 90 secs
lola: sara is running 95 secs || 94822 markings, 125479 edges, 964 markings/sec, 95 secs
lola: sara is running 100 secs || 99687 markings, 132251 edges, 973 markings/sec, 100 secs
lola: sara is running 105 secs || 104458 markings, 138595 edges, 954 markings/sec, 105 secs
lola: sara is running 110 secs || 109160 markings, 144823 edges, 940 markings/sec, 110 secs
lola: sara is running 115 secs || 113992 markings, 151466 edges, 966 markings/sec, 115 secs
lola: sara is running 120 secs || 118769 markings, 157932 edges, 955 markings/sec, 120 secs
lola: sara is running 125 secs || 123389 markings, 163801 edges, 924 markings/sec, 125 secs
lola: sara is running 130 secs || 127961 markings, 169657 edges, 914 markings/sec, 130 secs
lola: sara is running 135 secs || 132268 markings, 175452 edges, 861 markings/sec, 135 secs
lola: sara is running 140 secs || 136779 markings, 181286 edges, 902 markings/sec, 140 secs
lola: sara is running 145 secs || 141343 markings, 187275 edges, 913 markings/sec, 145 secs
lola: sara is running 150 secs || 146037 markings, 193584 edges, 939 markings/sec, 150 secs
lola: sara is running 155 secs || 150686 markings, 199962 edges, 930 markings/sec, 155 secs
lola: sara is running 160 secs || 155615 markings, 206601 edges, 986 markings/sec, 160 secs
lola: sara is running 165 secs || 160492 markings, 213033 edges, 975 markings/sec, 165 secs
lola: sara is running 170 secs || 165424 markings, 219713 edges, 986 markings/sec, 170 secs
lola: sara is running 175 secs || 170161 markings, 225873 edges, 947 markings/sec, 175 secs
lola: sara is running 180 secs || 174793 markings, 231994 edges, 926 markings/sec, 180 secs
lola: sara is running 185 secs || 179299 markings, 238065 edges, 901 markings/sec, 185 secs
lola: sara is running 190 secs || 183982 markings, 244523 edges, 937 markings/sec, 190 secs
lola: sara is running 195 secs || 188877 markings, 251352 edges, 979 markings/sec, 195 secs
lola: sara is running 200 secs || 193582 markings, 257878 edges, 941 markings/sec, 200 secs
lola: sara is running 205 secs || 198520 markings, 264682 edges, 988 markings/sec, 205 secs
lola: sara is running 210 secs || 203512 markings, 271399 edges, 998 markings/sec, 210 secs
lola: sara is running 215 secs || 208288 markings, 277733 edges, 955 markings/sec, 215 secs
lola: sara is running 220 secs || 213074 markings, 284080 edges, 957 markings/sec, 220 secs
lola: sara is running 225 secs || 217786 markings, 290642 edges, 942 markings/sec, 225 secs
lola: sara is running 230 secs || 222210 markings, 296442 edges, 885 markings/sec, 230 secs
lola: sara is running 235 secs || 227097 markings, 303294 edges, 977 markings/sec, 235 secs
lola: sara is running 240 secs || 231896 markings, 309881 edges, 960 markings/sec, 240 secs
lola: sara is running 245 secs || 236727 markings, 316407 edges, 966 markings/sec, 245 secs
lola: sara is running 250 secs || 241390 markings, 322910 edges, 933 markings/sec, 250 secs
lola: sara is running 255 secs || 246047 markings, 329463 edges, 931 markings/sec, 255 secs
lola: sara is running 260 secs || 250604 markings, 335947 edges, 911 markings/sec, 260 secs
lola: sara is running 265 secs || 255160 markings, 342039 edges, 911 markings/sec, 265 secs
lola: sara is running 270 secs || 259826 markings, 348466 edges, 933 markings/sec, 270 secs
lola: sara is running 275 secs || 264606 markings, 355250 edges, 956 markings/sec, 275 secs
lola: sara is running 280 secs || 269320 markings, 361683 edges, 943 markings/sec, 280 secs
lola: sara is running 285 secs || 273888 markings, 367957 edges, 914 markings/sec, 285 secs
lola: sara is running 290 secs || 278631 markings, 374627 edges, 949 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_4509)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_2873) OR (FIREABLE(tr_T135_9991) AND FIREABLE(tr_T135_5541) AND (NOT FIREABLE(tr_T135_7350) OR NOT FIREABLE(tr_T135_338))))))
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 31 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_1066) OR (FIREABLE(tr_T125_117) AND (NOT FIREABLE(tr_T135_4809) OR (FIREABLE(tr_T135_2041) AND FIREABLE(tr_T135_9493)))))))
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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_8947)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T305_1) AND NOT FIREABLE(tr_T135_8627) AND NOT FIREABLE(tr_T51_99) AND NOT FIREABLE(tr_T135_7748))))
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 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_3610) OR FIREABLE(tr_T135_3046) OR FIREABLE(tr_T135_8718))))
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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 750 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_2926)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1000 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_5642)))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tr_T135_1022) AND FIREABLE(tr_T135_8705)) OR NOT FIREABLE(tr_T135_9416))))
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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2999 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_778) OR FIREABLE(tr_T135_1178) OR FIREABLE(tr_T135_952) OR FIREABLE(tr_T135_7007) OR ((FIREABLE(tr_T135_2540) OR FIREABLE(tr_T135_6296)) AND FIREABLE(tr_T135_3949)) OR FIREABLE(tr_T135_9122))))
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 27 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes no no unknown yes yes yes yes no no yes yes no yes
FORMULA Railroad-PT-100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494802141314

--------------------
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="Railroad-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
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/Railroad-PT-100.tgz
mv 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 Railroad-PT-100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r068-csrt-149440963100072"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;