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 irma4mcc-structural
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 r103-smll-152658633600166
=====================================================================

--------------------
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 1526732189458


BK_STOP 1526733176003

--------------------
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 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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 || 35318 markings, 35641 edges, 7064 markings/sec, 0 secs
lola: sara is running 5 secs || 57913 markings, 58386 edges, 4519 markings/sec, 5 secs
lola: sara is running 10 secs || 76813 markings, 77582 edges, 3780 markings/sec, 10 secs
lola: sara is running 15 secs || 93322 markings, 94171 edges, 3302 markings/sec, 15 secs
lola: sara is running 20 secs || 108275 markings, 109359 edges, 2991 markings/sec, 20 secs
lola: sara is running 25 secs || 122312 markings, 123762 edges, 2807 markings/sec, 25 secs
lola: sara is running 30 secs || 135709 markings, 137401 edges, 2679 markings/sec, 30 secs
lola: sara is running 35 secs || 148516 markings, 150340 edges, 2561 markings/sec, 35 secs
lola: sara is running 40 secs || 160235 markings, 162084 edges, 2344 markings/sec, 40 secs
lola: sara is running 45 secs || 172180 markings, 174037 edges, 2389 markings/sec, 45 secs
lola: sara is running 50 secs || 182854 markings, 184955 edges, 2135 markings/sec, 50 secs
lola: sara is running 55 secs || 193040 markings, 195771 edges, 2037 markings/sec, 55 secs
lola: sara is running 60 secs || 202746 markings, 205479 edges, 1941 markings/sec, 60 secs
lola: sara is running 65 secs || 212305 markings, 215599 edges, 1912 markings/sec, 65 secs
lola: sara is running 70 secs || 221644 markings, 225924 edges, 1868 markings/sec, 70 secs
lola: sara is running 75 secs || 230939 markings, 235966 edges, 1859 markings/sec, 75 secs
lola: sara is running 80 secs || 240107 markings, 245259 edges, 1834 markings/sec, 80 secs
lola: sara is running 85 secs || 248706 markings, 253858 edges, 1720 markings/sec, 85 secs
lola: sara is running 90 secs || 257007 markings, 262216 edges, 1660 markings/sec, 90 secs
lola: sara is running 95 secs || 265077 markings, 270330 edges, 1614 markings/sec, 95 secs
lola: sara is running 100 secs || 273016 markings, 278285 edges, 1588 markings/sec, 100 secs
lola: sara is running 105 secs || 280402 markings, 285749 edges, 1477 markings/sec, 105 secs
lola: sara is running 110 secs || 287737 markings, 293100 edges, 1467 markings/sec, 110 secs
lola: sara is running 115 secs || 295168 markings, 300581 edges, 1486 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 302315 markings, 307764 edges, 1429 markings/sec, 120 secs

