fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r139-qhx2-152673581300203
Last Updated
June 26, 2018

About the Execution of Irma.struct for Railroad-PT-100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1105.900 457839.00 849024.00 1532.80 TT?FTTTTTTTTTTTT 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 5.3M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.2K 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 5.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
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 r139-qhx2-152673581300203
=====================================================================

--------------------
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-00
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-01
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-02
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-03
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-04
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-05
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-06
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-07
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-08
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-09
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

=== Now, execution of the tool begins

BK_START 1527795137164


BK_STOP 1527795595003

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Railroad-PT-100 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': 541463, 'Memory': 463.14, 'Tool': 'lola'}, {'Time': 541639, 'Memory': 456.61, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityFireability lola Railroad-PT-100...

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


checking for too many tokens
===========================================================================================
Railroad-PT-100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Railroad-PT-100 @ 3537 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3537 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: A (G ((NOT FIREABLE(tr_T135_1467) OR ((NOT FIREABLE(tr_T135_4048) OR NOT FIREABLE(tr_T135_9743)) AND (NOT FIREABLE(tr_T135_8788) OR NOT FIREABLE(tr_T135_7663)))))) : E (F ((NOT FIREABLE(tr_T135_7978) AND NOT FIREABLE(tr_T135_6316) AND NOT FIREABLE(tr_T135_3123) AND FIREABLE(tr_T135_8890)))) : E (F (((NOT FIREABLE(tr_T135_1360) AND NOT FIREABLE(tr_T135_4566) AND ((FIREABLE(tr_T135_8924) AND FIREABLE(tr_T135_8728)) OR (FIREABLE(tr_T135_1432) AND FIREABLE(tr_T135_8250)))) OR (FIREABLE(tr_T135_2640) AND (FIREABLE(tr_T135_9412) OR FIREABLE(tr_T135_3306)))))) : A (G (NOT FIREABLE(tr_T135_8775))) : E (F (((FIREABLE(tr_T135_5579) OR FIREABLE(tr_T135_8605) OR FIREABLE(tr_T135_3728)) AND (FIREABLE(tr_T135_690) OR FIREABLE(tr_T136_1)) AND (FIREABLE(tr_T135_6287) OR FIREABLE(tr_T135_8889) OR NOT FIREABLE(tr_T135_1478) OR FIREABLE(tr_T135_4659))))) : A (G ((NOT FIREABLE(tr_T135_9484) OR (NOT FIREABLE(tr_T135_1592) AND NOT FIREABLE(tr_T135_6295) AND (NOT FIREABLE(tr_T135_597) OR NOT FIREABLE(tr_T135_2096)))))) : E (F (FIREABLE(tr_T135_2510))) : E (F (FIREABLE(tr_T135_9722))) : E (F (FIREABLE(tr_T135_6737))) : A (G ((NOT FIREABLE(tr_T135_10167) OR NOT FIREABLE(tr_T135_9520) OR NOT FIREABLE(tr_T135_4287) OR (NOT FIREABLE(tr_T135_1856) AND NOT FIREABLE(tr_T67_1) AND FIREABLE(tr_T135_8044))))) : E (F (((NOT FIREABLE(tr_T135_2376) OR NOT FIREABLE(tr_T135_577)) AND (NOT FIREABLE(tr_T135_3383) OR NOT FIREABLE(tr_T135_505)) AND FIREABLE(tr_T135_1816)))) : E (F ((NOT FIREABLE(tr_T135_4430) AND NOT FIREABLE(tr_T135_6803) AND NOT FIREABLE(tr_T135_6517) AND FIREABLE(tr_T135_3365)))) : E (F (((((FIREABLE(tr_T203_1) AND FIREABLE(tr_T135_9667)) OR FIREABLE(tr_T135_2198)) AND NOT FIREABLE(tr_T135_9380)) OR FIREABLE(tr_T135_7394)))) : E (F ((FIREABLE(tr_T135_2131) OR FIREABLE(tr_T135_1985) OR ((NOT FIREABLE(tr_T135_1785) OR NOT FIREABLE(tr_T135_9881)) AND FIREABLE(tr_T135_8448))))) : E (F (FIREABLE(tr_T135_3746))) : E (F (((NOT FIREABLE(tr_T135_7529) AND NOT FIREABLE(tr_T135_2780) AND ((FIREABLE(tr_T135_890) AND FIREABLE(tr_T125_127)) OR FIREABLE(tr_T135_9883))) OR (NOT FIREABLE(tr_T135_8400) AND NOT FIREABLE(tr_T135_9828) AND FIREABLE(tr_T135_547)))))
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 ((NOT FIREABLE(tr_T135_1467) OR ((NOT FIREABLE(tr_T135_4048) OR NOT FIREABLE(tr_T135_9743)) AND (NOT FIREABLE(tr_T135_8788) OR NOT FIREABLE(tr_T135_7663))))))
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 18 literals and 2 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 || 1766 markings, 2357 edges, 353 markings/sec, 0 secs
lola: sara is running 5 secs || 4634 markings, 6619 edges, 574 markings/sec, 5 secs
lola: sara is running 10 secs || 7194 markings, 10252 edges, 512 markings/sec, 10 secs
lola: sara is running 15 secs || 8833 markings, 12755 edges, 328 markings/sec, 15 secs
lola: sara is running 20 secs || 12119 markings, 17675 edges, 657 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 15894 markings, 23388 edges, 755 markings/sec, 25 secs
lola: sara is running 30 secs || 19462 markings, 29040 edges, 714 markings/sec, 30 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T135_7978) AND NOT FIREABLE(tr_T135_6316) AND NOT FIREABLE(tr_T135_3123) AND FIREABLE(tr_T135_8890))))
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 48 literals and 8 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: 182 markings, 181 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T135_1360) AND NOT FIREABLE(tr_T135_4566) AND ((FIREABLE(tr_T135_8924) AND FIREABLE(tr_T135_8728)) OR (FIREABLE(tr_T135_1432) AND FIREABLE(tr_T135_8250)))) OR (FIREABLE(tr_T135_2640) AND (FIREABLE(tr_T135_9412) OR FIREABLE(tr_T135_3306))))))
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 76 literals and 10 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: sara is running 0 secs || 1812 markings, 2611 edges, 362 markings/sec, 0 secs
lola: sara is running 5 secs || 4249 markings, 6260 edges, 487 markings/sec, 5 secs
lola: sara is running 10 secs || 6335 markings, 9477 edges, 417 markings/sec, 10 secs
lola: sara is running 15 secs || 7666 markings, 11566 edges, 266 markings/sec, 15 secs
lola: sara is running 20 secs || 9850 markings, 14888 edges, 437 markings/sec, 20 secs
lola: sara is running 25 secs || 13041 markings, 20132 edges, 638 markings/sec, 25 secs
lola: sara is running 30 secs || 16151 markings, 25281 edges, 622 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 18873 markings, 29678 edges, 544 markings/sec, 35 secs
lola: sara is running 40 secs || 21524 markings, 33704 edges, 530 markings/sec, 40 secs
lola: sara is running 45 secs || 24217 markings, 38095 edges, 539 markings/sec, 45 secs
lola: sara is running 50 secs || 27165 markings, 42832 edges, 590 markings/sec, 50 secs
lola: sara is running 55 secs || 30415 markings, 48306 edges, 650 markings/sec, 55 secs
lola: sara is running 60 secs || 33641 markings, 53540 edges, 645 markings/sec, 60 secs
lola: sara is running 65 secs || 36944 markings, 58670 edges, 661 markings/sec, 65 secs
lola: sara is running 70 secs || 40062 markings, 63565 edges, 624 markings/sec, 70 secs
lola: sara is running 75 secs || 43257 markings, 68951 edges, 639 markings/sec, 75 secs
lola: sara is running 80 secs || 46386 markings, 74329 edges, 626 markings/sec, 80 secs
lola: sara is running 85 secs || 49121 markings, 78738 edges, 547 markings/sec, 85 secs
lola: sara is running 90 secs || 51875 markings, 83173 edges, 551 markings/sec, 90 secs
lola: sara is running 95 secs || 54744 markings, 87839 edges, 574 markings/sec, 95 secs
lola: sara is running 100 secs || 57538 markings, 92123 edges, 559 markings/sec, 100 secs
lola: sara is running 105 secs || 60680 markings, 97377 edges, 628 markings/sec, 105 secs
lola: sara is running 110 secs || 63858 markings, 102421 edges, 636 markings/sec, 110 secs
lola: sara is running 115 secs || 66939 markings, 107430 edges, 616 markings/sec, 115 secs
lola: sara is running 120 secs || 70118 markings, 112964 edges, 636 markings/sec, 120 secs
lola: sara is running 125 secs || 72774 markings, 117780 edges, 531 markings/sec, 125 secs
lola: sara is running 130 secs || 75357 markings, 122225 edges, 517 markings/sec, 130 secs
lola: sara is running 135 secs || 78356 markings, 127461 edges, 600 markings/sec, 135 secs
lola: sara is running 140 secs || 81557 markings, 132406 edges, 640 markings/sec, 140 secs
lola: sara is running 145 secs || 84790 markings, 137918 edges, 647 markings/sec, 145 secs
lola: sara is running 150 secs || 88058 markings, 143543 edges, 654 markings/sec, 150 secs
lola: sara is running 155 secs || 91277 markings, 148541 edges, 644 markings/sec, 155 secs
lola: sara is running 160 secs || 94530 markings, 153905 edges, 651 markings/sec, 160 secs
lola: sara is running 165 secs || 97767 markings, 159393 edges, 647 markings/sec, 165 secs
lola: sara is running 170 secs || 101002 markings, 164664 edges, 647 markings/sec, 170 secs
lola: sara is running 175 secs || 104221 markings, 169589 edges, 644 markings/sec, 175 secs
lola: sara is running 180 secs || 107406 markings, 175017 edges, 637 markings/sec, 180 secs
lola: sara is running 185 secs || 110523 markings, 180351 edges, 623 markings/sec, 185 secs
lola: sara is running 190 secs || 113631 markings, 185605 edges, 622 markings/sec, 190 secs
lola: sara is running 195 secs || 116856 markings, 190895 edges, 645 markings/sec, 195 secs
lola: sara is running 200 secs || 120113 markings, 196152 edges, 651 markings/sec, 200 secs
lola: sara is running 205 secs || 123235 markings, 201100 edges, 624 markings/sec, 205 secs
lola: sara is running 210 secs || 126443 markings, 206211 edges, 642 markings/sec, 210 secs
lola: sara is running 215 secs || 129659 markings, 211457 edges, 643 markings/sec, 215 secs
lola: sara is running 220 secs || 132820 markings, 216440 edges, 632 markings/sec, 220 secs
lola: sara is running 225 secs || 136024 markings, 221930 edges, 641 markings/sec, 225 secs
lola: sara is running 230 secs || 139260 markings, 227751 edges, 647 markings/sec, 230 secs
lola: sara is running 235 secs || 142494 markings, 233463 edges, 647 markings/sec, 235 secs
lola: sara is running 240 secs || 145733 markings, 238928 edges, 648 markings/sec, 240 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 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T135_8775)))
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: 178 markings, 177 edges
lola: ========================================
lola: subprocess 4 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T135_5579) OR FIREABLE(tr_T135_8605) OR FIREABLE(tr_T135_3728)) AND (FIREABLE(tr_T135_690) OR FIREABLE(tr_T136_1)) AND (FIREABLE(tr_T135_6287) OR FIREABLE(tr_T135_8889) OR NOT FIREABLE(tr_T135_1478) OR FIREABLE(tr_T135_4659)))))
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 231 literals and 30 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 367 markings, 366 edges
lola: ========================================
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_9484) OR (NOT FIREABLE(tr_T135_1592) AND NOT FIREABLE(tr_T135_6295) AND (NOT FIREABLE(tr_T135_597) OR NOT FIREABLE(tr_T135_2096))))))
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 21 literals and 3 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 || 2025 markings, 2418 edges, 405 markings/sec, 0 secs
lola: sara is running 5 secs || 5039 markings, 6105 edges, 603 markings/sec, 5 secs
lola: sara is running 10 secs || 8441 markings, 10317 edges, 680 markings/sec, 10 secs
lola: sara is running 15 secs || 10864 markings, 13312 edges, 485 markings/sec, 15 secs
lola: sara is running 20 secs || 13596 markings, 16722 edges, 546 markings/sec, 20 secs
lola: sara is running 25 secs || 17786 markings, 21732 edges, 838 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 21794 markings, 26537 edges, 802 markings/sec, 30 secs
lola: sara is running 35 secs || 25317 markings, 30791 edges, 705 markings/sec, 35 secs

