About the Execution of Irma.full for Railroad-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1875.200 | 603746.00 | 1177129.00 | 2038.10 | FFT??FFFFTTFFFTT | 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)
............................................................................
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 249K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Railroad-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580700189
=====================================================================
--------------------
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-ReachabilityFireability-00
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-01
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-02
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-03
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-04
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-05
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-06
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-07
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-08
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-09
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-10
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-11
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-12
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-13
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-14
FORMULA_NAME Railroad-PT-020-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527150264551
BK_STOP 1527150868297
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Railroad-PT-020 as instance name.
Using Railroad as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1180149, 'Memory': 10117.05, 'Tool': 'lola'}, {'Time': 1180185, 'Memory': 10111.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Railroad-PT-020...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Railroad-PT-020: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
Railroad-PT-020: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ Railroad-PT-020 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 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-ReachabilityFireability.task
lola: A (G (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51)))))) : E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155))))) : E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79))))) : A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438)))) : E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290)))))) : A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370)))) : E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190)))) : A (G (NOT FIREABLE(tr_T47_188))) : A (G (NOT FIREABLE(tr_T47_427))) : A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305))))) : E (F (FIREABLE(tr_T47_62))) : A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1)))) : E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239)))) : E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350)))) : E (F (FIREABLE(tr_T47_79))) : E (F (FIREABLE(tr_T47_193)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51))))))
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 80 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155)))))
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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79)))))
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 20 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-2.sara.
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-020-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 113903 markings, 172408 edges, 22781 markings/sec, 0 secs
lola: sara is running 5 secs || 242329 markings, 374716 edges, 25685 markings/sec, 5 secs
lola: sara is running 10 secs || 373278 markings, 582976 edges, 26190 markings/sec, 10 secs
lola: sara is running 15 secs || 501816 markings, 788543 edges, 25708 markings/sec, 15 secs
lola: sara is running 20 secs || 628520 markings, 990986 edges, 25341 markings/sec, 20 secs
lola: sara is running 25 secs || 754605 markings, 1193213 edges, 25217 markings/sec, 25 secs
lola: sara is running 30 secs || 882551 markings, 1399277 edges, 25589 markings/sec, 30 secs
lola: sara is running 35 secs || 1010303 markings, 1607752 edges, 25550 markings/sec, 35 secs
lola: sara is running 40 secs || 1137603 markings, 1815832 edges, 25460 markings/sec, 40 secs
lola: sara is running 45 secs || 1263335 markings, 2023865 edges, 25146 markings/sec, 45 secs
lola: sara is running 50 secs || 1390101 markings, 2233075 edges, 25353 markings/sec, 50 secs
lola: sara is running 55 secs || 1517351 markings, 2442468 edges, 25450 markings/sec, 55 secs
lola: sara is running 60 secs || 1645261 markings, 2654336 edges, 25582 markings/sec, 60 secs
lola: sara is running 65 secs || 1772103 markings, 2863189 edges, 25368 markings/sec, 65 secs
lola: sara is running 70 secs || 1897871 markings, 3074227 edges, 25154 markings/sec, 70 secs
lola: sara is running 75 secs || 2024431 markings, 3284571 edges, 25312 markings/sec, 75 secs
lola: sara is running 80 secs || 2150585 markings, 3496250 edges, 25231 markings/sec, 80 secs
lola: sara is running 85 secs || 2277120 markings, 3707325 edges, 25307 markings/sec, 85 secs
lola: sara is running 90 secs || 2406291 markings, 3924580 edges, 25834 markings/sec, 90 secs
lola: sara is running 95 secs || 2531609 markings, 4137614 edges, 25064 markings/sec, 95 secs
lola: sara is running 100 secs || 2665893 markings, 4356778 edges, 26857 markings/sec, 100 secs
lola: sara is running 105 secs || 2805466 markings, 4596602 edges, 27915 markings/sec, 105 secs
lola: sara is running 110 secs || 2941174 markings, 4838638 edges, 27142 markings/sec, 110 secs
lola: sara is running 115 secs || 3076836 markings, 5078332 edges, 27132 markings/sec, 115 secs
lola: sara is running 120 secs || 3213555 markings, 5310323 edges, 27344 markings/sec, 120 secs
lola: sara is running 125 secs || 3348922 markings, 5560699 edges, 27073 markings/sec, 125 secs
lola: sara is running 130 secs || 3484026 markings, 5805345 edges, 27021 markings/sec, 130 secs
lola: sara is running 135 secs || 3619168 markings, 6060154 edges, 27028 markings/sec, 135 secs
lola: sara is running 140 secs || 3753356 markings, 6299903 edges, 26838 markings/sec, 140 secs
lola: sara is running 145 secs || 3881125 markings, 6524225 edges, 25554 markings/sec, 145 secs
lola: sara is running 150 secs || 4006709 markings, 6736347 edges, 25117 markings/sec, 150 secs
lola: sara is running 155 secs || 4134269 markings, 6958871 edges, 25512 markings/sec, 155 secs
lola: sara is running 160 secs || 4268252 markings, 7204099 edges, 26797 markings/sec, 160 secs
lola: sara is running 165 secs || 4399787 markings, 7436390 edges, 26307 markings/sec, 165 secs
lola: sara is running 170 secs || 4523342 markings, 7646099 edges, 24711 markings/sec, 170 secs
lola: sara is running 175 secs || 4648282 markings, 7861173 edges, 24988 markings/sec, 175 secs
lola: sara is running 180 secs || 4772625 markings, 8072900 edges, 24869 markings/sec, 180 secs
lola: sara is running 185 secs || 4901190 markings, 8295217 edges, 25713 markings/sec, 185 secs
lola: sara is running 190 secs || 5025777 markings, 8510875 edges, 24917 markings/sec, 190 secs
lola: sara is running 195 secs || 5156158 markings, 8745421 edges, 26076 markings/sec, 195 secs
lola: sara is running 200 secs || 5289137 markings, 8996477 edges, 26596 markings/sec, 200 secs
lola: sara is running 205 secs || 5419279 markings, 9235218 edges, 26028 markings/sec, 205 secs
lola: sara is running 210 secs || 5554975 markings, 9492544 edges, 27139 markings/sec, 210 secs
lola: sara is running 215 secs || 5681716 markings, 9709486 edges, 25348 markings/sec, 215 secs
lola: sara is running 220 secs || 5808831 markings, 9927663 edges, 25423 markings/sec, 220 secs
lola: sara is running 225 secs || 5935694 markings, 10146614 edges, 25373 markings/sec, 225 secs
lola: sara is running 230 secs || 6066373 markings, 10378092 edges, 26136 markings/sec, 230 secs
lola: sara is running 235 secs || 6199148 markings, 10622017 edges, 26555 markings/sec, 235 secs
lola: sara is running 240 secs || 6332389 markings, 10869542 edges, 26648 markings/sec, 240 secs
lola: sara is running 245 secs || 6468172 markings, 11131595 edges, 27157 markings/sec, 245 secs
lola: sara is running 250 secs || 6600566 markings, 11381576 edges, 26479 markings/sec, 250 secs
lola: sara is running 255 secs || 6732928 markings, 11631135 edges, 26472 markings/sec, 255 secs
lola: sara is running 260 secs || 6865749 markings, 11876683 edges, 26564 markings/sec, 260 secs
lola: sara is running 265 secs || 6998158 markings, 12130780 edges, 26482 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 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290))))))
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 27 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 121780 markings, 311192 edges, 24356 markings/sec, 0 secs
lola: sara is running 5 secs || 248226 markings, 670832 edges, 25289 markings/sec, 5 secs
lola: sara is running 10 secs || 370741 markings, 1027539 edges, 24503 markings/sec, 10 secs
lola: sara is running 15 secs || 493061 markings, 1389332 edges, 24464 markings/sec, 15 secs
lola: sara is running 20 secs || 613568 markings, 1753225 edges, 24101 markings/sec, 20 secs
lola: sara is running 25 secs || 733359 markings, 2116137 edges, 23958 markings/sec, 25 secs
lola: sara is running 30 secs || 852577 markings, 2479062 edges, 23844 markings/sec, 30 secs
lola: sara is running 35 secs || 970796 markings, 2840461 edges, 23644 markings/sec, 35 secs
lola: sara is running 40 secs || 1087339 markings, 3201672 edges, 23309 markings/sec, 40 secs
lola: sara is running 45 secs || 1203835 markings, 3558149 edges, 23299 markings/sec, 45 secs
lola: sara is running 50 secs || 1319034 markings, 3919945 edges, 23040 markings/sec, 50 secs
lola: sara is running 55 secs || 1433385 markings, 4283671 edges, 22870 markings/sec, 55 secs
lola: sara is running 60 secs || 1549073 markings, 4648019 edges, 23138 markings/sec, 60 secs
lola: sara is running 65 secs || 1665263 markings, 5010143 edges, 23238 markings/sec, 65 secs
lola: sara is running 70 secs || 1781702 markings, 5377714 edges, 23288 markings/sec, 70 secs
lola: sara is running 75 secs || 1896791 markings, 5743372 edges, 23018 markings/sec, 75 secs
lola: sara is running 80 secs || 2011098 markings, 6110363 edges, 22861 markings/sec, 80 secs
lola: sara is running 85 secs || 2124782 markings, 6477214 edges, 22737 markings/sec, 85 secs
lola: sara is running 90 secs || 2238856 markings, 6845809 edges, 22815 markings/sec, 90 secs
lola: sara is running 95 secs || 2353068 markings, 7213186 edges, 22842 markings/sec, 95 secs
lola: sara is running 100 secs || 2466790 markings, 7582066 edges, 22744 markings/sec, 100 secs
lola: sara is running 105 secs || 2579803 markings, 7949242 edges, 22603 markings/sec, 105 secs
lola: sara is running 110 secs || 2690615 markings, 8310915 edges, 22162 markings/sec, 110 secs
lola: sara is running 115 secs || 2799960 markings, 8667933 edges, 21869 markings/sec, 115 secs
lola: sara is running 120 secs || 2908894 markings, 9025647 edges, 21787 markings/sec, 120 secs
lola: sara is running 125 secs || 3018089 markings, 9384324 edges, 21839 markings/sec, 125 secs
lola: sara is running 130 secs || 3127176 markings, 9742863 edges, 21817 markings/sec, 130 secs
lola: sara is running 135 secs || 3235366 markings, 10098072 edges, 21638 markings/sec, 135 secs
lola: sara is running 140 secs || 3344965 markings, 10458379 edges, 21920 markings/sec, 140 secs
lola: sara is running 145 secs || 3456689 markings, 10826672 edges, 22345 markings/sec, 145 secs
lola: sara is running 150 secs || 3572061 markings, 11197080 edges, 23074 markings/sec, 150 secs
lola: sara is running 155 secs || 3692112 markings, 11564934 edges, 24010 markings/sec, 155 secs
lola: sara is running 160 secs || 3809815 markings, 11947548 edges, 23541 markings/sec, 160 secs
lola: sara is running 165 secs || 3918554 markings, 12307079 edges, 21748 markings/sec, 165 secs
lola: sara is running 170 secs || 4034016 markings, 12689734 edges, 23092 markings/sec, 170 secs
lola: sara is running 175 secs || 4149814 markings, 13070560 edges, 23160 markings/sec, 175 secs
lola: sara is running 180 secs || 4264140 markings, 13451694 edges, 22865 markings/sec, 180 secs
lola: sara is running 185 secs || 4377042 markings, 13826102 edges, 22580 markings/sec, 185 secs
lola: sara is running 190 secs || 4483871 markings, 14181940 edges, 21366 markings/sec, 190 secs
lola: sara is running 195 secs || 4587563 markings, 14528379 edges, 20738 markings/sec, 195 secs
lola: sara is running 200 secs || 4692442 markings, 14874369 edges, 20976 markings/sec, 200 secs
lola: sara is running 205 secs || 4803163 markings, 15244486 edges, 22144 markings/sec, 205 secs
lola: sara is running 210 secs || 4915609 markings, 15624311 edges, 22489 markings/sec, 210 secs
lola: sara is running 215 secs || 5028284 markings, 15998932 edges, 22535 markings/sec, 215 secs
lola: sara is running 220 secs || 5139242 markings, 16370758 edges, 22192 markings/sec, 220 secs
lola: sara is running 225 secs || 5252502 markings, 16747762 edges, 22652 markings/sec, 225 secs
lola: sara is running 230 secs || 5365358 markings, 17127965 edges, 22571 markings/sec, 230 secs
lola: sara is running 235 secs || 5477062 markings, 17501011 edges, 22341 markings/sec, 235 secs
lola: sara is running 240 secs || 5584207 markings, 17857967 edges, 21429 markings/sec, 240 secs
lola: sara is running 245 secs || 5690516 markings, 18212580 edges, 21262 markings/sec, 245 secs
lola: sara is running 250 secs || 5796800 markings, 18568578 edges, 21257 markings/sec, 250 secs
lola: sara is running 255 secs || 5904790 markings, 18926219 edges, 21598 markings/sec, 255 secs
lola: sara is running 260 secs || 6011357 markings, 19282888 edges, 21313 markings/sec, 260 secs
lola: sara is running 265 secs || 6119510 markings, 19643281 edges, 21631 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370))))
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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190))))
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 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-6.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 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_188)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-7.sara.
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_427)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305)))))
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 50 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_62)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: 10 markings, 9 edges
state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-10.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-11.sara
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 747 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239))))
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 160 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 996 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350))))
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 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_79)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-14.sara
lola: ========================================
lola: subprocess 15 will run for 2986 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_193)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 348 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes unknown unknown no no no no yes yes no no no yes yes
FORMULA Railroad-PT-020-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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-020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-full"
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-020.tgz
mv Railroad-PT-020 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is Railroad-PT-020, 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 r138-qhx2-152673580700189"
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 '
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 ;