lola: sara is running 125 secs || 309260 markings, 314734 edges, 1389 markings/sec, 125 secs
lola: sara is running 130 secs || 316164 markings, 321664 edges, 1381 markings/sec, 130 secs
lola: sara is running 135 secs || 323120 markings, 328620 edges, 1391 markings/sec, 135 secs
lola: sara is running 140 secs || 329793 markings, 335576 edges, 1335 markings/sec, 140 secs
lola: sara is running 145 secs || 336538 markings, 342362 edges, 1349 markings/sec, 145 secs
lola: sara is running 150 secs || 343327 markings, 349199 edges, 1358 markings/sec, 150 secs
lola: sara is running 155 secs || 350091 markings, 355987 edges, 1353 markings/sec, 155 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 337 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 || 24680 markings, 26596 edges, 4936 markings/sec, 0 secs
lola: sara is running 5 secs || 44612 markings, 47992 edges, 3986 markings/sec, 5 secs
lola: sara is running 10 secs || 63729 markings, 68517 edges, 3823 markings/sec, 10 secs
lola: sara is running 15 secs || 82097 markings, 88224 edges, 3674 markings/sec, 15 secs
lola: sara is running 20 secs || 99627 markings, 107036 edges, 3506 markings/sec, 20 secs
lola: sara is running 25 secs || 117120 markings, 125776 edges, 3499 markings/sec, 25 secs
lola: sara is running 30 secs || 134020 markings, 143879 edges, 3380 markings/sec, 30 secs
lola: sara is running 35 secs || 159817 markings, 170274 edges, 5159 markings/sec, 35 secs
lola: sara is running 40 secs || 183950 markings, 194669 edges, 4827 markings/sec, 40 secs
lola: sara is running 45 secs || 202221 markings, 213001 edges, 3654 markings/sec, 45 secs
lola: sara is running 50 secs || 219189 markings, 230154 edges, 3394 markings/sec, 50 secs
lola: sara is running 55 secs || 234626 markings, 245675 edges, 3087 markings/sec, 55 secs
lola: sara is running 60 secs || 249431 markings, 260946 edges, 2961 markings/sec, 60 secs
lola: sara is running 65 secs || 264296 markings, 275885 edges, 2973 markings/sec, 65 secs
lola: sara is running 70 secs || 278836 markings, 290445 edges, 2908 markings/sec, 70 secs
lola: sara is running 75 secs || 292004 markings, 303619 edges, 2634 markings/sec, 75 secs
lola: sara is running 80 secs || 304933 markings, 316548 edges, 2586 markings/sec, 80 secs
lola: sara is running 85 secs || 316635 markings, 328250 edges, 2340 markings/sec, 85 secs
lola: sara is running 90 secs || 327346 markings, 339042 edges, 2142 markings/sec, 90 secs
lola: sara is running 95 secs || 339420 markings, 351325 edges, 2415 markings/sec, 95 secs
lola: sara is running 100 secs || 351558 markings, 363665 edges, 2428 markings/sec, 100 secs
lola: sara is running 105 secs || 363695 markings, 375979 edges, 2427 markings/sec, 105 secs
lola: sara is running 110 secs || 375774 markings, 388279 edges, 2416 markings/sec, 110 secs
lola: sara is running 115 secs || 388266 markings, 400894 edges, 2498 markings/sec, 115 secs
lola: sara is running 120 secs || 402433 markings, 415061 edges, 2833 markings/sec, 120 secs
lola: sara is running 125 secs || 416637 markings, 429265 edges, 2841 markings/sec, 125 secs
lola: sara is running 130 secs || 430823 markings, 443451 edges, 2837 markings/sec, 130 secs
lola: sara is running 135 secs || 445004 markings, 457632 edges, 2836 markings/sec, 135 secs
lola: sara is running 140 secs || 459176 markings, 471804 edges, 2834 markings/sec, 140 secs
lola: sara is running 145 secs || 473370 markings, 486001 edges, 2839 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 487592 markings, 500228 edges, 2844 markings/sec, 150 secs
lola: sara is running 155 secs || 501796 markings, 514438 edges, 2841 markings/sec, 155 secs

