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.r168-tall-165277016100021.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 itstools
Input is Peterson-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016100021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 8.2K Apr 30 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 44K May 10 09:34 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 Peterson-COL-4-UpperBounds-00
FORMULA_NAME Peterson-COL-4-UpperBounds-01
FORMULA_NAME Peterson-COL-4-UpperBounds-02
FORMULA_NAME Peterson-COL-4-UpperBounds-03
FORMULA_NAME Peterson-COL-4-UpperBounds-04
FORMULA_NAME Peterson-COL-4-UpperBounds-05
FORMULA_NAME Peterson-COL-4-UpperBounds-06
FORMULA_NAME Peterson-COL-4-UpperBounds-07
FORMULA_NAME Peterson-COL-4-UpperBounds-08
FORMULA_NAME Peterson-COL-4-UpperBounds-09
FORMULA_NAME Peterson-COL-4-UpperBounds-10
FORMULA_NAME Peterson-COL-4-UpperBounds-11
FORMULA_NAME Peterson-COL-4-UpperBounds-12
FORMULA_NAME Peterson-COL-4-UpperBounds-13
FORMULA_NAME Peterson-COL-4-UpperBounds-14
FORMULA_NAME Peterson-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652771336588

Running Version 202205111006
[2022-05-17 07:08:57] [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-17 07:08:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:08:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 07:08:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 07:08:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2022-05-17 07:08:58] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 07:08:58] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2022-05-17 07:08:58] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 07:08:58] [INFO ] Computed 1 place invariants in 3 ms
FORMULA Peterson-COL-4-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 07:08:58] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 07:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-17 07:08:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 07:08:58] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 6 ms.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:08:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:08:58] [INFO ] Added : 12 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 07:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 07:08:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:08:58] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:08:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 07:08:58] [INFO ] Added : 11 causal constraints over 4 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 07:08:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 07:08:59] [INFO ] Added : 12 causal constraints over 4 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 07:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:08:59] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 07:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 07:08:59] [INFO ] Added : 11 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 07:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 07:08:59] [INFO ] Added : 11 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:08:59] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 07:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 07:08:59] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 07:08:59] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 5, 5]
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 07:08:59] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 32 ms.
[2022-05-17 07:08:59] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 40 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :28
FORMULA Peterson-COL-4-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :14
FORMULA Peterson-COL-4-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 07:08:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2022-05-17 07:08:59] [INFO ] Computed 19 place invariants in 24 ms
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:08:59] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-17 07:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:00] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-17 07:09:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:09:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 68 ms returned sat
[2022-05-17 07:09:00] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2022-05-17 07:09:00] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2022-05-17 07:09:00] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2022-05-17 07:09:00] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-05-17 07:09:01] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:09:02] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:09:02] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 1 ms to minimize.
[2022-05-17 07:09:02] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2022-05-17 07:09:02] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 2 ms to minimize.
[2022-05-17 07:09:02] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 0 ms to minimize.
[2022-05-17 07:09:03] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 0 ms to minimize.
[2022-05-17 07:09:03] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 07:09:03] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 0 ms to minimize.
[2022-05-17 07:09:03] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:09:03] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
[2022-05-17 07:09:04] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:09:04] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:09:04] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:09:04] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 07:09:04] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:04] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-17 07:09:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:05] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:05] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-17 07:09:05] [INFO ] [Nat]Added 116 Read/Feed constraints in 34 ms returned sat
[2022-05-17 07:09:05] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:09:05] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:09:05] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:09:05] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:09:06] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 5 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 0 ms to minimize.
[2022-05-17 07:09:07] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 1 ms to minimize.
[2022-05-17 07:09:08] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 0 ms to minimize.
[2022-05-17 07:09:08] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 0 ms to minimize.
[2022-05-17 07:09:08] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2022-05-17 07:09:08] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2022-05-17 07:09:09] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:09:09] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:09:09] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:09:09] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2022-05-17 07:09:09] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2022-05-17 07:09:10] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
[2022-05-17 07:09:10] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 07:09:10] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 07:09:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:10] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-17 07:09:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 07:09:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:10] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-17 07:09:10] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2022-05-17 07:09:10] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:09:10] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:09:11] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-05-17 07:09:11] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2022-05-17 07:09:11] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2022-05-17 07:09:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 757 ms
[2022-05-17 07:09:11] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-17 07:09:11] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:11] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-05-17 07:09:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:11] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-17 07:09:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 32 ms returned sat
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 0 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 1 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 1 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2022-05-17 07:09:12] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 1 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-17 07:09:13] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 1 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 0 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 0 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 0 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2022-05-17 07:09:14] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2022-05-17 07:09:15] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 1 ms to minimize.
[2022-05-17 07:09:15] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 0 ms to minimize.
[2022-05-17 07:09:16] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:09:16] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 1 ms to minimize.
[2022-05-17 07:09:16] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2022-05-17 07:09:16] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2022-05-17 07:09:16] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 0 ms to minimize.
[2022-05-17 07:09:16] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 07:09:16] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:16] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-17 07:09:16] [INFO ] [Real]Added 116 Read/Feed constraints in 14 ms returned sat
[2022-05-17 07:09:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-17 07:09:17] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:17] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-05-17 07:09:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 26 ms returned sat
[2022-05-17 07:09:17] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2022-05-17 07:09:17] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2022-05-17 07:09:17] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2022-05-17 07:09:17] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2022-05-17 07:09:17] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 0 ms to minimize.
[2022-05-17 07:09:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 803 ms
[2022-05-17 07:09:18] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 39 ms.
[2022-05-17 07:09:18] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2022-05-17 07:09:19] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-05-17 07:09:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 07:09:19] [INFO ] Added : 86 causal constraints over 18 iterations in 1132 ms. Result :sat
Minimization took 150 ms.
[2022-05-17 07:09:19] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:19] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2022-05-17 07:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:19] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-05-17 07:09:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-17 07:09:19] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2022-05-17 07:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:19] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-05-17 07:09:19] [INFO ] [Nat]Added 116 Read/Feed constraints in 36 ms returned sat
[2022-05-17 07:09:19] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2022-05-17 07:09:20] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2022-05-17 07:09:20] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-17 07:09:20] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2022-05-17 07:09:20] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2022-05-17 07:09:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 770 ms
Current structural bounds on expressions (after SMT) : [5, 5, 4, 5, 5, 4] Max seen :[1, 1, 4, 1, 2, 4]
FORMULA Peterson-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-4-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 63 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/480 places, 375/690 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 07:09:20] [INFO ] Computed 19 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1480 ms. (steps per millisecond=675 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 3) seen :3
[2022-05-17 07:09:23] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 07:09:23] [INFO ] Computed 19 place invariants in 5 ms
[2022-05-17 07:09:23] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:09:23] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2022-05-17 07:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:23] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-17 07:09:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:09:23] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 07:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:23] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 07:09:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:09:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:24] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:26] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:27] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:09:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:30] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:09:32] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:09:32] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:32] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:34] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2022-05-17 07:09:34] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:09:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:35] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:09:35] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:09:36] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:09:36] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:09:36] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:09:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:09:37] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:09:38] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:09:41] [INFO ] Trap strengthening (SAT) tested/added 104/104 trap constraints in 17550 ms
[2022-05-17 07:09:41] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:09:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 07:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-17 07:09:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:09:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-17 07:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:41] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 07:09:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2022-05-17 07:09:41] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:41] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:41] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:44] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:45] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:46] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:46] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:46] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:47] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:09:48] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:49] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:09:50] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:09:50] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:09:52] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:09:52] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:09:52] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:09:52] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2022-05-17 07:09:52] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:09:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:09:53] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:09:54] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:09:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:09:55] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:09:55] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:09:56] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Trap strengthening (SAT) tested/added 104/104 trap constraints in 17559 ms
[2022-05-17 07:09:59] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:09:59] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2022-05-17 07:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:59] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-17 07:09:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:09:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:09:59] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-17 07:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:09:59] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 07:09:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:09:59] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:00] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:01] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:02] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:03] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:10:04] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:04] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:05] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:07] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:08] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:08] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:10] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:10:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:10:11] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:10:12] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:12] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:10:13] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:14] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:17] [INFO ] Trap strengthening (SAT) tested/added 104/104 trap constraints in 17539 ms
Current structural bounds on expressions (after SMT) : [5, 5, 5] Max seen :[1, 1, 1]
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 14 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 12 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 07:10:17] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2022-05-17 07:10:17] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 07:10:17] [INFO ] Implicit Places using invariants in 101 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 160/165 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/165 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:10:17] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1365 ms. (steps per millisecond=732 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 3) seen :3
[2022-05-17 07:10:19] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:10:19] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 07:10:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:20] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-17 07:10:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:10:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:20] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-17 07:10:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:10:20] [INFO ] [Nat]Added 116 Read/Feed constraints in 13 ms returned sat
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:20] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:21] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:22] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:10:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:24] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:25] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:25] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:10:25] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:25] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:26] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:27] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:27] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2022-05-17 07:10:27] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:10:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:28] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:28] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:10:28] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:29] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:10:32] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 12696 ms
[2022-05-17 07:10:32] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:32] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-17 07:10:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:10:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:33] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 07:10:33] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:10:34] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 5 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:35] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:36] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:38] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:38] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:10:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:40] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:10:40] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:10:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:10:41] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:41] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:41] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-05-17 07:10:42] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 87 trap constraints in 12612 ms
[2022-05-17 07:10:45] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:45] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-17 07:10:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:10:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:10:45] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 07:10:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:10:45] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:47] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:10:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:10:50] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:10:51] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:10:51] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:51] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:10:51] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:10:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 07:10:52] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:10:53] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2022-05-17 07:10:53] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:10:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:10:54] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2022-05-17 07:10:55] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:10:58] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 12723 ms
Current structural bounds on expressions (after SMT) : [5, 1, 5] Max seen :[1, 1, 1]
FORMULA Peterson-COL-4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 19 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:10:58] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1299 ms. (steps per millisecond=769 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 2) seen :2
[2022-05-17 07:11:00] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:00] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 07:11:00] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-17 07:11:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 07:11:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:11:01] [INFO ] [Nat]Added 116 Read/Feed constraints in 11 ms returned sat
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:01] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:02] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:03] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:05] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:11:06] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:06] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:06] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:11:06] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:07] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:08] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:09] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:10] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:11:10] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:11] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 87 trap constraints in 13197 ms
[2022-05-17 07:11:14] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:14] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-17 07:11:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:14] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-17 07:11:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:14] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:15] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:16] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:17] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:19] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 4 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:20] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:21] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:11:22] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:23] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:11:24] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:11:27] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 12811 ms
Current structural bounds on expressions (after SMT) : [1, 5] Max seen :[1, 1]
FORMULA Peterson-COL-4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 16 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:27] [INFO ] Computed 14 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1202 ms. (steps per millisecond=831 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 1) seen :1
[2022-05-17 07:11:28] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:28] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 07:11:28] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:29] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-17 07:11:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:29] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-17 07:11:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:11:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:29] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:30] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:31] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 5 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:11:34] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:34] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:34] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:35] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:36] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:11:36] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:36] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:11:36] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:37] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:37] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:38] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:41] [INFO ] Trap strengthening (SAT) tested/added 87/87 trap constraints in 12727 ms
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2022-05-17 07:11:41] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:41] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 07:11:41] [INFO ] Implicit Places using invariants in 105 ms returned []
[2022-05-17 07:11:41] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:41] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 07:11:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:11:42] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2022-05-17 07:11:42] [INFO ] Redundant transitions in 34 ms returned []
[2022-05-17 07:11:42] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:42] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 07:11:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Starting property specific reduction for Peterson-COL-4-UpperBounds-07
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:42] [INFO ] Computed 14 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2022-05-17 07:11:42] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:42] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-17 07:11:42] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:42] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-17 07:11:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 07:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:42] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-17 07:11:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:11:42] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:11:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:42] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:43] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-17 07:11:44] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:45] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2022-05-17 07:11:46] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2022-05-17 07:11:47] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 160 /160 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 375/375 transitions.
Normalized transition count is 315 out of 375 initially.
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:47] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 1) seen :1
[2022-05-17 07:11:49] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 160 cols
[2022-05-17 07:11:49] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-17 07:11:49] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-17 07:11:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 07:11:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 07:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 07:11:49] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 07:11:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2022-05-17 07:11:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 12 ms returned sat
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2022-05-17 07:11:49] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:50] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:51] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-05-17 07:11:52] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:53] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:54] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:54] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-05-17 07:11:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-05-17 07:11:54] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2022-05-17 07:11:55] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2022-05-17 07:11:56] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2022-05-17 07:11:57] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:11:57] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-05-17 07:11:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-05-17 07:11:59] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2022-05-17 07:12:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 87 trap constraints in 12741 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA Peterson-COL-4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for Peterson-COL-4-UpperBounds-07 in 19742 ms.
[2022-05-17 07:12:02] [INFO ] Flatten gal took : 74 ms
[2022-05-17 07:12:02] [INFO ] Applying decomposition
[2022-05-17 07:12:02] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5240969041624749091.txt' '-o' '/tmp/graph5240969041624749091.bin' '-w' '/tmp/graph5240969041624749091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5240969041624749091.bin' '-l' '-1' '-v' '-w' '/tmp/graph5240969041624749091.weights' '-q' '0' '-e' '0.001'
[2022-05-17 07:12:02] [INFO ] Decomposing Gal with order
[2022-05-17 07:12:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 07:12:02] [INFO ] Removed a total of 398 redundant transitions.
[2022-05-17 07:12:02] [INFO ] Flatten gal took : 86 ms
[2022-05-17 07:12:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 31 ms.
[2022-05-17 07:12:02] [INFO ] Time to serialize gal into /tmp/UpperBounds11342974378798285600.gal : 20 ms
[2022-05-17 07:12:02] [INFO ] Time to serialize properties into /tmp/UpperBounds9580330439927106933.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11342974378798285600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9580330439927106933.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9580330439927106933.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1,0.055689,6384,37,30,82,137,754,6,179,92,0
Total reachable state count : 1

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 185183 ms.

BK_STOP 1652771522982

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="Peterson-COL-4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-COL-4, 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 r168-tall-165277016100021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;