lola: sara is running 40 secs || 29082 markings, 35365 edges, 753 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 6 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_2510)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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: 54 markings, 53 edges
lola: ========================================
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_9722)))
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-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: 198 markings, 197 edges
lola: ========================================
lola: subprocess 8 will run for 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_6737)))
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-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: 138 markings, 137 edges
lola: ========================================
lola: subprocess 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_10167) OR NOT FIREABLE(tr_T135_9520) OR NOT FIREABLE(tr_T135_4287) OR (NOT FIREABLE(tr_T135_1856) AND NOT FIREABLE(tr_T67_1) AND FIREABLE(tr_T135_8044)))))
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 44 literals and 4 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: sara is running 0 secs || 1877 markings, 2089 edges, 375 markings/sec, 0 secs
lola: sara is running 5 secs || 5162 markings, 5800 edges, 657 markings/sec, 5 secs
lola: sara is running 10 secs || 7690 markings, 8665 edges, 506 markings/sec, 10 secs
lola: sara is running 15 secs || 10044 markings, 11345 edges, 471 markings/sec, 15 secs
lola: sara is running 20 secs || 13943 markings, 15954 edges, 780 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 17996 markings, 21246 edges, 811 markings/sec, 25 secs
lola: sara is running 30 secs || 21965 markings, 26394 edges, 794 markings/sec, 30 secs
lola: sara is running 35 secs || 25852 markings, 31535 edges, 777 markings/sec, 35 secs