lola: sara is running 160 secs || 516006 markings, 528653 edges, 2842 markings/sec, 160 secs
lola: sara is running 165 secs || 530253 markings, 542906 edges, 2849 markings/sec, 165 secs
lola: sara is running 170 secs || 544466 markings, 557124 edges, 2843 markings/sec, 170 secs
lola: sara is running 175 secs || 558680 markings, 571343 edges, 2843 markings/sec, 175 secs
lola: sara is running 180 secs || 572883 markings, 585551 edges, 2841 markings/sec, 180 secs
lola: sara is running 185 secs || 587087 markings, 599760 edges, 2841 markings/sec, 185 secs
lola: sara is running 190 secs || 601281 markings, 613960 edges, 2839 markings/sec, 190 secs
lola: sara is running 195 secs || 615519 markings, 628202 edges, 2848 markings/sec, 195 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: 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 || 26300 markings, 29549 edges, 5260 markings/sec, 0 secs
lola: sara is running 5 secs || 47354 markings, 52958 edges, 4211 markings/sec, 5 secs
lola: sara is running 10 secs || 65194 markings, 71462 edges, 3568 markings/sec, 10 secs
lola: sara is running 15 secs || 83081 markings, 89927 edges, 3577 markings/sec, 15 secs
lola: sara is running 20 secs || 101903 markings, 109359 edges, 3764 markings/sec, 20 secs
lola: sara is running 25 secs || 120166 markings, 128183 edges, 3653 markings/sec, 25 secs
lola: sara is running 30 secs || 137766 markings, 146344 edges, 3520 markings/sec, 30 secs
lola: sara is running 35 secs || 155611 markings, 164768 edges, 3569 markings/sec, 35 secs
lola: sara is running 40 secs || 173185 markings, 182891 edges, 3515 markings/sec, 40 secs
lola: sara is running 45 secs || 189453 markings, 199681 edges, 3254 markings/sec, 45 secs
lola: sara is running 50 secs || 206084 markings, 216840 edges, 3326 markings/sec, 50 secs
lola: sara is running 55 secs || 222347 markings, 233629 edges, 3253 markings/sec, 55 secs
lola: sara is running 60 secs || 238517 markings, 250296 edges, 3234 markings/sec, 60 secs
lola: sara is running 65 secs || 253567 markings, 265830 edges, 3010 markings/sec, 65 secs
lola: sara is running 70 secs || 268898 markings, 281634 edges, 3066 markings/sec, 70 secs
lola: sara is running 75 secs || 283805 markings, 297010 edges, 2981 markings/sec, 75 secs
lola: sara is running 80 secs || 298445 markings, 312107 edges, 2928 markings/sec, 80 secs
lola: sara is running 85 secs || 313095 markings, 327229 edges, 2930 markings/sec, 85 secs
lola: sara is running 90 secs || 328081 markings, 342705 edges, 2997 markings/sec, 90 secs
lola: sara is running 95 secs || 342926 markings, 358059 edges, 2969 markings/sec, 95 secs
lola: sara is running 100 secs || 358281 markings, 373891 edges, 3071 markings/sec, 100 secs
lola: sara is running 105 secs || 372169 markings, 388304 edges, 2778 markings/sec, 105 secs
lola: sara is running 110 secs || 386080 markings, 402743 edges, 2782 markings/sec, 110 secs
lola: sara is running 115 secs || 400088 markings, 417280 edges, 2802 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 414409 markings, 432086 edges, 2864 markings/sec, 120 secs
lola: sara is running 125 secs || 429105 markings, 447295 edges, 2939 markings/sec, 125 secs
lola: sara is running 130 secs || 443563 markings, 462279 edges, 2892 markings/sec, 130 secs

