About the Execution of 2024-gold for ShieldPPPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15686.350 | 986520.00 | 1089240.00 | 2098.50 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r209-tall-174894546800117.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is ShieldPPPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546800117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 955K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-050B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749020731080
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:05:32] [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]
[2025-06-04 07:05:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:05:32] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2025-06-04 07:05:32] [INFO ] Transformed 3903 places.
[2025-06-04 07:05:32] [INFO ] Transformed 3553 transitions.
[2025-06-04 07:05:32] [INFO ] Found NUPN structural information;
[2025-06-04 07:05:32] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3553 rows 3903 cols
[2025-06-04 07:05:33] [INFO ] Computed 551 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 112 ms. (88 steps per ms)
FORMULA ShieldPPPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (22 resets) in 141 ms. (774 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-04 07:05:33] [INFO ] Invariant cache hit.
[2025-06-04 07:05:34] [INFO ] [Real]Absence check using 551 positive place invariants in 284 ms returned sat
[2025-06-04 07:05:36] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2025-06-04 07:05:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 275 ms returned sat
[2025-06-04 07:05:38] [INFO ] [Nat]Absence check using state equation in 1539 ms returned sat
[2025-06-04 07:05:41] [INFO ] Deduced a trap composed of 26 places in 2199 ms of which 171 ms to minimize.
[2025-06-04 07:05:43] [INFO ] Deduced a trap composed of 28 places in 1968 ms of which 23 ms to minimize.
[2025-06-04 07:05:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:05:44] [INFO ] [Real]Absence check using 551 positive place invariants in 296 ms returned sat
[2025-06-04 07:05:45] [INFO ] [Real]Absence check using state equation in 1656 ms returned sat
[2025-06-04 07:05:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 274 ms returned sat
[2025-06-04 07:05:48] [INFO ] [Nat]Absence check using state equation in 1753 ms returned sat
[2025-06-04 07:05:50] [INFO ] Deduced a trap composed of 19 places in 1813 ms of which 22 ms to minimize.
[2025-06-04 07:05:52] [INFO ] Deduced a trap composed of 38 places in 1776 ms of which 21 ms to minimize.
[2025-06-04 07:05:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:05:53] [INFO ] [Real]Absence check using 551 positive place invariants in 256 ms returned sat
[2025-06-04 07:05:54] [INFO ] [Real]Absence check using state equation in 1491 ms returned sat
[2025-06-04 07:05:56] [INFO ] Deduced a trap composed of 19 places in 1830 ms of which 20 ms to minimize.
[2025-06-04 07:05:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:57] [INFO ] [Nat]Absence check using 551 positive place invariants in 244 ms returned sat
[2025-06-04 07:05:59] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2025-06-04 07:06:01] [INFO ] Deduced a trap composed of 19 places in 1946 ms of which 22 ms to minimize.
[2025-06-04 07:06:03] [INFO ] Deduced a trap composed of 26 places in 1913 ms of which 21 ms to minimize.
[2025-06-04 07:06:03] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:04] [INFO ] [Real]Absence check using 551 positive place invariants in 254 ms returned sat
[2025-06-04 07:06:05] [INFO ] [Real]Absence check using state equation in 1526 ms returned sat
[2025-06-04 07:06:08] [INFO ] Deduced a trap composed of 22 places in 2168 ms of which 23 ms to minimize.
[2025-06-04 07:06:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 250 ms returned sat
[2025-06-04 07:06:10] [INFO ] [Nat]Absence check using state equation in 1522 ms returned sat
[2025-06-04 07:06:12] [INFO ] Deduced a trap composed of 22 places in 2178 ms of which 23 ms to minimize.
[2025-06-04 07:06:15] [INFO ] Deduced a trap composed of 25 places in 2157 ms of which 26 ms to minimize.
[2025-06-04 07:06: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 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:15] [INFO ] [Real]Absence check using 551 positive place invariants in 246 ms returned sat
[2025-06-04 07:06:17] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2025-06-04 07:06:19] [INFO ] Deduced a trap composed of 27 places in 1844 ms of which 21 ms to minimize.
[2025-06-04 07:06:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 269 ms returned sat
[2025-06-04 07:06:22] [INFO ] [Nat]Absence check using state equation in 1509 ms returned sat
[2025-06-04 07:06:23] [INFO ] Deduced a trap composed of 27 places in 1863 ms of which 22 ms to minimize.
[2025-06-04 07:06:25] [INFO ] Deduced a trap composed of 29 places in 1869 ms of which 22 ms to minimize.
[2025-06-04 07:06:25] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:26] [INFO ] [Real]Absence check using 551 positive place invariants in 244 ms returned sat
[2025-06-04 07:06:28] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2025-06-04 07:06:30] [INFO ] Deduced a trap composed of 24 places in 1782 ms of which 21 ms to minimize.
[2025-06-04 07:06:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:31] [INFO ] [Nat]Absence check using 551 positive place invariants in 261 ms returned sat
[2025-06-04 07:06:32] [INFO ] [Nat]Absence check using state equation in 1759 ms returned sat
[2025-06-04 07:06:34] [INFO ] Deduced a trap composed of 24 places in 1858 ms of which 21 ms to minimize.
[2025-06-04 07:06:36] [INFO ] Deduced a trap composed of 28 places in 1833 ms of which 21 ms to minimize.
[2025-06-04 07:06:36] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:37] [INFO ] [Real]Absence check using 551 positive place invariants in 273 ms returned sat
[2025-06-04 07:06:39] [INFO ] [Real]Absence check using state equation in 1737 ms returned sat
[2025-06-04 07:06:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:40] [INFO ] [Nat]Absence check using 551 positive place invariants in 238 ms returned sat
[2025-06-04 07:06:42] [INFO ] [Nat]Absence check using state equation in 1658 ms returned sat
[2025-06-04 07:06:44] [INFO ] Deduced a trap composed of 26 places in 1946 ms of which 22 ms to minimize.
[2025-06-04 07:06:46] [INFO ] Deduced a trap composed of 31 places in 1907 ms of which 19 ms to minimize.
[2025-06-04 07:06:46] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:47] [INFO ] [Real]Absence check using 551 positive place invariants in 271 ms returned sat
[2025-06-04 07:06:48] [INFO ] [Real]Absence check using state equation in 1799 ms returned sat
[2025-06-04 07:06:50] [INFO ] Deduced a trap composed of 25 places in 1749 ms of which 18 ms to minimize.
[2025-06-04 07:06:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:06:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 249 ms returned sat
[2025-06-04 07:06:53] [INFO ] [Nat]Absence check using state equation in 1566 ms returned sat
[2025-06-04 07:06:55] [INFO ] Deduced a trap composed of 25 places in 1680 ms of which 19 ms to minimize.
[2025-06-04 07:06:57] [INFO ] Deduced a trap composed of 38 places in 1769 ms of which 19 ms to minimize.
[2025-06-04 07:06:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:06:58] [INFO ] [Real]Absence check using 551 positive place invariants in 256 ms returned sat
[2025-06-04 07:06:59] [INFO ] [Real]Absence check using state equation in 1506 ms returned sat
[2025-06-04 07:06:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:00] [INFO ] [Nat]Absence check using 551 positive place invariants in 251 ms returned sat
[2025-06-04 07:07:02] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2025-06-04 07:07:03] [INFO ] Deduced a trap composed of 28 places in 1788 ms of which 22 ms to minimize.
[2025-06-04 07:07:05] [INFO ] Deduced a trap composed of 19 places in 1808 ms of which 21 ms to minimize.
[2025-06-04 07:07:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:07:06] [INFO ] [Real]Absence check using 551 positive place invariants in 270 ms returned sat
[2025-06-04 07:07:08] [INFO ] [Real]Absence check using state equation in 1867 ms returned sat
[2025-06-04 07:07:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 257 ms returned sat
[2025-06-04 07:07:11] [INFO ] [Nat]Absence check using state equation in 1614 ms returned sat
[2025-06-04 07:07:13] [INFO ] Deduced a trap composed of 22 places in 2001 ms of which 24 ms to minimize.
[2025-06-04 07:07:15] [INFO ] Deduced a trap composed of 38 places in 1757 ms of which 20 ms to minimize.
[2025-06-04 07:07: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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 07:07:16] [INFO ] [Real]Absence check using 551 positive place invariants in 277 ms returned sat
[2025-06-04 07:07:17] [INFO ] [Real]Absence check using state equation in 1747 ms returned sat
[2025-06-04 07:07:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:07:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 248 ms returned sat
[2025-06-04 07:07:20] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2025-06-04 07:07:22] [INFO ] Deduced a trap composed of 16 places in 1999 ms of which 23 ms to minimize.
[2025-06-04 07:07:24] [INFO ] Deduced a trap composed of 31 places in 1990 ms of which 19 ms to minimize.
[2025-06-04 07:07:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 948 transitions
Trivial Post-agglo rules discarded 948 transitions
Performed 948 trivial Post agglomeration. Transition count delta: 948
Iterating post reduction 0 with 948 rules applied. Total rules applied 948 place count 3903 transition count 2605
Reduce places removed 948 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 950 rules applied. Total rules applied 1898 place count 2955 transition count 2603
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 1902 place count 2954 transition count 2600
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1905 place count 2951 transition count 2600
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 198 Pre rules applied. Total rules applied 1905 place count 2951 transition count 2402
Deduced a syphon composed of 198 places in 7 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 396 rules applied. Total rules applied 2301 place count 2753 transition count 2402
Discarding 348 places :
Symmetric choice reduction at 4 with 348 rule applications. Total rules 2649 place count 2405 transition count 2054
Iterating global reduction 4 with 348 rules applied. Total rules applied 2997 place count 2405 transition count 2054
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 147 Pre rules applied. Total rules applied 2997 place count 2405 transition count 1907
Deduced a syphon composed of 147 places in 14 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 4 with 294 rules applied. Total rules applied 3291 place count 2258 transition count 1907
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 4 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 4 with 1696 rules applied. Total rules applied 4987 place count 1410 transition count 1059
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5189 place count 1309 transition count 1059
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 5279 place count 1264 transition count 1059
Partial Free-agglomeration rule applied 147 times.
Drop transitions (Partial Free agglomeration) removed 147 transitions
Iterating global reduction 4 with 147 rules applied. Total rules applied 5426 place count 1264 transition count 1059
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5427 place count 1263 transition count 1058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5428 place count 1262 transition count 1058
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 5428 place count 1262 transition count 1056
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5432 place count 1260 transition count 1056
Applied a total of 5432 rules in 1237 ms. Remains 1260 /3903 variables (removed 2643) and now considering 1056/3553 (removed 2497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1249 ms. Remains : 1260/3903 places, 1056/3553 transitions.
// Phase 1: matrix 1056 rows 1260 cols
[2025-06-04 07:07:25] [INFO ] Computed 550 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8998 ms. (111 steps per ms)
FORMULA ShieldPPPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4634418 steps (12 resets) in 30006 ms. (154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-04 07:08:04] [INFO ] Invariant cache hit.
[2025-06-04 07:08:05] [INFO ] [Real]Absence check using 550 positive place invariants in 82 ms returned sat
[2025-06-04 07:08:05] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-04 07:08:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:08:05] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:08:05] [INFO ] [Nat]Absence check using 550 positive place invariants in 93 ms returned sat
[2025-06-04 07:08:06] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2025-06-04 07:08:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:08:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 3 ms to minimize.
[2025-06-04 07:08:06] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 3 ms to minimize.
[2025-06-04 07:08:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2025-06-04 07:08:06] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 63 ms.
[2025-06-04 07:08:26] [INFO ] Added : 945 causal constraints over 189 iterations in 20338 ms.(timeout) Result :sat
Minimization took 679 ms.
[2025-06-04 07:08:27] [INFO ] [Real]Absence check using 550 positive place invariants in 76 ms returned sat
[2025-06-04 07:08:28] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-04 07:08:28] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:08:28] [INFO ] [Nat]Absence check using 550 positive place invariants in 80 ms returned sat
[2025-06-04 07:08:28] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2025-06-04 07:08:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:08:28] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2025-06-04 07:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-04 07:08:29] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 50 ms.
[2025-06-04 07:08:49] [INFO ] Added : 970 causal constraints over 194 iterations in 20206 ms.(timeout) Result :sat
Minimization took 767 ms.
[2025-06-04 07:08:50] [INFO ] [Real]Absence check using 550 positive place invariants in 80 ms returned sat
[2025-06-04 07:08:50] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-04 07:08:50] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:08:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:08:50] [INFO ] [Nat]Absence check using 550 positive place invariants in 79 ms returned sat
[2025-06-04 07:08:51] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-04 07:08:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:08:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
[2025-06-04 07:08:51] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2025-06-04 07:08:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2025-06-04 07:08:51] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 50 ms.
[2025-06-04 07:09:11] [INFO ] Added : 960 causal constraints over 192 iterations in 20093 ms.(timeout) Result :sat
Minimization took 637 ms.
[2025-06-04 07:09:12] [INFO ] [Real]Absence check using 550 positive place invariants in 83 ms returned sat
[2025-06-04 07:09:12] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-06-04 07:09:12] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:09:13] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 3 ms to minimize.
[2025-06-04 07:09:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:09:13] [INFO ] [Nat]Absence check using 550 positive place invariants in 83 ms returned sat
[2025-06-04 07:09:13] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2025-06-04 07:09:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:09:13] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 6 ms to minimize.
[2025-06-04 07:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2025-06-04 07:09:13] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 49 ms.
[2025-06-04 07:09:34] [INFO ] Added : 990 causal constraints over 198 iterations in 20285 ms.(timeout) Result :sat
Minimization took 671 ms.
[2025-06-04 07:09:35] [INFO ] [Real]Absence check using 550 positive place invariants in 83 ms returned sat
[2025-06-04 07:09:35] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2025-06-04 07:09:35] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:09:35] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 51 ms.
[2025-06-04 07:09:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:09:36] [INFO ] [Nat]Absence check using 550 positive place invariants in 81 ms returned sat
[2025-06-04 07:09:36] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-04 07:09:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:09:36] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-04 07:09:56] [INFO ] Added : 955 causal constraints over 191 iterations in 20260 ms.(timeout) Result :sat
Minimization took 535 ms.
[2025-06-04 07:09:57] [INFO ] [Real]Absence check using 550 positive place invariants in 78 ms returned sat
[2025-06-04 07:09:57] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2025-06-04 07:09:57] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:09:58] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2025-06-04 07:09:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:09:58] [INFO ] [Nat]Absence check using 550 positive place invariants in 89 ms returned sat
[2025-06-04 07:09:58] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-06-04 07:09:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:09:58] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2025-06-04 07:09:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-04 07:09:59] [INFO ] Computed and/alt/rep : 1052/2455/1052 causal constraints (skipped 0 transitions) in 52 ms.
[2025-06-04 07:10:19] [INFO ] Added : 985 causal constraints over 197 iterations in 20488 ms.(timeout) Result :sat
Minimization took 1037 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1260/1260 places, 1056/1056 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1260 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1259 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1259 transition count 1053
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1257 transition count 1053
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1255 transition count 1051
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1253 transition count 1051
Applied a total of 14 rules in 203 ms. Remains 1253 /1260 variables (removed 7) and now considering 1051/1056 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 1253/1260 places, 1051/1056 transitions.
// Phase 1: matrix 1051 rows 1253 cols
[2025-06-04 07:10:27] [INFO ] Computed 550 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8765 ms. (114 steps per ms)
BEST_FIRST walk for 4834898 steps (12 resets) in 30006 ms. (161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-04 07:11:06] [INFO ] Invariant cache hit.
[2025-06-04 07:11:06] [INFO ] [Real]Absence check using 550 positive place invariants in 78 ms returned sat
[2025-06-04 07:11:07] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2025-06-04 07:11:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:11:07] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:11:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:11:07] [INFO ] [Nat]Absence check using 550 positive place invariants in 76 ms returned sat
[2025-06-04 07:11:07] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-04 07:11:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:11:08] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2025-06-04 07:11:08] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 58 ms.
[2025-06-04 07:11:26] [INFO ] Added : 993 causal constraints over 199 iterations in 18422 ms. Result :sat
Minimization took 719 ms.
[2025-06-04 07:11:27] [INFO ] [Real]Absence check using 550 positive place invariants in 76 ms returned sat
[2025-06-04 07:11:27] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-06-04 07:11:27] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:11:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:11:28] [INFO ] [Nat]Absence check using 550 positive place invariants in 89 ms returned sat
[2025-06-04 07:11:28] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2025-06-04 07:11:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:11:28] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:11:28] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 3 ms to minimize.
[2025-06-04 07:11:28] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 3 ms to minimize.
[2025-06-04 07:11:29] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:11:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 605 ms
[2025-06-04 07:11:29] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 50 ms.
[2025-06-04 07:11:51] [INFO ] Added : 985 causal constraints over 197 iterations in 21983 ms.(timeout) Result :sat
Minimization took 2034 ms.
[2025-06-04 07:11:53] [INFO ] [Real]Absence check using 550 positive place invariants in 90 ms returned sat
[2025-06-04 07:11:53] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2025-06-04 07:11:53] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:11:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:11:54] [INFO ] [Nat]Absence check using 550 positive place invariants in 91 ms returned sat
[2025-06-04 07:11:54] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-04 07:11:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:11:54] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 60 ms.
[2025-06-04 07:12:14] [INFO ] Added : 999 causal constraints over 200 iterations in 20119 ms. Result :sat
Minimization took 2748 ms.
[2025-06-04 07:12:17] [INFO ] [Real]Absence check using 550 positive place invariants in 81 ms returned sat
[2025-06-04 07:12:18] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-04 07:12:18] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:12:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:12:18] [INFO ] [Nat]Absence check using 550 positive place invariants in 82 ms returned sat
[2025-06-04 07:12:18] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-04 07:12:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2025-06-04 07:12:18] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2025-06-04 07:12:18] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-04 07:12:39] [INFO ] Added : 1010 causal constraints over 202 iterations in 20292 ms.(timeout) Result :sat
Minimization took 3947 ms.
[2025-06-04 07:12:43] [INFO ] [Real]Absence check using 550 positive place invariants in 80 ms returned sat
[2025-06-04 07:12:43] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-06-04 07:12:43] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:12:43] [INFO ] [Nat]Absence check using 550 positive place invariants in 82 ms returned sat
[2025-06-04 07:12:44] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2025-06-04 07:12:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:12:44] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2025-06-04 07:12:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2025-06-04 07:12:44] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 42 ms.
[2025-06-04 07:13:04] [INFO ] Added : 975 causal constraints over 195 iterations in 20123 ms.(timeout) Result :sat
Minimization took 1301 ms.
[2025-06-04 07:13:06] [INFO ] [Real]Absence check using 550 positive place invariants in 74 ms returned sat
[2025-06-04 07:13:06] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-06-04 07:13:06] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:13:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:13:06] [INFO ] [Nat]Absence check using 550 positive place invariants in 79 ms returned sat
[2025-06-04 07:13:07] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2025-06-04 07:13:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:13:07] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2025-06-04 07:13:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-04 07:13:07] [INFO ] Computed and/alt/rep : 1047/2461/1047 causal constraints (skipped 0 transitions) in 55 ms.
[2025-06-04 07:13:29] [INFO ] Added : 997 causal constraints over 200 iterations in 22389 ms.(timeout) Result :sat
Minimization took 3214 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1051/1051 transitions.
Applied a total of 0 rules in 35 ms. Remains 1253 /1253 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1253/1253 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1051/1051 transitions.
Applied a total of 0 rules in 28 ms. Remains 1253 /1253 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2025-06-04 07:13:39] [INFO ] Invariant cache hit.
[2025-06-04 07:13:40] [INFO ] Implicit Places using invariants in 649 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1251/1253 places, 1051/1051 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1249 transition count 1049
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1249 transition count 1049
Applied a total of 4 rules in 68 ms. Remains 1249 /1251 variables (removed 2) and now considering 1049/1051 (removed 2) transitions.
// Phase 1: matrix 1049 rows 1249 cols
[2025-06-04 07:13:40] [INFO ] Computed 548 invariants in 7 ms
[2025-06-04 07:13:41] [INFO ] Implicit Places using invariants in 710 ms returned []
[2025-06-04 07:13:41] [INFO ] Invariant cache hit.
[2025-06-04 07:13:42] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1249/1253 places, 1049/1051 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2752 ms. Remains : 1249/1253 places, 1049/1051 transitions.
[2025-06-04 07:13:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8601 ms. (116 steps per ms)
BEST_FIRST walk for 4919560 steps (12 resets) in 30006 ms. (163 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-04 07:14:21] [INFO ] Invariant cache hit.
[2025-06-04 07:14:21] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:14:21] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2025-06-04 07:14:21] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 3 ms to minimize.
[2025-06-04 07:14:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:14:22] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2025-06-04 07:14:22] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-04 07:14:22] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2025-06-04 07:14:22] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2025-06-04 07:14:22] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2025-06-04 07:14:23] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
[2025-06-04 07:14:23] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 3 ms to minimize.
[2025-06-04 07:14:23] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 3 ms to minimize.
[2025-06-04 07:14:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 942 ms
[2025-06-04 07:14:23] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 54 ms.
[2025-06-04 07:14:43] [INFO ] Added : 1005 causal constraints over 202 iterations in 20153 ms.(timeout) Result :sat
Minimization took 801 ms.
[2025-06-04 07:14:44] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2025-06-04 07:14:44] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2025-06-04 07:14:45] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2025-06-04 07:14:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:14:45] [INFO ] [Nat]Absence check using 548 positive place invariants in 78 ms returned sat
[2025-06-04 07:14:45] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-04 07:14:45] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 3 ms to minimize.
[2025-06-04 07:14:46] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2025-06-04 07:14:46] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 2 ms to minimize.
[2025-06-04 07:14:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2025-06-04 07:14:46] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-04 07:15:03] [INFO ] Added : 994 causal constraints over 200 iterations in 17448 ms. Result :sat
Minimization took 1664 ms.
[2025-06-04 07:15:05] [INFO ] [Real]Absence check using 548 positive place invariants in 79 ms returned sat
[2025-06-04 07:15:05] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-06-04 07:15:06] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 17 ms to minimize.
[2025-06-04 07:15:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:15:06] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2025-06-04 07:15:06] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2025-06-04 07:15:06] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2025-06-04 07:15:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2025-06-04 07:15:07] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 54 ms.
[2025-06-04 07:15:25] [INFO ] Added : 1015 causal constraints over 204 iterations in 18500 ms. Result :sat
Minimization took 699 ms.
[2025-06-04 07:15:26] [INFO ] [Real]Absence check using 548 positive place invariants in 77 ms returned sat
[2025-06-04 07:15:26] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-04 07:15:26] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 3 ms to minimize.
[2025-06-04 07:15:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:15:27] [INFO ] [Nat]Absence check using 548 positive place invariants in 85 ms returned sat
[2025-06-04 07:15:27] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-06-04 07:15:27] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2025-06-04 07:15:27] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
[2025-06-04 07:15:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2025-06-04 07:15:27] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 59 ms.
[2025-06-04 07:15:46] [INFO ] Added : 1006 causal constraints over 202 iterations in 18867 ms. Result :sat
Minimization took 1527 ms.
[2025-06-04 07:15:48] [INFO ] [Real]Absence check using 548 positive place invariants in 84 ms returned sat
[2025-06-04 07:15:48] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2025-06-04 07:15:49] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 3 ms to minimize.
[2025-06-04 07:15:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:15:49] [INFO ] [Nat]Absence check using 548 positive place invariants in 89 ms returned sat
[2025-06-04 07:15:49] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-06-04 07:15:49] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:15:50] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2025-06-04 07:15:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 331 ms
[2025-06-04 07:15:50] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-04 07:16:13] [INFO ] Added : 1013 causal constraints over 203 iterations in 22838 ms.(timeout) Result :sat
Minimization took 2893 ms.
[2025-06-04 07:16:16] [INFO ] [Real]Absence check using 548 positive place invariants in 81 ms returned sat
[2025-06-04 07:16:16] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-04 07:16:16] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2025-06-04 07:16:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:16:16] [INFO ] [Nat]Absence check using 548 positive place invariants in 83 ms returned sat
[2025-06-04 07:16:17] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2025-06-04 07:16:17] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2025-06-04 07:16:17] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 2 ms to minimize.
[2025-06-04 07:16:17] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2025-06-04 07:16:17] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2025-06-04 07:16:18] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:16:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 754 ms
[2025-06-04 07:16:18] [INFO ] Computed and/alt/rep : 1045/2448/1045 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-04 07:16:39] [INFO ] Added : 1015 causal constraints over 203 iterations in 21517 ms.(timeout) Result :sat
Minimization took 1430 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1049/1049 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1249 transition count 1048
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1248 transition count 1048
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 60 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1049 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1247/1249 places, 1048/1049 transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2025-06-04 07:16:47] [INFO ] Computed 548 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 8905 ms. (112 steps per ms)
BEST_FIRST walk for 3214272 steps (8 resets) in 20004 ms. (160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-04 07:17:16] [INFO ] Invariant cache hit.
[2025-06-04 07:17:17] [INFO ] [Real]Absence check using 548 positive place invariants in 78 ms returned sat
[2025-06-04 07:17:17] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2025-06-04 07:17:17] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2025-06-04 07:17:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:17:17] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:17:18] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-06-04 07:17:18] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2025-06-04 07:17:18] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2025-06-04 07:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2025-06-04 07:17:18] [INFO ] Computed and/alt/rep : 1044/2451/1044 causal constraints (skipped 0 transitions) in 51 ms.
[2025-06-04 07:17:38] [INFO ] Added : 1012 causal constraints over 204 iterations in 19907 ms. Result :sat
Minimization took 2670 ms.
[2025-06-04 07:17:41] [INFO ] [Real]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:17:41] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-04 07:17:41] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2025-06-04 07:17:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:17:42] [INFO ] [Nat]Absence check using 548 positive place invariants in 80 ms returned sat
[2025-06-04 07:17:42] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-04 07:17:42] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2025-06-04 07:17:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-06-04 07:17:42] [INFO ] Computed and/alt/rep : 1044/2451/1044 causal constraints (skipped 0 transitions) in 45 ms.
[2025-06-04 07:18:01] [INFO ] Added : 1010 causal constraints over 203 iterations in 18455 ms. Result :sat
Minimization took 3624 ms.
[2025-06-04 07:18:04] [INFO ] [Real]Absence check using 548 positive place invariants in 80 ms returned sat
[2025-06-04 07:18:05] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-04 07:18:05] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2025-06-04 07:18:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:18:05] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:18:06] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-04 07:18:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2025-06-04 07:18:06] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2025-06-04 07:18:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2025-06-04 07:18:06] [INFO ] Computed and/alt/rep : 1044/2451/1044 causal constraints (skipped 0 transitions) in 46 ms.
[2025-06-04 07:18:26] [INFO ] Added : 1003 causal constraints over 202 iterations in 20287 ms.(timeout) Result :sat
Minimization took 3661 ms.
[2025-06-04 07:18:30] [INFO ] [Real]Absence check using 548 positive place invariants in 75 ms returned sat
[2025-06-04 07:18:30] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-04 07:18:31] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2025-06-04 07:18:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:18:31] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:18:31] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-06-04 07:18:31] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2025-06-04 07:18:31] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:18:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2025-06-04 07:18:31] [INFO ] Computed and/alt/rep : 1044/2451/1044 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-04 07:18:49] [INFO ] Added : 996 causal constraints over 200 iterations in 17924 ms. Result :sat
Minimization took 817 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
Applied a total of 2 rules in 32 ms. Remains 1246 /1247 variables (removed 1) and now considering 1047/1048 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1246/1247 places, 1047/1048 transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2025-06-04 07:18:55] [INFO ] Computed 548 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 8424 ms. (118 steps per ms)
BEST_FIRST walk for 3273574 steps (8 resets) in 20004 ms. (163 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-04 07:19:23] [INFO ] Invariant cache hit.
[2025-06-04 07:19:24] [INFO ] [Real]Absence check using 548 positive place invariants in 74 ms returned sat
[2025-06-04 07:19:24] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-06-04 07:19:24] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2025-06-04 07:19:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:19:24] [INFO ] [Nat]Absence check using 548 positive place invariants in 74 ms returned sat
[2025-06-04 07:19:25] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-06-04 07:19:25] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2025-06-04 07:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-04 07:19:25] [INFO ] Computed and/alt/rep : 1043/2451/1043 causal constraints (skipped 0 transitions) in 47 ms.
[2025-06-04 07:19:47] [INFO ] Added : 989 causal constraints over 199 iterations in 21628 ms.(timeout) Result :sat
Minimization took 2163 ms.
[2025-06-04 07:19:49] [INFO ] [Real]Absence check using 548 positive place invariants in 75 ms returned sat
[2025-06-04 07:19:49] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2025-06-04 07:19:50] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2025-06-04 07:19:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:19:50] [INFO ] [Nat]Absence check using 548 positive place invariants in 76 ms returned sat
[2025-06-04 07:19:50] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-06-04 07:19:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2025-06-04 07:19:50] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:19:51] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:19:51] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2025-06-04 07:19:51] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2025-06-04 07:19:51] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2025-06-04 07:19:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 833 ms
[2025-06-04 07:19:51] [INFO ] Computed and/alt/rep : 1043/2451/1043 causal constraints (skipped 0 transitions) in 46 ms.
[2025-06-04 07:20:10] [INFO ] Added : 1009 causal constraints over 203 iterations in 19248 ms. Result :sat
Minimization took 2471 ms.
[2025-06-04 07:20:13] [INFO ] [Real]Absence check using 548 positive place invariants in 75 ms returned sat
[2025-06-04 07:20:13] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-04 07:20:13] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2025-06-04 07:20:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:20:14] [INFO ] [Nat]Absence check using 548 positive place invariants in 73 ms returned sat
[2025-06-04 07:20:14] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-06-04 07:20:14] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 2 ms to minimize.
[2025-06-04 07:20:14] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2025-06-04 07:20:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2025-06-04 07:20:14] [INFO ] Computed and/alt/rep : 1043/2451/1043 causal constraints (skipped 0 transitions) in 48 ms.
[2025-06-04 07:20:31] [INFO ] Added : 1001 causal constraints over 201 iterations in 17127 ms. Result :sat
Minimization took 1161 ms.
[2025-06-04 07:20:33] [INFO ] [Real]Absence check using 548 positive place invariants in 77 ms returned sat
[2025-06-04 07:20:33] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-06-04 07:20:33] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 2 ms to minimize.
[2025-06-04 07:20:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:20:34] [INFO ] [Nat]Absence check using 548 positive place invariants in 79 ms returned sat
[2025-06-04 07:20:34] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2025-06-04 07:20:34] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2025-06-04 07:20:34] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 3 ms to minimize.
[2025-06-04 07:20:34] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2025-06-04 07:20:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 426 ms
[2025-06-04 07:20:34] [INFO ] Computed and/alt/rep : 1043/2451/1043 causal constraints (skipped 0 transitions) in 49 ms.
[2025-06-04 07:20:54] [INFO ] Added : 1018 causal constraints over 204 iterations in 19605 ms. Result :sat
Minimization took 4097 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 1047/1047 transitions.
Applied a total of 0 rules in 33 ms. Remains 1246 /1246 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 1246/1246 places, 1047/1047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 1047/1047 transitions.
Applied a total of 0 rules in 26 ms. Remains 1246 /1246 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2025-06-04 07:21:03] [INFO ] Invariant cache hit.
[2025-06-04 07:21:03] [INFO ] Implicit Places using invariants in 615 ms returned []
[2025-06-04 07:21:03] [INFO ] Invariant cache hit.
[2025-06-04 07:21:04] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2025-06-04 07:21:05] [INFO ] Redundant transitions in 54 ms returned []
Running 1043 sub problems to find dead transitions.
[2025-06-04 07:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1244 variables, 546/546 constraints. Problems are: Problem set: 0 solved, 1043 unsolved
[2025-06-04 07:21:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2025-06-04 07:21:34] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 5 ms to minimize.
[2025-06-04 07:21:34] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 5 ms to minimize.
[2025-06-04 07:21:34] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 5 ms to minimize.
[2025-06-04 07:21:34] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 5 ms to minimize.
[2025-06-04 07:21:35] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 4 ms to minimize.
[2025-06-04 07:21:35] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 5 ms to minimize.
SMT process timed out in 30470ms, After SMT, problems are : Problem set: 0 solved, 1043 unsolved
Search for dead transitions found 0 dead transitions in 30490ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32345 ms. Remains : 1246/1246 places, 1047/1047 transitions.
RANDOM walk for 40000 steps (8 resets) in 923 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 491 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 493 ms. (80 steps per ms) remains 8/8 properties
[2025-06-04 07:21:36] [INFO ] Flatten gal took : 287 ms
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 8/8 properties
[2025-06-04 07:21:36] [INFO ] Flatten gal took : 105 ms
[2025-06-04 07:21:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14555460886504700286.gal : 53 ms
[2025-06-04 07:21:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2162180947367626441.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14555460886504700286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2162180947367626441.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality2162180947367626441.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 424 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :15 after 28
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :28 after 54
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :54 after 103
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :103 after 226
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :226 after 538
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :538 after 5443
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5443 after 147560
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :147560 after 4.33661e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.33661e+06 after 7.20988e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :7.20988e+08 after 1.96461e+10
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.96461e+10 after 1.6822e+13
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1.6822e+13 after 6.11438e+16
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :6.11438e+16 after 5.80884e+23
Interrupted probabilistic random walk after 83090 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 8
Probabilistic random walk after 83090 steps, saw 68041 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
[2025-06-04 07:21:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 11/19 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 32/51 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/53 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/57 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/57 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 53/110 variables, 27/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 4/114 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/114 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/114 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 8/122 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 75/197 variables, 41/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/197 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/197 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 4/201 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/201 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/201 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 8/209 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/209 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 102/311 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/311 variables, 15/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/311 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 5/316 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/316 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/316 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 4/320 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/320 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 93/413 variables, 53/287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/413 variables, 17/304 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-04 07:21:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/413 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/413 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 4/417 variables, 6/311 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/417 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/417 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 4/421 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/421 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 82/503 variables, 46/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/503 variables, 14/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/503 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 4/507 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/507 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/507 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 4/511 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/511 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 71/582 variables, 39/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/582 variables, 11/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/582 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 4/586 variables, 6/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/586 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/586 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 4/590 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/590 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 59/649 variables, 36/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/649 variables, 11/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/649 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 2/651 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/651 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/651 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 35/686 variables, 18/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/686 variables, 7/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/686 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 2/688 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/688 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/688 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 4/692 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/692 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (OVERLAPS) 49/741 variables, 27/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/741 variables, 5/567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/741 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 4/745 variables, 6/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/745 variables, 4/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/745 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 35/780 variables, 18/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/780 variables, 7/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/780 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (OVERLAPS) 2/782 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/782 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/782 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 90 (OVERLAPS) 4/786 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/786 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 92 (OVERLAPS) 49/835 variables, 27/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/835 variables, 5/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/835 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 95 (OVERLAPS) 4/839 variables, 6/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/839 variables, 4/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/839 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 98 (OVERLAPS) 35/874 variables, 18/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/874 variables, 7/675 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/874 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 101 (OVERLAPS) 2/876 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/876 variables, 2/679 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 103 (INCLUDED_ONLY) 0/876 variables, 0/679 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 104 (OVERLAPS) 4/880 variables, 2/681 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD size :5.80884e+23 after 1.33706e+34
At refinement iteration 105 (INCLUDED_ONLY) 0/880 variables, 0/681 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 48/928 variables, 28/709 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/928 variables, 7/716 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/928 variables, 0/716 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 2/930 variables, 4/720 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/930 variables, 2/722 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/930 variables, 0/722 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 23/953 variables, 14/736 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/953 variables, 7/743 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/953 variables, 0/743 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 29/982 variables, 15/758 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/982 variables, 3/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/982 variables, 0/761 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 2/984 variables, 4/765 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/984 variables, 2/767 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/984 variables, 0/767 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 121 (OVERLAPS) 15/999 variables, 8/775 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/999 variables, 4/779 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/999 variables, 0/779 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 124 (OVERLAPS) 29/1028 variables, 15/794 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1028 variables, 3/797 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1028 variables, 0/797 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 2/1030 variables, 4/801 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1030 variables, 2/803 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1030 variables, 0/803 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 130 (OVERLAPS) 15/1045 variables, 8/811 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1045 variables, 4/815 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1045 variables, 0/815 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 29/1074 variables, 15/830 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1074 variables, 3/833 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1074 variables, 0/833 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 136 (OVERLAPS) 2/1076 variables, 4/837 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1076 variables, 2/839 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1076 variables, 0/839 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 15/1091 variables, 8/847 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1091 variables, 4/851 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1091 variables, 0/851 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 142 (OVERLAPS) 29/1120 variables, 15/866 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1120 variables, 3/869 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1120 variables, 0/869 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 145 (OVERLAPS) 2/1122 variables, 4/873 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1122 variables, 2/875 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1122 variables, 0/875 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 148 (OVERLAPS) 15/1137 variables, 8/883 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1137 variables, 4/887 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1137 variables, 0/887 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 29/1166 variables, 15/902 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1166 variables, 3/905 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1166 variables, 0/905 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 154 (OVERLAPS) 2/1168 variables, 4/909 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1168 variables, 2/911 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1168 variables, 0/911 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 157 (OVERLAPS) 15/1183 variables, 8/919 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1183 variables, 4/923 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1183 variables, 0/923 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 160 (OVERLAPS) 29/1212 variables, 15/938 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1212 variables, 3/941 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1212 variables, 0/941 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 163 (OVERLAPS) 2/1214 variables, 4/945 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1214 variables, 2/947 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1214 variables, 0/947 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 166 (OVERLAPS) 15/1229 variables, 8/955 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1229 variables, 4/959 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1229 variables, 0/959 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 169 (OVERLAPS) 29/1258 variables, 15/974 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1258 variables, 3/977 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1258 variables, 0/977 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 172 (OVERLAPS) 2/1260 variables, 4/981 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1260 variables, 2/983 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1260 variables, 0/983 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 15/1275 variables, 8/991 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1275 variables, 4/995 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1275 variables, 0/995 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SMT process timed out in 5053ms, After SMT, problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 1047/1047 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1243 transition count 1044
Applied a total of 6 rules in 54 ms. Remains 1243 /1246 variables (removed 3) and now considering 1044/1047 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1243/1246 places, 1044/1047 transitions.
RANDOM walk for 40000 steps (8 resets) in 599 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.33706e+34 after 4.5921e+40
Interrupted probabilistic random walk after 138391 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 138391 steps, saw 112595 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 1044 rows 1243 cols
[2025-06-04 07:21:48] [INFO ] Computed 548 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/24 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 33/57 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/61 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/61 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/69 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/69 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 30/99 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/99 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/99 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 55/154 variables, 27/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/154 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/154 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/158 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/158 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 4/162 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/162 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 42/204 variables, 26/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/204 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/204 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 49/253 variables, 25/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/253 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-04 07:21:48] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/253 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/253 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 4/257 variables, 6/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/257 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/257 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 4/261 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/261 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 35/296 variables, 21/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/296 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/296 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 49/345 variables, 25/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/345 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/345 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 4/349 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/349 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/349 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 4/353 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/353 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 35/388 variables, 21/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/388 variables, 8/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/388 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 49/437 variables, 25/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/437 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/437 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 4/441 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/441 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/441 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 4/445 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/445 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 35/480 variables, 21/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/480 variables, 8/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/480 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 49/529 variables, 25/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/529 variables, 6/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/529 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 4/533 variables, 6/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/533 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/533 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 4/537 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/537 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 35/572 variables, 21/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/572 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/572 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 49/621 variables, 25/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/621 variables, 6/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/621 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/625 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/625 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/625 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (OVERLAPS) 4/629 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/629 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 35/664 variables, 21/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/664 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/664 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 49/713 variables, 25/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/713 variables, 6/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/713 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 4/717 variables, 6/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/717 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/717 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 4/721 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/721 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 35/756 variables, 21/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/756 variables, 8/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/756 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 49/805 variables, 25/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/805 variables, 6/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/805 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 4/809 variables, 6/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/809 variables, 4/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/809 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 4/813 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/813 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (OVERLAPS) 35/848 variables, 21/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/848 variables, 8/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/848 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (OVERLAPS) 49/897 variables, 25/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/897 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/897 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 4/901 variables, 6/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/901 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/901 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 4/905 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/905 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 35/940 variables, 21/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/940 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 120 (INCLUDED_ONLY) 0/940 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (OVERLAPS) 49/989 variables, 25/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/989 variables, 6/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/989 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (OVERLAPS) 4/993 variables, 6/768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/993 variables, 4/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/993 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 4/997 variables, 2/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/997 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 35/1032 variables, 21/795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1032 variables, 8/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1032 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (OVERLAPS) 49/1081 variables, 25/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1081 variables, 6/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1081 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (OVERLAPS) 4/1085 variables, 6/840 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1085 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1085 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (OVERLAPS) 4/1089 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1089 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (OVERLAPS) 35/1124 variables, 21/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1124 variables, 8/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1124 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 49/1173 variables, 25/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1173 variables, 6/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1173 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (OVERLAPS) 4/1177 variables, 6/912 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1177 variables, 4/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1177 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (OVERLAPS) 4/1181 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1181 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 34/1215 variables, 21/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1215 variables, 8/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1215 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (OVERLAPS) 37/1252 variables, 21/968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1252 variables, 6/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1252 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (OVERLAPS) 2/1254 variables, 4/978 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1254 variables, 2/980 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1254 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (OVERLAPS) 15/1269 variables, 8/988 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1269 variables, 4/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1269 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (OVERLAPS) 29/1298 variables, 15/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1298 variables, 3/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1298 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (OVERLAPS) 2/1300 variables, 4/1014 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1300 variables, 2/1016 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1300 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (OVERLAPS) 15/1315 variables, 8/1024 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1315 variables, 4/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1315 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (OVERLAPS) 29/1344 variables, 15/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1344 variables, 3/1046 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1344 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 2/1346 variables, 4/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1346 variables, 2/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1346 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (OVERLAPS) 15/1361 variables, 8/1060 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1361 variables, 4/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1361 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (OVERLAPS) 29/1390 variables, 15/1079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1390 variables, 3/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1390 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (OVERLAPS) 2/1392 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1392 variables, 2/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1392 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (OVERLAPS) 15/1407 variables, 8/1096 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1407 variables, 4/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1407 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (OVERLAPS) 29/1436 variables, 15/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1436 variables, 3/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1436 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (OVERLAPS) 2/1438 variables, 4/1122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1438 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1438 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (OVERLAPS) 15/1453 variables, 8/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1453 variables, 4/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1453 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (OVERLAPS) 29/1482 variables, 15/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1482 variables, 3/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1482 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (OVERLAPS) 2/1484 variables, 4/1158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1484 variables, 2/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1484 variables, 0/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (OVERLAPS) 15/1499 variables, 8/1168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1499 variables, 4/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1499 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (OVERLAPS) 29/1528 variables, 15/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1528 variables, 3/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1528 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (OVERLAPS) 2/1530 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1530 variables, 2/1196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1530 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 214 (OVERLAPS) 15/1545 variables, 8/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1545 variables, 4/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1545 variables, 0/1208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 217 (OVERLAPS) 29/1574 variables, 15/1223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1574 variables, 3/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1574 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 220 (OVERLAPS) 2/1576 variables, 4/1230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1576 variables, 2/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1576 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 223 (OVERLAPS) 15/1591 variables, 8/1240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1591 variables, 4/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1591 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 226 (OVERLAPS) 29/1620 variables, 15/1259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1620 variables, 3/1262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1620 variables, 0/1262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 229 (OVERLAPS) 2/1622 variables, 4/1266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1622 variables, 2/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1622 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 232 (OVERLAPS) 15/1637 variables, 8/1276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1637 variables, 4/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1637 variables, 0/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 235 (OVERLAPS) 29/1666 variables, 15/1295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1666 variables, 3/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1666 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 238 (OVERLAPS) 2/1668 variables, 4/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1668 variables, 2/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1668 variables, 0/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 241 (OVERLAPS) 15/1683 variables, 8/1312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1683 variables, 4/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1683 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 244 (OVERLAPS) 29/1712 variables, 15/1331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1712 variables, 3/1334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1712 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 247 (OVERLAPS) 2/1714 variables, 4/1338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1714 variables, 2/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1714 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 250 (OVERLAPS) 15/1729 variables, 8/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1729 variables, 4/1352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1729 variables, 0/1352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 253 (OVERLAPS) 29/1758 variables, 15/1367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1758 variables, 3/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1758 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 256 (OVERLAPS) 2/1760 variables, 4/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1760 variables, 2/1376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1760 variables, 0/1376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 259 (OVERLAPS) 15/1775 variables, 8/1384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1775 variables, 4/1388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1775 variables, 0/1388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 262 (OVERLAPS) 29/1804 variables, 15/1403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1804 variables, 3/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1804 variables, 0/1406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 265 (OVERLAPS) 2/1806 variables, 4/1410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1806 variables, 2/1412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1806 variables, 0/1412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 268 (OVERLAPS) 15/1821 variables, 8/1420 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1821 variables, 4/1424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1821 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 271 (OVERLAPS) 29/1850 variables, 15/1439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1850 variables, 3/1442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1850 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 274 (OVERLAPS) 2/1852 variables, 4/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1852 variables, 2/1448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1852 variables, 0/1448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 277 (OVERLAPS) 15/1867 variables, 8/1456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1867 variables, 4/1460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1867 variables, 0/1460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 280 (OVERLAPS) 29/1896 variables, 15/1475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1896 variables, 3/1478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1896 variables, 0/1478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 283 (OVERLAPS) 2/1898 variables, 4/1482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1898 variables, 2/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1898 variables, 0/1484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 286 (OVERLAPS) 15/1913 variables, 8/1492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1913 variables, 4/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1913 variables, 0/1496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 289 (OVERLAPS) 29/1942 variables, 15/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1942 variables, 3/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1942 variables, 0/1514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 292 (OVERLAPS) 2/1944 variables, 4/1518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1944 variables, 2/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1944 variables, 0/1520 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 295 (OVERLAPS) 15/1959 variables, 8/1528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1959 variables, 4/1532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1959 variables, 0/1532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 298 (OVERLAPS) 29/1988 variables, 15/1547 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1988 variables, 3/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1988 variables, 0/1550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 301 (OVERLAPS) 2/1990 variables, 4/1554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1990 variables, 2/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1990 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 304 (OVERLAPS) 15/2005 variables, 8/1564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/2005 variables, 4/1568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/2005 variables, 0/1568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 307 (OVERLAPS) 29/2034 variables, 15/1583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/2034 variables, 3/1586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/2034 variables, 0/1586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 310 (OVERLAPS) 2/2036 variables, 4/1590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/2036 variables, 2/1592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/2036 variables, 0/1592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 313 (OVERLAPS) 15/2051 variables, 8/1600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/2051 variables, 4/1604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 315 (INCLUDED_ONLY) 0/2051 variables, 0/1604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 316 (OVERLAPS) 29/2080 variables, 15/1619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/2080 variables, 3/1622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/2080 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 319 (OVERLAPS) 2/2082 variables, 4/1626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/2082 variables, 2/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/2082 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 322 (OVERLAPS) 15/2097 variables, 8/1636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/2097 variables, 4/1640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/2097 variables, 0/1640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 325 (OVERLAPS) 29/2126 variables, 15/1655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/2126 variables, 3/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/2126 variables, 0/1658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 328 (OVERLAPS) 2/2128 variables, 4/1662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/2128 variables, 2/1664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/2128 variables, 0/1664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 331 (OVERLAPS) 15/2143 variables, 8/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/2143 variables, 4/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/2143 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 334 (OVERLAPS) 29/2172 variables, 15/1691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/2172 variables, 3/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/2172 variables, 0/1694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 337 (OVERLAPS) 2/2174 variables, 4/1698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/2174 variables, 2/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/2174 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 340 (OVERLAPS) 15/2189 variables, 8/1708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/2189 variables, 4/1712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/2189 variables, 0/1712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 343 (OVERLAPS) 29/2218 variables, 15/1727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/2218 variables, 3/1730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/2218 variables, 0/1730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 346 (OVERLAPS) 2/2220 variables, 4/1734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/2220 variables, 2/1736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/2220 variables, 0/1736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 349 (OVERLAPS) 14/2234 variables, 8/1744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/2234 variables, 4/1748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/2234 variables, 0/1748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 352 (OVERLAPS) 24/2258 variables, 12/1760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/2258 variables, 2/1762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/2258 variables, 0/1762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 355 (OVERLAPS) 2/2260 variables, 4/1766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/2260 variables, 2/1768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/2260 variables, 0/1768 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 358 (OVERLAPS) 10/2270 variables, 6/1774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/2270 variables, 3/1777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/2270 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 361 (OVERLAPS) 15/2285 variables, 8/1785 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/2285 variables, 4/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/2285 variables, 0/1789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 364 (OVERLAPS) 2/2287 variables, 2/1791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/2287 variables, 1/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/2287 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 367 (OVERLAPS) 0/2287 variables, 0/1792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2287/2287 variables, and 1792 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5666 ms.
Refiners :[Positive P Invariants (semi-flows): 548/548 constraints, State Equation: 1243/1243 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/24 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 33/57 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/61 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/61 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/61 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/69 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/69 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 30/99 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/99 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/99 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 55/154 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/154 variables, 7/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/154 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/158 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/158 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 4/162 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/162 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 42/204 variables, 26/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/204 variables, 10/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/204 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 49/253 variables, 25/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/253 variables, 6/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/253 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/253 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 4/257 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/257 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/257 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 4/261 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/261 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 35/296 variables, 21/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/296 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/296 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 49/345 variables, 25/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/345 variables, 6/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/345 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 4/349 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/349 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/349 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 4/353 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/353 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 35/388 variables, 21/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/388 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/388 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 49/437 variables, 25/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/437 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/437 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 4/441 variables, 6/338 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/441 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/441 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/445 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/445 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 35/480 variables, 21/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/480 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/480 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 49/529 variables, 25/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/529 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/529 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 4/533 variables, 6/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/533 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/533 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 4/537 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/537 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 35/572 variables, 21/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/572 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/572 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 49/621 variables, 25/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/621 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/621 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 4/625 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/625 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/625 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 4/629 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/629 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 35/664 variables, 21/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/664 variables, 8/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/664 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 49/713 variables, 25/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/713 variables, 6/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/713 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (OVERLAPS) 4/717 variables, 6/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/717 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/717 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (OVERLAPS) 4/721 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/721 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 35/756 variables, 21/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/756 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/756 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 49/805 variables, 25/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/805 variables, 6/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/805 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 4/809 variables, 6/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/809 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/809 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 4/813 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/813 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 35/848 variables, 21/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/848 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/848 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 49/897 variables, 25/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/897 variables, 6/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/897 variables, 0/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 4/901 variables, 6/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/901 variables, 4/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/901 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 4/905 variables, 2/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/905 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 35/940 variables, 21/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/940 variables, 8/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/940 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 49/989 variables, 25/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/989 variables, 6/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/989 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (OVERLAPS) 4/993 variables, 6/770 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/993 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/993 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (OVERLAPS) 4/997 variables, 2/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/997 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (OVERLAPS) 35/1032 variables, 21/797 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1032 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1032 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 49/1081 variables, 25/830 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1081 variables, 6/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1081 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (OVERLAPS) 4/1085 variables, 6/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1085 variables, 4/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1085 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 4/1089 variables, 2/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1089 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (OVERLAPS) 35/1124 variables, 21/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1124 variables, 8/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1124 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (OVERLAPS) 49/1173 variables, 25/902 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1173 variables, 6/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1173 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (OVERLAPS) 4/1177 variables, 6/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1177 variables, 4/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1177 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (OVERLAPS) 4/1181 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1181 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (OVERLAPS) 34/1215 variables, 21/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1215 variables, 8/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1215 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (OVERLAPS) 37/1252 variables, 21/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1252 variables, 6/976 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1252 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (OVERLAPS) 2/1254 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1254 variables, 2/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1254 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (OVERLAPS) 15/1269 variables, 8/990 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1269 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1269 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (OVERLAPS) 29/1298 variables, 15/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1298 variables, 3/1012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1298 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (OVERLAPS) 2/1300 variables, 4/1016 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1300 variables, 2/1018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1300 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (OVERLAPS) 15/1315 variables, 8/1026 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1315 variables, 4/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1315 variables, 0/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (OVERLAPS) 29/1344 variables, 15/1045 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1344 variables, 3/1048 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1344 variables, 0/1048 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (OVERLAPS) 2/1346 variables, 4/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1346 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1346 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (OVERLAPS) 15/1361 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1361 variables, 4/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1361 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (OVERLAPS) 29/1390 variables, 15/1081 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1390 variables, 3/1084 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1390 variables, 0/1084 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (OVERLAPS) 2/1392 variables, 4/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1392 variables, 2/1090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1392 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (OVERLAPS) 15/1407 variables, 8/1098 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1407 variables, 4/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1407 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (OVERLAPS) 29/1436 variables, 15/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1436 variables, 3/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1436 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (OVERLAPS) 2/1438 variables, 4/1124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1438 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1438 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (OVERLAPS) 15/1453 variables, 8/1134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1453 variables, 4/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1453 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (OVERLAPS) 29/1482 variables, 15/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1482 variables, 3/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1482 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (OVERLAPS) 2/1484 variables, 4/1160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1484 variables, 2/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1484 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (OVERLAPS) 15/1499 variables, 8/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1499 variables, 4/1174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1499 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (OVERLAPS) 29/1528 variables, 15/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1528 variables, 3/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1528 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (OVERLAPS) 2/1530 variables, 4/1196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1530 variables, 2/1198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1530 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 215 (OVERLAPS) 15/1545 variables, 8/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1545 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1545 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 218 (OVERLAPS) 29/1574 variables, 15/1225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1574 variables, 3/1228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1574 variables, 0/1228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 221 (OVERLAPS) 2/1576 variables, 4/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1576 variables, 2/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1576 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 224 (OVERLAPS) 15/1591 variables, 8/1242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1591 variables, 4/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1591 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 227 (OVERLAPS) 29/1620 variables, 15/1261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1620 variables, 3/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1620 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 230 (OVERLAPS) 2/1622 variables, 4/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1622 variables, 2/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1622 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 233 (OVERLAPS) 15/1637 variables, 8/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1637 variables, 4/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1637 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 236 (OVERLAPS) 29/1666 variables, 15/1297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1666 variables, 3/1300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1666 variables, 0/1300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 239 (OVERLAPS) 2/1668 variables, 4/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1668 variables, 2/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1668 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 242 (OVERLAPS) 15/1683 variables, 8/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1683 variables, 4/1318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1683 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 245 (OVERLAPS) 29/1712 variables, 15/1333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1712 variables, 3/1336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1712 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 248 (OVERLAPS) 2/1714 variables, 4/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1714 variables, 2/1342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1714 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 251 (OVERLAPS) 15/1729 variables, 8/1350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1729 variables, 4/1354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1729 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 254 (OVERLAPS) 29/1758 variables, 15/1369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1758 variables, 3/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1758 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 257 (OVERLAPS) 2/1760 variables, 4/1376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1760 variables, 2/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1760 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 260 (OVERLAPS) 15/1775 variables, 8/1386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1775 variables, 4/1390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1775 variables, 0/1390 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 263 (OVERLAPS) 29/1804 variables, 15/1405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1804 variables, 3/1408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
After SMT solving in domain Int declared 1804/2287 variables, and 1408 constraints, problems are : Problem set: 2 solved, 0 unsolved in 3244 ms.
Refiners :[Positive P Invariants (semi-flows): 427/548 constraints, State Equation: 978/1243 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 8930ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ShieldPPPt-PT-050B-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldPPPt-PT-050B-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldPPPt-PT-050B-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldPPPt-PT-050B-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 985220 ms.
BK_STOP 1749021717600
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldPPPt-PT-050B, 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 r209-tall-174894546800117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-PT-050B 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;