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 |
| 731.070 | 513873.00 | 965018.00 | 2670.80 | TFTFTTFTTFFFTFTF | 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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581300201
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-01
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-02
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-03
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-04
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-05
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-06
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-07
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-08
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-09
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-10
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-11
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-12
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-13
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-14
FORMULA_NAME Railroad-PT-100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527795051053
BK_STOP 1527795564926
--------------------
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 bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 241642, 'Memory': 316.77, 'Tool': 'lola'}, {'Time': 243125, 'Memory': 250.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola Railroad-PT-100...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ Railroad-PT-100 @ 3537 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-ReachabilityCardinality.task
lola: A (G (((pl_P29_42 + 1 <= pl_P459_1) OR ((2 <= pl_P435_32) AND (pl_P387_1 <= pl_P218_57)) OR ((pl_P25_1 <= pl_P218_15) AND ((pl_P218_30 <= pl_P435_85) OR (1 <= pl_P435_45)))))) : A (G (((pl_P218_63 <= pl_P218_96) AND ((pl_P1_1 <= pl_P321_1) OR ((1 <= pl_P349_1) AND (pl_P498_1 <= pl_P401_1)))))) : A (G (((pl_P337_1 <= 2) OR (pl_P218_52 + 1 <= pl_P111_1) OR (1 <= pl_P435_13) OR (pl_P435_79 <= pl_P218_76) OR (2 <= pl_P494_1) OR (3 <= pl_P502_32)))) : E (F ((3 <= pl_P186_1))) : E (F (((pl_P166_1 <= 2) AND ((pl_P335_1 <= pl_P407_1) OR (pl_P29_37 <= pl_P133_1)) AND ((1 <= pl_P502_56) OR (pl_P476_1 <= pl_P179_1)) AND ((1 <= pl_P304_36) OR (2 <= pl_P335_1))))) : A (G ((pl_P502_69 <= pl_P29_96))) : E (F (((2 <= pl_P218_89) AND (3 <= pl_P387_1)))) : E (F ((((pl_P218_6 <= 2) AND (pl_P279_1 + 1 <= pl_P304_46)) OR (1 <= pl_P25_1)))) : E (F (((pl_P435_31 + 1 <= pl_P199_1) AND (pl_P502_3 <= 2) AND ((pl_P218_4 + 1 <= pl_P516_1) OR (pl_P68_1 + 1 <= pl_P486_1))))) : E (F (((2 <= pl_P435_16) AND (pl_P291_1 + 1 <= pl_P56_1)))) : E (F (((2 <= pl_P29_35) AND (3 <= pl_P502_66)))) : E (F ((3 <= pl_P435_23))) : E (F (((pl_P502_23 <= 0) AND (pl_P205_1 + 1 <= pl_P387_1) AND (pl_P15_1 + 1 <= pl_P49_1)))) : E (F (((2 <= pl_P433_1) AND (3 <= pl_P280_1) AND (pl_P502_74 <= 1) AND (pl_P413_1 <= 1)))) : A (G (((pl_P218_82 <= pl_P43_1) OR (pl_P260_1 + 1 <= pl_P308_1) OR ((pl_P190_1 + 1 <= pl_P130_1) AND (pl_P449_1 + 1 <= pl_P96_1))))) : E (F ((2 <= pl_P163_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P29_42 + 1 <= pl_P459_1) OR ((2 <= pl_P435_32) AND (pl_P387_1 <= pl_P218_57)) OR ((pl_P25_1 <= pl_P218_15) AND ((pl_P218_30 <= pl_P435_85) OR (1 <= pl_P435_45))))))
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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1310 markings, 1531 edges, 262 markings/sec, 0 secs
lola: sara is running 5 secs || 5130 markings, 6208 edges, 764 markings/sec, 5 secs
lola: sara is running 10 secs || 8533 markings, 10404 edges, 681 markings/sec, 10 secs
lola: sara is running 15 secs || 10977 markings, 13429 edges, 489 markings/sec, 15 secs
lola: sara is running 20 secs || 15655 markings, 19404 edges, 936 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 20682 markings, 25842 edges, 1005 markings/sec, 25 secs
lola: sara is running 30 secs || 25431 markings, 32019 edges, 950 markings/sec, 30 secs
lola: sara is running 35 secs || 29981 markings, 38004 edges, 910 markings/sec, 35 secs
lola: sara is running 40 secs || 34500 markings, 43884 edges, 904 markings/sec, 40 secs
lola: sara is running 45 secs || 39250 markings, 49900 edges, 950 markings/sec, 45 secs
lola: sara is running 50 secs || 43818 markings, 55842 edges, 914 markings/sec, 50 secs
lola: sara is running 55 secs || 47808 markings, 61064 edges, 798 markings/sec, 55 secs
lola: sara is running 60 secs || 52103 markings, 66724 edges, 859 markings/sec, 60 secs
lola: sara is running 65 secs || 56245 markings, 72074 edges, 828 markings/sec, 65 secs
lola: sara is running 70 secs || 60469 markings, 77619 edges, 845 markings/sec, 70 secs
lola: sara is running 75 secs || 65018 markings, 83544 edges, 910 markings/sec, 75 secs
lola: sara is running 80 secs || 69326 markings, 89152 edges, 862 markings/sec, 80 secs
lola: sara is running 85 secs || 74173 markings, 95405 edges, 969 markings/sec, 85 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 229 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P218_63 <= pl_P218_96) AND ((pl_P1_1 <= pl_P321_1) OR ((1 <= pl_P349_1) AND (pl_P498_1 <= pl_P401_1))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P337_1 <= 2) OR (pl_P218_52 + 1 <= pl_P111_1) OR (1 <= pl_P435_13) OR (pl_P435_79 <= pl_P218_76) OR (2 <= pl_P494_1) OR (3 <= pl_P502_32))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2359 markings, 2826 edges, 472 markings/sec, 0 secs
lola: sara is running 5 secs || 6390 markings, 7780 edges, 806 markings/sec, 5 secs
lola: sara is running 10 secs || 9087 markings, 11279 edges, 539 markings/sec, 10 secs
lola: sara is running 15 secs || 12741 markings, 15949 edges, 731 markings/sec, 15 secs
lola: sara is running 20 secs || 17534 markings, 22117 edges, 959 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 22158 markings, 28095 edges, 925 markings/sec, 25 secs
lola: sara is running 30 secs || 26919 markings, 34387 edges, 952 markings/sec, 30 secs
lola: sara is running 35 secs || 31672 markings, 40553 edges, 951 markings/sec, 35 secs
lola: sara is running 40 secs || 36146 markings, 46340 edges, 895 markings/sec, 40 secs
lola: sara is running 45 secs || 40775 markings, 52399 edges, 926 markings/sec, 45 secs
lola: sara is running 50 secs || 45424 markings, 58472 edges, 930 markings/sec, 50 secs
lola: sara is running 55 secs || 50160 markings, 64548 edges, 947 markings/sec, 55 secs
lola: sara is running 60 secs || 54860 markings, 70645 edges, 940 markings/sec, 60 secs
lola: sara is running 65 secs || 59551 markings, 76689 edges, 938 markings/sec, 65 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P186_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 1267 markings, 1480 edges, 253 markings/sec, 0 secs
lola: sara is running 5 secs || 4954 markings, 5977 edges, 737 markings/sec, 5 secs
lola: sara is running 10 secs || 8463 markings, 10287 edges, 702 markings/sec, 10 secs
lola: sara is running 15 secs || 11246 markings, 13792 edges, 557 markings/sec, 15 secs
lola: sara is running 20 secs || 15752 markings, 19539 edges, 901 markings/sec, 20 secs
lola: sara is running 25 secs || 20786 markings, 26070 edges, 1007 markings/sec, 25 secs
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 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P166_1 <= 2) AND ((pl_P335_1 <= pl_P407_1) OR (pl_P29_37 <= pl_P133_1)) AND ((1 <= pl_P502_56) OR (pl_P476_1 <= pl_P179_1)) AND ((1 <= pl_P304_36) OR (2 <= pl_P335_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 74 markings, 73 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pl_P502_69 <= pl_P29_96)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 1432 markings, 1680 edges, 286 markings/sec, 0 secs
lola: sara is running 5 secs || 5510 markings, 6654 edges, 816 markings/sec, 5 secs
lola: sara is running 10 secs || 8857 markings, 10790 edges, 669 markings/sec, 10 secs
lola: sara is running 15 secs || 11723 markings, 14404 edges, 573 markings/sec, 15 secs
lola: sara is running 20 secs || 16780 markings, 20864 edges, 1011 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 21721 markings, 27188 edges, 988 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P218_89) AND (3 <= pl_P387_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pl_P218_6 <= 2) AND (pl_P279_1 + 1 <= pl_P304_46)) OR (1 <= pl_P25_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 94 markings, 93 edges
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P435_31 + 1 <= pl_P199_1) AND (pl_P502_3 <= 2) AND ((pl_P218_4 + 1 <= pl_P516_1) OR (pl_P68_1 + 1 <= pl_P486_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P435_16) AND (pl_P291_1 + 1 <= pl_P56_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 1329 markings, 1554 edges, 266 markings/sec, 0 secs
lola: sara is running 5 secs || 5026 markings, 6055 edges, 739 markings/sec, 5 secs
lola: sara is running 10 secs || 7900 markings, 10044 edges, 575 markings/sec, 10 secs
lola: sara is running 15 secs || 10462 markings, 13499 edges, 512 markings/sec, 15 secs
lola: sara is running 20 secs || 13931 markings, 18564 edges, 694 markings/sec, 20 secs
lola: sara is running 25 secs || 18213 markings, 24622 edges, 856 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 22216 markings, 30297 edges, 801 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P29_35) AND (3 <= pl_P502_66))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 1737 markings, 2055 edges, 347 markings/sec, 0 secs
lola: sara is running 5 secs || 5449 markings, 6587 edges, 742 markings/sec, 5 secs
lola: sara is running 10 secs || 9646 markings, 11773 edges, 839 markings/sec, 10 secs
lola: sara is running 15 secs || 13122 markings, 16218 edges, 695 markings/sec, 15 secs
lola: sara is running 20 secs || 15396 markings, 19100 edges, 455 markings/sec, 20 secs
lola: sara is running 25 secs || 19311 markings, 24149 edges, 783 markings/sec, 25 secs
lola: sara is running 30 secs || 23388 markings, 29472 edges, 815 markings/sec, 30 secs
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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pl_P435_23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 981 markings, 1134 edges, 196 markings/sec, 0 secs
lola: sara is running 5 secs || 4617 markings, 5578 edges, 727 markings/sec, 5 secs
lola: sara is running 10 secs || 7725 markings, 9378 edges, 622 markings/sec, 10 secs
lola: sara is running 15 secs || 10460 markings, 12808 edges, 547 markings/sec, 15 secs
lola: sara is running 20 secs || 14902 markings, 18484 edges, 888 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 19863 markings, 24863 edges, 992 markings/sec, 25 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pl_P502_23 <= 0) AND (pl_P205_1 + 1 <= pl_P387_1) AND (pl_P15_1 + 1 <= pl_P49_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pl_P433_1) AND (3 <= pl_P280_1) AND (pl_P502_74 <= 1) AND (pl_P413_1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 1542 markings, 1816 edges, 308 markings/sec, 0 secs
lola: sara is running 5 secs || 5519 markings, 6665 edges, 795 markings/sec, 5 secs
lola: sara is running 10 secs || 8966 markings, 10915 edges, 689 markings/sec, 10 secs
lola: sara is running 15 secs || 11709 markings, 14436 edges, 549 markings/sec, 15 secs
lola: sara is running 20 secs || 16616 markings, 20720 edges, 981 markings/sec, 20 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 25 secs || 21688 markings, 27198 edges, 1014 markings/sec, 25 secs
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 1575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pl_P218_82 <= pl_P43_1) OR (pl_P260_1 + 1 <= pl_P308_1) OR ((pl_P190_1 + 1 <= pl_P130_1) AND (pl_P449_1 + 1 <= pl_P96_1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 1442 markings, 1692 edges, 288 markings/sec, 0 secs
lola: sara is running 5 secs || 5491 markings, 6631 edges, 810 markings/sec, 5 secs
lola: sara is running 10 secs || 8725 markings, 10586 edges, 647 markings/sec, 10 secs
lola: sara is running 15 secs || 11643 markings, 14233 edges, 584 markings/sec, 15 secs
lola: sara is running 20 secs || 16346 markings, 20279 edges, 941 markings/sec, 20 secs
lola: sara is running 25 secs || 20609 markings, 25777 edges, 853 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 24923 markings, 31362 edges, 863 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 15 will run for 3115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pl_P163_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 1649 markings, 1949 edges, 330 markings/sec, 0 secs
lola: sara is running 5 secs || 5297 markings, 6402 edges, 730 markings/sec, 5 secs
lola: sara is running 10 secs || 9144 markings, 11143 edges, 769 markings/sec, 10 secs
lola: sara is running 15 secs || 11615 markings, 14273 edges, 494 markings/sec, 15 secs
lola: sara is running 20 secs || 15469 markings, 19199 edges, 771 markings/sec, 20 secs
lola: sara is running 25 secs || 20481 markings, 25682 edges, 1002 markings/sec, 25 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 30 secs || 25317 markings, 31974 edges, 967 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes no yes yes no no no yes no yes no
FORMULA Railroad-PT-100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityCardinality-15 FALSE 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-100"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
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-152673581300201"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;