lola: sara is running 40 secs || 29786 markings, 36810 edges, 787 markings/sec, 40 secs
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 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T135_2376) OR NOT FIREABLE(tr_T135_577)) AND (NOT FIREABLE(tr_T135_3383) OR NOT FIREABLE(tr_T135_505)) AND FIREABLE(tr_T135_1816))))
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 16 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T135_4430) AND NOT FIREABLE(tr_T135_6803) AND NOT FIREABLE(tr_T135_6517) AND FIREABLE(tr_T135_3365))))
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 48 literals and 8 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 72 markings, 71 edges
lola: ========================================
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(tr_T203_1) AND FIREABLE(tr_T135_9667)) OR FIREABLE(tr_T135_2198)) AND NOT FIREABLE(tr_T135_9380)) OR FIREABLE(tr_T135_7394))))
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 23 literals and 5 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: 196 markings, 195 edges
lola: ========================================
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_2131) OR FIREABLE(tr_T135_1985) OR ((NOT FIREABLE(tr_T135_1785) OR NOT FIREABLE(tr_T135_9881)) AND FIREABLE(tr_T135_8448)))))
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 22 literals and 6 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: 48 markings, 47 edges
lola: ========================================
lola: subprocess 14 will run for 1567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_3746)))
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
----- Kill lola and sara stderr -----
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 15 will run for 3133 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T135_7529) AND NOT FIREABLE(tr_T135_2780) AND ((FIREABLE(tr_T135_890) AND FIREABLE(tr_T125_127)) OR FIREABLE(tr_T135_9883))) OR (NOT FIREABLE(tr_T135_8400) AND NOT FIREABLE(tr_T135_9828) AND FIREABLE(tr_T135_547)))))
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 72 literals and 12 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: 207 markings, 206 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown no yes yes yes yes yes yes yes yes yes yes yes 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-2 CANNOT_COMPUTE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-5 TRUE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-11 TRUE 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 TRUE 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 stderr -----
----- Finished stdout -----

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="irma4mcc-structural"
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
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-structural"
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 r139-qhx2-152673581300203"
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 ;