Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117600073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 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 DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652718900681

Running Version 0
[2022-05-16 16:35:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:35:02] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-05-16 16:35:02] [INFO ] Transformed 534 places.
[2022-05-16 16:35:02] [INFO ] Transformed 498 transitions.
[2022-05-16 16:35:02] [INFO ] Parsed PT model containing 534 places and 498 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 498 rows 534 cols
[2022-05-16 16:35:02] [INFO ] Computed 54 place invariants in 80 ms
FORMULA DoubleExponent-PT-010-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 327 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :4
FORMULA DoubleExponent-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 288 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 280 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :3
// Phase 1: matrix 498 rows 534 cols
[2022-05-16 16:35:02] [INFO ] Computed 54 place invariants in 78 ms
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2022-05-16 16:35:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:03] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-05-16 16:35:03] [INFO ] Deduced a trap composed of 216 places in 162 ms of which 3 ms to minimize.
[2022-05-16 16:35:03] [INFO ] Deduced a trap composed of 206 places in 145 ms of which 2 ms to minimize.
[2022-05-16 16:35:03] [INFO ] Deduced a trap composed of 221 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 214 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 202 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 193 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 230 places in 160 ms of which 1 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1846 ms
[2022-05-16 16:35:05] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 16:35:08] [INFO ] Added : 300 causal constraints over 60 iterations in 2866 ms. Result :unknown
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-16 16:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-16 16:35:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 16:35:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:13] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:13] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-16 16:35:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:13] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:14] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-05-16 16:35:14] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 16:35:18] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:35:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-16 16:35:18] [INFO ] Added : 360 causal constraints over 72 iterations in 4530 ms. Result :sat
Minimization took 177 ms.
[2022-05-16 16:35:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-16 16:35:18] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-16 16:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 16:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:19] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2022-05-16 16:35:19] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:35:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:24] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-16 16:35:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 16:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:24] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-05-16 16:35:24] [INFO ] Deduced a trap composed of 115 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 120 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:35:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 306 ms
[2022-05-16 16:35:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 16:35:29] [INFO ] Added : 325 causal constraints over 65 iterations in 4404 ms. Result :unknown
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:29] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-16 16:35:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2022-05-16 16:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:30] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 216 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Deduced a trap composed of 167 places in 102 ms of which 1 ms to minimize.
[2022-05-16 16:35:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2022-05-16 16:35:30] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 202 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 203 places in 124 ms of which 1 ms to minimize.
[2022-05-16 16:35:31] [INFO ] Deduced a trap composed of 220 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Deduced a trap composed of 219 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:35:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1150 ms
[2022-05-16 16:35:32] [INFO ] Added : 127 causal constraints over 26 iterations in 2198 ms. Result :sat
Minimization took 604 ms.
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:33] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-16 16:35:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-16 16:35:34] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-16 16:35:38] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:35:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned unsat
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:39] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2022-05-16 16:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:39] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-16 16:35:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:39] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned sat
[2022-05-16 16:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:39] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-05-16 16:35:39] [INFO ] Deduced a trap composed of 203 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:35:39] [INFO ] Deduced a trap composed of 103 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:35:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2022-05-16 16:35:39] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 16:35:44] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:35:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:35:44] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:44] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-05-16 16:35:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:44] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-16 16:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:44] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 205 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 219 places in 125 ms of which 1 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 194 places in 122 ms of which 1 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 217 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 232 places in 125 ms of which 1 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 231 places in 127 ms of which 5 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 220 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 187 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 245 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 189 places in 125 ms of which 1 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 196 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 212 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:35:47] [INFO ] Deduced a trap composed of 210 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 225 places in 119 ms of which 1 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 209 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 209 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 231 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 225 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:35:48] [INFO ] Deduced a trap composed of 206 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 232 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 226 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 220 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 205 places in 125 ms of which 7 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 219 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:35:49] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:35:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:49] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:50] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2022-05-16 16:35:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:50] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:50] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-05-16 16:35:50] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 16:35:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:35:55] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:55] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-16 16:35:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:35:55] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:55] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-16 16:35:55] [INFO ] Deduced a trap composed of 166 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:35:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-16 16:35:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-16 16:35:59] [INFO ] Added : 295 causal constraints over 59 iterations in 3625 ms. Result :sat
Minimization took 447 ms.
[2022-05-16 16:36:00] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:36:00] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-05-16 16:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:00] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-05-16 16:36:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:36:00] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-16 16:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:00] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-16 16:36:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 16:36:05] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:36:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:36:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-16 16:36:05] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2022-05-16 16:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:05] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-16 16:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-16 16:36:05] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-16 16:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:05] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-05-16 16:36:06] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-16 16:36:10] [INFO ] Added : 390 causal constraints over 78 iterations in 4681 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 8, -1, 2, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 12148200 steps, including 425548 resets, run finished after 11405 ms. (steps per millisecond=1065 ) properties (out of 13) seen :3 could not realise parikh vector
FORMULA DoubleExponent-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 88200 steps, including 3281 resets, run finished after 99 ms. (steps per millisecond=890 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 67800 steps, including 2594 resets, run finished after 65 ms. (steps per millisecond=1043 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 5200600 steps, including 194148 resets, run finished after 4476 ms. (steps per millisecond=1161 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 4162800 steps, including 155596 resets, run finished after 3824 ms. (steps per millisecond=1088 ) properties (out of 12) seen :2 could not realise parikh vector
Support contains 12 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 527 transition count 385
Reduce places removed 111 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 416 transition count 381
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 234 place count 412 transition count 381
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 234 place count 412 transition count 362
Deduced a syphon composed of 19 places in 6 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 272 place count 393 transition count 362
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 444 place count 307 transition count 276
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 474 place count 292 transition count 276
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 475 place count 292 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 476 place count 291 transition count 275
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 519 place count 291 transition count 232
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 562 place count 248 transition count 232
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 596 place count 248 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 247 transition count 231
Applied a total of 597 rules in 153 ms. Remains 247 /534 variables (removed 287) and now considering 231/498 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/534 places, 231/498 transitions.
// Phase 1: matrix 231 rows 247 cols
[2022-05-16 16:36:30] [INFO ] Computed 50 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 109905 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70395 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70429 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70495 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70449 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70437 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70442 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70378 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70452 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70411 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70458 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70621 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70480 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 12) seen :2
// Phase 1: matrix 231 rows 247 cols
[2022-05-16 16:36:38] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-16 16:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:38] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:38] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 16:36:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:38] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:38] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:36:38] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:36:38] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:36:38] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 11 ms to minimize.
[2022-05-16 16:36:38] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2022-05-16 16:36:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-16 16:36:38] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 15 ms.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2022-05-16 16:36:40] [INFO ] Added : 144 causal constraints over 29 iterations in 1441 ms. Result :sat
Minimization took 197 ms.
[2022-05-16 16:36:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:40] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:40] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-16 16:36:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:40] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:40] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:36:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:36:40] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-05-16 16:36:40] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 13 ms.
[2022-05-16 16:36:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:36:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:36:42] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:36:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2022-05-16 16:36:42] [INFO ] Added : 183 causal constraints over 37 iterations in 1710 ms. Result :sat
Minimization took 254 ms.
[2022-05-16 16:36:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:42] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:42] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:36:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:42] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:42] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-16 16:36:42] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2022-05-16 16:36:42] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:36:43] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:36:43] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:36:43] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 1 ms to minimize.
[2022-05-16 16:36:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 309 ms
[2022-05-16 16:36:43] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 15 ms.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2022-05-16 16:36:45] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:36:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1693 ms
[2022-05-16 16:36:46] [INFO ] Added : 191 causal constraints over 39 iterations in 3697 ms. Result :sat
Minimization took 405 ms.
[2022-05-16 16:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:47] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:47] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-16 16:36:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:47] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:47] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-16 16:36:47] [INFO ] [Nat]Added 32 Read/Feed constraints in 17 ms returned sat
[2022-05-16 16:36:47] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 0 ms to minimize.
[2022-05-16 16:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-05-16 16:36:47] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 18 ms.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 0 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1006 ms
[2022-05-16 16:36:50] [INFO ] Added : 181 causal constraints over 37 iterations in 2534 ms. Result :sat
Minimization took 228 ms.
[2022-05-16 16:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:50] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-16 16:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:50] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:50] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 16:36:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:36:50] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:36:51] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:36:51] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:36:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 380 ms
[2022-05-16 16:36:51] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 12 ms.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-05-16 16:36:52] [INFO ] Deduced a trap composed of 29 places in 21 ms of which 1 ms to minimize.
[2022-05-16 16:36:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 451 ms
[2022-05-16 16:36:53] [INFO ] Added : 174 causal constraints over 36 iterations in 1966 ms. Result :sat
Minimization took 419 ms.
[2022-05-16 16:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:53] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-05-16 16:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:53] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-16 16:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:53] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:53] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-16 16:36:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:36:53] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:36:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:36:53] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:36:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2022-05-16 16:36:53] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 13 ms.
[2022-05-16 16:36:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:36:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:36:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2022-05-16 16:36:55] [INFO ] Added : 189 causal constraints over 38 iterations in 1780 ms. Result :sat
Minimization took 307 ms.
[2022-05-16 16:36:56] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:56] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-16 16:36:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:56] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:56] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-16 16:36:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
[2022-05-16 16:36:56] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-16 16:36:56] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 13 ms.
[2022-05-16 16:36:58] [INFO ] Added : 188 causal constraints over 38 iterations in 1602 ms. Result :sat
Minimization took 267 ms.
[2022-05-16 16:36:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:58] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:58] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-16 16:36:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:36:58] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:58] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-16 16:36:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 24 ms returned sat
[2022-05-16 16:36:58] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:36:58] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:36:58] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:36:58] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:36:58] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:36:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 416 ms
[2022-05-16 16:36:58] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 15 ms.
[2022-05-16 16:36:59] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2022-05-16 16:36:59] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 0 ms to minimize.
[2022-05-16 16:36:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 459 ms
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2022-05-16 16:37:00] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:01] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:02] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:03] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 1 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 0 ms to minimize.
[2022-05-16 16:37:04] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:05] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:06] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:07] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:08] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:37:09] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:10] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:11] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:12] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:13] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:14] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 90 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:15] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 79 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:16] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:17] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:18] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:19] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:20] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:21] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:22] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:23] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 101 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 103 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 94 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:24] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 95 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:25] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:26] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:27] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:28] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 4 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:29] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:30] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:31] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 89 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:32] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:33] [INFO ] Deduced a trap composed of 89 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:34] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:35] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:36] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 83 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:37] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 14 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:38] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:39] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:40] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:41] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:42] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:37:43] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:37:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:37:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:43] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:43] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-16 16:37:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:43] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:43] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:37:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 17 ms returned sat
[2022-05-16 16:37:43] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 20 ms.
[2022-05-16 16:37:45] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:37:45] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:37:45] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:37:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:37:45] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1481 ms
[2022-05-16 16:37:47] [INFO ] Added : 179 causal constraints over 37 iterations in 3284 ms. Result :sat
Minimization took 1501 ms.
[2022-05-16 16:37:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:48] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-16 16:37:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:48] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:37:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:48] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-16 16:37:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 43 ms returned sat
[2022-05-16 16:37:48] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:37:49] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:37:49] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2022-05-16 16:37:49] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 11 ms.
[2022-05-16 16:37:50] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-16 16:37:50] [INFO ] Added : 169 causal constraints over 34 iterations in 1878 ms. Result :sat
Minimization took 232 ms.
[2022-05-16 16:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:51] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:51] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-16 16:37:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:51] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:51] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-16 16:37:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 20 ms returned sat
[2022-05-16 16:37:51] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:37:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-05-16 16:37:51] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 606 ms
[2022-05-16 16:37:53] [INFO ] Added : 165 causal constraints over 35 iterations in 2339 ms. Result :sat
Minimization took 198 ms.
[2022-05-16 16:37:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:54] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-16 16:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:54] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-16 16:37:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:37:54] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-16 16:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:54] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-16 16:37:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 15 ms returned sat
[2022-05-16 16:37:54] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2022-05-16 16:37:54] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-16 16:37:55] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:37:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:37:55] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2022-05-16 16:37:56] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:37:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1277 ms
[2022-05-16 16:37:57] [INFO ] Added : 162 causal constraints over 34 iterations in 2662 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 8, -1, 2, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0]
Incomplete Parikh walk after 1659000 steps, including 200526 resets, run finished after 1551 ms. (steps per millisecond=1069 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 156000 steps, including 18877 resets, run finished after 135 ms. (steps per millisecond=1155 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 503600 steps, including 60841 resets, run finished after 433 ms. (steps per millisecond=1163 ) properties (out of 12) seen :2 could not realise parikh vector
Interrupted Parikh walk after 33820576 steps, including 4085672 resets, run timeout after 30001 ms. (steps per millisecond=1127 ) properties (out of 12) seen :2
Incomplete Parikh walk after 8775400 steps, including 1059876 resets, run finished after 7815 ms. (steps per millisecond=1122 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 7036000 steps, including 849696 resets, run finished after 6315 ms. (steps per millisecond=1114 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 20157700 steps, including 2435783 resets, run finished after 18386 ms. (steps per millisecond=1096 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 7824000 steps, including 924226 resets, run finished after 7026 ms. (steps per millisecond=1113 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 681700 steps, including 82345 resets, run finished after 587 ms. (steps per millisecond=1161 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 1383000 steps, including 166940 resets, run finished after 1205 ms. (steps per millisecond=1147 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 5527100 steps, including 667399 resets, run finished after 4931 ms. (steps per millisecond=1120 ) properties (out of 12) seen :2 could not realise parikh vector
Support contains 12 out of 247 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 247/247 places, 231/231 transitions.
Applied a total of 0 rules in 11 ms. Remains 247 /247 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/247 places, 231/231 transitions.
Starting structural reductions, iteration 0 : 247/247 places, 231/231 transitions.
Applied a total of 0 rules in 14 ms. Remains 247 /247 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 247 cols
[2022-05-16 16:39:15] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-16 16:39:16] [INFO ] Implicit Places using invariants in 290 ms returned [20, 26, 46, 51, 72, 77, 100, 107, 129, 134, 135, 155, 160, 184, 191, 198, 206, 212, 238, 244]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 294 ms to find 20 implicit places.
[2022-05-16 16:39:16] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 231 rows 227 cols
[2022-05-16 16:39:16] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:39:16] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Starting structural reductions, iteration 1 : 227/247 places, 231/231 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 230
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 226 transition count 225
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 221 transition count 225
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 221 transition count 225
Applied a total of 16 rules in 25 ms. Remains 221 /227 variables (removed 6) and now considering 225/231 (removed 6) transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:39:16] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:39:16] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:39:16] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:39:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:39:16] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 221/247 places, 225/231 transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:39:17] [INFO ] Computed 31 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 109617 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70370 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70440 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70387 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70232 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70309 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70665 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70564 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70296 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70293 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70387 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70401 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70264 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 12) seen :2
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:39:24] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:39:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:24] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-05-16 16:39:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:24] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-16 16:39:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:39:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 54 ms returned sat
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2022-05-16 16:39:24] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:39:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:39:26] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2022-05-16 16:39:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2022-05-16 16:39:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2022-05-16 16:39:26] [INFO ] Added : 174 causal constraints over 35 iterations in 1847 ms. Result :sat
Minimization took 248 ms.
[2022-05-16 16:39:27] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:27] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-16 16:39:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:27] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-16 16:39:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 16 ms returned sat
[2022-05-16 16:39:27] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:39:28] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:39:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-05-16 16:39:28] [INFO ] Added : 160 causal constraints over 33 iterations in 1587 ms. Result :sat
Minimization took 326 ms.
[2022-05-16 16:39:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:29] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-16 16:39:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:29] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 16:39:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 18 ms returned sat
[2022-05-16 16:39:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:29] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:29] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:29] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 337 ms
[2022-05-16 16:39:29] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:39:31] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:39:31] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2022-05-16 16:39:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2022-05-16 16:39:31] [INFO ] Added : 164 causal constraints over 33 iterations in 1866 ms. Result :sat
Minimization took 212 ms.
[2022-05-16 16:39:32] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-16 16:39:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:32] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-16 16:39:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:39:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:32] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-16 16:39:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:32] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 3618 ms
[2022-05-16 16:39:35] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 358 ms
[2022-05-16 16:39:37] [INFO ] Added : 134 causal constraints over 28 iterations in 2037 ms. Result :sat
Minimization took 454 ms.
[2022-05-16 16:39:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:38] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:39:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:39:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:39:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:38] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 16:39:38] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-05-16 16:39:38] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2022-05-16 16:39:40] [INFO ] Added : 172 causal constraints over 35 iterations in 1666 ms. Result :sat
Minimization took 286 ms.
[2022-05-16 16:39:40] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:40] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-16 16:39:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:39:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:41] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 16:39:41] [INFO ] [Nat]Added 32 Read/Feed constraints in 19 ms returned sat
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 409 ms
[2022-05-16 16:39:41] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:39:43] [INFO ] Added : 180 causal constraints over 37 iterations in 1784 ms. Result :sat
Minimization took 615 ms.
[2022-05-16 16:39:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:39:43] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:43] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-05-16 16:39:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:44] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-16 16:39:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:39:44] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 13 ms.
[2022-05-16 16:39:46] [INFO ] Added : 191 causal constraints over 39 iterations in 2049 ms. Result :sat
Minimization took 319 ms.
[2022-05-16 16:39:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:46] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-16 16:39:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:39:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:39:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 16:39:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 173 ms returned sat
[2022-05-16 16:39:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 1985 ms
[2022-05-16 16:39:48] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1915 ms
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 1 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 94 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 95 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:05] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:06] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:07] [INFO ] Deduced a trap composed of 94 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 99 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 95 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:08] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 95 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:09] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:10] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:11] [INFO ] Deduced a trap composed of 100 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:12] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 89 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 91 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 101 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 107 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 88 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 94 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 92 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:16] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 94 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 94 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 99 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 95 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:17] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:19] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 94 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 90 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 94 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:20] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 96 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 97 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:21] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 90 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 96 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 97 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 99 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:22] [INFO ] Deduced a trap composed of 99 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 96 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 96 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 96 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 94 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 92 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:23] [INFO ] Deduced a trap composed of 96 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 102 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 106 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 97 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:24] [INFO ] Deduced a trap composed of 89 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 97 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 87 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:25] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 99 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:26] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 98 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 92 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 101 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 98 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 90 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 92 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 96 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 91 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 92 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:40:31] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:40:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 16:40:31] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:31] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-05-16 16:40:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:32] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-16 16:40:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:33] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:40:34] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:40:35] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:35] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:35] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:40:35] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 2994 ms
[2022-05-16 16:40:35] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:40:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-16 16:40:37] [INFO ] Added : 183 causal constraints over 37 iterations in 2254 ms. Result :sat
Minimization took 476 ms.
[2022-05-16 16:40:37] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:37] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-16 16:40:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:38] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-16 16:40:38] [INFO ] [Nat]Added 32 Read/Feed constraints in 119 ms returned sat
[2022-05-16 16:40:38] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:40:39] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2022-05-16 16:40:39] [INFO ] Added : 145 causal constraints over 30 iterations in 1455 ms. Result :sat
Minimization took 236 ms.
[2022-05-16 16:40:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:39] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 16:40:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:40:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:40] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-16 16:40:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 35 ms returned sat
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:40:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 758 ms
[2022-05-16 16:40:40] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 13 ms.
[2022-05-16 16:40:43] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:40:43] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2022-05-16 16:40:43] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:40:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2022-05-16 16:40:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 286 ms
[2022-05-16 16:40:43] [INFO ] Added : 191 causal constraints over 39 iterations in 2769 ms. Result :sat
Minimization took 402 ms.
[2022-05-16 16:40:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:44] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-16 16:40:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:40:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:44] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-16 16:40:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:40:44] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 13 ms.
[2022-05-16 16:40:46] [INFO ] Added : 178 causal constraints over 36 iterations in 1877 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 3, -1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0]
Incomplete Parikh walk after 3663000 steps, including 442547 resets, run finished after 3282 ms. (steps per millisecond=1116 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 4729100 steps, including 571280 resets, run finished after 4234 ms. (steps per millisecond=1116 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 4279600 steps, including 517135 resets, run finished after 3787 ms. (steps per millisecond=1130 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 2186800 steps, including 258375 resets, run finished after 1887 ms. (steps per millisecond=1158 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 9275600 steps, including 1120780 resets, run finished after 8247 ms. (steps per millisecond=1124 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 5459500 steps, including 644849 resets, run finished after 4964 ms. (steps per millisecond=1099 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 1393300 steps, including 168327 resets, run finished after 1227 ms. (steps per millisecond=1135 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 504500 steps, including 61020 resets, run finished after 438 ms. (steps per millisecond=1151 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 735900 steps, including 88777 resets, run finished after 637 ms. (steps per millisecond=1155 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 1905400 steps, including 224896 resets, run finished after 1703 ms. (steps per millisecond=1118 ) properties (out of 12) seen :2 could not realise parikh vector
Incomplete Parikh walk after 354500 steps, including 42833 resets, run finished after 304 ms. (steps per millisecond=1166 ) properties (out of 12) seen :2 could not realise parikh vector
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 221 /221 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 225/225 transitions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Applied a total of 0 rules in 6 ms. Remains 221 /221 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:17] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:41:17] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:17] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:41:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:41:18] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2022-05-16 16:41:18] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:18] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 16:41:18] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 225/225 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:18] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1115 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 703 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:18] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:41:18] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:18] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:18] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-05-16 16:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:18] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-05-16 16:41:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:41:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 53 ms returned sat
[2022-05-16 16:41:18] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:41:18] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:41:18] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:41:18] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:41:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 306 ms
[2022-05-16 16:41:18] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 14 ms.
[2022-05-16 16:41:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2022-05-16 16:41:20] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:41:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2022-05-16 16:41:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2022-05-16 16:41:20] [INFO ] Added : 174 causal constraints over 35 iterations in 1813 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 354500 steps, including 42855 resets, run finished after 272 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 40 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:21] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144296 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91228 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:22] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:41:22] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:22] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-16 16:41:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:22] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-16 16:41:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:41:22] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2022-05-16 16:41:22] [INFO ] Computed and/alt/rep : 168/1076/168 causal constraints (skipped 42 transitions) in 11 ms.
[2022-05-16 16:41:24] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:41:24] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2022-05-16 16:41:24] [INFO ] Added : 146 causal constraints over 30 iterations in 1544 ms. Result :sat
Minimization took 250 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7472300 steps, including 1249295 resets, run finished after 6051 ms. (steps per millisecond=1234 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:30] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 16:41:30] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:30] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:41:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:41:31] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-16 16:41:31] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:31] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:41:31] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 13410 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:31] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 1097 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 685 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:31] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:41:31] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:31] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:31] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-16 16:41:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:31] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-16 16:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:31] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-05-16 16:41:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:41:31] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:41:31] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 14 ms.
[2022-05-16 16:41:33] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2022-05-16 16:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-05-16 16:41:33] [INFO ] Added : 160 causal constraints over 33 iterations in 1630 ms. Result :sat
Minimization took 338 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1905400 steps, including 225161 resets, run finished after 1497 ms. (steps per millisecond=1272 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 210 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 41 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 202 transition count 209
Applied a total of 42 rules in 35 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:41:35] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144023 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91449 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:41:36] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:41:36] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:36] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:36] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-16 16:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-16 16:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:36] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-16 16:41:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:41:36] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:41:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 334 ms
[2022-05-16 16:41:37] [INFO ] Computed and/alt/rep : 163/1044/163 causal constraints (skipped 45 transitions) in 12 ms.
[2022-05-16 16:41:38] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:38] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Deduced a trap composed of 29 places in 18 ms of which 1 ms to minimize.
[2022-05-16 16:41:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 854 ms
[2022-05-16 16:41:39] [INFO ] Added : 154 causal constraints over 31 iterations in 2406 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3367400 steps, including 563061 resets, run finished after 2756 ms. (steps per millisecond=1221 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 5 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:41:42] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:41:42] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:41:42] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 16:41:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:41:43] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2022-05-16 16:41:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:41:43] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:41:43] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 12014 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:43] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1091 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 685 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:43] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:41:43] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:43] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:43] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-16 16:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:43] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-16 16:41:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:41:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 19 ms returned sat
[2022-05-16 16:41:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:44] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:44] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:44] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:41:44] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 317 ms
[2022-05-16 16:41:44] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:41:46] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:41:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:41:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2022-05-16 16:41:46] [INFO ] Added : 164 causal constraints over 33 iterations in 1893 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 735900 steps, including 88839 resets, run finished after 569 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 34 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:47] [INFO ] Computed 31 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 144391 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91384 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:48] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:41:48] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:48] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:48] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 16:41:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:41:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:48] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-16 16:41:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:41:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2022-05-16 16:41:48] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:48] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:41:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2022-05-16 16:41:48] [INFO ] Computed and/alt/rep : 166/1051/166 causal constraints (skipped 44 transitions) in 10 ms.
[2022-05-16 16:41:49] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:41:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2022-05-16 16:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2022-05-16 16:41:49] [INFO ] Added : 88 causal constraints over 18 iterations in 731 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6649000 steps, including 1110931 resets, run finished after 5431 ms. (steps per millisecond=1224 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:54] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:41:55] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:55] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:41:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:41:55] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2022-05-16 16:41:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:41:55] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:41:55] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 12191 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-03
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:55] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1101 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 710 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:41:55] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-16 16:41:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-05-16 16:41:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:41:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:41:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:41:56] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:41:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:41:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:41:56] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 69 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:57] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:41:58] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:41:59] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 3631 ms
[2022-05-16 16:41:59] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:42:00] [INFO ] Added : 120 causal constraints over 24 iterations in 1230 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1061600 steps, including 128265 resets, run finished after 834 ms. (steps per millisecond=1272 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 210 transition count 211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 34 place count 204 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 40 place count 204 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 203 transition count 210
Applied a total of 41 rules in 27 ms. Remains 203 /221 variables (removed 18) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:42:01] [INFO ] Computed 31 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 144509 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91235 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:42:03] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:42:03] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:03] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:03] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-16 16:42:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:03] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:03] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-16 16:42:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:42:03] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:42:03] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:04] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1300 ms
[2022-05-16 16:42:04] [INFO ] Computed and/alt/rep : 166/1064/166 causal constraints (skipped 43 transitions) in 11 ms.
[2022-05-16 16:42:05] [INFO ] Added : 96 causal constraints over 20 iterations in 715 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 388500 steps, including 64956 resets, run finished after 305 ms. (steps per millisecond=1273 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Starting structural reductions, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:42:05] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:42:05] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:42:05] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:42:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:42:06] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2022-05-16 16:42:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:42:06] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:42:06] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-03 in 10901 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:06] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 1092 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 712 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:06] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:42:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:06] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-16 16:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:07] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-16 16:42:07] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:42:07] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:42:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-05-16 16:42:07] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 14 ms.
[2022-05-16 16:42:08] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-05-16 16:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-16 16:42:08] [INFO ] Added : 172 causal constraints over 35 iterations in 1647 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1393300 steps, including 168348 resets, run finished after 1090 ms. (steps per millisecond=1278 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 221 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 211 transition count 210
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 202 transition count 209
Applied a total of 43 rules in 36 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:42:10] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144217 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91817 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:42:11] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 16:42:11] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:42:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:11] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-05-16 16:42:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:11] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-16 16:42:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:42:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 18 ms returned sat
[2022-05-16 16:42:11] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2022-05-16 16:42:11] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:42:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2022-05-16 16:42:11] [INFO ] Computed and/alt/rep : 164/1062/164 causal constraints (skipped 44 transitions) in 15 ms.
[2022-05-16 16:42:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:42:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:42:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2022-05-16 16:42:13] [INFO ] Added : 150 causal constraints over 30 iterations in 1576 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 873200 steps, including 145999 resets, run finished after 675 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:42:14] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:42:14] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:42:14] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 16:42:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:42:14] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2022-05-16 16:42:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:42:15] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:42:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 8416 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:15] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1109 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 698 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:15] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-16 16:42:15] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:15] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-16 16:42:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:15] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-16 16:42:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:42:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 20 ms returned sat
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:42:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 405 ms
[2022-05-16 16:42:15] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-16 16:42:17] [INFO ] Added : 180 causal constraints over 37 iterations in 1751 ms. Result :sat
Minimization took 609 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 5459500 steps, including 644875 resets, run finished after 4436 ms. (steps per millisecond=1230 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 35 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:42:22] [INFO ] Computed 31 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 143950 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91344 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:42:23] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:42:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:24] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 16:42:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:24] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 16:42:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:42:24] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:42:24] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:25] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 56 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:26] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:27] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 81/80 trap constraints in 4773 ms
[2022-05-16 16:42:28] [INFO ] Computed and/alt/rep : 167/1065/167 causal constraints (skipped 43 transitions) in 11 ms.
[2022-05-16 16:42:30] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:42:30] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:42:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 586 ms
[2022-05-16 16:42:31] [INFO ] Added : 143 causal constraints over 29 iterations in 2408 ms. Result :sat
Minimization took 568 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4111800 steps, including 687092 resets, run finished after 3356 ms. (steps per millisecond=1225 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:42:35] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:42:35] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:42:35] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:42:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:42:36] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2022-05-16 16:42:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-16 16:42:36] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-16 16:42:36] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 21066 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:36] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1084 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 715 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:42:36] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:42:36] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:36] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:36] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-16 16:42:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:36] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 16:42:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:42:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2022-05-16 16:42:36] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 13 ms.
[2022-05-16 16:42:38] [INFO ] Added : 191 causal constraints over 39 iterations in 1968 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 9275600 steps, including 1120697 resets, run finished after 7336 ms. (steps per millisecond=1264 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 211 transition count 213
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 30 place count 206 transition count 213
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 36 place count 206 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 205 transition count 212
Applied a total of 37 rules in 24 ms. Remains 205 /221 variables (removed 16) and now considering 212/225 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/221 places, 212/225 transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:42:46] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144282 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91361 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 1) seen :0
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:42:47] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:42:47] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:47] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-05-16 16:42:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:42:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:42:47] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-16 16:42:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:42:47] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2022-05-16 16:42:47] [INFO ] Computed and/alt/rep : 168/1075/168 causal constraints (skipped 43 transitions) in 11 ms.
[2022-05-16 16:42:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-05-16 16:42:49] [INFO ] Added : 151 causal constraints over 31 iterations in 1457 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 23730300 steps, including 3966833 resets, run finished after 19512 ms. (steps per millisecond=1216 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:43:08] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:43:09] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:43:09] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 16:43:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:43:09] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2022-05-16 16:43:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:43:09] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 16:43:09] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 33513 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:43:09] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 1069 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 713 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:43:09] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:43:09] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:43:09] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:09] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-16 16:43:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:43:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:43:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:09] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-16 16:43:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:43:10] [INFO ] [Nat]Added 32 Read/Feed constraints in 161 ms returned sat
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:10] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:11] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:12] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:12] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:12] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 1975 ms
[2022-05-16 16:43:12] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:43:13] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:43:13] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:43:13] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2022-05-16 16:43:13] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [INFO ] Deduced a trap composed of 2 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:43:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 205 transition count 212
Applied a total of 36 rules in 23 ms. Remains 205 /221 variables (removed 16) and now considering 212/225 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/221 places, 212/225 transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:43:14] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 109822 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70532 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :2
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:43:16] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-16 16:43:16] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:43:16] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:16] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2022-05-16 16:43:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:43:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:43:16] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:43:16] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-16 16:43:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 16:43:16] [INFO ] [Nat]Added 40 Read/Feed constraints in 24 ms returned sat
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:16] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:17] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:18] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:19] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 68 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:20] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:21] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 68 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:22] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 82 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:23] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:24] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:25] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:26] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:27] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:28] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:29] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2022-05-16 16:43:30] [INFO ] Trap strengthening (SAT) tested/added 232/231 trap constraints in 14122 ms
[2022-05-16 16:43:30] [INFO ] Computed and/alt/rep : 167/1066/167 causal constraints (skipped 44 transitions) in 12 ms.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 68 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:36] [INFO ] Deduced a trap composed of 81 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:37] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:38] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:39] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 82 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:40] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 82 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:41] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 83 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 79 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:42] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 79 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 86 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 92 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 80 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 93 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:43] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 85 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:43:44] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 75 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 69 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:45] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 77 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:43:46] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:43:47] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 84 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:48] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 80 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:49] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 76 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 78 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:50] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 76 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:51] [INFO ] Deduced a trap composed of 80 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 83 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:52] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 89 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 90 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 75 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:53] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 82 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 83 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 88 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 87 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 92 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:54] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 85 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 83 places in 40 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 81 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 84 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 86 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:55] [INFO ] Deduced a trap composed of 87 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 88 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 75 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 76 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 85 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 78 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 81 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:43:56] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 79 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 80 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 91 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 78 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 89 places in 40 ms of which 1 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 84 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:57] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 82 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 84 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 88 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 87 places in 39 ms of which 1 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 94 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 87 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 89 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 91 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:43:58] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:43:59] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 75 places in 40 ms of which 1 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 86 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 87 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 1 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 80 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 78 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:44:00] [INFO ] Deduced a trap composed of 80 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:01] [INFO ] Deduced a trap composed of 87 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:01] [INFO ] Deduced a trap composed of 81 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:44:01] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:44:01] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:44:01] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:44:01] [INFO ] Computed 31 place invariants in 22 ms
[2022-05-16 16:44:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 16:44:01] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2022-05-16 16:44:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-16 16:44:02] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:44:02] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 52404 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:02] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1122 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 690 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:02] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:44:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:02] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-16 16:44:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:02] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-05-16 16:44:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:44:02] [INFO ] [Nat]Added 32 Read/Feed constraints in 20 ms returned sat
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:44:02] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:03] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 81 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:04] [INFO ] Deduced a trap composed of 74 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2022-05-16 16:44:05] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 2967 ms
[2022-05-16 16:44:05] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 10 ms.
[2022-05-16 16:44:07] [INFO ] Added : 165 causal constraints over 33 iterations in 1791 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 4035800 steps, including 487524 resets, run finished after 3269 ms. (steps per millisecond=1234 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 210 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 42 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 202 transition count 209
Applied a total of 43 rules in 23 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:44:10] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 143817 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91376 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:44:11] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:44:11] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:11] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2022-05-16 16:44:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:44:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 16:44:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:44:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 18 ms returned sat
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:12] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:13] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:44:14] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:14] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 1933 ms
[2022-05-16 16:44:14] [INFO ] Computed and/alt/rep : 164/1062/164 causal constraints (skipped 44 transitions) in 11 ms.
[2022-05-16 16:44:15] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:16] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 69 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:44:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1723 ms
[2022-05-16 16:44:17] [INFO ] Added : 157 causal constraints over 32 iterations in 3631 ms. Result :sat
Minimization took 416 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 2288200 steps, including 399190 resets, run finished after 1796 ms. (steps per millisecond=1274 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:44:19] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-16 16:44:20] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:44:20] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 16:44:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:44:20] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2022-05-16 16:44:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-16 16:44:20] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 16:44:20] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 18544 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:20] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1111 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 693 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:20] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-16 16:44:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:44:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:20] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2022-05-16 16:44:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:20] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-16 16:44:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:44:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 119 ms returned sat
[2022-05-16 16:44:21] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:44:22] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-16 16:44:22] [INFO ] Added : 145 causal constraints over 30 iterations in 1469 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4279600 steps, including 516997 resets, run finished after 3385 ms. (steps per millisecond=1264 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 211 transition count 211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 204 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 204 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 203 transition count 210
Applied a total of 41 rules in 20 ms. Remains 203 /221 variables (removed 18) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:44:26] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144100 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91531 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:44:27] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:44:27] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-16 16:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:44:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-16 16:44:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:44:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 69 ms returned sat
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:44:27] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 69 places in 46 ms of which 1 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 67 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 813 ms
[2022-05-16 16:44:28] [INFO ] Computed and/alt/rep : 165/1063/165 causal constraints (skipped 44 transitions) in 11 ms.
[2022-05-16 16:44:28] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:44:29] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-05-16 16:44:29] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:44:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2022-05-16 16:44:29] [INFO ] Added : 66 causal constraints over 14 iterations in 692 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 125300 steps, including 20994 resets, run finished after 103 ms. (steps per millisecond=1216 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Starting structural reductions, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:44:29] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:44:29] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:44:29] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-16 16:44:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 16:44:30] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2022-05-16 16:44:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-16 16:44:30] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:44:30] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 9544 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-14
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:30] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1093 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 713 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:30] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-16 16:44:30] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:30] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-16 16:44:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:30] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-16 16:44:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:44:30] [INFO ] [Nat]Added 32 Read/Feed constraints in 35 ms returned sat
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:30] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:31] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:31] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:31] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:31] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 738 ms
[2022-05-16 16:44:31] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-16 16:44:33] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-05-16 16:44:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:44:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-05-16 16:44:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:44:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 292 ms
[2022-05-16 16:44:34] [INFO ] Added : 191 causal constraints over 39 iterations in 2796 ms. Result :sat
Minimization took 404 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4729100 steps, including 571096 resets, run finished after 3754 ms. (steps per millisecond=1259 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 213 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 213 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 212 transition count 218
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 212 transition count 211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 32 place count 205 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 205 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 204 transition count 210
Applied a total of 39 rules in 23 ms. Remains 204 /221 variables (removed 17) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 16:44:38] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 144504 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91596 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 16:44:39] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-16 16:44:39] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:44:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:39] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-16 16:44:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-16 16:44:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:39] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-16 16:44:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 16:44:39] [INFO ] [Nat]Added 40 Read/Feed constraints in 34 ms returned sat
[2022-05-16 16:44:39] [INFO ] Computed and/alt/rep : 171/1082/171 causal constraints (skipped 38 transitions) in 13 ms.
[2022-05-16 16:44:40] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-16 16:44:40] [INFO ] Added : 97 causal constraints over 20 iterations in 756 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 339500 steps, including 51491 resets, run finished after 263 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 16:44:40] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:44:41] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 16:44:41] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:44:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 16:44:41] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2022-05-16 16:44:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-16 16:44:41] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:44:41] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-14 in 11493 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:41] [INFO ] Computed 31 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 1091 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 693 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-16 16:44:41] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:44:41] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:41] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-16 16:44:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:41] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-16 16:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:42] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-16 16:44:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-16 16:44:42] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-05-16 16:44:42] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 15 ms.
[2022-05-16 16:44:43] [INFO ] Added : 178 causal constraints over 36 iterations in 1828 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3663000 steps, including 442344 resets, run finished after 2922 ms. (steps per millisecond=1253 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 225/225 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 213 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 213 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 212 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 212 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 32 place count 205 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 205 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 204 transition count 209
Applied a total of 39 rules in 21 ms. Remains 204 /221 variables (removed 17) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 204 cols
[2022-05-16 16:44:47] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144248 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91414 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 204 cols
[2022-05-16 16:44:48] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-16 16:44:48] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:48] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-16 16:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:48] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-16 16:44:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:44:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-16 16:44:48] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-16 16:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:44:48] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 16:44:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:44:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2022-05-16 16:44:48] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-16 16:44:48] [INFO ] Computed and/alt/rep : 167/1051/167 causal constraints (skipped 41 transitions) in 13 ms.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:50] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 79 places in 51 ms of which 1 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:51] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:44:52] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:44:53] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2022-05-16 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 2931 ms
[2022-05-16 16:44:53] [INFO ] Added : 159 causal constraints over 33 iterations in 4381 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1474000 steps, including 246399 resets, run finished after 1163 ms. (steps per millisecond=1267 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 204 /204 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 209/209 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 204 cols
[2022-05-16 16:44:54] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-16 16:44:54] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 209 rows 204 cols
[2022-05-16 16:44:54] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-16 16:44:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-16 16:44:55] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2022-05-16 16:44:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 209 rows 204 cols
[2022-05-16 16:44:55] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-16 16:44:55] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 13708 ms.
[2022-05-16 16:44:55] [INFO ] Flatten gal took : 61 ms
[2022-05-16 16:44:55] [INFO ] Applying decomposition
[2022-05-16 16:44:55] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7098699714439251014.txt, -o, /tmp/graph7098699714439251014.bin, -w, /tmp/graph7098699714439251014.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7098699714439251014.bin, -l, -1, -v, -w, /tmp/graph7098699714439251014.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 16:44:55] [INFO ] Decomposing Gal with order
[2022-05-16 16:44:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:44:55] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-16 16:44:55] [INFO ] Flatten gal took : 58 ms
[2022-05-16 16:44:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 14 ms.
[2022-05-16 16:44:55] [INFO ] Time to serialize gal into /tmp/UpperBounds5986255456375395822.gal : 11 ms
[2022-05-16 16:44:55] [INFO ] Time to serialize properties into /tmp/UpperBounds7906873340900509632.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5986255456375395822.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7906873340900509632.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5986255456375395822.gal -t CGAL -reachable-file /tmp/UpperBounds7906873340900509632.prop --nowitness
Loading property file /tmp/UpperBounds7906873340900509632.prop.
Detected timeout of ITS tools.
[2022-05-16 17:08:14] [INFO ] Flatten gal took : 180 ms
[2022-05-16 17:08:14] [INFO ] Time to serialize gal into /tmp/UpperBounds7424418091509527665.gal : 76 ms
[2022-05-16 17:08:14] [INFO ] Time to serialize properties into /tmp/UpperBounds7955173682279674565.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7424418091509527665.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7955173682279674565.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7424418091509527665.gal -t CGAL -reachable-file /tmp/UpperBounds7955173682279674565.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7955173682279674565.prop.
Detected timeout of ITS tools.
[2022-05-16 17:31:41] [INFO ] Flatten gal took : 191 ms
[2022-05-16 17:31:42] [INFO ] Input system was already deterministic with 225 transitions.
[2022-05-16 17:31:42] [INFO ] Transformed 221 places.
[2022-05-16 17:31:42] [INFO ] Transformed 225 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 17:31:42] [INFO ] Time to serialize gal into /tmp/UpperBounds2906043877861350636.gal : 20 ms
[2022-05-16 17:31:42] [INFO ] Time to serialize properties into /tmp/UpperBounds5255950008169646462.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2906043877861350636.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5255950008169646462.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2906043877861350636.gal -t CGAL -reachable-file /tmp/UpperBounds5255950008169646462.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5255950008169646462.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DoubleExponent-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2021"
echo " Input is DoubleExponent-PT-010, 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 r089-tall-165260117600073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 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 ;