fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815400133
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FamilyReunion-COL-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.970 3600000.00 339613.00 871.50 51 51 51 51 51 3 51 51 51 51 51 51 51 51 51 51 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815400133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 4.4K Apr 1 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 1 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 1 13:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 1 13:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 1 10:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 1 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 137K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591187466185

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:31:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 12:31:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:31:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 12:31:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1030 ms
[2020-06-03 12:31:09] [INFO ] sort/places :
Response->r0,
LxM->m1,ml0,l2,m2,lm1,l3,m3,ml1,l4,lm2,m4,m5,l5,ml2,l6,lm3,m6,m7,ml3,l7,m9,m10,ml4,
CINFORMI->c2,c4,c7,c0,c1,
LxP->p1,p3,p2,p5,p4,p6,p9,pl0,pl1,
LegalResident->lm0,l12,l0,l30,l31,lc1,l1,l32,lc2,l33,lc3,l34,cg0,l35,lg0,l36,l8,l9,lm4,l38,l10,l11,l13,l16,l14,lc0,l15,l17,l18,lp0,l19,lp1,l20,l21,l22,l24,l25,l23,l28,l26,l27,l29,
LxC->c3,cl2,c5,c6,cl0,cl1,
LxR->gl1,l37,l39,l40,
GovernmentCommission->g0,g2,g4,
PublicAdminOffice->p0,p7,p8,p10,p11,
MICSystem->m0,m8,m11,
LxG->g1,gl0,g3,

