About the Execution of 2022-gold for JoinFreeModules-PT-5000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is JoinFreeModules-PT-5000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300029
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 JoinFreeModules-PT-5000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678748318548
Running Version 202205111006
[2023-03-13 22:58:39] [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]
[2023-03-13 22:58:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:58:40] [INFO ] Load time of PNML (sax parser for PT used): 804 ms
[2023-03-13 22:58:40] [INFO ] Transformed 25001 places.
[2023-03-13 22:58:40] [INFO ] Transformed 40001 transitions.
[2023-03-13 22:58:40] [INFO ] Parsed PT model containing 25001 places and 40001 transitions in 1044 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-13 22:58:41] [INFO ] Computed 5000 place invariants in 255 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 2167 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2653 ms. (steps per millisecond=3 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2638 ms. (steps per millisecond=3 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2455 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2315 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2315 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2091 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2248 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2262 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2319 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2146 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2324 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2191 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2202 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2348 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2311 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2165 ms. (steps per millisecond=4 ) properties (out of 16) seen :25006
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-13 22:59:20] [INFO ] Computed 5000 place invariants in 96 ms
[2023-03-13 22:59:25] [INFO ] [Real]Absence check using 5000 positive place invariants in 1885 ms returned unknown
[2023-03-13 22:59:30] [INFO ] [Real]Absence check using 5000 positive place invariants in 2147 ms returned unknown
[2023-03-13 22:59:35] [INFO ] [Real]Absence check using 5000 positive place invariants in 2204 ms returned unknown
[2023-03-13 22:59:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 2143 ms returned unknown
[2023-03-13 22:59:45] [INFO ] [Real]Absence check using 5000 positive place invariants in 2199 ms returned unknown
[2023-03-13 22:59:50] [INFO ] [Real]Absence check using 5000 positive place invariants in 2192 ms returned unknown
[2023-03-13 22:59:55] [INFO ] [Real]Absence check using 5000 positive place invariants in 2187 ms returned unknown
[2023-03-13 23:00:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 2230 ms returned unknown
[2023-03-13 23:00:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
[2023-03-13 23:00:10] [INFO ] [Real]Absence check using 5000 positive place invariants in 2128 ms returned unknown
[2023-03-13 23:00:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
[2023-03-13 23:00:26] [INFO ] [Real]Absence check using 5000 positive place invariants in 2175 ms returned unknown
[2023-03-13 23:00:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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)
[2023-03-13 23:00:36] [INFO ] [Real]Absence check using 5000 positive place invariants in 2094 ms returned unknown
[2023-03-13 23:00:41] [INFO ] [Real]Absence check using 5000 positive place invariants in 2064 ms returned unknown
Current structural bounds on expressions (after SMT) : [5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003] Max seen :[0, 0, 0, 0, 2, 0, 5000, 5000, 1, 0, 5000, 1, 2, 5000, 5000, 0]
Support contains 16 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 75 are kept as prefixes of interest. Removing 24925 places using SCC suffix rule.41 ms
Discarding 24925 places :
Also discarding 39880 output transitions
Drop transitions removed 39880 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 120
Applied a total of 2 rules in 158 ms. Remains 75 /25000 variables (removed 24925) and now considering 120/40001 (removed 39881) transitions.
// Phase 1: matrix 120 rows 75 cols
[2023-03-13 23:00:41] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-13 23:00:41] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/25000 places, 120/40001 transitions.
// Phase 1: matrix 120 rows 75 cols
[2023-03-13 23:00:41] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000035 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 16) seen :72545
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 16) seen :27922
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 16) seen :30245
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 16) seen :27890
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 16) seen :27921
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 16) seen :25366
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 16) seen :27915
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 16) seen :25299
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 16) seen :25344
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 16) seen :30195
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 16) seen :30242
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 16) seen :25277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 16) seen :30196
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 16) seen :25382
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 16) seen :25347
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 16) seen :25264
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 16) seen :30230
// Phase 1: matrix 120 rows 75 cols
[2023-03-13 23:00:58] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-13 23:00:58] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:00:58] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-13 23:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:00:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:00:59] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:00:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 23:00:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:00:59] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:00:59] [INFO ] Added : 29 causal constraints over 7 iterations in 147 ms. Result :sat
Minimization took 249 ms.
[2023-03-13 23:00:59] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:00:59] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:00:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:00:59] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-13 23:00:59] [INFO ] [Nat]Added 15 Read/Feed constraints in 13 ms returned sat
[2023-03-13 23:00:59] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 23:00:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2023-03-13 23:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-13 23:00:59] [INFO ] Added : 34 causal constraints over 8 iterations in 179 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 23:00:59] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 23:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:00:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 23:00:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:00:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-13 23:01:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:01:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 23:01:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 8 ms to minimize.
[2023-03-13 23:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-13 23:01:00] [INFO ] Added : 30 causal constraints over 6 iterations in 168 ms. Result :sat
Minimization took 59 ms.
[2023-03-13 23:01:00] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:01:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:00] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:01:00] [INFO ] Added : 37 causal constraints over 9 iterations in 136 ms. Result :sat
Minimization took 103 ms.
[2023-03-13 23:01:00] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:00] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-13 23:01:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:00] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:00] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-13 23:01:00] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:01:00] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:01:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
[2023-03-13 23:01:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 23:01:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-13 23:01:01] [INFO ] Added : 38 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 56 ms.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:01] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:01:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 23:01:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-13 23:01:01] [INFO ] Added : 37 causal constraints over 8 iterations in 158 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:01] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:01:01] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:01:01] [INFO ] Added : 28 causal constraints over 7 iterations in 95 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:01:02] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 23:01:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-13 23:01:02] [INFO ] Added : 38 causal constraints over 9 iterations in 192 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 23:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:02] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:02] [INFO ] Added : 33 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Added 15 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:01:02] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 23:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-13 23:01:02] [INFO ] Added : 33 causal constraints over 7 iterations in 143 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 23:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:03] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:03] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:01:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 23:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 23:01:03] [INFO ] Added : 33 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 23:01:03] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:03] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:01:03] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:01:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-13 23:01:03] [INFO ] Added : 32 causal constraints over 7 iterations in 233 ms. Result :sat
Minimization took 24 ms.
[2023-03-13 23:01:03] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 23:01:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:03] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 23:01:03] [INFO ] [Nat]Added 15 Read/Feed constraints in 39 ms returned sat
[2023-03-13 23:01:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 23:01:04] [INFO ] Added : 34 causal constraints over 8 iterations in 124 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:01:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:01:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 23:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-13 23:01:04] [INFO ] Added : 31 causal constraints over 8 iterations in 139 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:01:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:04] [INFO ] Added : 29 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:01:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:04] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-13 23:01:04] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:01:04] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 23:01:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 23:01:05] [INFO ] Added : 31 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003] Max seen :[4002, 5000, 4000, 4002, 2503, 3504, 5000, 5000, 5001, 5000, 5000, 5001, 4532, 5000, 5000, 5000]
FORMULA JoinFreeModules-PT-5000-UpperBounds-09 5003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2023-03-13 23:01:33] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000503 steps, including 2 resets, run finished after 689 ms. (steps per millisecond=1452 ) properties (out of 15) seen :71478
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 15) seen :27949
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 15) seen :30223
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 15) seen :27961
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 15) seen :27922
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 15) seen :25395
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 15) seen :27921
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 15) seen :25313
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 15) seen :25331
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 15) seen :30220
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 15) seen :25310
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 15) seen :30173
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 15) seen :25402
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 15) seen :25355
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 15) seen :25308
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 15) seen :30210
// Phase 1: matrix 112 rows 70 cols
[2023-03-13 23:01:48] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-13 23:01:48] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:48] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:48] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 23:01:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-13 23:01:48] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:01:48] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:01:48] [INFO ] Added : 39 causal constraints over 8 iterations in 221 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 23:01:48] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:01:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:49] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:01:49] [INFO ] Added : 32 causal constraints over 7 iterations in 164 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 23:01:49] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:49] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:01:49] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:01:49] [INFO ] Added : 31 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 49 ms.
[2023-03-13 23:01:49] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:49] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-13 23:01:49] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:01:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:01:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2023-03-13 23:01:49] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:01:49] [INFO ] Added : 32 causal constraints over 7 iterations in 90 ms. Result :sat
Minimization took 49 ms.
[2023-03-13 23:01:50] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:01:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:01:50] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 23:01:50] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:01:50] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 11 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:52] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-13 23:01:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 12 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:01:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:55] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:01:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:01:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:01:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:01:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 79 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-13 23:02:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 73 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 70 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 75 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 80 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 80 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 80 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 80 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 23:02:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 77 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 102 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 11 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 77 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 82 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 70 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-13 23:02:29] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-03-13 23:02:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:02:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 23:02:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:02:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 23:02:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:02:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:02:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 23:02:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 23:02:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:02:35] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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)
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:02:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:02:35] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-13 23:02:35] [INFO ] Added : 26 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:02:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:02:35] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:02:35] [INFO ] Added : 33 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:02:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:35] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:02:35] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:02:35] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:02:35] [INFO ] Added : 33 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 23:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:02:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:02:36] [INFO ] Added : 41 causal constraints over 10 iterations in 95 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:02:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:02:36] [INFO ] Added : 28 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:02:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:36] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-13 23:02:36] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:02:36] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:02:36] [INFO ] Added : 19 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 23:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:02:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 23:02:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:02:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:02:37] [INFO ] Added : 35 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:02:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:02:37] [INFO ] Added : 32 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:02:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:02:37] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 23:02:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:02:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:02:38] [INFO ] Added : 33 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5002, 5003, 5003, 5003] Max seen :[4999, 5001, 5000, 4998, 5002, 5000, 5000, 5000, 5001, 5000, 5001, 5002, 5000, 5000, 5000]
FORMULA JoinFreeModules-PT-5000-UpperBounds-12 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 70 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 65 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 65 /70 variables (removed 5) and now considering 104/112 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/70 places, 104/112 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 23:02:50] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1002001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=1565 ) properties (out of 14) seen :65343
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 14) seen :27935
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 14) seen :30248
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 14) seen :27908
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 14) seen :27946
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 14) seen :25431
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 14) seen :27953
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 14) seen :25324
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 14) seen :25289
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 14) seen :30197
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 14) seen :25304
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 14) seen :30174
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 14) seen :25293
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 14) seen :25342
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 14) seen :30234
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 23:03:03] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-13 23:03:03] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:03] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:03] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-13 23:03:03] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 23:03:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:03:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:03:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 23:03:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:03:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:03] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-13 23:03:03] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:03] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-13 23:03:04] [INFO ] Added : 28 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 23:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-13 23:03:04] [INFO ] Added : 31 causal constraints over 7 iterations in 199 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 23:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:04] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:03:04] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:04] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-13 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-13 23:03:04] [INFO ] Added : 42 causal constraints over 9 iterations in 237 ms. Result :sat
Minimization took 54 ms.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:04] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 23:03:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:03:05] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-13 23:03:05] [INFO ] Added : 18 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 31 ms.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 23:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 23 ms returned sat
[2023-03-13 23:03:05] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:05] [INFO ] Added : 29 causal constraints over 6 iterations in 115 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:03:05] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 23:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-13 23:03:05] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:03:05] [INFO ] Added : 29 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:05] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 23:03:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 23:03:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:03:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-13 23:03:06] [INFO ] Added : 31 causal constraints over 7 iterations in 127 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 23:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:03:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:03:06] [INFO ] Added : 37 causal constraints over 8 iterations in 97 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 23:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-13 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-03-13 23:03:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:03:06] [INFO ] Added : 21 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:03:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:06] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 23:03:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:03:06] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 23:03:07] [INFO ] Added : 37 causal constraints over 8 iterations in 139 ms. Result :sat
Minimization took 31 ms.
[2023-03-13 23:03:07] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:07] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:07] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:03:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 23:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-03-13 23:03:07] [INFO ] Added : 33 causal constraints over 7 iterations in 115 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 23:03:07] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:07] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-13 23:03:07] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:07] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 23:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-13 23:03:07] [INFO ] Added : 24 causal constraints over 6 iterations in 115 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [5002, 5003, 5003, 5003, 5002, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003] Max seen :[5002, 5001, 5001, 4998, 5002, 5000, 5000, 5000, 5001, 5000, 5001, 5000, 5000, 5000]
FORMULA JoinFreeModules-PT-5000-UpperBounds-04 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-00 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-01 5003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 50 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /65 variables (removed 15) and now considering 80/104 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/65 places, 80/104 transitions.
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:15] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 11) seen :50023
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 11) seen :28079
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 11) seen :28144
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 11) seen :28155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 11) seen :25394
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 11) seen :25378
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 11) seen :30186
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 11) seen :25351
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 11) seen :30169
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 11) seen :25363
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 11) seen :25371
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 11) seen :30248
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:23] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 23:03:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:03:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:23] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-13 23:03:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-13 23:03:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 23:03:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 23:03:23] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:24] [INFO ] Added : 14 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 18 ms.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:03:24] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:24] [INFO ] Added : 20 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 23:03:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 23:03:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2023-03-13 23:03:24] [INFO ] Added : 18 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 24 ms.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:24] [INFO ] Added : 9 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:24] [INFO ] Added : 26 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 30 ms.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:03:25] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 23:03:25] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 20 ms.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:03:25] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:25] [INFO ] Added : 18 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 31 ms.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:25] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 23:03:25] [INFO ] Added : 27 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 24 ms.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 23:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:25] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:25] [INFO ] Added : 35 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:03:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-13 23:03:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:03:25] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:25] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 24 ms.
[2023-03-13 23:03:26] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:26] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 23:03:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:03:26] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:26] [INFO ] Added : 27 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003] Max seen :[5001, 5001, 5000, 5000, 5000, 5001, 5000, 5001, 5000, 5000, 5000]
Support contains 11 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:34] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-13 23:03:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 80/80 transitions.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-02
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:34] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10004 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :140
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:34] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:35] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-13 23:03:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:03:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:35] [INFO ] Added : 12 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:36] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:36] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000487 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10874 ) properties (out of 1) seen :4907
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:03:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 23:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-03-13 23:03:37] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:37] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:37] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 23:03:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:37] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-02 in 2578 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-03
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:37] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10004 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
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 :140
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:37] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:37] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:03:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:37] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-13 23:03:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 15 ms returned sat
[2023-03-13 23:03:37] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:37] [INFO ] Added : 12 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:38] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000128 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10639 ) properties (out of 1) seen :4966
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=7518 ) properties (out of 1) seen :4999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 23:03:38] [INFO ] Added : 4 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[4999]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:39] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:39] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 23:03:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:39] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1001825 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10889 ) properties (out of 1) seen :4968
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7462 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 23:03:39] [INFO ] Added : 5 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:40] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:40] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:40] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 23:03:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:40] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-03 in 2588 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:40] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10003 steps, including 1 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :140
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:40] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:40] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:40] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:03:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:03:40] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:03:40] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:41] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:41] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000152 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10871 ) properties (out of 1) seen :4982
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 23:03:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-13 23:03:41] [INFO ] Added : 6 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:42] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 23:03:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:42] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000765 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=11119 ) properties (out of 1) seen :4966
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :4998
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:03:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 23:03:42] [INFO ] Added : 6 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:43] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 23:03:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-05 in 2966 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:43] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 12506 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1389 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :5000
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:43] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 23:03:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 23:03:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:43] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:43] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:03:43] [INFO ] Added : 9 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000556 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10875 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6535 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:43] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:43] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-13 23:03:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-06 in 632 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-07
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:43] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :5000
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:43] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:43] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-13 23:03:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:43] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:43] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:43] [INFO ] Added : 26 causal constraints over 6 iterations in 96 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000899 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10762 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:44] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:03:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:44] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:44] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-13 23:03:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-07 in 665 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-08
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:44] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 1 resets, run finished after 8 ms. (steps per millisecond=1250 ) 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 :153
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:44] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:44] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:03:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:03:44] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:44] [INFO ] Added : 15 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[153]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000906 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10762 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=4694 ) properties (out of 1) seen :5001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 23:03:45] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:45] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 23:03:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1001389 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8141 ) properties (out of 1) seen :5001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :5001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:46] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-13 23:03:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-08 in 1885 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-10
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:46] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 1 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :5000
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:46] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:03:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 23:03:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:03:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-13 23:03:46] [INFO ] Added : 18 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000118 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=10753 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=4807 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:03:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 23:03:46] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 7 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:46] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-13 23:03:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-10 in 731 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-11
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:47] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :153
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:47] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:47] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:47] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-13 23:03:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:47] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:47] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:03:47] [INFO ] Added : 18 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[153]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:47] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000667 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=11118 ) properties (out of 1) seen :5001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :5001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:48] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 23:03:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-11 in 1293 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:48] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 1 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :5000
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:48] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:03:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-13 23:03:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:03:48] [INFO ] Added : 35 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000347 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=11114 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6410 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 23:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:03:48] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:48] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-13 23:03:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13 in 719 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:49] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 12505 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1389 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :5000
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:49] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-13 23:03:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:03:49] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 23:03:49] [INFO ] Added : 16 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000428 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11368 ) properties (out of 1) seen :5000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :5000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:03:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:03:49] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:49] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:03:49] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-13 23:03:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:03:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14 in 597 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-15
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:49] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :235
// Phase 1: matrix 80 rows 50 cols
[2023-03-13 23:03:49] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 23:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:03:49] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-13 23:03:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-13 23:03:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:03:49] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:03:49] [INFO ] Added : 12 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[235]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 23:03:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:03:59] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000796 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=11244 ) properties (out of 1) seen :5002
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties (out of 1) seen :5001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 23:04:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 23:04:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 23:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:04:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:04:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:04:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 23:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:04:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:04:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:04:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:04:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 23:04:00] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [5003] Max seen :[5002]
FORMULA JoinFreeModules-PT-5000-UpperBounds-15 5003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-15 in 10675 ms.
[2023-03-13 23:04:00] [INFO ] Flatten gal took : 29 ms
[2023-03-13 23:04:00] [INFO ] Applying decomposition
[2023-03-13 23:04:00] [INFO ] Flatten gal took : 21 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/graph10613649329125764732.txt' '-o' '/tmp/graph10613649329125764732.bin' '-w' '/tmp/graph10613649329125764732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10613649329125764732.bin' '-l' '-1' '-v' '-w' '/tmp/graph10613649329125764732.weights' '-q' '0' '-e' '0.001'
[2023-03-13 23:04:00] [INFO ] Decomposing Gal with order
[2023-03-13 23:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:04:00] [INFO ] Flatten gal took : 6 ms
[2023-03-13 23:04:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-13 23:04:00] [INFO ] Time to serialize gal into /tmp/UpperBounds14134204353867063672.gal : 2 ms
[2023-03-13 23:04:00] [INFO ] Time to serialize properties into /tmp/UpperBounds16427703591033712836.prop : 0 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/UpperBounds14134204353867063672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16427703591033712836.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...276
Loading property file /tmp/UpperBounds16427703591033712836.prop.
Detected timeout of ITS tools.
[2023-03-13 23:25:47] [INFO ] Flatten gal took : 6 ms
[2023-03-13 23:25:47] [INFO ] Time to serialize gal into /tmp/UpperBounds4007441509916978960.gal : 1 ms
[2023-03-13 23:25:47] [INFO ] Time to serialize properties into /tmp/UpperBounds15770890788490210699.prop : 0 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/UpperBounds4007441509916978960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15770890788490210699.prop' '--nowitness' '--gen-order' 'FOLLOW'
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...296
Loading property file /tmp/UpperBounds15770890788490210699.prop.
Detected timeout of ITS tools.
[2023-03-13 23:47:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 23:47:33] [INFO ] Input system was already deterministic with 80 transitions.
[2023-03-13 23:47:33] [INFO ] Transformed 50 places.
[2023-03-13 23:47:33] [INFO ] Transformed 80 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-13 23:47:33] [INFO ] Time to serialize gal into /tmp/UpperBounds12459541609794075596.gal : 1 ms
[2023-03-13 23:47:33] [INFO ] Time to serialize properties into /tmp/UpperBounds6933542522828807309.prop : 1 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/UpperBounds12459541609794075596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6933542522828807309.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6933542522828807309.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="JoinFreeModules-PT-5000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is JoinFreeModules-PT-5000, 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 r255-tall-167856440300029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 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 '
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 ;