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.r229-tall-167856412900197.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 itstools
Input is JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856412900197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:55 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 613K 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-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679447593176

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-22 01:13:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 01:13:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:13:14] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-22 01:13:14] [INFO ] Transformed 1001 places.
[2023-03-22 01:13:14] [INFO ] Transformed 1601 transitions.
[2023-03-22 01:13:14] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-22 01:13:14] [INFO ] Computed 200 place invariants in 34 ms
Incomplete random walk after 10019 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 16) seen :223
[2023-03-22 01:13:17] [INFO ] Invariant cache hit.
[2023-03-22 01:13:17] [INFO ] [Real]Absence check using 200 positive place invariants in 82 ms returned sat
[2023-03-22 01:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:17] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2023-03-22 01:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 01:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:19] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2023-03-22 01:13:19] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-22 01:13:19] [INFO ] [Nat]Added 200 Read/Feed constraints in 156 ms returned sat
[2023-03-22 01:13:20] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
[2023-03-22 01:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-22 01:13:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 93 ms.
[2023-03-22 01:13:23] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 1 ms to minimize.
[2023-03-22 01:13:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:13:23] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:24] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-22 01:13:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 72 ms returned sat
[2023-03-22 01:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:26] [INFO ] [Nat]Absence check using state equation in 2094 ms returned sat
[2023-03-22 01:13:26] [INFO ] [Nat]Added 200 Read/Feed constraints in 124 ms returned sat
[2023-03-22 01:13:26] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2023-03-22 01:13:29] [INFO ] Added : 115 causal constraints over 23 iterations in 2535 ms. Result :unknown
[2023-03-22 01:13:29] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-22 01:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:29] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-22 01:13:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 01:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:31] [INFO ] [Nat]Absence check using state equation in 1557 ms returned sat
[2023-03-22 01:13:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 157 ms returned sat
[2023-03-22 01:13:31] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-22 01:13:35] [INFO ] Deduced a trap composed of 3 places in 406 ms of which 2 ms to minimize.
[2023-03-22 01:13:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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.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 01:13:35] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 01:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:35] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-22 01:13:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:35] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:37] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2023-03-22 01:13:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 141 ms returned sat
[2023-03-22 01:13:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-22 01:13:41] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 1 ms to minimize.
[2023-03-22 01:13:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:13:41] [INFO ] [Real]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-22 01:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:41] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-22 01:13:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:13:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:43] [INFO ] [Nat]Absence check using state equation in 1571 ms returned sat
[2023-03-22 01:13:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 137 ms returned sat
[2023-03-22 01:13:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-22 01:13:47] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 1 ms to minimize.
[2023-03-22 01:13:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:13:47] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-22 01:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:47] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-22 01:13:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 01:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:49] [INFO ] [Nat]Absence check using state equation in 1519 ms returned sat
[2023-03-22 01:13:49] [INFO ] [Nat]Added 200 Read/Feed constraints in 132 ms returned sat
[2023-03-22 01:13:49] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-22 01:13:53] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 1 ms to minimize.
[2023-03-22 01:13:53] [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 5
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.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 01:13:53] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:13:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:53] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-22 01:13:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:57] [INFO ] [Nat]Absence check using state equation in 3767 ms returned sat
[2023-03-22 01:13:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 100 ms returned sat
[2023-03-22 01:13:57] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 87 ms.
[2023-03-22 01:13:58] [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.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:13:58] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:13:59] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-22 01:13:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:13:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:13:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:01] [INFO ] [Nat]Absence check using state equation in 1802 ms returned sat
[2023-03-22 01:14:01] [INFO ] [Nat]Added 200 Read/Feed constraints in 112 ms returned sat
[2023-03-22 01:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:14:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 326 ms
[2023-03-22 01:14:01] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-22 01:14:04] [INFO ] Added : 155 causal constraints over 31 iterations in 2628 ms. Result :unknown
[2023-03-22 01:14:04] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:04] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-22 01:14:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:06] [INFO ] [Nat]Absence check using state equation in 1568 ms returned sat
[2023-03-22 01:14:06] [INFO ] [Nat]Added 200 Read/Feed constraints in 109 ms returned sat
[2023-03-22 01:14:06] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 85 ms.
[2023-03-22 01:14:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:14:10] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 01:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:10] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-22 01:14:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:12] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2023-03-22 01:14:12] [INFO ] [Nat]Added 200 Read/Feed constraints in 118 ms returned sat
[2023-03-22 01:14:12] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2023-03-22 01:14:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:14:15] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:16] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-22 01:14:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:16] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-22 01:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:17] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2023-03-22 01:14:18] [INFO ] [Nat]Added 200 Read/Feed constraints in 135 ms returned sat
[2023-03-22 01:14:18] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-22 01:14:21] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 1 ms to minimize.
[2023-03-22 01:14:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:14:21] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 01:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:22] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-22 01:14:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-22 01:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:23] [INFO ] [Nat]Absence check using state equation in 1593 ms returned sat
[2023-03-22 01:14:24] [INFO ] [Nat]Added 200 Read/Feed constraints in 89 ms returned sat
[2023-03-22 01:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:14:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:14:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-03-22 01:14:24] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-22 01:14:27] [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 11
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.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:14:27] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 01:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:27] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2023-03-22 01:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:14:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:29] [INFO ] [Nat]Absence check using state equation in 1775 ms returned sat
[2023-03-22 01:14:29] [INFO ] [Nat]Added 200 Read/Feed constraints in 120 ms returned sat
[2023-03-22 01:14:30] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-22 01:14:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:14:32] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-22 01:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:33] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-22 01:14:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:35] [INFO ] [Nat]Absence check using state equation in 1572 ms returned sat
[2023-03-22 01:14:35] [INFO ] [Nat]Added 200 Read/Feed constraints in 130 ms returned sat
[2023-03-22 01:14:35] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 75 ms.
[2023-03-22 01:14:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
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.refineWithCausalOrder(DeadlockTester.java:1186)
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 01:14:38] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:38] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-22 01:14:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:39] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-22 01:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:41] [INFO ] [Nat]Absence check using state equation in 1912 ms returned sat
[2023-03-22 01:14:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 01:14:44] [INFO ] [Nat]Added 200 Read/Feed constraints in 2962 ms returned unknown
[2023-03-22 01:14:44] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-22 01:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:44] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-22 01:14:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:14:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-22 01:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:14:46] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2023-03-22 01:14:46] [INFO ] [Nat]Added 200 Read/Feed constraints in 127 ms returned sat
[2023-03-22 01:14:46] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-22 01:14:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
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.refineWithCausalOrder(DeadlockTester.java:1186)
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)
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[9, 10, 12, 9, 10, 12, 2, 9, 200, 2, 2, 9, 2, 12, 10, 12]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.3 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 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 25 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-22 01:15:49] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-22 01:15:49] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 80/1000 places, 128/1601 transitions.
[2023-03-22 01:15:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 1250 ms. (steps per millisecond=800 ) properties (out of 16) seen :3174
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1368 ms. (steps per millisecond=730 ) properties (out of 15) seen :743
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 15) seen :740
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 15) seen :743
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1351 ms. (steps per millisecond=740 ) properties (out of 15) seen :755
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1329 ms. (steps per millisecond=752 ) properties (out of 15) seen :723
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1335 ms. (steps per millisecond=749 ) properties (out of 15) seen :749
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1353 ms. (steps per millisecond=739 ) properties (out of 15) seen :660
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties (out of 15) seen :766
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1369 ms. (steps per millisecond=730 ) properties (out of 15) seen :615
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1399 ms. (steps per millisecond=714 ) properties (out of 15) seen :657
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1399 ms. (steps per millisecond=714 ) properties (out of 15) seen :661
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties (out of 15) seen :793
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1369 ms. (steps per millisecond=730 ) properties (out of 15) seen :655
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 15) seen :714
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1339 ms. (steps per millisecond=746 ) properties (out of 15) seen :737
[2023-03-22 01:16:11] [INFO ] Invariant cache hit.
[2023-03-22 01:16:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 01:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:11] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 01:16:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-22 01:16:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:11] [INFO ] Added : 66 causal constraints over 14 iterations in 288 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 01:16:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 01:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:12] [INFO ] Added : 46 causal constraints over 11 iterations in 126 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 01:16:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 01:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-22 01:16:12] [INFO ] Added : 45 causal constraints over 9 iterations in 154 ms. Result :sat
Minimization took 37 ms.
[2023-03-22 01:16:12] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 01:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:12] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 01:16:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:13] [INFO ] Added : 56 causal constraints over 14 iterations in 205 ms. Result :sat
Minimization took 56 ms.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 01:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:13] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 01:16:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:13] [INFO ] Added : 45 causal constraints over 10 iterations in 127 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 01:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:13] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:13] [INFO ] Added : 50 causal constraints over 11 iterations in 154 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:13] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 01:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:14] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:16:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:14] [INFO ] Added : 51 causal constraints over 11 iterations in 148 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 01:16:14] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 01:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 01:16:14] [INFO ] Added : 42 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 01:16:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 01:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:14] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-22 01:16:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:15] [INFO ] Added : 59 causal constraints over 12 iterations in 142 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 01:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:15] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 01:16:15] [INFO ] Added : 54 causal constraints over 13 iterations in 149 ms. Result :sat
Minimization took 36 ms.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 01:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:15] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:16:15] [INFO ] Added : 56 causal constraints over 12 iterations in 179 ms. Result :sat
Minimization took 50 ms.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 01:16:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:16] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 01:16:16] [INFO ] Added : 48 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 01:16:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 01:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:16] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:16] [INFO ] Added : 51 causal constraints over 11 iterations in 128 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 01:16:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-22 01:16:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:16] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 01:16:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:17] [INFO ] Added : 51 causal constraints over 11 iterations in 185 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 01:16:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 01:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:17] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 01:16:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-22 01:16:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:17] [INFO ] Added : 42 causal constraints over 11 iterations in 112 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 202, 198, 201, 202, 197, 200, 200, 198, 196, 198, 195, 201, 202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 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 60 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 4 ms. Remains 60 /80 variables (removed 20) and now considering 96/128 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 60/80 places, 96/128 transitions.
// Phase 1: matrix 96 rows 60 cols
[2023-03-22 01:16:18] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000046 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 12) seen :2386
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 12) seen :814
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 12) seen :716
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 12) seen :821
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 12) seen :714
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 12) seen :803
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 12) seen :756
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 12) seen :649
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 12) seen :760
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 12) seen :764
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 12) seen :867
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 12) seen :767
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 12) seen :737
[2023-03-22 01:16:32] [INFO ] Invariant cache hit.
[2023-03-22 01:16:32] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:16:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:32] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 01:16:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 01:16:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:33] [INFO ] Added : 35 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 57 ms.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:33] [INFO ] Added : 36 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 01:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 22 ms returned sat
[2023-03-22 01:16:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:33] [INFO ] Added : 38 causal constraints over 10 iterations in 103 ms. Result :sat
Minimization took 48 ms.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:16:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:33] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 01:16:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:16:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-22 01:16:34] [INFO ] Added : 29 causal constraints over 7 iterations in 124 ms. Result :sat
Minimization took 35 ms.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 01:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:16:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 01:16:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 01:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:34] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:16:34] [INFO ] Added : 38 causal constraints over 9 iterations in 95 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 16 ms returned sat
[2023-03-22 01:16:34] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:16:34] [INFO ] Added : 34 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:16:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 01:16:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:16:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 01:16:35] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:35] [INFO ] Added : 39 causal constraints over 10 iterations in 109 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 01:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:16:35] [INFO ] Added : 26 causal constraints over 7 iterations in 56 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 01:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:16:35] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:16:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 01:16:35] [INFO ] Added : 25 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 01:16:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:16:35] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 01:16:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:16:35] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 5 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 4 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 4 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:37] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:16:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:44] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:16:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:16:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:16:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 01:17:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:17:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:17] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-22 01:17:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 01:17:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 01:17:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:17:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:17:20] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:17:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:21] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-22 01:17:21] [INFO ] [Nat]Added 12 Read/Feed constraints in 23 ms returned sat
[2023-03-22 01:17:21] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 01:17:21] [INFO ] Added : 38 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 200, 201, 202, 200, 200, 202, 202, 201, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 55 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 3 ms. Remains 55 /60 variables (removed 5) and now considering 88/96 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/60 places, 88/96 transitions.
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:17:21] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 1000040 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 11) seen :2177
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 11) seen :870
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 11) seen :765
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 11) seen :830
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 11) seen :799
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 11) seen :857
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 11) seen :678
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 11) seen :835
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 11) seen :848
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 11) seen :866
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 11) seen :804
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 11) seen :757
[2023-03-22 01:17:33] [INFO ] Invariant cache hit.
[2023-03-22 01:17:33] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 01:17:34] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:34] [INFO ] Added : 31 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 37 ms.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:34] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:34] [INFO ] Added : 31 causal constraints over 7 iterations in 137 ms. Result :sat
Minimization took 34 ms.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:34] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:17:34] [INFO ] Added : 32 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 43 ms.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 01:17:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:17:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 01:17:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-22 01:17:35] [INFO ] Added : 39 causal constraints over 9 iterations in 166 ms. Result :sat
Minimization took 26 ms.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 12 ms returned sat
[2023-03-22 01:17:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 01:17:35] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 01:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2023-03-22 01:17:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:35] [INFO ] Added : 37 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 01:17:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:17:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-22 01:17:36] [INFO ] Added : 27 causal constraints over 6 iterations in 131 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 01:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2023-03-22 01:17:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:17:36] [INFO ] Added : 29 causal constraints over 6 iterations in 150 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 01:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 01:17:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 01:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 01:17:36] [INFO ] Added : 45 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 01:17:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2023-03-22 01:17:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 01:17:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-22 01:17:36] [INFO ] Added : 31 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 01:17:37] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:17:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 01:17:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:17:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 01:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-22 01:17:37] [INFO ] Added : 28 causal constraints over 7 iterations in 145 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 200, 201, 202, 200, 202, 202, 201, 202, 201]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-22 01:17:38] [INFO ] Invariant cache hit.
[2023-03-22 01:17:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 01:17:38] [INFO ] Invariant cache hit.
[2023-03-22 01:17:38] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-22 01:17:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:17:38] [INFO ] Invariant cache hit.
[2023-03-22 01:17:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 55/55 places, 88/88 transitions.
[2023-03-22 01:17:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 11) seen :2178
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 11) seen :806
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 11) seen :762
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 11) seen :843
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties (out of 11) seen :756
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 11) seen :838
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 11) seen :634
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 11) seen :859
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 11) seen :831
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 11) seen :849
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1113 ms. (steps per millisecond=898 ) properties (out of 11) seen :761
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 11) seen :714
[2023-03-22 01:17:50] [INFO ] Invariant cache hit.
[2023-03-22 01:17:50] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:50] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 01:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 01:17:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:17:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:51] [INFO ] Added : 31 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 38 ms.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 01:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:17:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:51] [INFO ] Added : 31 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2023-03-22 01:17:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 01:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 01:17:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:51] [INFO ] Added : 39 causal constraints over 9 iterations in 66 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 01:17:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:51] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-22 01:17:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:17:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 01:17:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2023-03-22 01:17:52] [INFO ] Added : 39 causal constraints over 9 iterations in 154 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-22 01:17:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:52] [INFO ] Added : 16 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-22 01:17:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:52] [INFO ] Added : 37 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 42 ms.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-22 01:17:52] [INFO ] Added : 27 causal constraints over 6 iterations in 128 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2023-03-22 01:17:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 01:17:53] [INFO ] Added : 29 causal constraints over 6 iterations in 152 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 01:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 01:17:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 01:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-22 01:17:53] [INFO ] Added : 45 causal constraints over 9 iterations in 133 ms. Result :sat
Minimization took 29 ms.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2023-03-22 01:17:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 01:17:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 01:17:53] [INFO ] Added : 31 causal constraints over 7 iterations in 125 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 01:17:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:54] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 01:17:54] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:54] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-22 01:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 01:17:54] [INFO ] Added : 28 causal constraints over 7 iterations in 130 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 201, 201, 202, 200, 202, 202, 201, 202, 201]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-22 01:17:54] [INFO ] Invariant cache hit.
[2023-03-22 01:17:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 01:17:54] [INFO ] Invariant cache hit.
[2023-03-22 01:17:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-22 01:17:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
[2023-03-22 01:17:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 55/55 places, 88/88 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
Incomplete random walk after 10071 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1438 ) properties (out of 1) seen :100
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 :109
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
[2023-03-22 01:17:55] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 01:17:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:55] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 01:17:55] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:55] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:55] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 01:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-22 01:17:55] [INFO ] Added : 32 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[109]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:17:55] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:17:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :200
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 01:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 01:17:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:17:56] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-22 01:17:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000019 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6134 ) properties (out of 1) seen :200
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 01:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:17:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-22 01:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-22 01:17:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:17:56] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 01:17:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 1641 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:17:56] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :201
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 01:17:56] [INFO ] Invariant cache hit.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 01:17:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:56] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:56] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:57] [INFO ] Added : 31 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:17:57] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 01:17:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:17:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000053 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4237 ) properties (out of 1) seen :201
[2023-03-22 01:17:57] [INFO ] Invariant cache hit.
[2023-03-22 01:17:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:57] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:17:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:17:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 01:17:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:17:57] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:17:57] [INFO ] Invariant cache hit.
[2023-03-22 01:17:57] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 01:17:57] [INFO ] Invariant cache hit.
[2023-03-22 01:17:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-22 01:17:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:17:57] [INFO ] Invariant cache hit.
[2023-03-22 01:17:57] [INFO ] Dead Transitions using invariants and state equation in 18 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-0200-UpperBounds-01 in 970 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:17:57] [INFO ] Computed 11 place invariants in 3 ms
Incomplete random walk after 10040 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 1) seen :50
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 :108
[2023-03-22 01:17:57] [INFO ] Invariant cache hit.
[2023-03-22 01:17:57] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:57] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 01:17:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:57] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 01:17:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:57] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:17:57] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:17:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 01:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 01:17:58] [INFO ] Added : 33 causal constraints over 7 iterations in 113 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[108]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:17:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 01:17:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:17:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000024 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=6493 ) properties (out of 1) seen :200
[2023-03-22 01:17:58] [INFO ] Invariant cache hit.
[2023-03-22 01:17:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 01:17:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:17:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-22 01:17:58] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:17:58] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
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 01:17:58] [INFO ] Invariant cache hit.
[2023-03-22 01:17:58] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 01:17:58] [INFO ] Invariant cache hit.
[2023-03-22 01:17:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 01:17:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:17:58] [INFO ] Invariant cache hit.
[2023-03-22 01:17:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 01:17:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000092 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6803 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :200
[2023-03-22 01:17:59] [INFO ] Invariant cache hit.
[2023-03-22 01:17:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:59] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 01:17:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 01:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-22 01:17:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:17:59] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:17:59] [INFO ] Invariant cache hit.
[2023-03-22 01:17:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 01:17:59] [INFO ] Invariant cache hit.
[2023-03-22 01:17:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:17:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 01:17:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:17:59] [INFO ] Invariant cache hit.
[2023-03-22 01:17:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 1517 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:17:59] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :201
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 01:17:59] [INFO ] Invariant cache hit.
[2023-03-22 01:17:59] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:17:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:17:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 01:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:17:59] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-22 01:17:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:17:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:17:59] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:17:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 01:17:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-22 01:17:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2023-03-22 01:17:59] [INFO ] Added : 39 causal constraints over 9 iterations in 164 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:17:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:17: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 24 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:17:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=5882 ) properties (out of 1) seen :201
[2023-03-22 01:18:00] [INFO ] Invariant cache hit.
[2023-03-22 01:18:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:00] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:18:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:18:00] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:18:00] [INFO ] Invariant cache hit.
[2023-03-22 01:18:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-22 01:18:00] [INFO ] Invariant cache hit.
[2023-03-22 01:18:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 01:18:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:00] [INFO ] Invariant cache hit.
[2023-03-22 01:18:00] [INFO ] Dead Transitions using invariants and state equation in 17 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-0200-UpperBounds-04 in 990 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:00] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10014 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :100
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 :108
[2023-03-22 01:18:00] [INFO ] Invariant cache hit.
[2023-03-22 01:18:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:18:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:00] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 01:18:00] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:00] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:18:00] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:18:00] [INFO ] Added : 51 causal constraints over 11 iterations in 100 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[108]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:00] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 01:18:00] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :198
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 01:18:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:18:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 01:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 01:18:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:18:01] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 01:18:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 1026 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:01] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10180 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1018 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :200
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 01:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 01:18:01] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-22 01:18:01] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:18:01] [INFO ] Added : 37 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:01] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 01:18:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6211 ) properties (out of 1) seen :200
[2023-03-22 01:18:01] [INFO ] Invariant cache hit.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 01:18:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:18:02] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
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 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:02] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 01:18:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 860 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:02] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10037 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 1) seen :170
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :12
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:18:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:02] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 01:18:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:02] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:18:02] [INFO ] Added : 25 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[170]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:02] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-22 01:18:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=5617 ) properties (out of 1) seen :202
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 01:18:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 01:18:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09 in 785 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:02] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :152
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :8
[2023-03-22 01:18:02] [INFO ] Invariant cache hit.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:02] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 01:18:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 01:18:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2023-03-22 01:18:03] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:18:03] [INFO ] Added : 29 causal constraints over 6 iterations in 103 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[152]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:03] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 01:18:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:03] [INFO ] Invariant cache hit.
Incomplete random walk after 1000039 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=5847 ) properties (out of 1) seen :202
[2023-03-22 01:18:03] [INFO ] Invariant cache hit.
[2023-03-22 01:18:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 01:18:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 01:18:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 01:18:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 825 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:03] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10063 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1257 ) properties (out of 1) seen :152
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 :104
[2023-03-22 01:18:03] [INFO ] Invariant cache hit.
[2023-03-22 01:18:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:18:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:03] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 01:18:03] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:03] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:18:03] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:18:03] [INFO ] Added : 44 causal constraints over 10 iterations in 86 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[152]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:04] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:18:04] [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/55 places, 8/88 transitions.
[2023-03-22 01:18:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000070 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=6493 ) properties (out of 1) seen :200
[2023-03-22 01:18:04] [INFO ] Invariant cache hit.
[2023-03-22 01:18:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:04] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:18:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 01:18:04] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
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 01:18:04] [INFO ] Invariant cache hit.
[2023-03-22 01:18:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 01:18:04] [INFO ] Invariant cache hit.
[2023-03-22 01:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:04] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 01:18:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:04] [INFO ] Invariant cache hit.
[2023-03-22 01:18:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-22 01:18:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000064 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :201
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 :200
[2023-03-22 01:18:05] [INFO ] Invariant cache hit.
[2023-03-22 01:18:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 01:18:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:05] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 01:18:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:18:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 01:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-22 01:18:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:18:05] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:18:05] [INFO ] Invariant cache hit.
[2023-03-22 01:18:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 01:18:05] [INFO ] Invariant cache hit.
[2023-03-22 01:18:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-22 01:18:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:05] [INFO ] Invariant cache hit.
[2023-03-22 01:18:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11 in 1620 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:05] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1253 ) properties (out of 1) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :8
[2023-03-22 01:18:05] [INFO ] Invariant cache hit.
[2023-03-22 01:18:05] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 01:18:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:05] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 01:18:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-22 01:18:05] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 01:18:05] [INFO ] Added : 33 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[103]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 5 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:18:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=5347 ) properties (out of 1) seen :202
[2023-03-22 01:18:06] [INFO ] Invariant cache hit.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 01:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 01:18:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-22 01:18:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12 in 779 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 88 rows 55 cols
[2023-03-22 01:18:06] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10038 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1434 ) properties (out of 1) seen :201
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 01:18:06] [INFO ] Invariant cache hit.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 01:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 01:18:06] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 01:18:06] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-22 01:18:06] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 01:18:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 01:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-22 01:18:06] [INFO ] Added : 28 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 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 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 01:18:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 01:18:06] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-22 01:18:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=5847 ) properties (out of 1) seen :201
[2023-03-22 01:18:06] [INFO ] Invariant cache hit.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 01:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 01:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:18:06] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 01:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 01:18:06] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 01:18:06] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
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 01:18:06] [INFO ] Invariant cache hit.
[2023-03-22 01:18:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 01:18:06] [INFO ] Invariant cache hit.
[2023-03-22 01:18:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 01:18:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 01:18:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:18:07] [INFO ] Invariant cache hit.
[2023-03-22 01:18:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 891 ms.
[2023-03-22 01:18:07] [INFO ] Flatten gal took : 59 ms
[2023-03-22 01:18:07] [INFO ] Applying decomposition
[2023-03-22 01:18:07] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1030008287917932011.txt' '-o' '/tmp/graph1030008287917932011.bin' '-w' '/tmp/graph1030008287917932011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1030008287917932011.bin' '-l' '-1' '-v' '-w' '/tmp/graph1030008287917932011.weights' '-q' '0' '-e' '0.001'
[2023-03-22 01:18:07] [INFO ] Decomposing Gal with order
[2023-03-22 01:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 01:18:07] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-22 01:18:07] [INFO ] Time to serialize gal into /tmp/UpperBounds10635941906393081673.gal : 2 ms
[2023-03-22 01:18:07] [INFO ] Time to serialize properties into /tmp/UpperBounds14469835710156886881.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10635941906393081673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14469835710156886881.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds14469835710156886881.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.80881e+86,7.87353,118576,13,1419,37,339629,48,0,63,399420,0
Total reachable state count : 3.808814559926716759115684888194081889523e+86

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-00 :0 <= u7.p704 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-00,0,7.89172,118576,1,0,64,339629,114,12,278,399420,123
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-01 :0 <= u10.p907 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-01,0,8.04047,118576,1,0,68,339629,140,12,490,399420,134
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-03 :0 <= u9.p764 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-03,0,8.04066,118576,1,0,71,339629,162,12,490,399420,139
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-04 :0 <= u0.p337 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-04,0,8.04079,118576,1,0,82,339629,188,12,490,399420,160
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-07 :0 <= u2.p494 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-07,0,8.04094,118576,1,0,92,339629,203,12,490,399420,179
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-08 :0 <= u4.p508 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-08,0,8.11121,118576,1,0,101,339629,221,12,698,399420,195
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-11 :0 <= u3.p499 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-11,0,8.11149,118576,1,0,110,339629,237,12,698,399420,212
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-14 :0 <= u1.p402 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-14,0,8.1116,118576,1,0,121,339629,251,12,698,399420,233
Total runtime 300986 ms.

BK_STOP 1679447896451

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-0200, 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 r229-tall-167856412900197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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