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 14M
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 14M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636800166
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526775556536


BK_STOP 1526776559758

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using HypertorusGrid-PT-d5k3p2b10 as instance name.
Using HypertorusGrid 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': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 249083, 'Memory': 11640.8, 'Tool': 'lola'}, {'Time': 251039, 'Memory': 11615.18, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola HypertorusGrid-PT-d5k3p2b10...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d5k3p2b10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 31833/65536 symbol table entries, 17230 collisions
lola: preprocessing...
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26973 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: E (F (((pb_d2_n2_2_3_2_1_1 <= 1) OR (pb_d5_n2_1_3_1_1_1 + 1 <= pol_d2_n1_3_3_3_3_3) OR (3 <= pb_d2_n1_1_1_2_1_1)))) : A (G (((pil_d2_n1_3_2_2_3_1 + 1 <= pb_d5_n1_3_1_3_1_2) OR (pb_d4_n1_1_2_1_1_1 <= pbl_3_3_3_1_2)))) : E (F (((pil_d2_n1_2_3_1_1_2 <= pil_d1_n1_3_1_3_3_3) AND ((pbl_1_2_3_1_2 + 1 <= pb_d2_n2_3_3_1_3_2) OR (pb_d2_n1_3_2_2_3_1 + 1 <= pol_d4_n1_2_2_3_1_2))))) : E (F ((((pol_d2_n1_2_1_1_2_2 <= pol_d2_n1_2_2_2_3_1) AND (pb_d4_n1_1_3_1_1_3 <= pi_d2_n1_3_1_2_3_3) AND ((pb_d1_n2_3_1_3_2_1 <= pb_d1_n1_3_2_3_2_3) OR (pol_d4_n1_2_1_3_3_1 <= pbl_2_3_3_2_1))) OR (((pol_d2_n1_3_3_1_3_1 <= po_d3_n1_2_2_2_3_3) OR (2 <= pb_d1_n2_2_1_1_3_3)) AND (pbl_1_2_2_2_2 <= 1))))) : A (G (((pi_d3_n1_2_3_1_1_2 <= pb_d1_n1_3_3_1_3_1) OR (2 <= po_d1_n1_1_1_3_2_3) OR ((1 <= pol_d3_n1_1_1_3_1_1) AND (1 <= po_d4_n1_1_2_2_3_1) AND (pb_d4_n1_1_1_1_2_3 <= 0))))) : E (F (((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_1_3)))) : E (F ((2 <= pol_d1_n1_3_3_1_1_1))) : A (G ((((pi_d4_n1_3_3_3_1_2 <= pb_d1_n2_2_2_1_2_2) OR (2 <= po_d4_n1_3_3_2_1_3) OR ((pol_d1_n1_1_1_1_1_1 <= pb_d4_n2_1_1_1_3_1) AND (pi_d1_n1_3_3_2_1_1 <= pil_d2_n1_1_3_1_2_3))) AND ((3 <= pol_d1_n1_2_3_1_3_3) OR (po_d1_n1_3_2_3_3_1 <= pb_d4_n2_3_1_3_2_3) OR ((pb_d5_n2_2_2_2_3_1 <= pil_d3_n1_2_3_3_2_3) AND (pb_d1_n2_2_1_1_1_3 <= pb_d2_n2_3_2_1_2_1)))))) : A (G (((pil_d4_n1_3_3_2_3_1 <= 1) OR ((pb_d2_n1_2_1_2_2_3 + 1 <= pil_d3_n1_1_2_3_3_3) AND (po_d1_n1_3_1_1_1_2 <= 2))))) : A (G ((((3 <= pb_d2_n2_3_1_1_2_1) AND (pi_d5_n1_2_2_3_3_1 <= po_d5_n1_3_3_1_2_3)) OR ((3 <= pil_d1_n1_1_3_3_3_1) AND (pol_d3_n1_2_3_3_1_3 <= pi_d3_n1_3_1_2_3_1)) OR (pil_d5_n1_1_1_3_2_2 <= pb_d2_n2_1_3_1_3_1)))) : A (G ((((pol_d3_n1_3_1_1_1_3 <= pi_d2_n1_3_2_3_2_2) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR (pi_d2_n1_3_3_1_2_3 <= po_d5_n1_1_3_2_3_3) OR (((2 <= pil_d1_n1_2_2_3_3_2) OR (pol_d3_n1_1_1_3_2_2 <= pb_d2_n2_3_2_1_2_2)) AND (pb_d1_n1_1_3_2_1_1 + 1 <= pb_d2_n2_1_2_2_1_3))))) : A (G (((((2 <= pb_d1_n1_2_1_1_1_3) OR (1 <= pil_d1_n1_3_3_1_2_1)) AND (pbl_3_1_3_2_1 <= 0)) OR (((2 <= pb_d5_n2_1_3_2_2_1) OR (1 <= po_d5_n1_1_2_2_2_1)) AND ((pil_d5_n1_2_3_2_2_1 <= pol_d3_n1_3_2_2_2_2) OR (pb_d3_n2_2_2_3_3_2 <= pb_d4_n2_3_2_2_2_1)))))) : E (F (((po_d1_n1_1_3_1_3_3 <= 1) AND (pb_d3_n1_1_1_2_1_1 + 1 <= pb_d2_n2_1_1_3_3_1) AND ((3 <= pol_d3_n1_3_1_1_2_1) OR (pb_d1_n1_1_1_3_2_2 <= pol_d4_n1_3_1_1_1_2))))) : E (F (((3 <= pb_d5_n1_1_3_3_2_2) AND (po_d3_n1_2_1_3_1_3 <= pi_d5_n1_1_1_1_2_3) AND (pil_d3_n1_3_2_1_1_2 <= 0) AND (pol_d3_n1_1_3_2_1_2 <= pb_d4_n2_2_3_2_1_1) AND (po_d5_n1_2_1_1_3_1 <= 1)))) : E (F (((po_d3_n1_3_2_3_1_3 <= pb_d2_n1_2_2_2_2_2) AND (1 <= po_d5_n1_3_3_3_2_2) AND (1 <= pol_d2_n1_2_1_1_1_3) AND (2 <= pil_d3_n1_1_2_3_3_2) AND ((3 <= pbl_2_1_1_3_1) OR (3 <= pol_d2_n1_1_3_2_3_1))))) : A (G (((pb_d5_n1_3_1_2_3_1 <= po_d1_n1_3_3_3_1_3) OR (pol_d2_n1_3_2_3_3_3 <= po_d4_n1_1_2_2_2_3) OR (pi_d2_n1_2_2_2_2_2 <= 2) OR (pil_d3_n1_1_2_1_1_3 <= pol_d1_n1_3_1_2_3_2) OR (po_d3_n1_1_3_1_3_1 <= pi_d4_n1_2_1_2_3_1) OR ((2 <= pi_d4_n1_3_3_1_1_2) AND (3 <= pb_d3_n1_2_3_3_2_3)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d2_n2_2_3_2_1_1 <= 1) OR (pb_d5_n2_1_3_1_1_1 + 1 <= pol_d2_n1_3_3_3_3_3) OR (3 <= pb_d2_n1_1_1_2_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 19436 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d2_n1_3_2_2_3_1 + 1 <= pb_d5_n1_3_1_3_1_2) OR (pb_d4_n1_1_2_1_1_1 <= pbl_3_3_3_1_2))))
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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d2_n1_2_3_1_1_2 <= pil_d1_n1_3_1_3_3_3) AND ((pbl_1_2_3_1_2 + 1 <= pb_d2_n2_3_3_1_3_2) OR (pb_d2_n1_3_2_2_3_1 + 1 <= pol_d4_n1_2_2_3_1_2)))))
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 19436 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d2_n1_2_1_1_2_2 <= pol_d2_n1_2_2_2_3_1) AND (pb_d4_n1_1_3_1_1_3 <= pi_d2_n1_3_1_2_3_3) AND ((pb_d1_n2_3_1_3_2_1 <= pb_d1_n1_3_2_3_2_3) OR (pol_d4_n1_2_1_3_3_1 <= pbl_2_3_3_2_1))) OR (((pol_d2_n1_3_3_1_3_1 <= po_d3_n1_2_2_2_3_3) OR (2 <= pb_d1_n2_2_1_1_3_3)) AND (pbl_1_2_2_2_2 <= 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 19436 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d3_n1_2_3_1_1_2 <= pb_d1_n1_3_3_1_3_1) OR (2 <= po_d1_n1_1_1_3_2_3) OR ((1 <= pol_d3_n1_1_1_3_1_1) AND (1 <= po_d4_n1_1_2_2_3_1) AND (pb_d4_n1_1_1_1_2_3 <= 0)))))
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 19436 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_1_3))))
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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 35396 markings, 35719 edges, 7079 markings/sec, 0 secs
lola: sara is running 5 secs || 58184 markings, 58657 edges, 4558 markings/sec, 5 secs
lola: sara is running 10 secs || 77108 markings, 77877 edges, 3785 markings/sec, 10 secs
lola: sara is running 15 secs || 93684 markings, 94533 edges, 3315 markings/sec, 15 secs
lola: sara is running 20 secs || 108627 markings, 109751 edges, 2989 markings/sec, 20 secs
lola: sara is running 25 secs || 122998 markings, 124453 edges, 2874 markings/sec, 25 secs
lola: sara is running 30 secs || 137521 markings, 139254 edges, 2905 markings/sec, 30 secs
lola: sara is running 35 secs || 150272 markings, 152096 edges, 2550 markings/sec, 35 secs
lola: sara is running 40 secs || 161435 markings, 163286 edges, 2233 markings/sec, 40 secs
lola: sara is running 45 secs || 172682 markings, 174545 edges, 2249 markings/sec, 45 secs
lola: sara is running 50 secs || 182650 markings, 184728 edges, 1994 markings/sec, 50 secs
lola: sara is running 55 secs || 192242 markings, 194973 edges, 1918 markings/sec, 55 secs
lola: sara is running 60 secs || 201558 markings, 204289 edges, 1863 markings/sec, 60 secs
lola: sara is running 65 secs || 210522 markings, 213801 edges, 1793 markings/sec, 65 secs
lola: sara is running 70 secs || 219416 markings, 223433 edges, 1779 markings/sec, 70 secs
lola: sara is running 75 secs || 228318 markings, 233345 edges, 1780 markings/sec, 75 secs
lola: sara is running 80 secs || 237212 markings, 242347 edges, 1779 markings/sec, 80 secs
lola: sara is running 85 secs || 245914 markings, 251066 edges, 1740 markings/sec, 85 secs
lola: sara is running 90 secs || 253861 markings, 259013 edges, 1589 markings/sec, 90 secs
lola: sara is running 95 secs || 261489 markings, 266727 edges, 1526 markings/sec, 95 secs
lola: sara is running 100 secs || 269108 markings, 274377 edges, 1524 markings/sec, 100 secs
lola: sara is running 105 secs || 276330 markings, 281599 edges, 1444 markings/sec, 105 secs
lola: sara is running 110 secs || 283612 markings, 288965 edges, 1456 markings/sec, 110 secs
lola: sara is running 115 secs || 291009 markings, 296407 edges, 1479 markings/sec, 115 secs
lola: sara is running 120 secs || 298413 markings, 303826 edges, 1481 markings/sec, 120 secs
lola: sara is running 125 secs || 305489 markings, 310947 edges, 1415 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 312381 markings, 317855 edges, 1378 markings/sec, 130 secs
lola: sara is running 135 secs || 319338 markings, 324838 edges, 1391 markings/sec, 135 secs

