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 1.5M
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is Echo-PT-d02r19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-blw3-152649950800448
=====================================================================

--------------------
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 Echo-PT-d02r19-ReachabilityFireability-00
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-01
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-02
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-03
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-04
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-05
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-06
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-07
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-08
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-09
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-10
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-11
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-12
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-13
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-14
FORMULA_NAME Echo-PT-d02r19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527490719455


BK_STOP 1527491083545

--------------------
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 Echo-PT-d02r19 as instance name.
Using Echo 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': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 207, 'Memory': 111.77, 'Tool': 'lola'}, {'Time': 327, 'Memory': 112.53, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Echo-PT-d02r19...

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


checking for too many tokens
===========================================================================================
Echo-PT-d02r19: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Echo-PT-d02r19 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 6185/65536 symbol table entries, 806 collisions
lola: preprocessing...
lola: finding significant places
lola: 3455 places, 2730 transitions, 1726 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5448 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r19-ReachabilityFireability.task
lola: A (G ((FIREABLE(t2595) OR FIREABLE(t1666) OR NOT FIREABLE(t2048)))) : E (F (FIREABLE(t1585))) : E (F ((FIREABLE(t2526) OR FIREABLE(t1263) OR FIREABLE(t962)))) : E (F ((NOT FIREABLE(t2526) AND NOT FIREABLE(t2683) AND NOT FIREABLE(t2392) AND ((FIREABLE(t51) AND FIREABLE(t436)) OR NOT FIREABLE(t2709)) AND (FIREABLE(t2381) OR FIREABLE(t956))))) : A (G ((NOT FIREABLE(t1307) OR (NOT FIREABLE(t525) AND NOT FIREABLE(t2452))))) : A (G ((NOT FIREABLE(t731) OR NOT FIREABLE(t365) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t1608)) OR (FIREABLE(t636) AND NOT FIREABLE(t807))))) : E (F ((FIREABLE(t2330) AND (NOT FIREABLE(t2606) OR NOT FIREABLE(t1239)) AND NOT FIREABLE(t2664)))) : E (F ((FIREABLE(t1731) AND FIREABLE(t2569) AND FIREABLE(t1983) AND FIREABLE(t2635)))) : E (F (FIREABLE(t1651))) : A (G ((NOT FIREABLE(t596) OR NOT FIREABLE(t1711) OR FIREABLE(t2117) OR NOT FIREABLE(t1437)))) : A (G (NOT FIREABLE(t2035))) : E (F (((FIREABLE(t2175) OR FIREABLE(t2157)) AND NOT FIREABLE(t1342)))) : E (F (FIREABLE(t2373))) : E (F ((FIREABLE(t1878) OR (NOT FIREABLE(t2367) AND NOT FIREABLE(t2200) AND (FIREABLE(t1184) OR FIREABLE(t2120)))))) : A (G (((NOT FIREABLE(t1453) OR (NOT FIREABLE(t1214) AND NOT FIREABLE(t1316))) AND (FIREABLE(t424) OR FIREABLE(t2576) OR FIREABLE(t1791) OR NOT FIREABLE(t314))))) : E (F (FIREABLE(t708)))
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(t2595) OR FIREABLE(t1666) OR NOT FIREABLE(t2048))))
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 216 bytes per marking, with 2 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1585)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2526) OR FIREABLE(t1263) OR FIREABLE(t962))))
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 216 bytes per marking, with 2 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 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2526) AND NOT FIREABLE(t2683) AND NOT FIREABLE(t2392) AND ((FIREABLE(t51) AND FIREABLE(t436)) OR NOT FIREABLE(t2709)) AND (FIREABLE(t2381) OR FIREABLE(t956)))))
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 216 bytes per marking, with 2 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1307) OR (NOT FIREABLE(t525) AND NOT FIREABLE(t2452)))))
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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-4.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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t731) OR NOT FIREABLE(t365) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t1608)) OR (FIREABLE(t636) AND NOT FIREABLE(t807)))))
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 216 bytes per marking, with 2 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 92 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 858486 markings, 866514 edges, 171697 markings/sec, 0 secs
lola: sara is running 5 secs || 1769616 markings, 1791359 edges, 182226 markings/sec, 5 secs
lola: sara is running 10 secs || 2676534 markings, 2710198 edges, 181384 markings/sec, 10 secs
lola: sara is running 15 secs || 3575824 markings, 3640029 edges, 179858 markings/sec, 15 secs
lola: sara is running 20 secs || 4475507 markings, 4575970 edges, 179937 markings/sec, 20 secs
lola: sara is running 25 secs || 5416835 markings, 5521561 edges, 188266 markings/sec, 25 secs
lola: sara is running 30 secs || 6341608 markings, 6450526 edges, 184955 markings/sec, 30 secs
lola: sara is running 35 secs || 7284786 markings, 7399093 edges, 188636 markings/sec, 35 secs
lola: sara is running 40 secs || 8201542 markings, 8320277 edges, 183351 markings/sec, 40 secs
lola: sara is running 45 secs || 9109476 markings, 9232779 edges, 181587 markings/sec, 45 secs
lola: sara is running 50 secs || 10020100 markings, 10147483 edges, 182125 markings/sec, 50 secs
lola: sara is running 55 secs || 10908711 markings, 11040694 edges, 177722 markings/sec, 55 secs
lola: sara is running 60 secs || 11829625 markings, 11966891 edges, 184183 markings/sec, 60 secs
lola: sara is running 65 secs || 12754180 markings, 12897370 edges, 184911 markings/sec, 65 secs
lola: sara is running 70 secs || 13663334 markings, 13813396 edges, 181831 markings/sec, 70 secs
lola: sara is running 75 secs || 14603492 markings, 14763077 edges, 188032 markings/sec, 75 secs
lola: sara is running 80 secs || 15528133 markings, 15700572 edges, 184928 markings/sec, 80 secs
lola: sara is running 85 secs || 16431873 markings, 16617155 edges, 180748 markings/sec, 85 secs
lola: sara is running 90 secs || 17318467 markings, 17544223 edges, 177319 markings/sec, 90 secs
lola: sara is running 95 secs || 18214807 markings, 18465786 edges, 179268 markings/sec, 95 secs
lola: sara is running 100 secs || 19145852 markings, 19401059 edges, 186209 markings/sec, 100 secs
lola: sara is running 105 secs || 20055241 markings, 20314587 edges, 181878 markings/sec, 105 secs
lola: sara is running 110 secs || 20983244 markings, 21247927 edges, 185601 markings/sec, 110 secs
lola: sara is running 115 secs || 21889649 markings, 22158707 edges, 181281 markings/sec, 115 secs
lola: sara is running 120 secs || 22798938 markings, 23072568 edges, 181858 markings/sec, 120 secs
lola: sara is running 125 secs || 23716925 markings, 23994666 edges, 183597 markings/sec, 125 secs
lola: sara is running 130 secs || 24630040 markings, 24912577 edges, 182623 markings/sec, 130 secs
lola: sara is running 135 secs || 25568186 markings, 25856044 edges, 187629 markings/sec, 135 secs
lola: sara is running 140 secs || 26488947 markings, 26782854 edges, 184152 markings/sec, 140 secs
lola: sara is running 145 secs || 27395248 markings, 27695945 edges, 181260 markings/sec, 145 secs
lola: sara is running 150 secs || 28251694 markings, 28642181 edges, 171289 markings/sec, 150 secs
lola: sara is running 155 secs || 29164335 markings, 29594837 edges, 182528 markings/sec, 155 secs
lola: sara is running 160 secs || 30087242 markings, 30534343 edges, 184581 markings/sec, 160 secs
lola: sara is running 165 secs || 30927398 markings, 31457942 edges, 168031 markings/sec, 165 secs
lola: sara is running 170 secs || 31806006 markings, 32406139 edges, 175722 markings/sec, 170 secs
lola: sara is running 175 secs || 32678763 markings, 33358593 edges, 174551 markings/sec, 175 secs
lola: sara is running 180 secs || 33488501 markings, 34279260 edges, 161948 markings/sec, 180 secs
lola: sara is running 185 secs || 34333401 markings, 35225841 edges, 168980 markings/sec, 185 secs
lola: sara is running 190 secs || 35242446 markings, 36182770 edges, 181809 markings/sec, 190 secs
lola: sara is running 195 secs || 36194625 markings, 37145527 edges, 190436 markings/sec, 195 secs
lola: sara is running 200 secs || 37135404 markings, 38096702 edges, 188156 markings/sec, 200 secs
lola: sara is running 205 secs || 38065712 markings, 39037038 edges, 186062 markings/sec, 205 secs
lola: sara is running 210 secs || 39006931 markings, 39986916 edges, 188244 markings/sec, 210 secs
lola: sara is running 215 secs || 39928485 markings, 40912587 edges, 184311 markings/sec, 215 secs
lola: sara is running 220 secs || 40846481 markings, 41834968 edges, 183599 markings/sec, 220 secs
lola: sara is running 225 secs || 41780203 markings, 42788849 edges, 186744 markings/sec, 225 secs
lola: sara is running 230 secs || 42696964 markings, 43722906 edges, 183352 markings/sec, 230 secs
lola: sara is running 235 secs || 43623974 markings, 44654700 edges, 185402 markings/sec, 235 secs
lola: sara is running 240 secs || 44555785 markings, 45594443 edges, 186362 markings/sec, 240 secs
lola: sara is running 245 secs || 45472431 markings, 46521768 edges, 183329 markings/sec, 245 secs
lola: sara is running 250 secs || 46400013 markings, 47460862 edges, 185516 markings/sec, 250 secs
lola: sara is running 255 secs || 47322078 markings, 48392593 edges, 184413 markings/sec, 255 secs
lola: sara is running 260 secs || 48247373 markings, 49328886 edges, 185059 markings/sec, 260 secs
lola: sara is running 265 secs || 49158677 markings, 50245615 edges, 182261 markings/sec, 265 secs
lola: sara is running 270 secs || 50059992 markings, 51153674 edges, 180263 markings/sec, 270 secs
lola: sara is running 275 secs || 51005446 markings, 52103333 edges, 189091 markings/sec, 275 secs
lola: sara is running 280 secs || 51962653 markings, 53064194 edges, 191441 markings/sec, 280 secs
lola: sara is running 285 secs || 52918528 markings, 54023717 edges, 191175 markings/sec, 285 secs
lola: sara is running 290 secs || 53869880 markings, 54978713 edges, 190270 markings/sec, 290 secs
lola: sara is running 295 secs || 54822636 markings, 55935729 edges, 190551 markings/sec, 295 secs
lola: sara is running 300 secs || 55763664 markings, 56880354 edges, 188206 markings/sec, 300 secs
lola: sara is running 305 secs || 56701433 markings, 57821721 edges, 187554 markings/sec, 305 secs
lola: sara is running 310 secs || 57636978 markings, 58761448 edges, 187109 markings/sec, 310 secs
lola: sara is running 315 secs || 58568790 markings, 59696827 edges, 186362 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2330) AND (NOT FIREABLE(t2606) OR NOT FIREABLE(t1239)) AND NOT FIREABLE(t2664))))
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 216 bytes per marking, with 2 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 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1731) AND FIREABLE(t2569) AND FIREABLE(t1983) AND FIREABLE(t2635))))
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 216 bytes per marking, with 2 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 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1651)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t596) OR NOT FIREABLE(t1711) OR FIREABLE(t2117) OR NOT FIREABLE(t1437))))
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 216 bytes per marking, with 2 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2035)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-10.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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2175) OR FIREABLE(t2157)) AND NOT FIREABLE(t1342))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2373)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1878) OR (NOT FIREABLE(t2367) AND NOT FIREABLE(t2200) AND (FIREABLE(t1184) OR FIREABLE(t2120))))))
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 216 bytes per marking, with 2 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 146 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1453) OR (NOT FIREABLE(t1214) AND NOT FIREABLE(t1316))) AND (FIREABLE(t424) OR FIREABLE(t2576) OR FIREABLE(t1791) OR NOT FIREABLE(t314)))))
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 216 bytes per marking, with 2 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 232 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t708)))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no unknown yes yes yes no no yes yes yes no yes
FORMULA Echo-PT-d02r19-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-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 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="Echo-PT-d02r19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-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/Echo-PT-d02r19.tgz
mv Echo-PT-d02r19 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 mcc4mcc-structural"
echo " Input is Echo-PT-d02r19, 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 r083-blw3-152649950800448"
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 ;