lola: sara is running 135 secs || 457317 markings, 476589 edges, 2751 markings/sec, 135 secs
lola: sara is running 140 secs || 469601 markings, 489399 edges, 2457 markings/sec, 140 secs
lola: sara is running 145 secs || 481709 markings, 502026 edges, 2422 markings/sec, 145 secs
lola: sara is running 150 secs || 493242 markings, 514076 edges, 2307 markings/sec, 150 secs
lola: sara is running 155 secs || 503701 markings, 525176 edges, 2092 markings/sec, 155 secs
lola: sara is running 160 secs || 514723 markings, 536592 edges, 2204 markings/sec, 160 secs
lola: sara is running 165 secs || 525698 markings, 547952 edges, 2195 markings/sec, 165 secs
lola: sara is running 170 secs || 536805 markings, 559388 edges, 2221 markings/sec, 170 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 427 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: 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 499 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: 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 598 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: 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 748 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 998 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 1497 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 || 34154 markings, 35051 edges, 6831 markings/sec, 0 secs
lola: sara is running 5 secs || 58462 markings, 59474 edges, 4862 markings/sec, 5 secs
lola: sara is running 10 secs || 81526 markings, 83149 edges, 4613 markings/sec, 10 secs
lola: sara is running 15 secs || 104281 markings, 106157 edges, 4551 markings/sec, 15 secs
lola: sara is running 20 secs || 125757 markings, 127633 edges, 4295 markings/sec, 20 secs
lola: sara is running 25 secs || 144947 markings, 146823 edges, 3838 markings/sec, 25 secs
lola: sara is running 30 secs || 160816 markings, 162756 edges, 3174 markings/sec, 30 secs
lola: sara is running 35 secs || 174312 markings, 176646 edges, 2699 markings/sec, 35 secs
lola: sara is running 40 secs || 188254 markings, 191478 edges, 2788 markings/sec, 40 secs
lola: sara is running 45 secs || 202085 markings, 206710 edges, 2766 markings/sec, 45 secs
lola: sara is running 50 secs || 215974 markings, 222038 edges, 2778 markings/sec, 50 secs
lola: sara is running 55 secs || 229755 markings, 237143 edges, 2756 markings/sec, 55 secs
lola: sara is running 60 secs || 243397 markings, 252156 edges, 2728 markings/sec, 60 secs
lola: sara is running 65 secs || 257204 markings, 267393 edges, 2761 markings/sec, 65 secs
lola: sara is running 70 secs || 270970 markings, 282575 edges, 2753 markings/sec, 70 secs
lola: sara is running 75 secs || 284173 markings, 297040 edges, 2641 markings/sec, 75 secs
lola: sara is running 80 secs || 297528 markings, 311739 edges, 2671 markings/sec, 80 secs
lola: sara is running 85 secs || 311112 markings, 326728 edges, 2717 markings/sec, 85 secs
lola: sara is running 90 secs || 324365 markings, 341338 edges, 2651 markings/sec, 90 secs
lola: sara is running 95 secs || 338341 markings, 356660 edges, 2795 markings/sec, 95 secs
lola: sara is running 100 secs || 352340 markings, 371813 edges, 2800 markings/sec, 100 secs
lola: sara is running 105 secs || 365978 markings, 385451 edges, 2728 markings/sec, 105 secs
lola: sara is running 110 secs || 379313 markings, 398786 edges, 2667 markings/sec, 110 secs
lola: sara is running 115 secs || 392777 markings, 412250 edges, 2693 markings/sec, 115 secs
lola: sara is running 120 secs || 405368 markings, 424848 edges, 2518 markings/sec, 120 secs
lola: sara is running 125 secs || 415703 markings, 435409 edges, 2067 markings/sec, 125 secs
lola: sara is running 130 secs || 425934 markings, 445962 edges, 2046 markings/sec, 130 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 135 secs || 436389 markings, 456686 edges, 2091 markings/sec, 135 secs
lola: sara is running 140 secs || 447302 markings, 467799 edges, 2183 markings/sec, 140 secs
lola: sara is running 145 secs || 458289 markings, 478966 edges, 2197 markings/sec, 145 secs
lola: sara is running 150 secs || 468779 markings, 489822 edges, 2098 markings/sec, 150 secs