lola: sara is running 140 secs || 326208 markings, 331771 edges, 1374 markings/sec, 140 secs
lola: sara is running 145 secs || 333054 markings, 338862 edges, 1369 markings/sec, 145 secs
lola: sara is running 150 secs || 339925 markings, 345773 edges, 1374 markings/sec, 150 secs
lola: sara is running 155 secs || 346849 markings, 352738 edges, 1385 markings/sec, 155 secs
lola: sara is running 160 secs || 353639 markings, 359585 edges, 1358 markings/sec, 160 secs
lola: sara is running 165 secs || 360343 markings, 366320 edges, 1341 markings/sec, 165 secs
lola: sara is running 170 secs || 367092 markings, 373300 edges, 1350 markings/sec, 170 secs
lola: sara is running 175 secs || 373835 markings, 380352 edges, 1349 markings/sec, 175 secs
lola: sara is running 180 secs || 380565 markings, 387249 edges, 1346 markings/sec, 180 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pol_d1_n1_3_3_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 25300 markings, 27263 edges, 5060 markings/sec, 0 secs
lola: sara is running 5 secs || 45296 markings, 48731 edges, 3999 markings/sec, 5 secs
lola: sara is running 10 secs || 64139 markings, 68948 edges, 3769 markings/sec, 10 secs
lola: sara is running 15 secs || 82437 markings, 88593 edges, 3660 markings/sec, 15 secs
lola: sara is running 20 secs || 99946 markings, 107379 edges, 3502 markings/sec, 20 secs
lola: sara is running 25 secs || 117349 markings, 126013 edges, 3481 markings/sec, 25 secs
lola: sara is running 30 secs || 134228 markings, 144088 edges, 3376 markings/sec, 30 secs
lola: sara is running 35 secs || 159996 markings, 170465 edges, 5154 markings/sec, 35 secs
lola: sara is running 40 secs || 183510 markings, 194229 edges, 4703 markings/sec, 40 secs
lola: sara is running 45 secs || 200928 markings, 211686 edges, 3484 markings/sec, 45 secs
lola: sara is running 50 secs || 217301 markings, 228266 edges, 3275 markings/sec, 50 secs
lola: sara is running 55 secs || 232140 markings, 243157 edges, 2968 markings/sec, 55 secs
lola: sara is running 60 secs || 246139 markings, 257632 edges, 2800 markings/sec, 60 secs
lola: sara is running 65 secs || 260053 markings, 271629 edges, 2783 markings/sec, 65 secs
lola: sara is running 70 secs || 274023 markings, 285629 edges, 2794 markings/sec, 70 secs
lola: sara is running 75 secs || 287117 markings, 298726 edges, 2619 markings/sec, 75 secs
lola: sara is running 80 secs || 299780 markings, 311395 edges, 2533 markings/sec, 80 secs
lola: sara is running 85 secs || 311883 markings, 323498 edges, 2421 markings/sec, 85 secs
lola: sara is running 90 secs || 321295 markings, 332916 edges, 1882 markings/sec, 90 secs
lola: sara is running 95 secs || 332198 markings, 344019 edges, 2181 markings/sec, 95 secs
lola: sara is running 100 secs || 343499 markings, 355450 edges, 2260 markings/sec, 100 secs
lola: sara is running 105 secs || 354782 markings, 366941 edges, 2257 markings/sec, 105 secs
lola: sara is running 110 secs || 366823 markings, 379152 edges, 2408 markings/sec, 110 secs
lola: sara is running 115 secs || 378823 markings, 391388 edges, 2400 markings/sec, 115 secs
lola: sara is running 120 secs || 391803 markings, 404431 edges, 2596 markings/sec, 120 secs
lola: sara is running 125 secs || 405994 markings, 418622 edges, 2838 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 420079 markings, 432707 edges, 2817 markings/sec, 130 secs
lola: sara is running 135 secs || 434057 markings, 446685 edges, 2796 markings/sec, 135 secs

