MCC'2023- Execution of r234-tall-167856420000221

About the Execution of Marcie+red for JoinFreeModules-PT-2000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15403.048	3600000.00	3693303.00	34356.80	2002 ? ? 2002 2002 ? 2003 2002 ? ? 2002 2002 ? ? ? ?	normal

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.r234-tall-167856420000221.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 marciexred
Input is JoinFreeModules-PT-2000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 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 6.2M 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-2000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679464023992

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 05:47:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 05:47:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:47:06] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2023-03-22 05:47:06] [INFO ] Transformed 10001 places.
[2023-03-22 05:47:06] [INFO ] Transformed 16001 transitions.
[2023-03-22 05:47:06] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 631 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 05:47:06] [INFO ] Computed 2000 place invariants in 117 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1257 ms. (steps per millisecond=7 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1050 ms. (steps per millisecond=9 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1226 ms. (steps per millisecond=8 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1164 ms. (steps per millisecond=8 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=8 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 974 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 999 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 979 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=9 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1104 ms. (steps per millisecond=9 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 16) seen :4013
[2023-03-22 05:47:24] [INFO ] Invariant cache hit.
[2023-03-22 05:47:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 751 ms returned sat
[2023-03-22 05:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:29] [INFO ] [Real]Absence check using state equation in 3109 ms returned unknown
[2023-03-22 05:47:31] [INFO ] [Real]Absence check using 2000 positive place invariants in 707 ms returned sat
[2023-03-22 05:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-22 05:47:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 737 ms returned sat
[2023-03-22 05:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:39] [INFO ] [Real]Absence check using state equation in 3389 ms returned unknown
[2023-03-22 05:47:41] [INFO ] [Real]Absence check using 2000 positive place invariants in 733 ms returned sat
[2023-03-22 05:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:44] [INFO ] [Real]Absence check using state equation in 3435 ms returned unknown
[2023-03-22 05:47:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 729 ms returned sat
[2023-03-22 05:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:49] [INFO ] [Real]Absence check using state equation in 3425 ms returned unknown
[2023-03-22 05:47:51] [INFO ] [Real]Absence check using 2000 positive place invariants in 728 ms returned sat
[2023-03-22 05:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:54] [INFO ] [Real]Absence check using state equation in 3428 ms returned unknown
[2023-03-22 05:47:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 728 ms returned sat
[2023-03-22 05:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:47:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-22 05:48:01] [INFO ] [Real]Absence check using 2000 positive place invariants in 728 ms returned sat
[2023-03-22 05:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:04] [INFO ] [Real]Absence check using state equation in 3443 ms returned unknown
[2023-03-22 05:48:06] [INFO ] [Real]Absence check using 2000 positive place invariants in 734 ms returned sat
[2023-03-22 05:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:09] [INFO ] [Real]Absence check using state equation in 3426 ms returned unknown
[2023-03-22 05:48:11] [INFO ] [Real]Absence check using 2000 positive place invariants in 766 ms returned sat
[2023-03-22 05:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:14] [INFO ] [Real]Absence check using state equation in 3393 ms returned unknown
[2023-03-22 05:48:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 750 ms returned sat
[2023-03-22 05:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:19] [INFO ] [Real]Absence check using state equation in 3396 ms returned unknown
[2023-03-22 05:48:21] [INFO ] [Real]Absence check using 2000 positive place invariants in 724 ms returned sat
[2023-03-22 05:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:24] [INFO ] [Real]Absence check using state equation in 3425 ms returned unknown
[2023-03-22 05:48:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 736 ms returned sat
[2023-03-22 05:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:29] [INFO ] [Real]Absence check using state equation in 3396 ms returned unknown
[2023-03-22 05:48:31] [INFO ] [Real]Absence check using 2000 positive place invariants in 735 ms returned sat
[2023-03-22 05:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:34] [INFO ] [Real]Absence check using state equation in 3430 ms returned unknown
[2023-03-22 05:48:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 711 ms returned sat
[2023-03-22 05:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:39] [INFO ] [Real]Absence check using state equation in 3438 ms returned unknown
[2023-03-22 05:48:41] [INFO ] [Real]Absence check using 2000 positive place invariants in 713 ms returned sat
[2023-03-22 05:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:48:44] [INFO ] [Real]Absence check using state equation in 3438 ms returned unknown
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2, 2, 1, 2, 2, 2000, 1, 2, 1, 1, 1, 2, 2, 1, 2000, 1]
Support contains 16 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 80 are kept as prefixes of interest. Removing 9920 places using SCC suffix rule.23 ms
Discarding 9920 places :
Also discarding 15872 output transitions
Drop transitions removed 15872 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 80 transition count 128
Applied a total of 2 rules in 124 ms. Remains 80 /10000 variables (removed 9920) and now considering 128/16001 (removed 15873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-22 05:48:44] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-22 05:48:45] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 80/10000 places, 128/16001 transitions.
[2023-03-22 05:48:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000918 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=947 ) properties (out of 16) seen :29915
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties (out of 16) seen :4414
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1242 ms. (steps per millisecond=805 ) properties (out of 16) seen :6263
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 16) seen :5429
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 16) seen :4395
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties (out of 16) seen :4400
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 16) seen :4340
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1245 ms. (steps per millisecond=803 ) properties (out of 16) seen :6293
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1306 ms. (steps per millisecond=765 ) properties (out of 16) seen :4427
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties (out of 16) seen :5506
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1273 ms. (steps per millisecond=785 ) properties (out of 16) seen :5487
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1265 ms. (steps per millisecond=790 ) properties (out of 16) seen :5445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 16) seen :4427
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 16) seen :6285
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 16) seen :5437
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 16) seen :4305
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties (out of 16) seen :5484
[2023-03-22 05:49:06] [INFO ] Invariant cache hit.
[2023-03-22 05:49:06] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:49:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:06] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 05:49:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 05:49:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-22 05:49:07] [INFO ] Added : 38 causal constraints over 8 iterations in 306 ms. Result :sat
Minimization took 167 ms.
[2023-03-22 05:49:07] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:07] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 05:49:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 5 ms to minimize.
[2023-03-22 05:49:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 05:49:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-22 05:49:07] [INFO ] Added : 32 causal constraints over 7 iterations in 201 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 05:49:07] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2023-03-22 05:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:08] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-22 05:49:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2023-03-22 05:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:08] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-22 05:49:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2023-03-22 05:49:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 05:49:08] [INFO ] Added : 30 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 129 ms.
[2023-03-22 05:49:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-22 05:49:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:08] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-22 05:49:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 39 ms returned sat
[2023-03-22 05:49:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 05:49:08] [INFO ] Added : 41 causal constraints over 10 iterations in 105 ms. Result :sat
Minimization took 78 ms.
[2023-03-22 05:49:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:09] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-22 05:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:09] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-22 05:49:09] [INFO ] Added : 45 causal constraints over 10 iterations in 243 ms. Result :sat
Minimization took 35 ms.
[2023-03-22 05:49:09] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 05:49:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:09] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:49:09] [INFO ] Added : 45 causal constraints over 10 iterations in 136 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 05:49:09] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-22 05:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:49:10] [INFO ] Added : 36 causal constraints over 8 iterations in 120 ms. Result :sat
Minimization took 54 ms.
[2023-03-22 05:49:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:10] [INFO ] Added : 38 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 05:49:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:10] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:49:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:49:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:49:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-22 05:49:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2023-03-22 05:49:11] [INFO ] Added : 43 causal constraints over 9 iterations in 209 ms. Result :sat
Minimization took 144 ms.
[2023-03-22 05:49:11] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:11] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 05:49:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:11] [INFO ] Added : 39 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 99 ms.
[2023-03-22 05:49:11] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:49:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:11] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 05:49:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:12] [INFO ] Added : 38 causal constraints over 9 iterations in 122 ms. Result :sat
Minimization took 64 ms.
[2023-03-22 05:49:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:49:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:12] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2023-03-22 05:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-22 05:49:12] [INFO ] Added : 51 causal constraints over 12 iterations in 250 ms. Result :sat
Minimization took 150 ms.
[2023-03-22 05:49:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-22 05:49:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:12] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 05:49:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:13] [INFO ] Added : 34 causal constraints over 10 iterations in 332 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 05:49:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:49:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:13] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:49:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:13] [INFO ] Added : 39 causal constraints over 9 iterations in 323 ms. Result :sat
Minimization took 88 ms.
[2023-03-22 05:49:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:49:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:14] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 05:49:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-22 05:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 05:49:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:14] [INFO ] Added : 34 causal constraints over 9 iterations in 127 ms. Result :sat
Minimization took 30 ms.
[2023-03-22 05:49:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:14] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 05:49:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:14] [INFO ] Added : 48 causal constraints over 10 iterations in 223 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[1679, 2001, 1899, 1907, 1702, 2000, 2000, 1940, 1601, 1922, 1665, 1849, 2001, 1897, 2000, 1852]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-22 05:49:24] [INFO ] Invariant cache hit.
[2023-03-22 05:49:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 05:49:24] [INFO ] Invariant cache hit.
[2023-03-22 05:49:24] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 05:49:24] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-22 05:49:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:49:24] [INFO ] Invariant cache hit.
[2023-03-22 05:49:24] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 80/80 places, 128/128 transitions.
[2023-03-22 05:49:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000222 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 16) seen :29840
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1313 ms. (steps per millisecond=761 ) properties (out of 16) seen :4385
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1223 ms. (steps per millisecond=817 ) properties (out of 16) seen :6237
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 16) seen :5481
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1306 ms. (steps per millisecond=765 ) properties (out of 16) seen :4383
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 16) seen :4384
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1307 ms. (steps per millisecond=765 ) properties (out of 16) seen :4347
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1263 ms. (steps per millisecond=791 ) properties (out of 16) seen :6278
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 16) seen :4422
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1264 ms. (steps per millisecond=791 ) properties (out of 16) seen :5411
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1276 ms. (steps per millisecond=783 ) properties (out of 16) seen :5473
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1278 ms. (steps per millisecond=782 ) properties (out of 16) seen :5455
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties (out of 16) seen :4387
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 16) seen :6260
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1277 ms. (steps per millisecond=783 ) properties (out of 16) seen :5416
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1295 ms. (steps per millisecond=772 ) properties (out of 16) seen :4302
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 16) seen :5495
[2023-03-22 05:49:46] [INFO ] Invariant cache hit.
[2023-03-22 05:49:46] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:46] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:49:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:46] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:49:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 05:49:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 12 ms returned sat
[2023-03-22 05:49:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:46] [INFO ] Added : 48 causal constraints over 10 iterations in 143 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 05:49:46] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 05:49:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:46] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 05:49:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 05:49:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 05:49:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:47] [INFO ] Added : 32 causal constraints over 7 iterations in 175 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-22 05:49:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:47] [INFO ] Added : 39 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 05:49:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:49:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:47] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 05:49:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 05:49:48] [INFO ] Added : 54 causal constraints over 11 iterations in 184 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:49:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:48] [INFO ] Added : 45 causal constraints over 10 iterations in 126 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:48] [INFO ] Added : 36 causal constraints over 8 iterations in 110 ms. Result :sat
Minimization took 55 ms.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 05:49:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 05:49:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:49] [INFO ] Added : 54 causal constraints over 11 iterations in 143 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 05:49:49] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:49] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:49:49] [INFO ] Added : 36 causal constraints over 10 iterations in 99 ms. Result :sat
Minimization took 63 ms.
[2023-03-22 05:49:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:49] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 05:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:49] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 05:49:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:49:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 05:49:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-22 05:49:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:49:49] [INFO ] Added : 38 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 67 ms.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-22 05:49:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:49:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-22 05:49:50] [INFO ] Added : 53 causal constraints over 14 iterations in 229 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 05:49:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:50] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:49:50] [INFO ] Added : 50 causal constraints over 11 iterations in 155 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:49:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:51] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 05:49:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:49:51] [INFO ] Added : 34 causal constraints over 10 iterations in 347 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 05:49:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:49:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 05:49:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 26 ms returned sat
[2023-03-22 05:49:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:49:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 05:49:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:49:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-22 05:49:51] [INFO ] Added : 58 causal constraints over 13 iterations in 274 ms. Result :sat
Minimization took 46 ms.
[2023-03-22 05:49:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-22 05:49:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-22 05:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:52] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:49:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:49:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:49:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-22 05:49:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:49:52] [INFO ] Added : 34 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 05:49:52] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:49:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:49:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 05:49:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:49:52] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 05:49:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:49:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:49:52] [INFO ] Added : 38 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2002, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 2000, 2002, 2002, 2000, 2000, 2002, 1999, 1996, 2001, 2002, 2001, 1999, 2000, 2000]
FORMULA JoinFreeModules-PT-2000-UpperBounds-03 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 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 10 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2023-03-22 05:50:02] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000215 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 15) seen :28584
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1245 ms. (steps per millisecond=803 ) properties (out of 15) seen :4409
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 15) seen :6251
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1207 ms. (steps per millisecond=828 ) properties (out of 15) seen :5485
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1236 ms. (steps per millisecond=809 ) properties (out of 15) seen :4400
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1235 ms. (steps per millisecond=809 ) properties (out of 15) seen :4298
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1196 ms. (steps per millisecond=836 ) properties (out of 15) seen :6284
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1246 ms. (steps per millisecond=802 ) properties (out of 15) seen :4390
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 15) seen :5504
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 15) seen :5455
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 15) seen :5474
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties (out of 15) seen :4428
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 15) seen :6277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1223 ms. (steps per millisecond=817 ) properties (out of 15) seen :5461
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 15) seen :4348
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1219 ms. (steps per millisecond=820 ) properties (out of 15) seen :5453
[2023-03-22 05:50:21] [INFO ] Invariant cache hit.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-22 05:50:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-22 05:50:22] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:50:22] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:22] [INFO ] Added : 31 causal constraints over 7 iterations in 80 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 05:50:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-22 05:50:22] [INFO ] Added : 38 causal constraints over 8 iterations in 149 ms. Result :sat
Minimization took 49 ms.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:50:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:22] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-22 05:50:22] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:50:22] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:23] [INFO ] Added : 49 causal constraints over 11 iterations in 108 ms. Result :sat
Minimization took 53 ms.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:23] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Nat]Added 15 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:50:23] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-22 05:50:23] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-22 05:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-22 05:50:23] [INFO ] Added : 29 causal constraints over 7 iterations in 149 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:23] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Nat]Added 15 Read/Feed constraints in 14 ms returned sat
[2023-03-22 05:50:23] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-22 05:50:23] [INFO ] Added : 42 causal constraints over 11 iterations in 163 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:24] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:50:24] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 05:50:24] [INFO ] Added : 43 causal constraints over 10 iterations in 143 ms. Result :sat
Minimization took 48 ms.
[2023-03-22 05:50:24] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:50:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:24] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:24] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:24] [INFO ] Added : 27 causal constraints over 8 iterations in 101 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 05:50:24] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:50:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:24] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-22 05:50:24] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:50:24] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 05:50:24] [INFO ] Added : 45 causal constraints over 10 iterations in 147 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:50:25] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:25] [INFO ] Added : 46 causal constraints over 11 iterations in 117 ms. Result :sat
Minimization took 58 ms.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:50:25] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-22 05:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 05:50:25] [INFO ] Added : 32 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 30 ms.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:25] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 22 ms returned sat
[2023-03-22 05:50:26] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:26] [INFO ] Added : 40 causal constraints over 10 iterations in 129 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 05:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:26] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2023-03-22 05:50:26] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-22 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 05:50:26] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-22 05:50:26] [INFO ] Added : 34 causal constraints over 8 iterations in 140 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 05:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:26] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 05:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:26] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:26] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:50:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 2 ms to minimize.
[2023-03-22 05:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 05:50:26] [INFO ] Added : 34 causal constraints over 7 iterations in 128 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 05:50:26] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:27] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:27] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-22 05:50:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:50:27] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:50:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 05:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 05:50:27] [INFO ] Added : 43 causal constraints over 10 iterations in 133 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 05:50:27] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:27] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 05:50:27] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:50:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-03-22 05:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 05:50:27] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:50:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-22 05:50:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-22 05:50:27] [INFO ] Added : 41 causal constraints over 9 iterations in 276 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 2001, 2002, 2000, 2001, 2002, 1999, 1999, 2001, 2002, 2001, 1999, 2000, 2000]
FORMULA JoinFreeModules-PT-2000-UpperBounds-06 2003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2023-03-22 05:50:37] [INFO ] Computed 14 place invariants in 0 ms
Incomplete random walk after 1000507 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1151 ) properties (out of 14) seen :26352
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1168 ms. (steps per millisecond=856 ) properties (out of 14) seen :4439
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 14) seen :6264
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=881 ) properties (out of 14) seen :5530
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties (out of 14) seen :4417
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 14) seen :4324
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1168 ms. (steps per millisecond=856 ) properties (out of 14) seen :4396
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 14) seen :5486
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 14) seen :5504
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 14) seen :5521
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 14) seen :4432
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 14) seen :6221
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 14) seen :5499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1152 ms. (steps per millisecond=868 ) properties (out of 14) seen :4323
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 14) seen :5513
[2023-03-22 05:50:53] [INFO ] Invariant cache hit.
[2023-03-22 05:50:53] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:50:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:50:54] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-22 05:50:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:50:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 05:50:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:54] [INFO ] Added : 41 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:50:54] [INFO ] Added : 32 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:50:54] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 05:50:54] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:50:54] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 5 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 98 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:55] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 05:50:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 8 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:50:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 293 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 116 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:50:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:50:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 4 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 144 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:50:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:50:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 201 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 68 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:50:59] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-03-22 05:50:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 455 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:03] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:04] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-03-22 05:51:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 80 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:05] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 05:51:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:06] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 4 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 65 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:51:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 65 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 75 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:09] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 68 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:13] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:15] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:51:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:16] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 4 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:26] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 05:51:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 05:51:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 05:51:39] [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 3
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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-22 05:51:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:51:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:39] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 05:51:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 20 ms returned sat
[2023-03-22 05:51:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:51:40] [INFO ] Added : 28 causal constraints over 6 iterations in 83 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:51:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 05:51:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-22 05:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 20 ms returned sat
[2023-03-22 05:51:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 05:51:40] [INFO ] Added : 31 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 39 ms.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 6 ms returned sat
[2023-03-22 05:51:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:51:40] [INFO ] Added : 29 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:51:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 37 ms returned sat
[2023-03-22 05:51:41] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 05:51:41] [INFO ] Added : 43 causal constraints over 9 iterations in 108 ms. Result :sat
Minimization took 54 ms.
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:51:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 05:51:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:51:41] [INFO ] Added : 42 causal constraints over 9 iterations in 107 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 05:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-22 05:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:51:42] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:51:42] [INFO ] Added : 20 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 05:51:42] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:51:42] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:51:42] [INFO ] Added : 19 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 05:51:42] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 05:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 05:51:42] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:51:42] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:51:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 05:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-22 05:51:42] [INFO ] Added : 39 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [2002, 2003, 2003, 2003, 2003, 2002, 2003, 2003, 2003, 2002, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 2001, 2002, 2000, 2002, 1999, 2001, 2001, 2002, 2001, 1999, 2000, 2000]
FORMULA JoinFreeModules-PT-2000-UpperBounds-11 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-UpperBounds-07 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-UpperBounds-00 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 55 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 55 /70 variables (removed 15) and now considering 88/112 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/70 places, 88/112 transitions.
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 05:51:47] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000034 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 11) seen :21265
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 11) seen :6214
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 11) seen :5651
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 11) seen :4518
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 11) seen :4394
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 11) seen :5639
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 11) seen :5668
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 11) seen :5674
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 11) seen :6221
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 11) seen :5671
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 11) seen :4374
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 11) seen :5631
[2023-03-22 05:51:58] [INFO ] Invariant cache hit.
[2023-03-22 05:51:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 05:51:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 05:51:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2023-03-22 05:51:59] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:51:59] [INFO ] Added : 32 causal constraints over 7 iterations in 150 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:51:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:51:59] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:51:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 05:51:59] [INFO ] Added : 44 causal constraints over 9 iterations in 143 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:51:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:51:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:51:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:51:59] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:51:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 05:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 05:51:59] [INFO ] Added : 34 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:51:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:51:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:51:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 05:52:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-22 05:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 05:52:00] [INFO ] Added : 37 causal constraints over 9 iterations in 124 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:52:00] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:00] [INFO ] Added : 41 causal constraints over 9 iterations in 128 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:00] [INFO ] Added : 37 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:00] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 05:52:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:00] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 05:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-22 05:52:00] [INFO ] Added : 39 causal constraints over 10 iterations in 132 ms. Result :sat
Minimization took 30 ms.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:01] [INFO ] Added : 49 causal constraints over 11 iterations in 98 ms. Result :sat
Minimization took 74 ms.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:52:01] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:01] [INFO ] Added : 32 causal constraints over 7 iterations in 150 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:01] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 05:52:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:52:01] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:01] [INFO ] Added : 23 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2002, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2001, 2001, 2002, 2000, 1999, 2001, 2001, 2001, 2000, 2000, 2000]
FORMULA JoinFreeModules-PT-2000-UpperBounds-04 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 50 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 6 ms. Remains 50 /55 variables (removed 5) and now considering 80/88 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 50/55 places, 80/88 transitions.
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:06] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000537 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=1573 ) properties (out of 10) seen :19526
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 10) seen :6252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 10) seen :5738
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 10) seen :4405
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 10) seen :5750
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 10) seen :5703
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 10) seen :5753
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 10) seen :6231
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 10) seen :5766
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 10) seen :4389
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 10) seen :5740
[2023-03-22 05:52:15] [INFO ] Invariant cache hit.
[2023-03-22 05:52:15] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:15] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 05:52:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:15] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 05:52:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:15] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:15] [INFO ] Added : 33 causal constraints over 10 iterations in 86 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 05:52:15] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:16] [INFO ] Added : 29 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:16] [INFO ] Added : 27 causal constraints over 7 iterations in 66 ms. Result :sat
Minimization took 52 ms.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:16] [INFO ] Added : 35 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 35 ms.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:17] [INFO ] Added : 44 causal constraints over 10 iterations in 82 ms. Result :sat
Minimization took 41 ms.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-22 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:17] [INFO ] Added : 28 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:17] [INFO ] Added : 39 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:17] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 05:52:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-22 05:52:17] [INFO ] Added : 39 causal constraints over 8 iterations in 132 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 05:52:18] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 05:52:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2023-03-22 05:52:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:18] [INFO ] Added : 33 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 05:52:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:18] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 05:52:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:18] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2001, 2001, 2000, 2001, 2001, 2001, 2001, 2000, 2000, 2000]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:23] [INFO ] Invariant cache hit.
[2023-03-22 05:52:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 05:52:23] [INFO ] Invariant cache hit.
[2023-03-22 05:52:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-22 05:52:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 05:52:23] [INFO ] Invariant cache hit.
[2023-03-22 05:52:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 50/50 places, 80/80 transitions.
[2023-03-22 05:52:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000367 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=1595 ) properties (out of 10) seen :19082
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 10) seen :6228
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 10) seen :5740
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 10) seen :4406
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 10) seen :5748
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 10) seen :5788
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 10) seen :5780
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 10) seen :6210
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 10) seen :5784
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 10) seen :4375
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 10) seen :5700
[2023-03-22 05:52:33] [INFO ] Invariant cache hit.
[2023-03-22 05:52:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:33] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 05:52:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:33] [INFO ] Added : 33 causal constraints over 10 iterations in 83 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 05:52:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:33] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-22 05:52:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:33] [INFO ] Added : 29 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 41 ms.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:34] [INFO ] Added : 27 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:34] [INFO ] Added : 35 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-22 05:52:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:34] [INFO ] Added : 44 causal constraints over 10 iterations in 81 ms. Result :sat
Minimization took 39 ms.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:34] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-22 05:52:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:35] [INFO ] Added : 28 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:52:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:35] [INFO ] Added : 39 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 05:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:52:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:35] [INFO ] Added : 32 causal constraints over 8 iterations in 162 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:35] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 05:52:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2023-03-22 05:52:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:36] [INFO ] Added : 33 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 39 ms.
[2023-03-22 05:52:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:36] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 05:52:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:36] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:36] [INFO ] Added : 18 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2001, 2001, 2000, 2001, 2001, 2001, 2001, 2001, 2000, 2000]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
[2023-03-22 05:52:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
[2023-03-22 05:52:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-22 05:52:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
[2023-03-22 05:52:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 50/50 places, 80/80 transitions.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
Incomplete random walk after 10211 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1458 ) properties (out of 1) seen :2
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 :153
[2023-03-22 05:52:41] [INFO ] Invariant cache hit.
[2023-03-22 05:52:41] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 05:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:41] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 05:52:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:41] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:41] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:41] [INFO ] Added : 34 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[153]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:42] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000303 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8852 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=4347 ) properties (out of 1) seen :2001
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
[2023-03-22 05:52:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:42] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
[2023-03-22 05:52:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
[2023-03-22 05:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 05:52:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
[2023-03-22 05:52:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01 in 1300 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:42] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 11008 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1572 ) properties (out of 1) seen :0
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 :140
[2023-03-22 05:52:42] [INFO ] Invariant cache hit.
[2023-03-22 05:52:42] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:42] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-22 05:52:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:43] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-22 05:52:43] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:43] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:52:43] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-22 05:52:43] [INFO ] Added : 29 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:52:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000336 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9177 ) properties (out of 1) seen :1992
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=6172 ) properties (out of 1) seen :1999
[2023-03-22 05:52:44] [INFO ] Invariant cache hit.
[2023-03-22 05:52:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:52:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:52:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-22 05:52:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:44] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 05:52:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02 in 2439 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:45] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 11343 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1620 ) properties (out of 1) seen :2000
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 :2000
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:45] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 05:52:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:45] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:45] [INFO ] Added : 27 causal constraints over 7 iterations in 68 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000423 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9012 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6369 ) properties (out of 1) seen :2000
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:45] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:52:45] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 05:52:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05 in 732 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:45] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) 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 :140
[2023-03-22 05:52:45] [INFO ] Invariant cache hit.
[2023-03-22 05:52:46] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:46] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 05:52:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:46] [INFO ] Added : 25 causal constraints over 6 iterations in 162 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:52:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000542 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8933 ) properties (out of 1) seen :1992
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :2000
[2023-03-22 05:52:46] [INFO ] Invariant cache hit.
[2023-03-22 05:52:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:46] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 05:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:46] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:47] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 05:52:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000182 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9092 ) properties (out of 1) seen :1981
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :1998
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 05:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 05:52:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:52:47] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 05:52:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:47] [INFO ] Invariant cache hit.
[2023-03-22 05:52:47] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08 in 2016 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:47] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10259 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=854 ) 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 :140
[2023-03-22 05:52:48] [INFO ] Invariant cache hit.
[2023-03-22 05:52:48] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:48] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-22 05:52:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:48] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:48] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:48] [INFO ] Added : 29 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:52:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000248 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=9526 ) properties (out of 1) seen :1991
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2000
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
[2023-03-22 05:52:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:50] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 05:52:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:50] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
[2023-03-22 05:52:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
[2023-03-22 05:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 05:52:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
[2023-03-22 05:52:50] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 05:52:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000191 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8697 ) properties (out of 1) seen :1983
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :2000
[2023-03-22 05:52:51] [INFO ] Invariant cache hit.
[2023-03-22 05:52:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:51] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-22 05:52:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:51] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:51] [INFO ] Invariant cache hit.
[2023-03-22 05:52:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 05:52:51] [INFO ] Invariant cache hit.
[2023-03-22 05:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 05:52:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:51] [INFO ] Invariant cache hit.
[2023-03-22 05:52:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09 in 3479 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:51] [INFO ] Computed 10 place invariants in 2 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :140
[2023-03-22 05:52:51] [INFO ] Invariant cache hit.
[2023-03-22 05:52:51] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:51] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:51] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 05:52:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:51] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 05:52:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 05:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-22 05:52:51] [INFO ] Added : 45 causal constraints over 10 iterations in 145 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000367 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9094 ) properties (out of 1) seen :1993
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2000
[2023-03-22 05:52:52] [INFO ] Invariant cache hit.
[2023-03-22 05:52:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 05:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-22 05:52:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 05:52:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-10 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10 in 1656 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:53] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11009 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2001
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 :153
[2023-03-22 05:52:53] [INFO ] Invariant cache hit.
[2023-03-22 05:52:53] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 05:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:53] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 05:52:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 05:52:53] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 05:52:53] [INFO ] Added : 39 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:53] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000474 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8776 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6250 ) properties (out of 1) seen :2001
[2023-03-22 05:52:53] [INFO ] Invariant cache hit.
[2023-03-22 05:52:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:54] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:54] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:52:54] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:54] [INFO ] Invariant cache hit.
[2023-03-22 05:52:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 05:52:54] [INFO ] Invariant cache hit.
[2023-03-22 05:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:54] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 05:52:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:54] [INFO ] Invariant cache hit.
[2023-03-22 05:52:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12 in 1058 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:54] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11010 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1000
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 :140
[2023-03-22 05:52:54] [INFO ] Invariant cache hit.
[2023-03-22 05:52:54] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:54] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 05:52:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-22 05:52:54] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 05:52:54] [INFO ] Added : 35 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8547 ) properties (out of 1) seen :1962
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :1999
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
[2023-03-22 05:52:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 05:52:55] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:55] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
[2023-03-22 05:52:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
[2023-03-22 05:52:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 05:52:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
[2023-03-22 05:52:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 05:52:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000289 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9176 ) properties (out of 1) seen :1985
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :2000
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
[2023-03-22 05:52:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 05:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 05:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:56] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 05:52:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-22 05:52:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:56] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
[2023-03-22 05:52:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
[2023-03-22 05:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-22 05:52:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
[2023-03-22 05:52:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13 in 2314 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:56] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11343 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=872 ) properties (out of 1) seen :2000
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 :2000
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
[2023-03-22 05:52:56] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 05:52:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:56] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 05:52:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 16 ms returned sat
[2023-03-22 05:52:56] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:56] [INFO ] Added : 33 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:52:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000901 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8857 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=6849 ) properties (out of 1) seen :2000
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:57] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:57] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 05:52:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:57] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14 in 764 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 05:52:57] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11010 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=846 ) properties (out of 1) seen :1000
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
[2023-03-22 05:52:57] [INFO ] Invariant cache hit.
[2023-03-22 05:52:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 05:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 05:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:57] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 05:52:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 05:52:57] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:57] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 05:52:57] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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-22 05:52:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 05:52:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/50 places, 8/80 transitions.
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000072 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9091 ) properties (out of 1) seen :1996
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=6849 ) properties (out of 1) seen :1998
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
[2023-03-22 05:52:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:58] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 05:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 05:52:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 05:52:58] [INFO ] Added : 4 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1999]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
[2023-03-22 05:52:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
[2023-03-22 05:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 05:52:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
[2023-03-22 05:52:58] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 05:52:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1001126 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=9444 ) properties (out of 1) seen :1987
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6410 ) properties (out of 1) seen :1999
[2023-03-22 05:52:59] [INFO ] Invariant cache hit.
[2023-03-22 05:52:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 05:52:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:52:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 05:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:52:59] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 05:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 05:52:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 05:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-22 05:52:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 05:52:59] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 05:52:59] [INFO ] Invariant cache hit.
[2023-03-22 05:52:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:52:59] [INFO ] Invariant cache hit.
[2023-03-22 05:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 05:52:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-22 05:52:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:52:59] [INFO ] Invariant cache hit.
[2023-03-22 05:52:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15 in 2198 ms.
[2023-03-22 05:52:59] [INFO ] Flatten gal took : 25 ms
[2023-03-22 05:52:59] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-22 05:52:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50 places, 80 transitions and 210 arcs took 1 ms.
Total runtime 354142 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: JoinFreeModules_PT_2000
(NrP: 50 NrTr: 80 NrArc: 210)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.834sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 736924 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16087832 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok

initing FirstDep: 0m 0.000sec

30346

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-2000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is JoinFreeModules-PT-2000, 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 r234-tall-167856420000221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;