lola: sara is running 155 secs || 478529 markings, 499652 edges, 1950 markings/sec, 155 secs
lola: sara is running 160 secs || 488727 markings, 509958 edges, 2040 markings/sec, 160 secs
lola: sara is running 165 secs || 498955 markings, 520272 edges, 2046 markings/sec, 165 secs
lola: sara is running 170 secs || 509196 markings, 530602 edges, 2048 markings/sec, 170 secs
lola: sara is running 175 secs || 519179 markings, 540678 edges, 1997 markings/sec, 175 secs
lola: sara is running 180 secs || 529148 markings, 550740 edges, 1994 markings/sec, 180 secs
lola: sara is running 185 secs || 538924 markings, 560566 edges, 1955 markings/sec, 185 secs
lola: sara is running 190 secs || 548063 markings, 569791 edges, 1828 markings/sec, 190 secs
lola: sara is running 195 secs || 557819 markings, 579612 edges, 1951 markings/sec, 195 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 2791 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 || 48139 markings, 48169 edges, 9628 markings/sec, 0 secs
lola: sara is running 5 secs || 93121 markings, 93231 edges, 8996 markings/sec, 5 secs
lola: sara is running 10 secs || 118102 markings, 118223 edges, 4996 markings/sec, 10 secs
lola: sara is running 15 secs || 136106 markings, 136281 edges, 3601 markings/sec, 15 secs
lola: sara is running 20 secs || 151083 markings, 151258 edges, 2995 markings/sec, 20 secs
lola: sara is running 25 secs || 165211 markings, 165422 edges, 2826 markings/sec, 25 secs
lola: sara is running 30 secs || 177895 markings, 178328 edges, 2537 markings/sec, 30 secs
lola: sara is running 35 secs || 190750 markings, 191234 edges, 2571 markings/sec, 35 secs
lola: sara is running 40 secs || 203621 markings, 204159 edges, 2574 markings/sec, 40 secs
lola: sara is running 45 secs || 216547 markings, 217463 edges, 2585 markings/sec, 45 secs
lola: sara is running 50 secs || 229498 markings, 230639 edges, 2590 markings/sec, 50 secs
lola: sara is running 55 secs || 242437 markings, 243728 edges, 2588 markings/sec, 55 secs
lola: sara is running 60 secs || 255279 markings, 256722 edges, 2568 markings/sec, 60 secs
lola: sara is running 65 secs || 263828 markings, 265795 edges, 1710 markings/sec, 65 secs
lola: sara is running 70 secs || 268878 markings, 271398 edges, 1010 markings/sec, 70 secs
lola: sara is running 75 secs || 273857 markings, 276939 edges, 996 markings/sec, 75 secs
lola: sara is running 80 secs || 278869 markings, 282494 edges, 1002 markings/sec, 80 secs
lola: sara is running 85 secs || 283863 markings, 288025 edges, 999 markings/sec, 85 secs
lola: sara is running 90 secs || 288855 markings, 293591 edges, 998 markings/sec, 90 secs
lola: sara is running 95 secs || 293891 markings, 299171 edges, 1007 markings/sec, 95 secs
lola: sara is running 100 secs || 298922 markings, 304744 edges, 1006 markings/sec, 100 secs
lola: sara is running 105 secs || 303984 markings, 310372 edges, 1012 markings/sec, 105 secs
lola: sara is running 110 secs || 309131 markings, 316103 edges, 1029 markings/sec, 110 secs
lola: sara is running 115 secs || 314255 markings, 321782 edges, 1025 markings/sec, 115 secs
lola: sara is running 120 secs || 319390 markings, 327460 edges, 1027 markings/sec, 120 secs
lola: sara is running 125 secs || 324510 markings, 333155 edges, 1024 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 329612 markings, 338797 edges, 1020 markings/sec, 130 secs
lola: sara is running 135 secs || 334713 markings, 344431 edges, 1020 markings/sec, 135 secs
lola: sara is running 140 secs || 339808 markings, 350102 edges, 1019 markings/sec, 140 secs
lola: sara is running 145 secs || 345314 markings, 355673 edges, 1101 markings/sec, 145 secs

lola: sara is running 150 secs || 351275 markings, 361986 edges, 1192 markings/sec, 150 secs
lola: sara is running 155 secs || 357176 markings, 368107 edges, 1180 markings/sec, 155 secs
lola: sara is running 160 secs || 362592 markings, 373529 edges, 1083 markings/sec, 160 secs
lola: sara is running 165 secs || 369438 markings, 380375 edges, 1369 markings/sec, 165 secs
lola: sara is running 170 secs || 377746 markings, 388693 edges, 1662 markings/sec, 170 secs
lola: sara is running 175 secs || 385727 markings, 396675 edges, 1596 markings/sec, 175 secs
lola: sara is running 180 secs || 393489 markings, 404436 edges, 1552 markings/sec, 180 secs
lola: sara is running 185 secs || 401206 markings, 412222 edges, 1543 markings/sec, 185 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 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="HypertorusGrid-PT-d5k3p2b10"
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/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 irma4mcc-structural"
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 r103-smll-152658633600166"
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 ;