lola: sara is running 140 secs || 447972 markings, 460600 edges, 2783 markings/sec, 140 secs
lola: sara is running 145 secs || 461849 markings, 474477 edges, 2775 markings/sec, 145 secs
lola: sara is running 150 secs || 475796 markings, 488428 edges, 2789 markings/sec, 150 secs
lola: sara is running 155 secs || 489746 markings, 502383 edges, 2790 markings/sec, 155 secs
lola: sara is running 160 secs || 503711 markings, 516354 edges, 2793 markings/sec, 160 secs
lola: sara is running 165 secs || 517703 markings, 530351 edges, 2798 markings/sec, 165 secs
lola: sara is running 170 secs || 531797 markings, 544450 edges, 2819 markings/sec, 170 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pi_d4_n1_3_3_3_1_2 <= pb_d1_n2_2_2_1_2_2) OR (2 <= po_d4_n1_3_3_2_1_3) OR ((pol_d1_n1_1_1_1_1_1 <= pb_d4_n2_1_1_1_3_1) AND (pi_d1_n1_3_3_2_1_1 <= pil_d2_n1_1_3_1_2_3))) AND ((3 <= pol_d1_n1_2_3_1_3_3) OR (po_d1_n1_3_2_3_3_1 <= pb_d4_n2_3_1_3_2_3) OR ((pb_d5_n2_2_2_2_3_1 <= pil_d3_n1_2_3_3_2_3) AND (pb_d1_n2_2_1_1_1_3 <= pb_d2_n2_3_2_1_2_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 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7.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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d4_n1_3_3_2_3_1 <= 1) OR ((pb_d2_n1_2_1_2_2_3 + 1 <= pil_d3_n1_1_2_3_3_3) AND (po_d1_n1_3_1_1_1_2 <= 2)))))
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 19436 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 26483 markings, 29762 edges, 5297 markings/sec, 0 secs
lola: sara is running 5 secs || 47192 markings, 52789 edges, 4142 markings/sec, 5 secs
lola: sara is running 10 secs || 64753 markings, 71021 edges, 3512 markings/sec, 10 secs
lola: sara is running 15 secs || 82146 markings, 88971 edges, 3479 markings/sec, 15 secs
lola: sara is running 20 secs || 100640 markings, 108045 edges, 3699 markings/sec, 20 secs
lola: sara is running 25 secs || 118530 markings, 126514 edges, 3578 markings/sec, 25 secs
lola: sara is running 30 secs || 136010 markings, 144552 edges, 3496 markings/sec, 30 secs
lola: sara is running 35 secs || 153728 markings, 162834 edges, 3544 markings/sec, 35 secs
lola: sara is running 40 secs || 170570 markings, 180204 edges, 3368 markings/sec, 40 secs
lola: sara is running 45 secs || 186752 markings, 196893 edges, 3236 markings/sec, 45 secs
lola: sara is running 50 secs || 202560 markings, 213217 edges, 3162 markings/sec, 50 secs
lola: sara is running 55 secs || 218506 markings, 229658 edges, 3189 markings/sec, 55 secs
lola: sara is running 60 secs || 234044 markings, 245691 edges, 3108 markings/sec, 60 secs
lola: sara is running 65 secs || 249135 markings, 261244 edges, 3018 markings/sec, 65 secs
lola: sara is running 70 secs || 264306 markings, 276911 edges, 3034 markings/sec, 70 secs
lola: sara is running 75 secs || 278796 markings, 291862 edges, 2898 markings/sec, 75 secs
lola: sara is running 80 secs || 293354 markings, 306871 edges, 2912 markings/sec, 80 secs
lola: sara is running 85 secs || 307512 markings, 321471 edges, 2832 markings/sec, 85 secs
lola: sara is running 90 secs || 322118 markings, 336567 edges, 2921 markings/sec, 90 secs
lola: sara is running 95 secs || 336833 markings, 351752 edges, 2943 markings/sec, 95 secs
lola: sara is running 100 secs || 351386 markings, 366794 edges, 2911 markings/sec, 100 secs
lola: sara is running 105 secs || 365725 markings, 381615 edges, 2868 markings/sec, 105 secs
lola: sara is running 110 secs || 379546 markings, 395943 edges, 2764 markings/sec, 110 secs
lola: sara is running 115 secs || 393215 markings, 410121 edges, 2734 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 406832 markings, 424268 edges, 2723 markings/sec, 120 secs
lola: sara is running 125 secs || 421000 markings, 438929 edges, 2834 markings/sec, 125 secs
lola: sara is running 130 secs || 434841 markings, 453282 edges, 2768 markings/sec, 130 secs
lola: sara is running 135 secs || 449764 markings, 468684 edges, 2985 markings/sec, 135 secs

