About the Execution of M4M.struct for HypercubeGrid-PT-C5K3P3B15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7975.310 | 1084391.00 | 2319136.00 | 3190.80 | TTTFTTTFFFFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K 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.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-structural
Input is HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-152658637500124
=====================================================================
--------------------
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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526801138576
BK_STOP 1526802222967
--------------------
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 HypercubeGrid-PT-C5K3P3B15 as instance name.
Using HypercubeGrid 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': False, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 296488, 'Memory': 4764.4, 'Tool': 'lola'}, {'Time': 304787, 'Memory': 4915.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola HypercubeGrid-PT-C5K3P3B15...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
HypercubeGrid-PT-C5K3P3B15: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
HypercubeGrid-PT-C5K3P3B15: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 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: 34263/65536 symbol table entries, 18076 collisions
lola: preprocessing...
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28593 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.task
lola: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3)))) : E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3))) : E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3)))) : A (G ((1 <= pb_d4_n2_2_2_1_2_2))) : E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1)))) : A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3)))) : E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1)))) : A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1)))) : E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4)))) : A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2)))) : A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1)))))) : A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2)))) : E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0))))) : E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2)))))) : E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1))) : A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_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: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 42070 markings, 42416 edges, 8414 markings/sec, 0 secs
lola: sara is running 5 secs || 72808 markings, 73188 edges, 6148 markings/sec, 5 secs
lola: sara is running 10 secs || 94592 markings, 94972 edges, 4357 markings/sec, 10 secs
lola: sara is running 15 secs || 112900 markings, 113397 edges, 3662 markings/sec, 15 secs
lola: sara is running 20 secs || 129289 markings, 129878 edges, 3278 markings/sec, 20 secs
lola: sara is running 25 secs || 145367 markings, 146001 edges, 3216 markings/sec, 25 secs
lola: sara is running 30 secs || 160502 markings, 161704 edges, 3027 markings/sec, 30 secs
lola: sara is running 35 secs || 175575 markings, 177022 edges, 3015 markings/sec, 35 secs
lola: sara is running 40 secs || 190711 markings, 192210 edges, 3027 markings/sec, 40 secs
lola: sara is running 45 secs || 205621 markings, 207217 edges, 2982 markings/sec, 45 secs
lola: sara is running 50 secs || 220621 markings, 222366 edges, 3000 markings/sec, 50 secs
lola: sara is running 55 secs || 235540 markings, 237429 edges, 2984 markings/sec, 55 secs
lola: sara is running 60 secs || 250021 markings, 252034 edges, 2896 markings/sec, 60 secs
lola: sara is running 65 secs || 264345 markings, 266453 edges, 2865 markings/sec, 65 secs
lola: sara is running 70 secs || 278742 markings, 280940 edges, 2879 markings/sec, 70 secs
lola: sara is running 75 secs || 293297 markings, 295666 edges, 2911 markings/sec, 75 secs
lola: sara is running 80 secs || 308317 markings, 310889 edges, 3004 markings/sec, 80 secs
lola: sara is running 85 secs || 323298 markings, 326084 edges, 2996 markings/sec, 85 secs
lola: sara is running 90 secs || 338258 markings, 341592 edges, 2992 markings/sec, 90 secs
lola: sara is running 95 secs || 353083 markings, 356531 edges, 2965 markings/sec, 95 secs
lola: sara is running 100 secs || 366403 markings, 370059 edges, 2664 markings/sec, 100 secs
lola: sara is running 105 secs || 380076 markings, 383876 edges, 2735 markings/sec, 105 secs
lola: sara is running 110 secs || 391238 markings, 395985 edges, 2232 markings/sec, 110 secs
lola: sara is running 115 secs || 402588 markings, 408136 edges, 2270 markings/sec, 115 secs
lola: sara is running 120 secs || 414134 markings, 419878 edges, 2309 markings/sec, 120 secs
lola: sara is running 125 secs || 425716 markings, 431593 edges, 2316 markings/sec, 125 secs
lola: sara is running 130 secs || 437158 markings, 443234 edges, 2288 markings/sec, 130 secs
lola: sara is running 135 secs || 448706 markings, 455043 edges, 2310 markings/sec, 135 secs
lola: sara is running 140 secs || 460326 markings, 466918 edges, 2324 markings/sec, 140 secs
lola: sara is running 145 secs || 471755 markings, 478654 edges, 2286 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 483251 markings, 490546 edges, 2299 markings/sec, 150 secs
lola: sara is running 155 secs || 493889 markings, 501266 edges, 2128 markings/sec, 155 secs
lola: sara is running 160 secs || 504573 markings, 511967 edges, 2137 markings/sec, 160 secs
lola: sara is running 165 secs || 514067 markings, 521715 edges, 1899 markings/sec, 165 secs
lola: sara is running 170 secs || 523580 markings, 531617 edges, 1903 markings/sec, 170 secs
lola: sara is running 175 secs || 533115 markings, 541313 edges, 1907 markings/sec, 175 secs
lola: sara is running 180 secs || 542607 markings, 551118 edges, 1898 markings/sec, 180 secs
lola: sara is running 185 secs || 552140 markings, 560703 edges, 1907 markings/sec, 185 secs
lola: sara is running 190 secs || 561254 markings, 570404 edges, 1823 markings/sec, 190 secs
lola: sara is running 195 secs || 570335 markings, 579719 edges, 1816 markings/sec, 195 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d4_n2_2_2_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 54175 markings, 55367 edges, 10835 markings/sec, 0 secs
lola: sara is running 5 secs || 84339 markings, 85643 edges, 6033 markings/sec, 5 secs
lola: sara is running 10 secs || 108712 markings, 110269 edges, 4875 markings/sec, 10 secs
lola: sara is running 15 secs || 129499 markings, 131446 edges, 4157 markings/sec, 15 secs
lola: sara is running 20 secs || 149316 markings, 151338 edges, 3963 markings/sec, 20 secs
lola: sara is running 25 secs || 167920 markings, 170459 edges, 3721 markings/sec, 25 secs
lola: sara is running 30 secs || 185396 markings, 187957 edges, 3495 markings/sec, 30 secs
lola: sara is running 35 secs || 201349 markings, 204528 edges, 3191 markings/sec, 35 secs
lola: sara is running 40 secs || 216788 markings, 221131 edges, 3088 markings/sec, 40 secs
lola: sara is running 45 secs || 232424 markings, 237177 edges, 3127 markings/sec, 45 secs
lola: sara is running 50 secs || 248155 markings, 253093 edges, 3146 markings/sec, 50 secs
lola: sara is running 55 secs || 264128 markings, 269268 edges, 3195 markings/sec, 55 secs
lola: sara is running 60 secs || 279920 markings, 285109 edges, 3158 markings/sec, 60 secs
lola: sara is running 65 secs || 295098 markings, 300731 edges, 3036 markings/sec, 65 secs
lola: sara is running 70 secs || 310180 markings, 316374 edges, 3016 markings/sec, 70 secs
lola: sara is running 75 secs || 325365 markings, 332490 edges, 3037 markings/sec, 75 secs
lola: sara is running 80 secs || 340381 markings, 348281 edges, 3003 markings/sec, 80 secs
lola: sara is running 85 secs || 355322 markings, 363982 edges, 2988 markings/sec, 85 secs
lola: sara is running 90 secs || 370523 markings, 379997 edges, 3040 markings/sec, 90 secs
lola: sara is running 95 secs || 385983 markings, 396092 edges, 3092 markings/sec, 95 secs
lola: sara is running 100 secs || 401383 markings, 412163 edges, 3080 markings/sec, 100 secs
lola: sara is running 105 secs || 416414 markings, 427762 edges, 3006 markings/sec, 105 secs
lola: sara is running 110 secs || 431407 markings, 443325 edges, 2999 markings/sec, 110 secs
lola: sara is running 115 secs || 446460 markings, 458941 edges, 3011 markings/sec, 115 secs
lola: sara is running 120 secs || 461518 markings, 474568 edges, 3012 markings/sec, 120 secs
lola: sara is running 125 secs || 476596 markings, 490268 edges, 3016 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 491699 markings, 506012 edges, 3021 markings/sec, 130 secs
lola: sara is running 135 secs || 506829 markings, 521778 edges, 3026 markings/sec, 135 secs
lola: sara is running 140 secs || 521908 markings, 537436 edges, 3016 markings/sec, 140 secs
lola: sara is running 145 secs || 536776 markings, 552849 edges, 2974 markings/sec, 145 secs
lola: sara is running 150 secs || 551696 markings, 568286 edges, 2984 markings/sec, 150 secs
lola: sara is running 155 secs || 566543 markings, 583645 edges, 2969 markings/sec, 155 secs
lola: sara is running 160 secs || 581307 markings, 598894 edges, 2953 markings/sec, 160 secs
lola: sara is running 165 secs || 596158 markings, 614217 edges, 2970 markings/sec, 165 secs
lola: sara is running 170 secs || 610918 markings, 629434 edges, 2952 markings/sec, 170 secs
lola: sara is running 175 secs || 625712 markings, 644715 edges, 2959 markings/sec, 175 secs
lola: sara is running 180 secs || 640714 markings, 660441 edges, 3000 markings/sec, 180 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_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 22676 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 349 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_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 22676 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 HypercubeGrid-PT-C5K3P3B15-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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4))))
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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 61052 markings, 61513 edges, 12210 markings/sec, 0 secs
lola: sara is running 5 secs || 93255 markings, 94310 edges, 6441 markings/sec, 5 secs
lola: sara is running 10 secs || 119594 markings, 120929 edges, 5268 markings/sec, 10 secs
lola: sara is running 15 secs || 141401 markings, 142784 edges, 4361 markings/sec, 15 secs
lola: sara is running 20 secs || 161637 markings, 163269 edges, 4047 markings/sec, 20 secs
lola: sara is running 25 secs || 182436 markings, 184341 edges, 4160 markings/sec, 25 secs
lola: sara is running 30 secs || 203963 markings, 206118 edges, 4305 markings/sec, 30 secs
lola: sara is running 35 secs || 226848 markings, 229201 edges, 4577 markings/sec, 35 secs
lola: sara is running 40 secs || 250928 markings, 253281 edges, 4816 markings/sec, 40 secs
lola: sara is running 45 secs || 275026 markings, 277379 edges, 4820 markings/sec, 45 secs
lola: sara is running 50 secs || 298987 markings, 301340 edges, 4792 markings/sec, 50 secs
lola: sara is running 55 secs || 323169 markings, 325542 edges, 4836 markings/sec, 55 secs
lola: sara is running 60 secs || 347341 markings, 349715 edges, 4834 markings/sec, 60 secs
lola: sara is running 65 secs || 371116 markings, 373490 edges, 4755 markings/sec, 65 secs
lola: sara is running 70 secs || 395038 markings, 397448 edges, 4784 markings/sec, 70 secs
lola: sara is running 75 secs || 418794 markings, 421209 edges, 4751 markings/sec, 75 secs
lola: sara is running 80 secs || 442573 markings, 445110 edges, 4756 markings/sec, 80 secs
lola: sara is running 85 secs || 465513 markings, 469941 edges, 4588 markings/sec, 85 secs
lola: sara is running 90 secs || 487599 markings, 495688 edges, 4417 markings/sec, 90 secs
lola: sara is running 95 secs || 509868 markings, 522760 edges, 4454 markings/sec, 95 secs
lola: sara is running 100 secs || 533597 markings, 551157 edges, 4746 markings/sec, 100 secs
lola: sara is running 105 secs || 557333 markings, 579346 edges, 4747 markings/sec, 105 secs
lola: sara is running 110 secs || 580934 markings, 609263 edges, 4720 markings/sec, 110 secs
lola: sara is running 115 secs || 604267 markings, 637286 edges, 4667 markings/sec, 115 secs
lola: sara is running 120 secs || 626134 markings, 665278 edges, 4373 markings/sec, 120 secs
lola: sara is running 125 secs || 647588 markings, 692284 edges, 4291 markings/sec, 125 secs
lola: sara is running 130 secs || 669044 markings, 719596 edges, 4291 markings/sec, 130 secs
lola: sara is running 135 secs || 690502 markings, 747164 edges, 4292 markings/sec, 135 secs
lola: sara is running 140 secs || 712031 markings, 776130 edges, 4306 markings/sec, 140 secs
lola: sara is running 145 secs || 734502 markings, 808449 edges, 4494 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 757037 markings, 838773 edges, 4507 markings/sec, 150 secs
lola: sara is running 155 secs || 780577 markings, 867094 edges, 4708 markings/sec, 155 secs
lola: sara is running 160 secs || 804133 markings, 896337 edges, 4711 markings/sec, 160 secs
lola: sara is running 165 secs || 827698 markings, 925262 edges, 4713 markings/sec, 165 secs
lola: sara is running 170 secs || 851237 markings, 954916 edges, 4708 markings/sec, 170 secs
lola: sara is running 175 secs || 874730 markings, 985567 edges, 4699 markings/sec, 175 secs
lola: sara is running 180 secs || 898261 markings, 1015987 edges, 4706 markings/sec, 180 secs
lola: sara is running 185 secs || 921727 markings, 1046166 edges, 4693 markings/sec, 185 secs
lola: sara is running 190 secs || 945047 markings, 1079648 edges, 4664 markings/sec, 190 secs
lola: sara is running 195 secs || 968303 markings, 1113076 edges, 4651 markings/sec, 195 secs
lola: sara is running 200 secs || 991321 markings, 1141634 edges, 4604 markings/sec, 200 secs
lola: sara is running 205 secs || 1012732 markings, 1168414 edges, 4282 markings/sec, 205 secs
lola: sara is running 210 secs || 1036029 markings, 1198888 edges, 4659 markings/sec, 210 secs
lola: sara is running 215 secs || 1059548 markings, 1229500 edges, 4704 markings/sec, 215 secs
lola: sara is running 220 secs || 1082984 markings, 1260072 edges, 4687 markings/sec, 220 secs
lola: sara is running 225 secs || 1106285 markings, 1293832 edges, 4660 markings/sec, 225 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 47440 markings, 47951 edges, 9488 markings/sec, 0 secs
lola: sara is running 5 secs || 79709 markings, 80504 edges, 6454 markings/sec, 5 secs
lola: sara is running 10 secs || 110696 markings, 111857 edges, 6197 markings/sec, 10 secs
lola: sara is running 15 secs || 140847 markings, 142394 edges, 6030 markings/sec, 15 secs
lola: sara is running 20 secs || 173530 markings, 175140 edges, 6537 markings/sec, 20 secs
lola: sara is running 25 secs || 206853 markings, 208462 edges, 6665 markings/sec, 25 secs
lola: sara is running 30 secs || 239277 markings, 240887 edges, 6485 markings/sec, 30 secs
lola: sara is running 35 secs || 271325 markings, 272955 edges, 6410 markings/sec, 35 secs
lola: sara is running 40 secs || 304094 markings, 305725 edges, 6554 markings/sec, 40 secs
lola: sara is running 45 secs || 335655 markings, 337371 edges, 6312 markings/sec, 45 secs
lola: sara is running 50 secs || 366156 markings, 367883 edges, 6100 markings/sec, 50 secs
lola: sara is running 55 secs || 398830 markings, 400575 edges, 6535 markings/sec, 55 secs
lola: sara is running 60 secs || 431657 markings, 433426 edges, 6565 markings/sec, 60 secs
lola: sara is running 65 secs || 464298 markings, 466078 edges, 6528 markings/sec, 65 secs
lola: sara is running 70 secs || 496963 markings, 498763 edges, 6533 markings/sec, 70 secs
lola: sara is running 75 secs || 529225 markings, 531095 edges, 6452 markings/sec, 75 secs
lola: sara is running 80 secs || 561692 markings, 563608 edges, 6493 markings/sec, 80 secs
lola: sara is running 85 secs || 594152 markings, 596080 edges, 6492 markings/sec, 85 secs
lola: sara is running 90 secs || 626353 markings, 628414 edges, 6440 markings/sec, 90 secs
lola: sara is running 95 secs || 658367 markings, 660428 edges, 6403 markings/sec, 95 secs
lola: sara is running 100 secs || 690392 markings, 692458 edges, 6405 markings/sec, 100 secs
lola: sara is running 105 secs || 722530 markings, 724635 edges, 6428 markings/sec, 105 secs
lola: sara is running 110 secs || 754363 markings, 756664 edges, 6367 markings/sec, 110 secs
lola: sara is running 115 secs || 786371 markings, 788853 edges, 6402 markings/sec, 115 secs
lola: sara is running 120 secs || 818524 markings, 821042 edges, 6431 markings/sec, 120 secs
lola: sara is running 125 secs || 850793 markings, 853350 edges, 6454 markings/sec, 125 secs
lola: sara is running 130 secs || 882961 markings, 885552 edges, 6434 markings/sec, 130 secs
lola: sara is running 135 secs || 914738 markings, 917365 edges, 6355 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 946447 markings, 949095 edges, 6342 markings/sec, 140 secs
lola: sara is running 145 secs || 977978 markings, 980626 edges, 6306 markings/sec, 145 secs
lola: sara is running 150 secs || 1009989 markings, 1012687 edges, 6402 markings/sec, 150 secs
lola: sara is running 155 secs || 1041771 markings, 1044520 edges, 6356 markings/sec, 155 secs
lola: sara is running 160 secs || 1072555 markings, 1075304 edges, 6157 markings/sec, 160 secs
lola: sara is running 165 secs || 1103411 markings, 1106160 edges, 6171 markings/sec, 165 secs
lola: sara is running 170 secs || 1133940 markings, 1136801 edges, 6106 markings/sec, 170 secs
lola: sara is running 175 secs || 1164611 markings, 1167476 edges, 6134 markings/sec, 175 secs
lola: sara is running 180 secs || 1194943 markings, 1197808 edges, 6066 markings/sec, 180 secs
lola: sara is running 185 secs || 1225179 markings, 1228044 edges, 6047 markings/sec, 185 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_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 22676 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_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 22676 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)
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10.sara.
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 HypercubeGrid-PT-C5K3P3B15-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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0)))))
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 22676 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 46248 markings, 47337 edges, 9250 markings/sec, 0 secs
lola: sara is running 5 secs || 100128 markings, 101990 edges, 10776 markings/sec, 5 secs
lola: sara is running 10 secs || 134332 markings, 136813 edges, 6841 markings/sec, 10 secs
lola: sara is running 15 secs || 167168 markings, 170344 edges, 6567 markings/sec, 15 secs
lola: sara is running 20 secs || 187987 markings, 191326 edges, 4164 markings/sec, 20 secs
lola: sara is running 25 secs || 206191 markings, 209653 edges, 3641 markings/sec, 25 secs
lola: sara is running 30 secs || 224277 markings, 228352 edges, 3617 markings/sec, 30 secs
lola: sara is running 35 secs || 242716 markings, 247110 edges, 3688 markings/sec, 35 secs
lola: sara is running 40 secs || 261008 markings, 265869 edges, 3658 markings/sec, 40 secs
lola: sara is running 45 secs || 276041 markings, 281281 edges, 3007 markings/sec, 45 secs
lola: sara is running 50 secs || 290316 markings, 295624 edges, 2855 markings/sec, 50 secs
lola: sara is running 55 secs || 302924 markings, 308253 edges, 2522 markings/sec, 55 secs
lola: sara is running 60 secs || 314648 markings, 320296 edges, 2345 markings/sec, 60 secs
lola: sara is running 65 secs || 325631 markings, 331343 edges, 2197 markings/sec, 65 secs
lola: sara is running 70 secs || 336067 markings, 341786 edges, 2087 markings/sec, 70 secs
lola: sara is running 75 secs || 346141 markings, 352201 edges, 2015 markings/sec, 75 secs
lola: sara is running 80 secs || 356031 markings, 362337 edges, 1978 markings/sec, 80 secs
lola: sara is running 85 secs || 366232 markings, 372585 edges, 2040 markings/sec, 85 secs
lola: sara is running 90 secs || 376206 markings, 383154 edges, 1995 markings/sec, 90 secs
lola: sara is running 95 secs || 385968 markings, 393537 edges, 1952 markings/sec, 95 secs
lola: sara is running 100 secs || 395765 markings, 403793 edges, 1959 markings/sec, 100 secs
lola: sara is running 105 secs || 405628 markings, 413742 edges, 1973 markings/sec, 105 secs
lola: sara is running 110 secs || 415563 markings, 423777 edges, 1987 markings/sec, 110 secs
lola: sara is running 115 secs || 425530 markings, 433870 edges, 1993 markings/sec, 115 secs
lola: sara is running 120 secs || 435720 markings, 444275 edges, 2038 markings/sec, 120 secs
lola: sara is running 125 secs || 445899 markings, 454680 edges, 2036 markings/sec, 125 secs
lola: sara is running 130 secs || 455895 markings, 464891 edges, 1999 markings/sec, 130 secs
lola: sara is running 135 secs || 465815 markings, 474814 edges, 1984 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 475531 markings, 484574 edges, 1943 markings/sec, 140 secs
lola: sara is running 145 secs || 485748 markings, 494880 edges, 2043 markings/sec, 145 secs
lola: sara is running 150 secs || 496202 markings, 505476 edges, 2091 markings/sec, 150 secs
lola: sara is running 155 secs || 506669 markings, 516078 edges, 2093 markings/sec, 155 secs
lola: sara is running 160 secs || 517092 markings, 526643 edges, 2085 markings/sec, 160 secs
lola: sara is running 165 secs || 527485 markings, 537204 edges, 2079 markings/sec, 165 secs
lola: sara is running 170 secs || 537831 markings, 547816 edges, 2069 markings/sec, 170 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 175 secs || 548167 markings, 558418 edges, 2067 markings/sec, 175 secs
lola: sara is running 180 secs || 558500 markings, 569017 edges, 2067 markings/sec, 180 secs
lola: sara is running 185 secs || 568129 markings, 578694 edges, 1926 markings/sec, 185 secs
lola: sara is running 190 secs || 577689 markings, 588278 edges, 1912 markings/sec, 190 secs
lola: sara is running 195 secs || 586771 markings, 597369 edges, 1816 markings/sec, 195 secs
lola: sara is running 200 secs || 595262 markings, 605937 edges, 1698 markings/sec, 200 secs
lola: sara is running 205 secs || 603851 markings, 614746 edges, 1718 markings/sec, 205 secs
lola: sara is running 210 secs || 612523 markings, 623522 edges, 1734 markings/sec, 210 secs
lola: sara is running 215 secs || 621149 markings, 632417 edges, 1725 markings/sec, 215 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 834 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_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 22676 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 7 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 14 will run for 1251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_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 22676 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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 15 will run for 2502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_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 22676 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15.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: 5 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no no no no no no yes yes no
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypercubeGrid-PT-C5K3P3B15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C5K3P3B15.tgz
mv HypercubeGrid-PT-C5K3P3B15 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is HypercubeGrid-PT-C5K3P3B15, 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 r107-smll-152658637500124"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;