[2020-06-03 12:31:09] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2020-06-03 12:31:09] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 61 ms.
[2020-06-03 12:31:09] [INFO ] Computed order based on color domains.
[2020-06-03 12:31:09] [INFO ] Unfolded HLPN to a Petri net with 12245 places and 10560 transitions in 162 ms.
[2020-06-03 12:31:09] [INFO ] Unfolded HLPN properties in 7 ms.
Deduced a syphon composed of 51 places in 83 ms
Reduce places removed 68 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 419 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 5 ms. (steps per millisecond=0 )
[2020-06-03 12:31:11] [INFO ] Flatten gal took : 1154 ms
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 7 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 10560 rows 12177 cols
[2020-06-03 12:31:13] [INFO ] Computed 2768 place invariants in 1632 ms
Support contains 1644 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Discarding 1392 places :
Also discarding 1377 output transitions
Drop transitions removed 1377 transitions
Graph (complete) has 18927 edges and 12177 vertex of which 10785 are kept as prefixes of interest. Removing 1392 places using SCC suffix rule.142 ms
Discarding 1530 places :
Implicit places reduction removed 1530 places
Performed 2550 Post agglomeration using F-continuation condition.Transition count delta: 2550
Iterating post reduction 0 with 4080 rules applied. Total rules applied 4081 place count 9255 transition count 6633
Reduce places removed 2550 places and 0 transitions.
Iterating post reduction 1 with 2550 rules applied. Total rules applied 6631 place count 6705 transition count 6633
Performed 714 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 714 Pre rules applied. Total rules applied 6631 place count 6705 transition count 5919
Deduced a syphon composed of 714 places in 11 ms
Ensure Unique test removed 408 places
Reduce places removed 1122 places and 0 transitions.
Iterating global reduction 2 with 1836 rules applied. Total rules applied 8467 place count 5583 transition count 5919
Discarding 204 places :
Implicit places reduction removed 204 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 255 rules applied. Total rules applied 8722 place count 5379 transition count 5868
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 8773 place count 5328 transition count 5868
Symmetric choice reduction at 4 with 918 rule applications. Total rules 9691 place count 5328 transition count 5868
Deduced a syphon composed of 918 places in 9 ms
Reduce places removed 918 places and 918 transitions.
Iterating global reduction 4 with 1836 rules applied. Total rules applied 11527 place count 4410 transition count 4950
Ensure Unique test removed 204 transitions
Reduce isomorphic transitions removed 204 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Iterating post reduction 4 with 561 rules applied. Total rules applied 12088 place count 4308 transition count 4491
Reduce places removed 255 places and 0 transitions.
Iterating post reduction 5 with 255 rules applied. Total rules applied 12343 place count 4053 transition count 4491
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 102 Pre rules applied. Total rules applied 12343 place count 4053 transition count 4389
Deduced a syphon composed of 102 places in 8 ms
Ensure Unique test removed 51 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 6 with 255 rules applied. Total rules applied 12598 place count 3900 transition count 4389
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 5 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 408 rules applied. Total rules applied 13006 place count 3696 transition count 4185
Free-agglomeration rule (complex) applied 612 times.
Iterating global reduction 6 with 612 rules applied. Total rules applied 13618 place count 3696 transition count 3573
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 6 with 612 rules applied. Total rules applied 14230 place count 3084 transition count 3573
Applied a total of 14230 rules in 4319 ms. Remains 3084 /12177 variables (removed 9093) and now considering 3573/10560 (removed 6987) transitions.
Finished structural reductions, in 1 iterations. Remains : 3084/12177 places, 3573/10560 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 3573 rows 3084 cols
[2020-06-03 12:31:17] [INFO ] Computed 211 place invariants in 107 ms
Support contains 1644 out of 3084 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3084/3084 places, 3573/3573 transitions.
Applied a total of 0 rules in 93 ms. Remains 3084 /3084 variables (removed 0) and now considering 3573/3573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3084/3084 places, 3573/3573 transitions.
Starting structural reductions, iteration 0 : 3084/3084 places, 3573/3573 transitions.
Applied a total of 0 rules in 178 ms. Remains 3084 /3084 variables (removed 0) and now considering 3573/3573 (removed 0) transitions.
// Phase 1: matrix 3573 rows 3084 cols
[2020-06-03 12:31:18] [INFO ] Computed 211 place invariants in 80 ms
[2020-06-03 12:31:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:31:23] [INFO ] Implicit Places using invariants in 5162 ms returned [357]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5169 ms to find 1 implicit places.
[2020-06-03 12:31:23] [INFO ] Redundant transitions in 457 ms returned []
// Phase 1: matrix 3573 rows 3083 cols
[2020-06-03 12:31:23] [INFO ] Computed 210 place invariants in 83 ms
[2020-06-03 12:31:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:31:46] [INFO ] Dead Transitions using invariants and state equation in 22742 ms returned []
Starting structural reductions, iteration 1 : 3083/3084 places, 3573/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3083 transition count 3567
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3077 transition count 3567
Applied a total of 12 rules in 153 ms. Remains 3077 /3083 variables (removed 6) and now considering 3567/3573 (removed 6) transitions.
// Phase 1: matrix 3567 rows 3077 cols
[2020-06-03 12:31:46] [INFO ] Computed 210 place invariants in 91 ms
[2020-06-03 12:31:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:31:51] [INFO ] Implicit Places using invariants in 5087 ms returned [351]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5092 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 3076/3084 places, 3567/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3076 transition count 3561
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3070 transition count 3561
Applied a total of 12 rules in 234 ms. Remains 3070 /3076 variables (removed 6) and now considering 3561/3567 (removed 6) transitions.
// Phase 1: matrix 3561 rows 3070 cols
[2020-06-03 12:31:52] [INFO ] Computed 209 place invariants in 116 ms
[2020-06-03 12:31:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:31:57] [INFO ] Implicit Places using invariants in 5644 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5651 ms to find 1 implicit places.
Starting structural reductions, iteration 3 : 3069/3084 places, 3561/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3069 transition count 3555
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3063 transition count 3555
Applied a total of 12 rules in 176 ms. Remains 3063 /3069 variables (removed 6) and now considering 3555/3561 (removed 6) transitions.
// Phase 1: matrix 3555 rows 3063 cols
[2020-06-03 12:31:57] [INFO ] Computed 208 place invariants in 77 ms
[2020-06-03 12:31:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:02] [INFO ] Implicit Places using invariants in 4528 ms returned [339]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4548 ms to find 1 implicit places.
Starting structural reductions, iteration 4 : 3062/3084 places, 3555/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3062 transition count 3549
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3056 transition count 3549
Applied a total of 12 rules in 231 ms. Remains 3056 /3062 variables (removed 6) and now considering 3549/3555 (removed 6) transitions.
// Phase 1: matrix 3549 rows 3056 cols
[2020-06-03 12:32:02] [INFO ] Computed 207 place invariants in 117 ms
[2020-06-03 12:32:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:07] [INFO ] Implicit Places using invariants in 5039 ms returned [333]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5043 ms to find 1 implicit places.
Starting structural reductions, iteration 5 : 3055/3084 places, 3549/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3055 transition count 3543
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3049 transition count 3543
Applied a total of 12 rules in 126 ms. Remains 3049 /3055 variables (removed 6) and now considering 3543/3549 (removed 6) transitions.
// Phase 1: matrix 3543 rows 3049 cols
[2020-06-03 12:32:07] [INFO ] Computed 206 place invariants in 74 ms
[2020-06-03 12:32:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:12] [INFO ] Implicit Places using invariants in 4630 ms returned [327]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4636 ms to find 1 implicit places.
Starting structural reductions, iteration 6 : 3048/3084 places, 3543/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3048 transition count 3537
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3042 transition count 3537
Applied a total of 12 rules in 204 ms. Remains 3042 /3048 variables (removed 6) and now considering 3537/3543 (removed 6) transitions.
// Phase 1: matrix 3537 rows 3042 cols
[2020-06-03 12:32:12] [INFO ] Computed 205 place invariants in 130 ms
[2020-06-03 12:32:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:17] [INFO ] Implicit Places using invariants in 5168 ms returned [321]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5172 ms to find 1 implicit places.
Starting structural reductions, iteration 7 : 3041/3084 places, 3537/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3041 transition count 3531
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3035 transition count 3531
Applied a total of 12 rules in 199 ms. Remains 3035 /3041 variables (removed 6) and now considering 3531/3537 (removed 6) transitions.
// Phase 1: matrix 3531 rows 3035 cols
[2020-06-03 12:32:18] [INFO ] Computed 204 place invariants in 117 ms
[2020-06-03 12:32:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:22] [INFO ] Implicit Places using invariants in 4593 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4595 ms to find 1 implicit places.
Starting structural reductions, iteration 8 : 3034/3084 places, 3531/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3034 transition count 3525
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3028 transition count 3525
Applied a total of 12 rules in 121 ms. Remains 3028 /3034 variables (removed 6) and now considering 3525/3531 (removed 6) transitions.
// Phase 1: matrix 3525 rows 3028 cols
[2020-06-03 12:32:22] [INFO ] Computed 203 place invariants in 73 ms
[2020-06-03 12:32:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:26] [INFO ] Implicit Places using invariants in 4298 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4302 ms to find 1 implicit places.
Starting structural reductions, iteration 9 : 3027/3084 places, 3525/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3027 transition count 3519
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3021 transition count 3519
Applied a total of 12 rules in 195 ms. Remains 3021 /3027 variables (removed 6) and now considering 3519/3525 (removed 6) transitions.
// Phase 1: matrix 3519 rows 3021 cols
[2020-06-03 12:32:27] [INFO ] Computed 202 place invariants in 117 ms
[2020-06-03 12:32:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:31] [INFO ] Implicit Places using invariants in 4494 ms returned [303]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4498 ms to find 1 implicit places.
Starting structural reductions, iteration 10 : 3020/3084 places, 3519/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3020 transition count 3513
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3014 transition count 3513
Applied a total of 12 rules in 199 ms. Remains 3014 /3020 variables (removed 6) and now considering 3513/3519 (removed 6) transitions.
// Phase 1: matrix 3513 rows 3014 cols
[2020-06-03 12:32:31] [INFO ] Computed 201 place invariants in 115 ms
[2020-06-03 12:32:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:36] [INFO ] Implicit Places using invariants in 4466 ms returned [297]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4471 ms to find 1 implicit places.
Starting structural reductions, iteration 11 : 3013/3084 places, 3513/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3013 transition count 3507
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3007 transition count 3507
Applied a total of 12 rules in 191 ms. Remains 3007 /3013 variables (removed 6) and now considering 3507/3513 (removed 6) transitions.
// Phase 1: matrix 3507 rows 3007 cols
[2020-06-03 12:32:36] [INFO ] Computed 200 place invariants in 118 ms
[2020-06-03 12:32:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:40] [INFO ] Implicit Places using invariants in 4407 ms returned [291]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4411 ms to find 1 implicit places.
Starting structural reductions, iteration 12 : 3006/3084 places, 3507/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3006 transition count 3501
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 3000 transition count 3501
Applied a total of 12 rules in 188 ms. Remains 3000 /3006 variables (removed 6) and now considering 3501/3507 (removed 6) transitions.
// Phase 1: matrix 3501 rows 3000 cols
[2020-06-03 12:32:41] [INFO ] Computed 199 place invariants in 116 ms
[2020-06-03 12:32:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:45] [INFO ] Implicit Places using invariants in 4169 ms returned [285]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4174 ms to find 1 implicit places.
Starting structural reductions, iteration 13 : 2999/3084 places, 3501/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2999 transition count 3495
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2993 transition count 3495
Applied a total of 12 rules in 185 ms. Remains 2993 /2999 variables (removed 6) and now considering 3495/3501 (removed 6) transitions.
// Phase 1: matrix 3495 rows 2993 cols
[2020-06-03 12:32:45] [INFO ] Computed 198 place invariants in 114 ms
[2020-06-03 12:32:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:49] [INFO ] Implicit Places using invariants in 4429 ms returned [279]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4432 ms to find 1 implicit places.
Starting structural reductions, iteration 14 : 2992/3084 places, 3495/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2992 transition count 3489
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2986 transition count 3489
Applied a total of 12 rules in 189 ms. Remains 2986 /2992 variables (removed 6) and now considering 3489/3495 (removed 6) transitions.
// Phase 1: matrix 3489 rows 2986 cols
[2020-06-03 12:32:50] [INFO ] Computed 197 place invariants in 116 ms
[2020-06-03 12:32:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:54] [INFO ] Implicit Places using invariants in 4273 ms returned [273]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4285 ms to find 1 implicit places.
Starting structural reductions, iteration 15 : 2985/3084 places, 3489/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2985 transition count 3483
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2979 transition count 3483
Applied a total of 12 rules in 183 ms. Remains 2979 /2985 variables (removed 6) and now considering 3483/3489 (removed 6) transitions.
// Phase 1: matrix 3483 rows 2979 cols
[2020-06-03 12:32:54] [INFO ] Computed 196 place invariants in 117 ms
[2020-06-03 12:32:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:32:58] [INFO ] Implicit Places using invariants in 4163 ms returned [267]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4168 ms to find 1 implicit places.
Starting structural reductions, iteration 16 : 2978/3084 places, 3483/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2978 transition count 3477
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2972 transition count 3477
Applied a total of 12 rules in 180 ms. Remains 2972 /2978 variables (removed 6) and now considering 3477/3483 (removed 6) transitions.
// Phase 1: matrix 3477 rows 2972 cols
[2020-06-03 12:32:59] [INFO ] Computed 195 place invariants in 115 ms
[2020-06-03 12:32:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:03] [INFO ] Implicit Places using invariants in 4302 ms returned [261]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4308 ms to find 1 implicit places.
Starting structural reductions, iteration 17 : 2971/3084 places, 3477/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2971 transition count 3471
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2965 transition count 3471
Applied a total of 12 rules in 180 ms. Remains 2965 /2971 variables (removed 6) and now considering 3471/3477 (removed 6) transitions.
// Phase 1: matrix 3471 rows 2965 cols
[2020-06-03 12:33:03] [INFO ] Computed 194 place invariants in 112 ms
[2020-06-03 12:33:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:07] [INFO ] Implicit Places using invariants in 3986 ms returned [255]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3989 ms to find 1 implicit places.
Starting structural reductions, iteration 18 : 2964/3084 places, 3471/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2964 transition count 3465
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2958 transition count 3465
Applied a total of 12 rules in 109 ms. Remains 2958 /2964 variables (removed 6) and now considering 3465/3471 (removed 6) transitions.
// Phase 1: matrix 3465 rows 2958 cols
[2020-06-03 12:33:07] [INFO ] Computed 193 place invariants in 71 ms
[2020-06-03 12:33:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:11] [INFO ] Implicit Places using invariants in 3878 ms returned [249]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3880 ms to find 1 implicit places.
Starting structural reductions, iteration 19 : 2957/3084 places, 3465/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2957 transition count 3459
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2951 transition count 3459
Applied a total of 12 rules in 107 ms. Remains 2951 /2957 variables (removed 6) and now considering 3459/3465 (removed 6) transitions.
// Phase 1: matrix 3459 rows 2951 cols
[2020-06-03 12:33:11] [INFO ] Computed 192 place invariants in 72 ms
[2020-06-03 12:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:15] [INFO ] Implicit Places using invariants in 3957 ms returned [243]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3962 ms to find 1 implicit places.
Starting structural reductions, iteration 20 : 2950/3084 places, 3459/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2950 transition count 3453
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2944 transition count 3453
Applied a total of 12 rules in 175 ms. Remains 2944 /2950 variables (removed 6) and now considering 3453/3459 (removed 6) transitions.
// Phase 1: matrix 3453 rows 2944 cols
[2020-06-03 12:33:15] [INFO ] Computed 191 place invariants in 112 ms
[2020-06-03 12:33:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:19] [INFO ] Implicit Places using invariants in 3988 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3991 ms to find 1 implicit places.
Starting structural reductions, iteration 21 : 2943/3084 places, 3453/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2943 transition count 3447
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2937 transition count 3447
Applied a total of 12 rules in 109 ms. Remains 2937 /2943 variables (removed 6) and now considering 3447/3453 (removed 6) transitions.
// Phase 1: matrix 3447 rows 2937 cols
[2020-06-03 12:33:19] [INFO ] Computed 190 place invariants in 73 ms
[2020-06-03 12:33:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:24] [INFO ] Implicit Places using invariants in 4745 ms returned [231]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4748 ms to find 1 implicit places.
Starting structural reductions, iteration 22 : 2936/3084 places, 3447/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2936 transition count 3441
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2930 transition count 3441
Applied a total of 12 rules in 102 ms. Remains 2930 /2936 variables (removed 6) and now considering 3441/3447 (removed 6) transitions.
// Phase 1: matrix 3441 rows 2930 cols
[2020-06-03 12:33:24] [INFO ] Computed 189 place invariants in 68 ms
[2020-06-03 12:33:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:28] [INFO ] Implicit Places using invariants in 3875 ms returned [225]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3882 ms to find 1 implicit places.
Starting structural reductions, iteration 23 : 2929/3084 places, 3441/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2929 transition count 3435
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2923 transition count 3435
Applied a total of 12 rules in 167 ms. Remains 2923 /2929 variables (removed 6) and now considering 3435/3441 (removed 6) transitions.
// Phase 1: matrix 3435 rows 2923 cols
[2020-06-03 12:33:28] [INFO ] Computed 188 place invariants in 121 ms
[2020-06-03 12:33:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:32] [INFO ] Implicit Places using invariants in 3897 ms returned [219]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3901 ms to find 1 implicit places.
Starting structural reductions, iteration 24 : 2922/3084 places, 3435/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2922 transition count 3429
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2916 transition count 3429
Applied a total of 12 rules in 169 ms. Remains 2916 /2922 variables (removed 6) and now considering 3429/3435 (removed 6) transitions.
// Phase 1: matrix 3429 rows 2916 cols
[2020-06-03 12:33:32] [INFO ] Computed 187 place invariants in 110 ms
[2020-06-03 12:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:36] [INFO ] Implicit Places using invariants in 3867 ms returned [213]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3872 ms to find 1 implicit places.
Starting structural reductions, iteration 25 : 2915/3084 places, 3429/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2915 transition count 3423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2909 transition count 3423
Applied a total of 12 rules in 169 ms. Remains 2909 /2915 variables (removed 6) and now considering 3423/3429 (removed 6) transitions.
// Phase 1: matrix 3423 rows 2909 cols
[2020-06-03 12:33:36] [INFO ] Computed 186 place invariants in 113 ms
[2020-06-03 12:33:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:40] [INFO ] Implicit Places using invariants in 3785 ms returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3789 ms to find 1 implicit places.
Starting structural reductions, iteration 26 : 2908/3084 places, 3423/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2908 transition count 3417
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2902 transition count 3417
Applied a total of 12 rules in 166 ms. Remains 2902 /2908 variables (removed 6) and now considering 3417/3423 (removed 6) transitions.
// Phase 1: matrix 3417 rows 2902 cols
[2020-06-03 12:33:40] [INFO ] Computed 185 place invariants in 112 ms
[2020-06-03 12:33:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:44] [INFO ] Implicit Places using invariants in 3764 ms returned [201]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3769 ms to find 1 implicit places.
Starting structural reductions, iteration 27 : 2901/3084 places, 3417/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2901 transition count 3411
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2895 transition count 3411
Applied a total of 12 rules in 177 ms. Remains 2895 /2901 variables (removed 6) and now considering 3411/3417 (removed 6) transitions.
// Phase 1: matrix 3411 rows 2895 cols
[2020-06-03 12:33:44] [INFO ] Computed 184 place invariants in 112 ms
[2020-06-03 12:33:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:48] [INFO ] Implicit Places using invariants in 3693 ms returned [195]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3697 ms to find 1 implicit places.
Starting structural reductions, iteration 28 : 2894/3084 places, 3411/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2894 transition count 3405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2888 transition count 3405
Applied a total of 12 rules in 163 ms. Remains 2888 /2894 variables (removed 6) and now considering 3405/3411 (removed 6) transitions.
// Phase 1: matrix 3405 rows 2888 cols
[2020-06-03 12:33:48] [INFO ] Computed 183 place invariants in 113 ms
[2020-06-03 12:33:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:52] [INFO ] Implicit Places using invariants in 3687 ms returned [189]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3694 ms to find 1 implicit places.
Starting structural reductions, iteration 29 : 2887/3084 places, 3405/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2887 transition count 3399
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2881 transition count 3399
Applied a total of 12 rules in 163 ms. Remains 2881 /2887 variables (removed 6) and now considering 3399/3405 (removed 6) transitions.
// Phase 1: matrix 3399 rows 2881 cols
[2020-06-03 12:33:52] [INFO ] Computed 182 place invariants in 114 ms
[2020-06-03 12:33:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:55] [INFO ] Implicit Places using invariants in 3601 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3606 ms to find 1 implicit places.
Starting structural reductions, iteration 30 : 2880/3084 places, 3399/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2880 transition count 3393
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2874 transition count 3393
Applied a total of 12 rules in 101 ms. Remains 2874 /2880 variables (removed 6) and now considering 3393/3399 (removed 6) transitions.
// Phase 1: matrix 3393 rows 2874 cols
[2020-06-03 12:33:56] [INFO ] Computed 181 place invariants in 70 ms
[2020-06-03 12:33:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:33:59] [INFO ] Implicit Places using invariants in 3466 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3470 ms to find 1 implicit places.
Starting structural reductions, iteration 31 : 2873/3084 places, 3393/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2873 transition count 3387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2867 transition count 3387
Applied a total of 12 rules in 100 ms. Remains 2867 /2873 variables (removed 6) and now considering 3387/3393 (removed 6) transitions.
// Phase 1: matrix 3387 rows 2867 cols
[2020-06-03 12:33:59] [INFO ] Computed 180 place invariants in 69 ms
[2020-06-03 12:34:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:03] [INFO ] Implicit Places using invariants in 4189 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4192 ms to find 1 implicit places.
Starting structural reductions, iteration 32 : 2866/3084 places, 3387/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2866 transition count 3381
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2860 transition count 3381
Applied a total of 12 rules in 94 ms. Remains 2860 /2866 variables (removed 6) and now considering 3381/3387 (removed 6) transitions.
// Phase 1: matrix 3381 rows 2860 cols
[2020-06-03 12:34:03] [INFO ] Computed 179 place invariants in 68 ms
[2020-06-03 12:34:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:08] [INFO ] Implicit Places using invariants in 4279 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4283 ms to find 1 implicit places.
Starting structural reductions, iteration 33 : 2859/3084 places, 3381/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2859 transition count 3375
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2853 transition count 3375
Applied a total of 12 rules in 93 ms. Remains 2853 /2859 variables (removed 6) and now considering 3375/3381 (removed 6) transitions.
// Phase 1: matrix 3375 rows 2853 cols
[2020-06-03 12:34:08] [INFO ] Computed 178 place invariants in 66 ms
[2020-06-03 12:34:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:11] [INFO ] Implicit Places using invariants in 3278 ms returned [159]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3282 ms to find 1 implicit places.
Starting structural reductions, iteration 34 : 2852/3084 places, 3375/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2852 transition count 3369
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2846 transition count 3369
Applied a total of 12 rules in 158 ms. Remains 2846 /2852 variables (removed 6) and now considering 3369/3375 (removed 6) transitions.
// Phase 1: matrix 3369 rows 2846 cols
[2020-06-03 12:34:11] [INFO ] Computed 177 place invariants in 111 ms
[2020-06-03 12:34:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:16] [INFO ] Implicit Places using invariants in 4388 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4392 ms to find 1 implicit places.
Starting structural reductions, iteration 35 : 2845/3084 places, 3369/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2845 transition count 3363
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2839 transition count 3363
Applied a total of 12 rules in 91 ms. Remains 2839 /2845 variables (removed 6) and now considering 3363/3369 (removed 6) transitions.
// Phase 1: matrix 3363 rows 2839 cols
[2020-06-03 12:34:16] [INFO ] Computed 176 place invariants in 75 ms
[2020-06-03 12:34:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:20] [INFO ] Implicit Places using invariants in 3903 ms returned [147]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3905 ms to find 1 implicit places.
Starting structural reductions, iteration 36 : 2838/3084 places, 3363/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2838 transition count 3357
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2832 transition count 3357
Applied a total of 12 rules in 93 ms. Remains 2832 /2838 variables (removed 6) and now considering 3357/3363 (removed 6) transitions.
// Phase 1: matrix 3357 rows 2832 cols
[2020-06-03 12:34:20] [INFO ] Computed 175 place invariants in 67 ms
[2020-06-03 12:34:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:24] [INFO ] Implicit Places using invariants in 4116 ms returned [141]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4122 ms to find 1 implicit places.
Starting structural reductions, iteration 37 : 2831/3084 places, 3357/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2831 transition count 3351
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2825 transition count 3351
Applied a total of 12 rules in 98 ms. Remains 2825 /2831 variables (removed 6) and now considering 3351/3357 (removed 6) transitions.
// Phase 1: matrix 3351 rows 2825 cols
[2020-06-03 12:34:24] [INFO ] Computed 174 place invariants in 69 ms
[2020-06-03 12:34:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:27] [INFO ] Implicit Places using invariants in 2899 ms returned [135]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2901 ms to find 1 implicit places.
Starting structural reductions, iteration 38 : 2824/3084 places, 3351/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2824 transition count 3345
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2818 transition count 3345
Applied a total of 12 rules in 92 ms. Remains 2818 /2824 variables (removed 6) and now considering 3345/3351 (removed 6) transitions.
// Phase 1: matrix 3345 rows 2818 cols
[2020-06-03 12:34:27] [INFO ] Computed 173 place invariants in 69 ms
[2020-06-03 12:34:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:31] [INFO ] Implicit Places using invariants in 4108 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4111 ms to find 1 implicit places.
Starting structural reductions, iteration 39 : 2817/3084 places, 3345/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2817 transition count 3339
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2811 transition count 3339
Applied a total of 12 rules in 90 ms. Remains 2811 /2817 variables (removed 6) and now considering 3339/3345 (removed 6) transitions.
// Phase 1: matrix 3339 rows 2811 cols
[2020-06-03 12:34:31] [INFO ] Computed 172 place invariants in 69 ms
[2020-06-03 12:34:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:35] [INFO ] Implicit Places using invariants in 3974 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3977 ms to find 1 implicit places.
Starting structural reductions, iteration 40 : 2810/3084 places, 3339/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2810 transition count 3333
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2804 transition count 3333
Applied a total of 12 rules in 113 ms. Remains 2804 /2810 variables (removed 6) and now considering 3333/3339 (removed 6) transitions.
// Phase 1: matrix 3333 rows 2804 cols
[2020-06-03 12:34:35] [INFO ] Computed 171 place invariants in 101 ms
[2020-06-03 12:34:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:39] [INFO ] Implicit Places using invariants in 4088 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4093 ms to find 1 implicit places.
Starting structural reductions, iteration 41 : 2803/3084 places, 3333/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2803 transition count 3327
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2797 transition count 3327
Applied a total of 12 rules in 106 ms. Remains 2797 /2803 variables (removed 6) and now considering 3327/3333 (removed 6) transitions.
// Phase 1: matrix 3327 rows 2797 cols
[2020-06-03 12:34:39] [INFO ] Computed 170 place invariants in 66 ms
[2020-06-03 12:34:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:43] [INFO ] Implicit Places using invariants in 4002 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4005 ms to find 1 implicit places.
Starting structural reductions, iteration 42 : 2796/3084 places, 3327/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2796 transition count 3321
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2790 transition count 3321
Applied a total of 12 rules in 108 ms. Remains 2790 /2796 variables (removed 6) and now considering 3321/3327 (removed 6) transitions.
// Phase 1: matrix 3321 rows 2790 cols
[2020-06-03 12:34:44] [INFO ] Computed 169 place invariants in 84 ms
[2020-06-03 12:34:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:47] [INFO ] Implicit Places using invariants in 3379 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3388 ms to find 1 implicit places.
Starting structural reductions, iteration 43 : 2789/3084 places, 3321/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2789 transition count 3315
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2783 transition count 3315
Applied a total of 12 rules in 96 ms. Remains 2783 /2789 variables (removed 6) and now considering 3315/3321 (removed 6) transitions.
// Phase 1: matrix 3315 rows 2783 cols
[2020-06-03 12:34:47] [INFO ] Computed 168 place invariants in 65 ms
[2020-06-03 12:34:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:51] [INFO ] Implicit Places using invariants in 3806 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3810 ms to find 1 implicit places.
Starting structural reductions, iteration 44 : 2782/3084 places, 3315/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2782 transition count 3309
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2776 transition count 3309
Applied a total of 12 rules in 131 ms. Remains 2776 /2782 variables (removed 6) and now considering 3309/3315 (removed 6) transitions.
// Phase 1: matrix 3309 rows 2776 cols
[2020-06-03 12:34:51] [INFO ] Computed 167 place invariants in 100 ms
[2020-06-03 12:34:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:54] [INFO ] Implicit Places using invariants in 3364 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3368 ms to find 1 implicit places.
Starting structural reductions, iteration 45 : 2775/3084 places, 3309/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2775 transition count 3303
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2769 transition count 3303
Applied a total of 12 rules in 141 ms. Remains 2769 /2775 variables (removed 6) and now considering 3303/3309 (removed 6) transitions.
// Phase 1: matrix 3303 rows 2769 cols
[2020-06-03 12:34:55] [INFO ] Computed 166 place invariants in 105 ms
[2020-06-03 12:34:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:34:57] [INFO ] Implicit Places using invariants in 2796 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2807 ms to find 1 implicit places.
Starting structural reductions, iteration 46 : 2768/3084 places, 3303/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2768 transition count 3297
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2762 transition count 3297
Applied a total of 12 rules in 83 ms. Remains 2762 /2768 variables (removed 6) and now considering 3297/3303 (removed 6) transitions.
// Phase 1: matrix 3297 rows 2762 cols
[2020-06-03 12:34:57] [INFO ] Computed 165 place invariants in 68 ms
[2020-06-03 12:34:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:01] [INFO ] Implicit Places using invariants in 3503 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3513 ms to find 1 implicit places.
Starting structural reductions, iteration 47 : 2761/3084 places, 3297/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2761 transition count 3291
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2755 transition count 3291
Applied a total of 12 rules in 134 ms. Remains 2755 /2761 variables (removed 6) and now considering 3291/3297 (removed 6) transitions.
// Phase 1: matrix 3291 rows 2755 cols
[2020-06-03 12:35:01] [INFO ] Computed 164 place invariants in 123 ms
[2020-06-03 12:35:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:05] [INFO ] Implicit Places using invariants in 3864 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3867 ms to find 1 implicit places.
Starting structural reductions, iteration 48 : 2754/3084 places, 3291/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2754 transition count 3285
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2748 transition count 3285
Applied a total of 12 rules in 81 ms. Remains 2748 /2754 variables (removed 6) and now considering 3285/3291 (removed 6) transitions.
// Phase 1: matrix 3285 rows 2748 cols
[2020-06-03 12:35:05] [INFO ] Computed 163 place invariants in 70 ms
[2020-06-03 12:35:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:08] [INFO ] Implicit Places using invariants in 3528 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3532 ms to find 1 implicit places.
Starting structural reductions, iteration 49 : 2747/3084 places, 3285/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2747 transition count 3279
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2741 transition count 3279
Applied a total of 12 rules in 136 ms. Remains 2741 /2747 variables (removed 6) and now considering 3279/3285 (removed 6) transitions.
// Phase 1: matrix 3279 rows 2741 cols
[2020-06-03 12:35:09] [INFO ] Computed 162 place invariants in 102 ms
[2020-06-03 12:35:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:12] [INFO ] Implicit Places using invariants in 3585 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3588 ms to find 1 implicit places.
Starting structural reductions, iteration 50 : 2740/3084 places, 3279/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2740 transition count 3273
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2734 transition count 3273
Applied a total of 12 rules in 83 ms. Remains 2734 /2740 variables (removed 6) and now considering 3273/3279 (removed 6) transitions.
// Phase 1: matrix 3273 rows 2734 cols
[2020-06-03 12:35:12] [INFO ] Computed 161 place invariants in 65 ms
[2020-06-03 12:35:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:15] [INFO ] Implicit Places using invariants in 2565 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2571 ms to find 1 implicit places.
Starting structural reductions, iteration 51 : 2733/3084 places, 3273/3573 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 2733 transition count 3267
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 2727 transition count 3267
Applied a total of 12 rules in 134 ms. Remains 2727 /2733 variables (removed 6) and now considering 3267/3273 (removed 6) transitions.
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:15] [INFO ] Computed 160 place invariants in 106 ms
[2020-06-03 12:35:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:18] [INFO ] Implicit Places using invariants in 2834 ms returned []
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:18] [INFO ] Computed 160 place invariants in 107 ms
[2020-06-03 12:35:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:21] [INFO ] Implicit Places using invariants and state equation in 2805 ms returned []
Implicit Place search using SMT with State Equation took 5656 ms to find 0 implicit places.
Finished structural reductions, in 52 iterations. Remains : 2727/3084 places, 3267/3573 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:21] [INFO ] Computed 160 place invariants in 107 ms
Support contains 1644 out of 2727 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2727/2727 places, 3267/3267 transitions.
Applied a total of 0 rules in 66 ms. Remains 2727 /2727 variables (removed 0) and now considering 3267/3267 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2727/2727 places, 3267/3267 transitions.
Starting structural reductions, iteration 0 : 2727/2727 places, 3267/3267 transitions.
Applied a total of 0 rules in 66 ms. Remains 2727 /2727 variables (removed 0) and now considering 3267/3267 (removed 0) transitions.
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:21] [INFO ] Computed 160 place invariants in 118 ms
[2020-06-03 12:35:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:24] [INFO ] Implicit Places using invariants in 3341 ms returned []
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:24] [INFO ] Computed 160 place invariants in 106 ms
[2020-06-03 12:35:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:27] [INFO ] Implicit Places using invariants and state equation in 2861 ms returned []
Implicit Place search using SMT with State Equation took 6205 ms to find 0 implicit places.
[2020-06-03 12:35:27] [INFO ] Redundant transitions in 359 ms returned []
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:28] [INFO ] Computed 160 place invariants in 107 ms
[2020-06-03 12:35:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 12:35:45] [INFO ] Dead Transitions using invariants and state equation in 17671 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2727/2727 places, 3267/3267 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 41 ms. Remains 2727 /2727 variables (removed 0) and now considering 3267/3267 (removed 0) transitions.
// Phase 1: matrix 3267 rows 2727 cols
[2020-06-03 12:35:45] [INFO ] Computed 160 place invariants in 74 ms
[2020-06-03 12:35:45] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2020-06-03 12:35:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 24 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ FamilyReunion-COL-L00050M0005C002P002G001 @ 3570 seconds

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 51 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3546
rslt: Output for UpperBounds @ FamilyReunion-COL-L00050M0005C002P002G001

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 12:35:46 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "MAX(p2412 + p2413 + p2414)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 816,
"markings": 817,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "MAX(p2573 + p2572 + p2571)",
"processed_size": 26,
"rewrites": 0
},
"result":
{
"edges": 867,
"markings": 868,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p1638 + p1639 + p1640 + p1641 + p1642 + p1643)",
"processed_size": 50,
"rewrites": 0
},
"result":
{
"edges": 408,
"markings": 409,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 51,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "MAX(p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p1693 + p1694)",
"processed_size": 410,
"rewrites": 0
},
"result":
{
"edges": 459,
"markings": 460,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 51,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "MAX(p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1440 + p1441 + p1442 + p1443 + p1444 + p1445 + p1446 + p1447 + p1448 + p1449 + p1450 + p1451 + p1452 + p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 + p1475 + p1476 + p1477 + p1478)",
"processed_size": 410,
"rewrites": 0
},
"result":
{
"edges": 306,
"markings": 307,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 51,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "MAX(p2625 + p2626 + p2627 + p2628 + p2629 + p2630 + p2631 + p2632 + p2633 + p2634 + p2635 + p2636 + p2637 + p2638 + p2639 + p2640 + p2641 + p2642 + p2643 + p2644 + p2645 + p2646 + p2647 + p2648 + p2649 + p2650 + p2651 + p2652 + p2653 + p2654 + p2655 + p2656 + p2657 + p2658 + p2659 + p2660 + p2661 + p2662 + p2663 + p2664 + p2665 + p2666 + p2667 + p2668 + p2669 + p2670 + p2671 + p2672 + p2673 + p2674 + p2675)",
"processed_size": 410,
"rewrites": 0
},
"result":
{
"edges": 918,
"markings": 919,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 51,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "MAX(p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764)",
"processed_size": 359,
"rewrites": 0
},
"result":
{
"edges": 1071,
"markings": 1072,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 51,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 51,
"visible_transitions": 0
},
"processed": "MAX(p2676 + p2677 + p2678 + p2679 + p2680 + p2681 + p2682 + p2683 + p2684 + p2685 + p2686 + p2687 + p2688 + p2689 + p2690 + p2691 + p2692 + p2693 + p2694 + p2695 + p2696 + p2697 + p2698 + p2699 + p2700 + p2701 + p2702 + p2703 + p2704 + p2705 + p2706 + p2707 + p2708 + p2709 + p2710 + p2711 + p2712 + p2713 + p2714 + p2715 + p2716 + p2717 + p2718 + p2719 + p2720 + p2721 + p2722 + p2723 + p2724 + p2725 + p2726)",
"processed_size": 410,
"rewrites": 0
},
"result":
{
"edges": 969,
"markings": 970,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 153,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 153,
"visible_transitions": 0
},
"processed": "MAX(p1948 + p1947 + p1945 + p1944 + p1942 + p1941 + p1939 + p1938 + p1936 + p1935 + p1933 + p1932 + p1930 + p1929 + p1927 + p1926 + p1924 + p1923 + p1921 + p1920 + p1918 + p1917 + p1915 + p1914 + p1912 + p1911 + p1909 + p1908 + p1906 + p1905 + p1903 + p1902 + p1900 + p1899 + p1897 + p1896 + p1894 + p1893 + p1891 + p1890 + p1888 + p1887 + p1885 + p1884 + p1882 + p1881 + p1879 + p1878 + p1876 + p1875 + p1873 + p1872 + p1870 + p1869 + p1867 + p1866 + p1864 + p1863 + p1861 + p1860 + p1858 + p1857 + p1855 + p1854 + p1852 + p1851 + p1849 + p1848 + p1847 + p1846 + p1845 + p1844 + p1843 + p1842 + p1841 + p1840 + p1797 + p1798 + p1799 + p1800 + p1801 + p1802 + p1803 + p1804 + p1805 + p1806 + p1807 + p1808 + p1809 + p1810 + p1811 + p1812 + p1813 + p1814 + p1815 + p1816 + p1817 + p1818 + p1819 + p1820 + p1821 + p1822 + p1823 + p1824 + p1825 + p1826 + p1827 + p1828 + p1829 + p1830 + p1831 + p1832 + p1833 + p1834 + p1835 + p1836 + p1837 + p1838 + p1839 + p1850 + p1853 + p1856 + p1859 + p1862 + p1865 + p1868 + p1871 + p1874 + p1877 + p1880 + p1883 + p1886 + p1889 + p1892 + p1895 + p1898 + p1901 + p1904 + p1907 + p1910 + p1913 + p1916 + p1919 + p1922 + p1925 + p1928 + p1931 + p1934 + p1937 + p1940 + p1943 + p1946 + p1949)",
"processed_size": 1226,
"rewrites": 0
},
"result":
{
"edges": 561,
"markings": 562,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 153,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 153,
"visible_transitions": 0
},
"processed": "MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p2049 + p2050 + p2051 + p2052 + p2053 + p2054 + p2055 + p2056 + p2057 + p2058 + p2059 + p2060 + p2061 + p2062 + p2063 + p2064 + p2065 + p2066 + p2067 + p2068 + p2069 + p2070 + p2071 + p2072 + p2073 + p2074 + p2075 + p2076 + p2077 + p2078 + p2079 + p2080 + p2081 + p2082 + p2083 + p2084 + p2085 + p2086 + p2087 + p2088 + p2089 + p2090 + p2091 + p2092 + p2093 + p2094 + p2095 + p2096 + p2097 + p2098 + p2099 + p2100 + p2101 + p2102 + p1998 + p1996 + p1995 + p1993 + p1992 + p1990 + p1989 + p1987 + p1986 + p1984 + p1983 + p1981 + p1980 + p1978 + p1977 + p1975 + p1974 + p1972 + p1971 + p1969 + p1968 + p1966 + p1965 + p1963 + p1962 + p1960 + p1959 + p1957 + p1956 + p1954 + p1953 + p1951 + p1950 + p1952 + p1955 + p1958 + p1961 + p1964 + p1967 + p1970 + p1973 + p1976 + p1979 + p1982 + p1985 + p1988 + p1991 + p1994 + p1997 + p1999)",
"processed_size": 1226,
"rewrites": 0
},
"result":
{
"edges": 612,
"markings": 613,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 153,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 153,
"visible_transitions": 0
},
"processed": "MAX(p2256 + p2257 + p2258 + p2259 + p2260 + p2261 + p2262 + p2263 + p2264 + p2265 + p2266 + p2267 + p2268 + p2269 + p2270 + p2271 + p2272 + p2273 + p2274 + p2275 + p2276 + p2277 + p2278 + p2279 + p2280 + p2281 + p2282 + p2283 + p2284 + p2285 + p2286 + p2287 + p2288 + p2289 + p2290 + p2291 + p2292 + p2293 + p2294 + p2295 + p2296 + p2297 + p2298 + p2299 + p2300 + p2301 + p2302 + p2303 + p2304 + p2305 + p2306 + p2307 + p2308 + p2309 + p2310 + p2311 + p2312 + p2313 + p2314 + p2315 + p2316 + p2317 + p2318 + p2319 + p2320 + p2321 + p2322 + p2323 + p2324 + p2325 + p2326 + p2327 + p2328 + p2329 + p2330 + p2331 + p2332 + p2333 + p2334 + p2335 + p2336 + p2337 + p2338 + p2339 + p2340 + p2341 + p2342 + p2343 + p2344 + p2345 + p2346 + p2347 + p2348 + p2349 + p2350 + p2351 + p2352 + p2353 + p2354 + p2355 + p2356 + p2357 + p2358 + p2359 + p2360 + p2361 + p2362 + p2363 + p2364 + p2365 + p2366 + p2367 + p2368 + p2369 + p2370 + p2371 + p2372 + p2373 + p2374 + p2375 + p2376 + p2377 + p2378 + p2379 + p2380 + p2381 + p2382 + p2383 + p2384 + p2385 + p2386 + p2387 + p2388 + p2389 + p2390 + p2391 + p2392 + p2393 + p2394 + p2395 + p2396 + p2397 + p2398 + p2399 + p2400 + p2401 + p2402 + p2403 + p2404 + p2405 + p2406 + p2407 + p2408)",
"processed_size": 1226,
"rewrites": 0
},
"result":
{
"edges": 714,
"markings": 715,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 153,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 153,
"visible_transitions": 0
},
"processed": "MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p2049 + p2050 + p2051 + p2052 + p2053 + p2054 + p2055 + p2056 + p2057 + p2058 + p2059 + p2060 + p2061 + p2062 + p2063 + p2064 + p2065 + p2066 + p2067 + p2068 + p2069 + p2070 + p2071 + p2072 + p2073 + p2074 + p2075 + p2076 + p2077 + p2078 + p2079 + p2080 + p2081 + p2082 + p2083 + p2084 + p2085 + p2086 + p2087 + p2088 + p2089 + p2090 + p2091 + p2092 + p2093 + p2094 + p2095 + p2096 + p2097 + p2098 + p2099 + p2100 + p2101 + p2102 + p1998 + p1996 + p1995 + p1993 + p1992 + p1990 + p1989 + p1987 + p1986 + p1984 + p1983 + p1981 + p1980 + p1978 + p1977 + p1975 + p1974 + p1972 + p1971 + p1969 + p1968 + p1966 + p1965 + p1963 + p1962 + p1960 + p1959 + p1957 + p1956 + p1954 + p1953 + p1951 + p1950 + p1952 + p1955 + p1958 + p1961 + p1964 + p1967 + p1970 + p1973 + p1976 + p1979 + p1982 + p1985 + p1988 + p1991 + p1994 + p1997 + p1999)",
"processed_size": 1226,
"rewrites": 0
},
"result":
{
"edges": 612,
"markings": 613,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 306,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 306,
"visible_transitions": 0
},
"processed": "MAX(p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1242 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p1261 + p1262 + p1263 + p1264 + p1265 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337 + p1338 + p1339 + p1340 + p1341 + p1342 + p1343 + p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376)",
"processed_size": 2450,
"rewrites": 0
},
"result":
{
"edges": 204,
"markings": 205,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 306,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 306,
"visible_transitions": 0
},
"processed": "MAX(p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999)",
"processed_size": 2215,
"rewrites": 0
},
"result":
{
"edges": 153,
"markings": 154,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 306,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 306,
"visible_transitions": 0
},
"processed": "MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)",
"processed_size": 2095,
"rewrites": 0
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "search",
"value": 51
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 75660,
"runtime": 24.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 8319,
"conflict_clusters": 2465,
"places": 2727,
"places_significant": 2567,
"singleton_clusters": 0,
"transitions": 3267
},
"result":
{
"preliminary_value": "51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 ",
"value": "51 51 51 51 51 51 51 51 51 51 51 51 51 51 51 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5994/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 87264
lola: finding significant places
lola: 2727 places, 3267 transitions, 2567 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from UpperBounds.xml
lola: MAX(p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1440 + p1441 + p1442 + p1443 + p1444 + p1445 + p1446 + p1447 + p1448 + p1449 + p1450 + p1451 + p1452 + p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 + p1475 + p1476 + p1477 + p1478) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p2625 + p2626 + p2627 + p2628 + p2629 + p2630 + p2631 + p2632 + p2633 + p2634 + p2635 + p2636 + p2637 + p2638 + p2639 + p2640 + p2641 + p2642 + p2643 + p2644 + p2645 + p2646 + p2647 + p2648 + p2649 + p2650 + p2651 + p2652 + p2653 + p2654 + p2655 + p2656 + p2657 + p2658 + p2659 + p2660 + p2661 + p2662 + p2663 + p2664 + p2665 + p2666 + p2667 + p2668 + p2669 + p2670 + p2671 + p2672 + p2673 + p2674 + p2675) : MAX(p1948 + p1947 + p1945 + p1944 + p1942 + p1941 + p1939 + p1938 + p1936 + p1935 + p1933 + p1932 + p1930 + p1929 + p1927 + p1926 + p1924 + p1923 + p1921 + p1920 + p1918 + p1917 + p1915 + p1914 + p1912 + p1911 + p1909 + p1908 + p1906 + p1905 + p1903 + p1902 + p1900 + p1899 + p1897 + p1896 + p1894 + p1893 + p1891 + p1890 + p1888 + p1887 + p1885 + p1884 + p1882 + p1881 + p1879 + p1878 + p1876 + p1875 + p1873 + p1872 + p1870 + p1869 + p1867 + p1866 + p1864 + p1863 + p1861 + p1860 + p1858 + p1857 + p1855 + p1854 + p1852 + p1851 + p1849 + p1848 + p1847 + p1846 + p1845 + p1844 + p1843 + p1842 + p1841 + p1840 + p1797 + p1798 + p1799 + p1800 + p1801 + p1802 + p1803 + p1804 + p1805 + p1806 + p1807 + p1808 + p1809 + p1810 + p1811 + p1812 + p1813 + p1814 + p1815 + p1816 + p1817 + p1818 + p1819 + p1820 + p1821 + p1822 + p1823 + p1824 + p1825 + p1826 + p1827 + p1828 + p1829 + p1830 + p1831 + p1832 + p1833 + p1834 + p1835 + p1836 + p1837 + p1838 + p1839 + p1850 + p1853 + p1856 + p1859 + p1862 + p1865 + p1868 + p1871 + p1874 + p1877 + p1880 + p1883 + p1886 + p1889 + p1892 + p1895 + p1898 + p1901 + p1904 + p1907 + p1910 + p1913 + p1916 + p1919 + p1922 + p1925 + p1928 + p1931 + p1934 + p1937 + p1940 + p1943 + p1946 + p1949) : MAX(p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 + p842 + p843 + p844 + p845 + p846 + p847 + p848 + p849 + p850 + p851 + p852 + p853 + p854 + p855 + p856 + p857 + p858 + p859 + p860 + p861 + p862 + p863 + p864 + p865 + p866 + p867 + p868 + p869 + p870 + p871 + p872 + p873 + p874 + p875 + p876 + p877 + p878 + p879 + p880 + p881 + p882 + p883 + p884 + p885 + p886 + p887 + p888 + p889 + p890 + p891 + p892 + p893 + p894 + p895 + p896 + p897 + p898 + p899 + p1000 + p1001 + p1002 + p1003 + p1004 + p1005 + p1006 + p1007 + p1008 + p1009 + p1010 + p1011 + p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033 + p1034 + p1035 + p1036 + p1037 + p1038 + p1039 + p1040 + p1041 + p1042 + p1043 + p1044 + p1045 + p1046 + p1047 + p1048 + p1049 + p1050 + p1051 + p1052 + p1053 + p1054 + p1055 + p1056 + p1057 + p1058 + p1059 + p1060 + p1061 + p1062 + p1063 + p1064 + p1065 + p1066 + p1067 + p1068 + p1069 + p1070 + p900 + p901 + p902 + p903 + p904 + p905 + p906 + p907 + p908 + p909 + p910 + p911 + p912 + p913 + p914 + p915 + p916 + p917 + p918 + p919 + p920 + p921 + p922 + p923 + p924 + p925 + p926 + p927 + p928 + p929 + p930 + p931 + p932 + p933 + p934 + p935 + p936 + p937 + p938 + p939 + p940 + p941 + p942 + p943 + p944 + p945 + p946 + p947 + p948 + p949 + p950 + p951 + p952 + p953 + p954 + p955 + p956 + p957 + p958 + p959 + p960 + p961 + p962 + p963 + p964 + p965 + p966 + p967 + p968 + p969 + p970 + p971 + p972 + p973 + p974 + p975 + p976 + p977 + p978 + p979 + p980 + p981 + p982 + p983 + p984 + p985 + p986 + p987 + p988 + p989 + p990 + p991 + p992 + p993 + p994 + p995 + p996 + p997 + p998 + p999) : MAX(p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764) : MAX(p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p1120 + p1121 + p1122 + p1123 + p1124 + p1125 + p1126 + p1127 + p1128 + p1129 + p1130 + p1131 + p1132 + p1133 + p1134 + p1135 + p1136 + p1137 + p1138 + p1139 + p1140 + p1141 + p1142 + p1143 + p1144 + p1145 + p1146 + p1147 + p1148 + p1149 + p1150 + p1151 + p1152 + p1153 + p1154 + p1155 + p1156 + p1157 + p1158 + p1159 + p1160 + p1161 + p1162 + p1163 + p1164 + p1165 + p1166 + p1167 + p1168 + p1169 + p1170 + p1171 + p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182 + p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204 + p1205 + p1206 + p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217 + p1218 + p1219 + p1220 + p1221 + p1222 + p1223 + p1224 + p1225 + p1226 + p1227 + p1228 + p1229 + p1230 + p1231 + p1232 + p1233 + p1234 + p1235 + p1236 + p1237 + p1238 + p1239 + p1240 + p1241 + p1242 + p1243 + p1244 + p1245 + p1246 + p1247 + p1248 + p1249 + p1250 + p1251 + p1252 + p1253 + p1254 + p1255 + p1256 + p1257 + p1258 + p1259 + p1260 + p1261 + p1262 + p1263 + p1264 + p1265 + p1266 + p1267 + p1268 + p1269 + p1270 + p1271 + p1272 + p1273 + p1274 + p1275 + p1276 + p1277 + p1278 + p1279 + p1280 + p1281 + p1282 + p1283 + p1284 + p1285 + p1286 + p1287 + p1288 + p1289 + p1290 + p1291 + p1292 + p1293 + p1294 + p1295 + p1296 + p1297 + p1298 + p1299 + p1300 + p1301 + p1302 + p1303 + p1304 + p1305 + p1306 + p1307 + p1308 + p1309 + p1310 + p1311 + p1312 + p1313 + p1314 + p1315 + p1316 + p1317 + p1318 + p1319 + p1320 + p1321 + p1322 + p1323 + p1324 + p1325 + p1326 + p1327 + p1328 + p1329 + p1330 + p1331 + p1332 + p1333 + p1334 + p1335 + p1336 + p1337 + p1338 + p1339 + p1340 + p1341 + p1342 + p1343 + p1344 + p1345 + p1346 + p1347 + p1348 + p1349 + p1350 + p1351 + p1352 + p1353 + p1354 + p1355 + p1356 + p1357 + p1358 + p1359 + p1360 + p1361 + p1362 + p1363 + p1364 + p1365 + p1366 + p1367 + p1368 + p1369 + p1370 + p1371 + p1372 + p1373 + p1374 + p1375 + p1376) : MAX(p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p1693 + p1694) : MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p2049 + p2050 + p2051 + p2052 + p2053 + p2054 + p2055 + p2056 + p2057 + p2058 + p2059 + p2060 + p2061 + p2062 + p2063 + p2064 + p2065 + p2066 + p2067 + p2068 + p2069 + p2070 + p2071 + p2072 + p2073 + p2074 + p2075 + p2076 + p2077 + p2078 + p2079 + p2080 + p2081 + p2082 + p2083 + p2084 + p2085 + p2086 + p2087 + p2088 + p2089 + p2090 + p2091 + p2092 + p2093 + p2094 + p2095 + p2096 + p2097 + p2098 + p2099 + p2100 + p2101 + p2102 + p1998 + p1996 + p1995 + p1993 + p1992 + p1990 + p1989 + p1987 + p1986 + p1984 + p1983 + p1981 + p1980 + p1978 + p1977 + p1975 + p1974 + p1972 + p1971 + p1969 + p1968 + p1966 + p1965 + p1963 + p1962 + p1960 + p1959 + p1957 + p1956 + p1954 + p1953 + p1951 + p1950 + p1952 + p1955 + p1958 + p1961 + p1964 + p1967 + p1970 + p1973 + p1976 + p1979 + p1982 + p1985 + p1988 + p1991 + p1994 + p1997 + p1999) : MAX(p2412 + p2413 + p2414) : MAX(p1638 + p1639 + p1640 + p1641 + p1642 + p1643) : MAX(p2573 + p2572 + p2571) : MAX(p2676 + p2677 + p2678 + p2679 + p2680 + p2681 + p2682 + p2683 + p2684 + p2685 + p2686 + p2687 + p2688 + p2689 + p2690 + p2691 + p2692 + p2693 + p2694 + p2695 + p2696 + p2697 + p2698 + p2699 + p2700 + p2701 + p2702 + p2703 + p2704 + p2705 + p2706 + p2707 + p2708 + p2709 + p2710 + p2711 + p2712 + p2713 + p2714 + p2715 + p2716 + p2717 + p2718 + p2719 + p2720 + p2721 + p2722 + p2723 + p2724 + p2725 + p2726) : MAX(p2256 + p2257 + p2258 + p2259 + p2260 + p2261 + p2262 + p2263 + p2264 + p2265 + p2266 + p2267 + p2268 + p2269 + p2270 + p2271 + p2272 + p2273 + p2274 + p2275 + p2276 + p2277 + p2278 + p2279 + p2280 + p2281 + p2282 + p2283 + p2284 + p2285 + p2286 + p2287 + p2288 + p2289 + p2290 + p2291 + p2292 + p2293 + p2294 + p2295 + p2296 + p2297 + p2298 + p2299 + p2300 + p2301 + p2302 + p2303 + p2304 + p2305 + p2306 + p2307 + p2308 + p2309 + p2310 + p2311 + p2312 + p2313 + p2314 + p2315 + p2316 + p2317 + p2318 + p2319 + p2320 + p2321 + p2322 + p2323 + p2324 + p2325 + p2326 + p2327 + p2328 + p2329 + p2330 + p2331 + p2332 + p2333 + p2334 + p2335 + p2336 + p2337 + p2338 + p2339 + p2340 + p2341 + p2342 + p2343 + p2344 + p2345 + p2346 + p2347 + p2348 + p2349 + p2350 + p2351 + p2352 + p2353 + p2354 + p2355 + p2356 + p2357 + p2358 + p2359 + p2360 + p2361 + p2362 + p2363 + p2364 + p2365 + p2366 + p2367 + p2368 + p2369 + p2370 + p2371 + p2372 + p2373 + p2374 + p2375 + p2376 + p2377 + p2378 + p2379 + p2380 + p2381 + p2382 + p2383 + p2384 + p2385 + p2386 + p2387 + p2388 + p2389 + p2390 + p2391 + p2392 + p2393 + p2394 + p2395 + p2396 + p2397 + p2398 + p2399 + p2400 + p2401 + p2402 + p2403 + p2404 + p2405 + p2406 + p2407 + p2408) : MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p2049 + p2050 + p2051 + p2052 + p2053 + p2054 + p2055 + p2056 + p2057 + p2058 + p2059 + p2060 + p2061 + p2062 + p2063 + p2064 + p2065 + p2066 + p2067 + p2068 + p2069 + p2070 + p2071 + p2072 + p2073 + p2074 + p2075 + p2076 + p2077 + p2078 + p2079 + p2080 + p2081 + p2082 + p2083 + p2084 + p2085 + p2086 + p2087 + p2088 + p2089 + p2090 + p2091 + p2092 + p2093 + p2094 + p2095 + p2096 + p2097 + p2098 + p2099 + p2100 + p2101 + p2102 + p1998 + p1996 + p1995 + p1993 + p1992 + p1990 + p1989 + p1987 + p1986 + p1984 + p1983 + p1981 + p1980 + p1978 + p1977 + p1975 + p1974 + p1972 + p1971 + p1969 + p1968 + p1966 + p1965 + p1963 + p1962 + p1960 + p1959 + p1957 + p1956 + p1954 + p1953 + p1951 + p1950 + p1952 + p1955 + p1958 + p1961 + p1964 + p1967 + p1970 + p1973 + p1976 + p1979 + p1982 + p1985 + p1988 + p1991 + p1994 + p1997 + p1999)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2412 + p2413 + p2414)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2412 + p2413 + p2414)
lola: processed formula length: 26
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 817 markings, 816 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2573 + p2572 + p2571)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2573 + p2572 + p2571)
lola: processed formula length: 26
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 868 markings, 867 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1638 + p1639 + p1640 + p1641 + p1642 + p1643)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1638 + p1639 + p1640 + p1641 + p1642 + p1643)
lola: processed formula length: 50
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 409 markings, 408 edges
lola: ========================================
lola: subprocess 3 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p169... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p169... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 460 markings, 459 edges
lola: ========================================
lola: subprocess 4 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1440 + p1441 + p1442 + p1443 + p1444 + p1445 + p1446 + p1447 + p1448 + p1449 + p1450 + p1451 + p1452 + p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 + p1475 + p1476 + p147... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1440 + p1441 + p1442 + p1443 + p1444 + p1445 + p1446 + p1447 + p1448 + p1449 + p1450 + p1451 + p1452 + p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 + p1475 + p1476 + p147... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 307 markings, 306 edges
lola: ========================================
lola: subprocess 5 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2625 + p2626 + p2627 + p2628 + p2629 + p2630 + p2631 + p2632 + p2633 + p2634 + p2635 + p2636 + p2637 + p2638 + p2639 + p2640 + p2641 + p2642 + p2643 + p2644 + p2645 + p2646 + p2647 + p2648 + p2649 + p2650 + p2651 + p2652 + p2653 + p2654 + p2655 + p2656 + p2657 + p2658 + p2659 + p2660 + p2661 + p2662 + p2663 + p2664 + p2665 + p2666 + p2667 + p2668 + p2669 + p2670 + p2671 + p2672 + p2673 + p267... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2625 + p2626 + p2627 + p2628 + p2629 + p2630 + p2631 + p2632 + p2633 + p2634 + p2635 + p2636 + p2637 + p2638 + p2639 + p2640 + p2641 + p2642 + p2643 + p2644 + p2645 + p2646 + p2647 + p2648 + p2649 + p2650 + p2651 + p2652 + p2653 + p2654 + p2655 + p2656 + p2657 + p2658 + p2659 + p2660 + p2661 + p2662 + p2663 + p2664 + p2665 + p2666 + p2667 + p2668 + p2669 + p2670 + p2671 + p2672 + p2673 + p267... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 919 markings, 918 edges
lola: ========================================
lola: subprocess 6 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p714 + p715 + p716 + p717 + p718 + p719 + p720 + p721 + p722 + p723 + p724 + p725 + p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736 + p737 + p738 + p739 + p740 + p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760 + p761 + p762 + p763 + p764)
lola: processed formula length: 359
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 1072 markings, 1071 edges
lola: ========================================
lola: subprocess 7 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2676 + p2677 + p2678 + p2679 + p2680 + p2681 + p2682 + p2683 + p2684 + p2685 + p2686 + p2687 + p2688 + p2689 + p2690 + p2691 + p2692 + p2693 + p2694 + p2695 + p2696 + p2697 + p2698 + p2699 + p2700 + p2701 + p2702 + p2703 + p2704 + p2705 + p2706 + p2707 + p2708 + p2709 + p2710 + p2711 + p2712 + p2713 + p2714 + p2715 + p2716 + p2717 + p2718 + p2719 + p2720 + p2721 + p2722 + p2723 + p2724 + p272... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2676 + p2677 + p2678 + p2679 + p2680 + p2681 + p2682 + p2683 + p2684 + p2685 + p2686 + p2687 + p2688 + p2689 + p2690 + p2691 + p2692 + p2693 + p2694 + p2695 + p2696 + p2697 + p2698 + p2699 + p2700 + p2701 + p2702 + p2703 + p2704 + p2705 + p2706 + p2707 + p2708 + p2709 + p2710 + p2711 + p2712 + p2713 + p2714 + p2715 + p2716 + p2717 + p2718 + p2719 + p2720 + p2721 + p2722 + p2723 + p2724 + p272... (shortened)
lola: processed formula length: 410
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 970 markings, 969 edges
lola: ========================================
lola: subprocess 8 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1948 + p1947 + p1945 + p1944 + p1942 + p1941 + p1939 + p1938 + p1936 + p1935 + p1933 + p1932 + p1930 + p1929 + p1927 + p1926 + p1924 + p1923 + p1921 + p1920 + p1918 + p1917 + p1915 + p1914 + p1912 + p1911 + p1909 + p1908 + p1906 + p1905 + p1903 + p1902 + p1900 + p1899 + p1897 + p1896 + p1894 + p1893 + p1891 + p1890 + p1888 + p1887 + p1885 + p1884 + p1882 + p1881 + p1879 + p1878 + p1876 + p187... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1948 + p1947 + p1945 + p1944 + p1942 + p1941 + p1939 + p1938 + p1936 + p1935 + p1933 + p1932 + p1930 + p1929 + p1927 + p1926 + p1924 + p1923 + p1921 + p1920 + p1918 + p1917 + p1915 + p1914 + p1912 + p1911 + p1909 + p1908 + p1906 + p1905 + p1903 + p1902 + p1900 + p1899 + p1897 + p1896 + p1894 + p1893 + p1891 + p1890 + p1888 + p1887 + p1885 + p1884 + p1882 + p1881 + p1879 + p1878 + p1876 + p187... (shortened)
lola: processed formula length: 1226
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 562 markings, 561 edges
lola: ========================================
lola: subprocess 9 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p204... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p204... (shortened)
lola: processed formula length: 1226
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 613 markings, 612 edges
lola: ========================================
lola: subprocess 10 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2256 + p2257 + p2258 + p2259 + p2260 + p2261 + p2262 + p2263 + p2264 + p2265 + p2266 + p2267 + p2268 + p2269 + p2270 + p2271 + p2272 + p2273 + p2274 + p2275 + p2276 + p2277 + p2278 + p2279 + p2280 + p2281 + p2282 + p2283 + p2284 + p2285 + p2286 + p2287 + p2288 + p2289 + p2290 + p2291 + p2292 + p2293 + p2294 + p2295 + p2296 + p2297 + p2298 + p2299 + p2300 + p2301 + p2302 + p2303 + p2304 + p230... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2256 + p2257 + p2258 + p2259 + p2260 + p2261 + p2262 + p2263 + p2264 + p2265 + p2266 + p2267 + p2268 + p2269 + p2270 + p2271 + p2272 + p2273 + p2274 + p2275 + p2276 + p2277 + p2278 + p2279 + p2280 + p2281 + p2282 + p2283 + p2284 + p2285 + p2286 + p2287 + p2288 + p2289 + p2290 + p2291 + p2292 + p2293 + p2294 + p2295 + p2296 + p2297 + p2298 + p2299 + p2300 + p2301 + p2302 + p2303 + p2304 + p230... (shortened)
lola: processed formula length: 1226
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 715 markings, 714 edges
lola: ========================================
lola: subprocess 11 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p204... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2000 + p2001 + p2002 + p2003 + p2004 + p2005 + p2006 + p2007 + p2008 + p2009 + p2010 + p2011 + p2012 + p2013 + p2014 + p2015 + p2016 + p2017 + p2018 + p2019 + p2020 + p2021 + p2022 + p2023 + p2024 + p2025 + p2026 + p2027 + p2028 + p2029 + p2030 + p2031 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p204... (shortened)
lola: processed formula length: 1226
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 613 markings, 612 edges
lola: ========================================
lola: subprocess 12 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p112... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088 + p1089 + p1090 + p1091 + p1092 + p1093 + p1094 + p1095 + p1096 + p1097 + p1098 + p1099 + p1100 + p1101 + p1102 + p1103 + p1104 + p1105 + p1106 + p1107 + p1108 + p1109 + p1110 + p1111 + p1112 + p1113 + p1114 + p1115 + p1116 + p1117 + p1118 + p1119 + p112... (shortened)
lola: processed formula length: 2450
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 205 markings, 204 edges
lola: ========================================
lola: subprocess 13 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p765 + p766 + p767 + p768 + p769 + p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813 + p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821... (shortened)
lola: processed formula length: 2215
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 154 markings, 153 edges
lola: ========================================
lola: subprocess 14 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156... (shortened)
lola: processed formula length: 2095
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 51
lola: SUBRESULT
lola: result: 51
lola: produced by: state space
lola: The maximum value of the given expression is 51
lola: 52 markings, 51 edges
lola: RESULT
lola:
SUMMARY: 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51
lola:
preliminary result: 51 51 51 51 51 51 51 51 51 51 51 51 51 51 51
lola: ========================================
lola: memory consumption: 75660 KB
lola: time consumption: 24 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

--------------------
content from 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="FamilyReunion-COL-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815400133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00050M0005C002P002G001.tgz
mv FamilyReunion-COL-L00050M0005C002P002G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;