lola: sara is running 140 secs || 462043 markings, 481505 edges, 2456 markings/sec, 140 secs
lola: sara is running 145 secs || 474178 markings, 494163 edges, 2427 markings/sec, 145 secs
lola: sara is running 150 secs || 486502 markings, 506989 edges, 2465 markings/sec, 150 secs
lola: sara is running 155 secs || 496574 markings, 517703 edges, 2014 markings/sec, 155 secs
lola: sara is running 160 secs || 506967 markings, 528572 edges, 2079 markings/sec, 160 secs
lola: sara is running 165 secs || 517375 markings, 539339 edges, 2082 markings/sec, 165 secs
lola: sara is running 170 secs || 527816 markings, 550136 edges, 2088 markings/sec, 170 secs
lola: sara is running 175 secs || 538064 markings, 560744 edges, 2050 markings/sec, 175 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= pb_d2_n2_3_1_1_2_1) AND (pi_d5_n1_2_2_3_3_1 <= po_d5_n1_3_3_1_2_3)) OR ((3 <= pil_d1_n1_1_3_3_3_1) AND (pol_d3_n1_2_3_3_1_3 <= pi_d3_n1_3_1_2_3_1)) OR (pil_d5_n1_1_1_3_2_2 <= pb_d2_n2_1_3_1_3_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 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9.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 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pol_d3_n1_3_1_1_1_3 <= pi_d2_n1_3_2_3_2_2) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR (pi_d2_n1_3_3_1_2_3 <= po_d5_n1_1_3_2_3_3) OR (((2 <= pil_d1_n1_2_2_3_3_2) OR (pol_d3_n1_1_1_3_2_2 <= pb_d2_n2_3_2_1_2_2)) AND (pb_d1_n1_1_3_2_1_1 + 1 <= pb_d2_n2_1_2_2_1_3)))))
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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= pb_d1_n1_2_1_1_1_3) OR (1 <= pil_d1_n1_3_3_1_2_1)) AND (pbl_3_1_3_2_1 <= 0)) OR (((2 <= pb_d5_n2_1_3_2_2_1) OR (1 <= po_d5_n1_1_2_2_2_1)) AND ((pil_d5_n1_2_3_2_2_1 <= pol_d3_n1_3_2_2_2_2) OR (pb_d3_n2_2_2_3_3_2 <= pb_d4_n2_3_2_2_2_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11.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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d1_n1_1_3_1_3_3 <= 1) AND (pb_d3_n1_1_1_2_1_1 + 1 <= pb_d2_n2_1_1_3_3_1) AND ((3 <= pol_d3_n1_3_1_1_2_1) OR (pb_d1_n1_1_1_3_2_2 <= pol_d4_n1_3_1_1_1_2)))))
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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pb_d5_n1_1_3_3_2_2) AND (po_d3_n1_2_1_3_1_3 <= pi_d5_n1_1_1_1_2_3) AND (pil_d3_n1_3_2_1_1_2 <= 0) AND (pol_d3_n1_1_3_2_1_2 <= pb_d4_n2_2_3_2_1_1) AND (po_d5_n1_2_1_1_3_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 19436 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 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d3_n1_3_2_3_1_3 <= pb_d2_n1_2_2_2_2_2) AND (1 <= po_d5_n1_3_3_3_2_2) AND (1 <= pol_d2_n1_2_1_1_1_3) AND (2 <= pil_d3_n1_1_2_3_3_2) AND ((3 <= pbl_2_1_1_3_1) OR (3 <= pol_d2_n1_1_3_2_3_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 19436 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 34388 markings, 35284 edges, 6878 markings/sec, 0 secs
lola: sara is running 5 secs || 57690 markings, 58702 edges, 4660 markings/sec, 5 secs
lola: sara is running 10 secs || 79176 markings, 80716 edges, 4297 markings/sec, 10 secs
lola: sara is running 15 secs || 100425 markings, 102301 edges, 4250 markings/sec, 15 secs
lola: sara is running 20 secs || 120858 markings, 122734 edges, 4087 markings/sec, 20 secs
lola: sara is running 25 secs || 139685 markings, 141561 edges, 3765 markings/sec, 25 secs
lola: sara is running 30 secs || 156784 markings, 158706 edges, 3420 markings/sec, 30 secs
lola: sara is running 35 secs || 170133 markings, 172267 edges, 2670 markings/sec, 35 secs
lola: sara is running 40 secs || 183678 markings, 186729 edges, 2709 markings/sec, 40 secs
lola: sara is running 45 secs || 196674 markings, 200807 edges, 2599 markings/sec, 45 secs
lola: sara is running 50 secs || 209589 markings, 214958 edges, 2583 markings/sec, 50 secs
lola: sara is running 55 secs || 222499 markings, 229163 edges, 2582 markings/sec, 55 secs
lola: sara is running 60 secs || 235417 markings, 243410 edges, 2584 markings/sec, 60 secs
lola: sara is running 65 secs || 248334 markings, 257656 edges, 2583 markings/sec, 65 secs
lola: sara is running 70 secs || 261180 markings, 271753 edges, 2569 markings/sec, 70 secs
lola: sara is running 75 secs || 274075 markings, 285931 edges, 2579 markings/sec, 75 secs
lola: sara is running 80 secs || 287299 markings, 300489 edges, 2645 markings/sec, 80 secs
lola: sara is running 85 secs || 300990 markings, 315596 edges, 2738 markings/sec, 85 secs
lola: sara is running 90 secs || 314169 markings, 330106 edges, 2636 markings/sec, 90 secs
lola: sara is running 95 secs || 327082 markings, 344264 edges, 2583 markings/sec, 95 secs
lola: sara is running 100 secs || 339996 markings, 358473 edges, 2583 markings/sec, 100 secs
lola: sara is running 105 secs || 352838 markings, 372311 edges, 2568 markings/sec, 105 secs
lola: sara is running 110 secs || 365363 markings, 384836 edges, 2505 markings/sec, 110 secs
lola: sara is running 115 secs || 377728 markings, 397201 edges, 2473 markings/sec, 115 secs
lola: sara is running 120 secs || 390689 markings, 410162 edges, 2592 markings/sec, 120 secs
lola: sara is running 125 secs || 403309 markings, 422782 edges, 2524 markings/sec, 125 secs
lola: sara is running 130 secs || 413495 markings, 433106 edges, 2037 markings/sec, 130 secs
lola: sara is running 135 secs || 423233 markings, 443131 edges, 1948 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 433111 markings, 453364 edges, 1976 markings/sec, 140 secs
lola: sara is running 145 secs || 443486 markings, 463920 edges, 2075 markings/sec, 145 secs
lola: sara is running 150 secs || 453881 markings, 474484 edges, 2079 markings/sec, 150 secs

lola: sara is running 155 secs || 464002 markings, 485028 edges, 2024 markings/sec, 155 secs
lola: sara is running 160 secs || 472975 markings, 494082 edges, 1795 markings/sec, 160 secs
lola: sara is running 165 secs || 482076 markings, 503213 edges, 1820 markings/sec, 165 secs
lola: sara is running 170 secs || 491372 markings, 512628 edges, 1859 markings/sec, 170 secs
lola: sara is running 175 secs || 500732 markings, 522066 edges, 1872 markings/sec, 175 secs
lola: sara is running 180 secs || 510040 markings, 531453 edges, 1862 markings/sec, 180 secs
lola: sara is running 185 secs || 519093 markings, 540591 edges, 1811 markings/sec, 185 secs
lola: sara is running 190 secs || 528131 markings, 549714 edges, 1808 markings/sec, 190 secs
lola: sara is running 195 secs || 537027 markings, 558669 edges, 1779 markings/sec, 195 secs
lola: sara is running 200 secs || 546154 markings, 567862 edges, 1825 markings/sec, 200 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2781 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d5_n1_3_1_2_3_1 <= po_d1_n1_3_3_3_1_3) OR (pol_d2_n1_3_2_3_3_3 <= po_d4_n1_1_2_2_2_3) OR (pi_d2_n1_2_2_2_2_2 <= 2) OR (pil_d3_n1_1_2_1_1_3 <= pol_d1_n1_3_1_2_3_2) OR (po_d3_n1_1_3_1_3_1 <= pi_d4_n1_2_1_2_3_1) OR ((2 <= pi_d4_n1_3_3_1_1_2) AND (3 <= pb_d3_n1_2_3_3_2_3)))))
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 19436 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 49119 markings, 49150 edges, 9824 markings/sec, 0 secs
lola: sara is running 5 secs || 93833 markings, 93943 edges, 8943 markings/sec, 5 secs
lola: sara is running 10 secs || 119512 markings, 119634 edges, 5136 markings/sec, 10 secs
lola: sara is running 15 secs || 135895 markings, 136070 edges, 3277 markings/sec, 15 secs
lola: sara is running 20 secs || 149633 markings, 149808 edges, 2748 markings/sec, 20 secs
lola: sara is running 25 secs || 163092 markings, 163303 edges, 2692 markings/sec, 25 secs
lola: sara is running 30 secs || 175221 markings, 175638 edges, 2426 markings/sec, 30 secs
lola: sara is running 35 secs || 187484 markings, 187956 edges, 2453 markings/sec, 35 secs
lola: sara is running 40 secs || 199370 markings, 199891 edges, 2377 markings/sec, 40 secs
lola: sara is running 45 secs || 211206 markings, 211798 edges, 2367 markings/sec, 45 secs
lola: sara is running 50 secs || 223053 markings, 224118 edges, 2369 markings/sec, 50 secs
lola: sara is running 55 secs || 234892 markings, 236096 edges, 2368 markings/sec, 55 secs
lola: sara is running 60 secs || 246748 markings, 248093 edges, 2371 markings/sec, 60 secs
lola: sara is running 65 secs || 258105 markings, 259723 edges, 2271 markings/sec, 65 secs
lola: sara is running 70 secs || 264506 markings, 266546 edges, 1280 markings/sec, 70 secs
lola: sara is running 75 secs || 269310 markings, 271876 edges, 961 markings/sec, 75 secs
lola: sara is running 80 secs || 273856 markings, 276938 edges, 909 markings/sec, 80 secs
lola: sara is running 85 secs || 278373 markings, 281944 edges, 903 markings/sec, 85 secs
lola: sara is running 90 secs || 282890 markings, 286948 edges, 903 markings/sec, 90 secs
lola: sara is running 95 secs || 287419 markings, 291985 edges, 906 markings/sec, 95 secs
lola: sara is running 100 secs || 292022 markings, 297106 edges, 921 markings/sec, 100 secs
lola: sara is running 105 secs || 296762 markings, 302346 edges, 948 markings/sec, 105 secs
lola: sara is running 110 secs || 301616 markings, 307756 edges, 971 markings/sec, 110 secs
lola: sara is running 115 secs || 306546 markings, 313214 edges, 986 markings/sec, 115 secs
lola: sara is running 120 secs || 311491 markings, 318705 edges, 989 markings/sec, 120 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 125 secs || 316427 markings, 324192 edges, 987 markings/sec, 125 secs
lola: sara is running 130 secs || 321368 markings, 329656 edges, 988 markings/sec, 130 secs
lola: sara is running 135 secs || 326299 markings, 335127 edges, 986 markings/sec, 135 secs
lola: sara is running 140 secs || 331220 markings, 340579 edges, 984 markings/sec, 140 secs

lola: sara is running 145 secs || 336149 markings, 346035 edges, 986 markings/sec, 145 secs
lola: sara is running 150 secs || 341015 markings, 351327 edges, 973 markings/sec, 150 secs
lola: sara is running 155 secs || 346439 markings, 356978 edges, 1085 markings/sec, 155 secs
lola: sara is running 160 secs || 352497 markings, 363231 edges, 1212 markings/sec, 160 secs
lola: sara is running 165 secs || 357879 markings, 368816 edges, 1076 markings/sec, 165 secs
lola: sara is running 170 secs || 363144 markings, 374081 edges, 1053 markings/sec, 170 secs
lola: sara is running 175 secs || 369986 markings, 380923 edges, 1368 markings/sec, 175 secs
lola: sara is running 180 secs || 377930 markings, 388877 edges, 1589 markings/sec, 180 secs
lola: sara is running 185 secs || 385600 markings, 396547 edges, 1534 markings/sec, 185 secs
lola: sara is running 190 secs || 393066 markings, 404013 edges, 1493 markings/sec, 190 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes no no no yes yes no yes
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 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-full"
echo " Input is HypertorusGrid-PT-d5k3p2b10, 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 r106-smll-152658636800166"
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 '' ReachabilityCardinality.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 ;