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.r013-tall-174853743000055.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 ASLink-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000055
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.4M May 29 14:32 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 ASLink-PT-10b-UpperBounds-00
FORMULA_NAME ASLink-PT-10b-UpperBounds-01
FORMULA_NAME ASLink-PT-10b-UpperBounds-02
FORMULA_NAME ASLink-PT-10b-UpperBounds-03
FORMULA_NAME ASLink-PT-10b-UpperBounds-04
FORMULA_NAME ASLink-PT-10b-UpperBounds-05
FORMULA_NAME ASLink-PT-10b-UpperBounds-06
FORMULA_NAME ASLink-PT-10b-UpperBounds-07
FORMULA_NAME ASLink-PT-10b-UpperBounds-08
FORMULA_NAME ASLink-PT-10b-UpperBounds-09
FORMULA_NAME ASLink-PT-10b-UpperBounds-10
FORMULA_NAME ASLink-PT-10b-UpperBounds-11
FORMULA_NAME ASLink-PT-10b-UpperBounds-12
FORMULA_NAME ASLink-PT-10b-UpperBounds-13
FORMULA_NAME ASLink-PT-10b-UpperBounds-14
FORMULA_NAME ASLink-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540758194

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:45:59] [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-05-29 17:45:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:45:59] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2025-05-29 17:45:59] [INFO ] Transformed 4410 places.
[2025-05-29 17:45:59] [INFO ] Transformed 5405 transitions.
[2025-05-29 17:45:59] [INFO ] Found NUPN structural information;
[2025-05-29 17:45:59] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 5405 rows 4410 cols
[2025-05-29 17:46:00] [INFO ] Computed 433 invariants in 215 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 (12 resets) in 90 ms. (109 steps per ms)
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 152 ms. (653 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:46:00] [INFO ] Invariant cache hit.
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using 102 positive place invariants in 138 ms returned sat
[2025-05-29 17:46:01] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 145 ms returned sat
[2025-05-29 17:46:04] [INFO ] [Real]Absence check using state equation in 3285 ms returned sat
[2025-05-29 17:46:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:05] [INFO ] [Nat]Absence check using 102 positive place invariants in 131 ms returned sat
[2025-05-29 17:46:06] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 146 ms returned sat
[2025-05-29 17:46:08] [INFO ] [Nat]Absence check using state equation in 2679 ms returned sat
[2025-05-29 17:46:11] [INFO ] Deduced a trap composed of 83 places in 2393 ms of which 170 ms to minimize.
[2025-05-29 17:46:11] [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-05-29 17:46:12] [INFO ] [Real]Absence check using 102 positive place invariants in 130 ms returned sat
[2025-05-29 17:46:12] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 150 ms returned sat
[2025-05-29 17:46:15] [INFO ] [Real]Absence check using state equation in 3059 ms returned sat
[2025-05-29 17:46:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:16] [INFO ] [Nat]Absence check using 102 positive place invariants in 113 ms returned sat
[2025-05-29 17:46:16] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 137 ms returned sat
[2025-05-29 17:46:20] [INFO ] [Nat]Absence check using state equation in 3932 ms returned sat
[2025-05-29 17:46:21] [INFO ] Deduced a trap composed of 47 places in 1391 ms of which 16 ms to minimize.
[2025-05-29 17:46:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-05-29 17:46:22] [INFO ] [Real]Absence check using 102 positive place invariants in 108 ms returned sat
[2025-05-29 17:46:22] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 145 ms returned sat
[2025-05-29 17:46:25] [INFO ] [Real]Absence check using state equation in 2658 ms returned sat
[2025-05-29 17:46:27] [INFO ] Deduced a trap composed of 216 places in 2028 ms of which 21 ms to minimize.
[2025-05-29 17:46:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2249)
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-05-29 17:46:28] [INFO ] [Real]Absence check using 102 positive place invariants in 110 ms returned sat
[2025-05-29 17:46:28] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 147 ms returned sat
[2025-05-29 17:46:32] [INFO ] [Real]Absence check using state equation in 3557 ms returned sat
[2025-05-29 17:46:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:32] [INFO ] [Nat]Absence check using 102 positive place invariants in 111 ms returned sat
[2025-05-29 17:46:33] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2025-05-29 17:46:37] [INFO ] [Nat]Absence check using state equation in 3998 ms returned sat
[2025-05-29 17:46:39] [INFO ] Deduced a trap composed of 65 places in 2526 ms of which 24 ms to minimize.
[2025-05-29 17:46:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-05-29 17:46:40] [INFO ] [Real]Absence check using 102 positive place invariants in 112 ms returned sat
[2025-05-29 17:46:40] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 150 ms returned sat
[2025-05-29 17:46:43] [INFO ] [Real]Absence check using state equation in 2993 ms returned sat
[2025-05-29 17:46:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:44] [INFO ] [Nat]Absence check using 102 positive place invariants in 112 ms returned sat
[2025-05-29 17:46:44] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 134 ms returned sat
[2025-05-29 17:46:48] [INFO ] [Nat]Absence check using state equation in 3719 ms returned sat
[2025-05-29 17:46:50] [INFO ] Deduced a trap composed of 53 places in 1851 ms of which 19 ms to minimize.
[2025-05-29 17:46:50] [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-05-29 17:46:51] [INFO ] [Real]Absence check using 102 positive place invariants in 106 ms returned sat
[2025-05-29 17:46:51] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 135 ms returned sat
[2025-05-29 17:46:54] [INFO ] [Real]Absence check using state equation in 3025 ms returned sat
[2025-05-29 17:46:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:46:54] [INFO ] [Nat]Absence check using 102 positive place invariants in 110 ms returned sat
[2025-05-29 17:46:55] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 138 ms returned sat
[2025-05-29 17:46:57] [INFO ] [Nat]Absence check using state equation in 2571 ms returned sat
[2025-05-29 17:47:00] [INFO ] Deduced a trap composed of 23 places in 2622 ms of which 24 ms to minimize.
[2025-05-29 17:47:00] [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-05-29 17:47:01] [INFO ] [Real]Absence check using 102 positive place invariants in 106 ms returned sat
[2025-05-29 17:47:01] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 140 ms returned sat
[2025-05-29 17:47:03] [INFO ] [Real]Absence check using state equation in 2538 ms returned sat
[2025-05-29 17:47:06] [INFO ] Deduced a trap composed of 79 places in 2071 ms of which 22 ms to minimize.
[2025-05-29 17:47:06] [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:2249)
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-05-29 17:47:06] [INFO ] [Real]Absence check using 102 positive place invariants in 108 ms returned sat
[2025-05-29 17:47:07] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 128 ms returned sat
[2025-05-29 17:47:09] [INFO ] [Real]Absence check using state equation in 2892 ms returned sat
[2025-05-29 17:47:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:10] [INFO ] [Nat]Absence check using 102 positive place invariants in 130 ms returned sat
[2025-05-29 17:47:10] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 135 ms returned sat
[2025-05-29 17:47:14] [INFO ] [Nat]Absence check using state equation in 3119 ms returned sat
[2025-05-29 17:47:15] [INFO ] Deduced a trap composed of 29 places in 1193 ms of which 14 ms to minimize.
[2025-05-29 17:47: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 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-05-29 17:47:16] [INFO ] [Real]Absence check using 102 positive place invariants in 112 ms returned sat
[2025-05-29 17:47:16] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 137 ms returned sat
[2025-05-29 17:47:19] [INFO ] [Real]Absence check using state equation in 2833 ms returned sat
[2025-05-29 17:47:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:19] [INFO ] [Nat]Absence check using 102 positive place invariants in 112 ms returned sat
[2025-05-29 17:47:20] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 136 ms returned sat
[2025-05-29 17:47:22] [INFO ] [Nat]Absence check using state equation in 2944 ms returned sat
[2025-05-29 17:47:25] [INFO ] Deduced a trap composed of 24 places in 2539 ms of which 24 ms to minimize.
[2025-05-29 17:47: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 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-05-29 17:47:26] [INFO ] [Real]Absence check using 102 positive place invariants in 118 ms returned sat
[2025-05-29 17:47:26] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 139 ms returned sat
[2025-05-29 17:47:29] [INFO ] [Real]Absence check using state equation in 2548 ms returned sat
[2025-05-29 17:47:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:29] [INFO ] [Nat]Absence check using 102 positive place invariants in 107 ms returned sat
[2025-05-29 17:47:29] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 133 ms returned sat
[2025-05-29 17:47:32] [INFO ] [Nat]Absence check using state equation in 2831 ms returned sat
[2025-05-29 17:47:35] [INFO ] Deduced a trap composed of 52 places in 2456 ms of which 24 ms to minimize.
[2025-05-29 17:47:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1020 transitions
Trivial Post-agglo rules discarded 1020 transitions
Performed 1020 trivial Post agglomeration. Transition count delta: 1020
Iterating post reduction 0 with 1020 rules applied. Total rules applied 1020 place count 4410 transition count 4385
Reduce places removed 1020 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1066 rules applied. Total rules applied 2086 place count 3390 transition count 4339
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 18 rules applied. Total rules applied 2104 place count 3378 transition count 4333
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2110 place count 3372 transition count 4333
Performed 1024 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1024 Pre rules applied. Total rules applied 2110 place count 3372 transition count 3309
Deduced a syphon composed of 1024 places in 9 ms
Ensure Unique test removed 100 places
Reduce places removed 1124 places and 0 transitions.
Iterating global reduction 4 with 2148 rules applied. Total rules applied 4258 place count 2248 transition count 3309
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 4 with 74 rules applied. Total rules applied 4332 place count 2236 transition count 3247
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 4394 place count 2174 transition count 3247
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 39 Pre rules applied. Total rules applied 4394 place count 2174 transition count 3208
Deduced a syphon composed of 39 places in 7 ms
Ensure Unique test removed 38 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 4510 place count 2097 transition count 3208
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 4511 place count 2096 transition count 3208
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 4511 place count 2096 transition count 3169
Deduced a syphon composed of 39 places in 25 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 4589 place count 2057 transition count 3169
Discarding 141 places :
Symmetric choice reduction at 7 with 141 rule applications. Total rules 4730 place count 1916 transition count 3028
Iterating global reduction 7 with 141 rules applied. Total rules applied 4871 place count 1916 transition count 3028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4872 place count 1916 transition count 3027
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 46 Pre rules applied. Total rules applied 4872 place count 1916 transition count 2981
Deduced a syphon composed of 46 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 8 with 93 rules applied. Total rules applied 4965 place count 1869 transition count 2981
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4965 place count 1869 transition count 2980
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4968 place count 1867 transition count 2980
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 4979 place count 1856 transition count 2911
Iterating global reduction 8 with 11 rules applied. Total rules applied 4990 place count 1856 transition count 2911
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 4990 place count 1856 transition count 2902
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 5008 place count 1847 transition count 2902
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5009 place count 1846 transition count 2894
Iterating global reduction 8 with 1 rules applied. Total rules applied 5010 place count 1846 transition count 2894
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5011 place count 1845 transition count 2886
Iterating global reduction 8 with 1 rules applied. Total rules applied 5012 place count 1845 transition count 2886
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5013 place count 1844 transition count 2878
Iterating global reduction 8 with 1 rules applied. Total rules applied 5014 place count 1844 transition count 2878
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5015 place count 1843 transition count 2870
Iterating global reduction 8 with 1 rules applied. Total rules applied 5016 place count 1843 transition count 2870
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5017 place count 1842 transition count 2862
Iterating global reduction 8 with 1 rules applied. Total rules applied 5018 place count 1842 transition count 2862
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5019 place count 1841 transition count 2854
Iterating global reduction 8 with 1 rules applied. Total rules applied 5020 place count 1841 transition count 2854
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5021 place count 1840 transition count 2846
Iterating global reduction 8 with 1 rules applied. Total rules applied 5022 place count 1840 transition count 2846
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5023 place count 1839 transition count 2838
Iterating global reduction 8 with 1 rules applied. Total rules applied 5024 place count 1839 transition count 2838
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5025 place count 1838 transition count 2830
Iterating global reduction 8 with 1 rules applied. Total rules applied 5026 place count 1838 transition count 2830
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5027 place count 1837 transition count 2822
Iterating global reduction 8 with 1 rules applied. Total rules applied 5028 place count 1837 transition count 2822
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5029 place count 1836 transition count 2814
Iterating global reduction 8 with 1 rules applied. Total rules applied 5030 place count 1836 transition count 2814
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5031 place count 1835 transition count 2806
Iterating global reduction 8 with 1 rules applied. Total rules applied 5032 place count 1835 transition count 2806
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5033 place count 1834 transition count 2798
Iterating global reduction 8 with 1 rules applied. Total rules applied 5034 place count 1834 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5035 place count 1833 transition count 2790
Iterating global reduction 8 with 1 rules applied. Total rules applied 5036 place count 1833 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5037 place count 1832 transition count 2782
Iterating global reduction 8 with 1 rules applied. Total rules applied 5038 place count 1832 transition count 2782
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5039 place count 1831 transition count 2774
Iterating global reduction 8 with 1 rules applied. Total rules applied 5040 place count 1831 transition count 2774
Performed 259 Post agglomeration using F-continuation condition.Transition count delta: 259
Deduced a syphon composed of 259 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 8 with 519 rules applied. Total rules applied 5559 place count 1571 transition count 2515
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5560 place count 1570 transition count 2514
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 5562 place count 1569 transition count 2514
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 5563 place count 1568 transition count 2513
Iterating global reduction 8 with 1 rules applied. Total rules applied 5564 place count 1568 transition count 2513
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 8 with 2 rules applied. Total rules applied 5566 place count 1568 transition count 2511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5567 place count 1567 transition count 2511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5569 place count 1566 transition count 2520
Free-agglomeration rule applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 5580 place count 1566 transition count 2509
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 5591 place count 1555 transition count 2509
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 5602 place count 1555 transition count 2498
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 5613 place count 1544 transition count 2498
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 5614 place count 1544 transition count 2498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 5615 place count 1543 transition count 2497
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 12 with 26 rules applied. Total rules applied 5641 place count 1525 transition count 2489
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 5649 place count 1517 transition count 2489
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 26 Pre rules applied. Total rules applied 5649 place count 1517 transition count 2463
Deduced a syphon composed of 26 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 14 with 53 rules applied. Total rules applied 5702 place count 1490 transition count 2463
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 5713 place count 1479 transition count 2463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 5713 place count 1479 transition count 2462
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 5715 place count 1478 transition count 2462
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 15 with 42 rules applied. Total rules applied 5757 place count 1457 transition count 2441
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 5767 place count 1447 transition count 2431
Iterating global reduction 15 with 10 rules applied. Total rules applied 5777 place count 1447 transition count 2431
Free-agglomeration rule applied 10 times.
Iterating global reduction 15 with 10 rules applied. Total rules applied 5787 place count 1447 transition count 2421
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 5797 place count 1437 transition count 2421
Applied a total of 5797 rules in 3377 ms. Remains 1437 /4410 variables (removed 2973) and now considering 2421/5405 (removed 2984) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3387 ms. Remains : 1437/4410 places, 2421/5405 transitions.
// Phase 1: matrix 2421 rows 1437 cols
[2025-05-29 17:47:38] [INFO ] Computed 248 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9163 resets) in 3848 ms. (259 steps per ms)
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9000007 steps (8024 resets) in 14439 ms. (623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:47:57] [INFO ] Invariant cache hit.
[2025-05-29 17:47:57] [INFO ] [Real]Absence check using 67 positive place invariants in 24 ms returned sat
[2025-05-29 17:47:57] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 34 ms returned sat
[2025-05-29 17:47:58] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2025-05-29 17:47:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:47:58] [INFO ] [Nat]Absence check using 67 positive place invariants in 26 ms returned sat
[2025-05-29 17:47:58] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 33 ms returned sat
[2025-05-29 17:47:59] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2025-05-29 17:47:59] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 144 ms.
[2025-05-29 17:48:17] [INFO ] Added : 745 causal constraints over 149 iterations in 17923 ms. Result :sat
Minimization took 1779 ms.
[2025-05-29 17:48:19] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:48:19] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 48 ms returned sat
[2025-05-29 17:48:19] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2025-05-29 17:48:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:20] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2025-05-29 17:48:20] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 44 ms returned sat
[2025-05-29 17:48:20] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2025-05-29 17:48:21] [INFO ] Deduced a trap composed of 139 places in 452 ms of which 7 ms to minimize.
[2025-05-29 17:48:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 605 ms
[2025-05-29 17:48:21] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 123 ms.
[2025-05-29 17:48:40] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2025-05-29 17:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2025-05-29 17:48:40] [INFO ] Added : 776 causal constraints over 156 iterations in 19067 ms. Result :sat
Minimization took 1907 ms.
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using 67 positive place invariants in 34 ms returned sat
[2025-05-29 17:48:42] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 33 ms returned sat
[2025-05-29 17:48:43] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2025-05-29 17:48:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:43] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:48:43] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:48:44] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2025-05-29 17:48:44] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 104 ms.
[2025-05-29 17:49:02] [INFO ] Deduced a trap composed of 94 places in 488 ms of which 10 ms to minimize.
[2025-05-29 17:49:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2025-05-29 17:49:03] [INFO ] Added : 774 causal constraints over 155 iterations in 18590 ms. Result :sat
Minimization took 1954 ms.
[2025-05-29 17:49:05] [INFO ] [Real]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:49:05] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 34 ms returned sat
[2025-05-29 17:49:06] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2025-05-29 17:49:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:06] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:49:06] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:49:07] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2025-05-29 17:49:07] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 115 ms.
[2025-05-29 17:49:24] [INFO ] Added : 741 causal constraints over 149 iterations in 17442 ms. Result :sat
Minimization took 2174 ms.
[2025-05-29 17:49:27] [INFO ] [Real]Absence check using 67 positive place invariants in 24 ms returned sat
[2025-05-29 17:49:27] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 37 ms returned sat
[2025-05-29 17:49:28] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2025-05-29 17:49:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:28] [INFO ] [Nat]Absence check using 67 positive place invariants in 24 ms returned sat
[2025-05-29 17:49:28] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 37 ms returned sat
[2025-05-29 17:49:29] [INFO ] [Nat]Absence check using state equation in 1090 ms returned sat
[2025-05-29 17:49:29] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 121 ms.
[2025-05-29 17:49:34] [INFO ] Added : 178 causal constraints over 36 iterations in 5055 ms. Result :sat
Minimization took 1594 ms.
[2025-05-29 17:49:36] [INFO ] [Real]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:49:36] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 36 ms returned sat
[2025-05-29 17:49:37] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2025-05-29 17:49:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:49:37] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2025-05-29 17:49:37] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 36 ms returned sat
[2025-05-29 17:49:38] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2025-05-29 17:49:38] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 114 ms.
[2025-05-29 17:49:57] [INFO ] Added : 822 causal constraints over 165 iterations in 19437 ms. Result :sat
Minimization took 2485 ms.
[2025-05-29 17:50:00] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:50:00] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 36 ms returned sat
[2025-05-29 17:50:01] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2025-05-29 17:50:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:01] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2025-05-29 17:50:01] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:50:02] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2025-05-29 17:50:02] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 112 ms.
[2025-05-29 17:50:20] [INFO ] Added : 761 causal constraints over 153 iterations in 17966 ms. Result :sat
Minimization took 1879 ms.
[2025-05-29 17:50:22] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:50:22] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:50:23] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2025-05-29 17:50:23] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 111 ms.
[2025-05-29 17:50:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:23] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:50:23] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 33 ms returned sat
[2025-05-29 17:50:24] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2025-05-29 17:50:24] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 123 ms.
[2025-05-29 17:50:43] [INFO ] Added : 793 causal constraints over 159 iterations in 19241 ms. Result :sat
Minimization took 2303 ms.
[2025-05-29 17:50:46] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:50:46] [INFO ] [Real]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:50:47] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2025-05-29 17:50:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:50:47] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2025-05-29 17:50:47] [INFO ] [Nat]Absence check using 67 positive and 181 generalized place invariants in 35 ms returned sat
[2025-05-29 17:50:48] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2025-05-29 17:50:48] [INFO ] Computed and/alt/rep : 977/3688/977 causal constraints (skipped 1395 transitions) in 129 ms.
[2025-05-29 17:51:05] [INFO ] Added : 736 causal constraints over 148 iterations in 17002 ms. Result :sat
Minimization took 2098 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 2421/2421 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 1437 transition count 2420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1436 transition count 2420
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 1432 transition count 2417
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 1432 transition count 2415
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 1430 transition count 2415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 1429 transition count 2414
Applied a total of 15 rules in 169 ms. Remains 1429 /1437 variables (removed 8) and now considering 2414/2421 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1429/1437 places, 2414/2421 transitions.
// Phase 1: matrix 2414 rows 1429 cols
[2025-05-29 17:51:27] [INFO ] Computed 247 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9274 resets) in 3628 ms. (275 steps per ms)
BEST_FIRST walk for 7000007 steps (6334 resets) in 11142 ms. (628 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:51:42] [INFO ] Invariant cache hit.
[2025-05-29 17:51:42] [INFO ] [Real]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:51:42] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 35 ms returned sat
[2025-05-29 17:51:43] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2025-05-29 17:51:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:51:43] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2025-05-29 17:51:43] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 35 ms returned sat
[2025-05-29 17:51:44] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2025-05-29 17:51:44] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 115 ms.
[2025-05-29 17:52:02] [INFO ] Added : 735 causal constraints over 147 iterations in 17622 ms. Result :sat
Minimization took 1714 ms.
[2025-05-29 17:52:04] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:52:04] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 34 ms returned sat
[2025-05-29 17:52:04] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2025-05-29 17:52:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:52:05] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:52:05] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 35 ms returned sat
[2025-05-29 17:52:05] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2025-05-29 17:52:05] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 116 ms.
[2025-05-29 17:52:22] [INFO ] Added : 739 causal constraints over 148 iterations in 17008 ms. Result :sat
Minimization took 1789 ms.
[2025-05-29 17:52:24] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:52:24] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 34 ms returned sat
[2025-05-29 17:52:25] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2025-05-29 17:52:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:52:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 26 ms returned sat
[2025-05-29 17:52:25] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 44 ms returned sat
[2025-05-29 17:52:26] [INFO ] [Nat]Absence check using state equation in 722 ms returned sat
[2025-05-29 17:52:26] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 114 ms.
[2025-05-29 17:52:32] [INFO ] Added : 194 causal constraints over 39 iterations in 6033 ms. Result :sat
Minimization took 1887 ms.
[2025-05-29 17:52:34] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:52:34] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 34 ms returned sat
[2025-05-29 17:52:35] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2025-05-29 17:52:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:52:35] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:52:36] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 35 ms returned sat
[2025-05-29 17:52:36] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2025-05-29 17:52:37] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 113 ms.
[2025-05-29 17:52:41] [INFO ] Added : 158 causal constraints over 32 iterations in 4272 ms. Result :sat
Minimization took 1879 ms.
[2025-05-29 17:52:43] [INFO ] [Real]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:52:43] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 36 ms returned sat
[2025-05-29 17:52:44] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2025-05-29 17:52:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:52:44] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:52:44] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 44 ms returned sat
[2025-05-29 17:52:45] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2025-05-29 17:52:45] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 113 ms.
[2025-05-29 17:53:03] [INFO ] Added : 781 causal constraints over 157 iterations in 17652 ms. Result :sat
Minimization took 1747 ms.
[2025-05-29 17:53:05] [INFO ] [Real]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:53:05] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 33 ms returned sat
[2025-05-29 17:53:05] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2025-05-29 17:53:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:06] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2025-05-29 17:53:06] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 37 ms returned sat
[2025-05-29 17:53:06] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2025-05-29 17:53:07] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 114 ms.
[2025-05-29 17:53:23] [INFO ] Added : 725 causal constraints over 145 iterations in 16779 ms. Result :sat
Minimization took 2100 ms.
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using 67 positive and 180 generalized place invariants in 34 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2025-05-29 17:53:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:26] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2025-05-29 17:53:26] [INFO ] [Nat]Absence check using 67 positive and 180 generalized place invariants in 36 ms returned sat
[2025-05-29 17:53:27] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2025-05-29 17:53:28] [INFO ] Deduced a trap composed of 49 places in 597 ms of which 8 ms to minimize.
[2025-05-29 17:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2025-05-29 17:53:28] [INFO ] Computed and/alt/rep : 968/3690/968 causal constraints (skipped 1397 transitions) in 113 ms.
[2025-05-29 17:53:31] [INFO ] Added : 118 causal constraints over 24 iterations in 2971 ms. Result :sat
Minimization took 1305 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 2414/2414 transitions.
Applied a total of 0 rules in 55 ms. Remains 1429 /1429 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1429/1429 places, 2414/2414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 2414/2414 transitions.
Applied a total of 0 rules in 52 ms. Remains 1429 /1429 variables (removed 0) and now considering 2414/2414 (removed 0) transitions.
[2025-05-29 17:53:41] [INFO ] Invariant cache hit.
[2025-05-29 17:53:42] [INFO ] Implicit Places using invariants in 929 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 257, 261, 262, 273, 274, 276, 293, 311, 382, 386, 387, 398, 399, 401, 419, 437, 475, 509, 513, 514, 525, 526, 528, 545, 563, 640, 655, 656, 658, 675, 693, 763, 767, 768, 779, 780, 782, 799, 817, 886, 890, 891, 902, 903, 905, 922, 940, 1009, 1013, 1014, 1025, 1026, 1028, 1045, 1063, 1132, 1136, 1137, 1148, 1149, 1151, 1168, 1186, 1255, 1259, 1260, 1263, 1274, 1275, 1276, 1294, 1296, 1300, 1318, 1319, 1320, 1321, 1333, 1339, 1345, 1351, 1357, 1363, 1369, 1375, 1381, 1387, 1393]
[2025-05-29 17:53:42] [INFO ] Actually due to overlaps returned [1294, 1276, 48, 168, 293, 419, 545, 675, 799, 922, 1045, 1168, 1300, 31, 151, 276, 401, 528, 658, 782, 905, 1028, 1151, 148, 273, 398, 525, 655, 779, 902, 1025, 1148, 1274, 1318, 149, 274, 399, 526, 656, 780, 903, 1026, 1149, 1275, 1296, 1319, 1, 18, 261, 262, 386, 387, 513, 514, 640, 767, 768, 890, 891, 1013, 1014, 1136, 1137, 1259, 1260, 66, 186, 311, 437, 563, 693, 817, 940, 1063, 1186, 1320, 1363, 1381, 1393, 19, 475, 1263, 1321, 1333, 1339, 1345, 1351, 1357, 1369, 1375, 1387]
Discarding 91 places :
Implicit Place search using SMT only with invariants took 934 ms to find 91 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1338/1429 places, 2414/2414 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 1329 transition count 2228
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 393 place count 1143 transition count 2216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 396 place count 1140 transition count 2216
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 396 place count 1140 transition count 2169
Deduced a syphon composed of 47 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 491 place count 1092 transition count 2169
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 503 place count 1088 transition count 2161
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 511 place count 1080 transition count 2161
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 526 place count 1065 transition count 2146
Iterating global reduction 5 with 15 rules applied. Total rules applied 541 place count 1065 transition count 2146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 544 place count 1065 transition count 2143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 544 place count 1065 transition count 2142
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 546 place count 1064 transition count 2142
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 549 place count 1061 transition count 2136
Iterating global reduction 6 with 3 rules applied. Total rules applied 552 place count 1061 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 553 place count 1060 transition count 2135
Iterating global reduction 6 with 1 rules applied. Total rules applied 554 place count 1060 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 555 place count 1059 transition count 2133
Iterating global reduction 6 with 1 rules applied. Total rules applied 556 place count 1059 transition count 2133
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 698 place count 988 transition count 2062
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 707 place count 979 transition count 2053
Iterating global reduction 6 with 9 rules applied. Total rules applied 716 place count 979 transition count 2053
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 725 place count 979 transition count 2044
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 729 place count 977 transition count 2045
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 753 place count 977 transition count 2021
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 778 place count 952 transition count 2021
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 8 with 29 rules applied. Total rules applied 807 place count 952 transition count 2021
Applied a total of 807 rules in 403 ms. Remains 952 /1338 variables (removed 386) and now considering 2021/2414 (removed 393) transitions.
// Phase 1: matrix 2021 rows 952 cols
[2025-05-29 17:53:43] [INFO ] Computed 141 invariants in 27 ms
[2025-05-29 17:53:43] [INFO ] Implicit Places using invariants in 587 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 181, 184, 186, 191, 192, 244, 262, 268, 271, 273, 278, 279, 332, 351, 357, 360, 362, 367, 368, 439, 445, 448, 450, 453, 460, 461, 516, 533, 539, 542, 544, 549, 550, 602, 619, 625, 628, 630, 635, 636, 688, 705, 711, 714, 716, 721, 722, 774, 791, 797, 800, 802, 807, 808, 860, 877, 883, 886, 888]
[2025-05-29 17:53:43] [INFO ] Actually due to overlaps returned [104, 191, 278, 367, 460, 549, 635, 721, 807, 105, 192, 279, 368, 461, 550, 636, 722, 808, 89, 95, 100, 174, 186, 262, 268, 273, 351, 357, 362, 439, 445, 450, 533, 539, 544, 619, 625, 630, 705, 711, 716, 791, 797, 802, 877, 883, 888, 72, 101, 157, 181, 244, 332, 453, 516, 602, 688, 774, 860]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 591 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 893/1429 places, 2021/2414 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 853 transition count 1981
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 853 transition count 1981
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 844 transition count 1972
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 844 transition count 1972
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 136 place count 825 transition count 1953
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 825 transition count 1952
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 167 place count 825 transition count 1922
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 197 place count 795 transition count 1922
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 206 place count 795 transition count 1913
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 215 place count 786 transition count 1913
Applied a total of 215 rules in 227 ms. Remains 786 /893 variables (removed 107) and now considering 1913/2021 (removed 108) transitions.
// Phase 1: matrix 1913 rows 786 cols
[2025-05-29 17:53:44] [INFO ] Computed 82 invariants in 24 ms
[2025-05-29 17:53:44] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-05-29 17:53:44] [INFO ] Invariant cache hit.
[2025-05-29 17:53:46] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 786/1429 places, 1913/2414 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4356 ms. Remains : 786/1429 places, 1913/2414 transitions.
[2025-05-29 17:53:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16054 resets) in 2652 ms. (376 steps per ms)
BEST_FIRST walk for 7000007 steps (14516 resets) in 6120 ms. (1143 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:53:55] [INFO ] Invariant cache hit.
[2025-05-29 17:53:55] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:55] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:53:55] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2025-05-29 17:53:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:55] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 19 ms returned sat
[2025-05-29 17:53:56] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2025-05-29 17:53:56] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 90 ms.
[2025-05-29 17:53:56] [INFO ] Added : 25 causal constraints over 5 iterations in 548 ms. Result :sat
Minimization took 676 ms.
[2025-05-29 17:53:57] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:53:57] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:53:58] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-05-29 17:53:58] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 89 ms.
[2025-05-29 17:53:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:53:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:53:58] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:53:59] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-05-29 17:53:59] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 96 ms.
[2025-05-29 17:54:00] [INFO ] Added : 69 causal constraints over 15 iterations in 1395 ms. Result :sat
Minimization took 752 ms.
[2025-05-29 17:54:01] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:01] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:01] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2025-05-29 17:54:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:54:02] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 16 ms returned sat
[2025-05-29 17:54:02] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2025-05-29 17:54:02] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 94 ms.
[2025-05-29 17:54:05] [INFO ] Added : 136 causal constraints over 28 iterations in 2537 ms. Result :sat
Minimization took 874 ms.
[2025-05-29 17:54:06] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:06] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 16 ms returned sat
[2025-05-29 17:54:06] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2025-05-29 17:54:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:06] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:07] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2025-05-29 17:54:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2025-05-29 17:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2025-05-29 17:54:07] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 92 ms.
[2025-05-29 17:54:08] [INFO ] Added : 27 causal constraints over 6 iterations in 661 ms. Result :sat
Minimization took 697 ms.
[2025-05-29 17:54:09] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:54:09] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:09] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2025-05-29 17:54:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:09] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 16 ms returned sat
[2025-05-29 17:54:10] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2025-05-29 17:54:10] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 92 ms.
[2025-05-29 17:54:12] [INFO ] Added : 114 causal constraints over 23 iterations in 1933 ms. Result :sat
Minimization took 815 ms.
[2025-05-29 17:54:13] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:13] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:13] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2025-05-29 17:54:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-05-29 17:54:13] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:14] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2025-05-29 17:54:14] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 90 ms.
[2025-05-29 17:54:16] [INFO ] Added : 122 causal constraints over 25 iterations in 2195 ms. Result :sat
Minimization took 876 ms.
[2025-05-29 17:54:17] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:17] [INFO ] [Real]Absence check using 17 positive and 65 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:18] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2025-05-29 17:54:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:18] [INFO ] [Nat]Absence check using 17 positive and 65 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:18] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-05-29 17:54:18] [INFO ] Computed and/alt/rep : 469/2076/469 causal constraints (skipped 1395 transitions) in 88 ms.
[2025-05-29 17:54:20] [INFO ] Added : 104 causal constraints over 21 iterations in 1766 ms. Result :sat
Minimization took 816 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 786 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 786/786 places, 1913/1913 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 786 transition count 1912
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 785 transition count 1912
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 783 transition count 1911
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 783 transition count 1910
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 783 transition count 1908
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 781 transition count 1908
Applied a total of 10 rules in 81 ms. Remains 781 /786 variables (removed 5) and now considering 1908/1913 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 781/786 places, 1908/1913 transitions.
// Phase 1: matrix 1908 rows 781 cols
[2025-05-29 17:54:24] [INFO ] Computed 81 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16134 resets) in 2575 ms. (388 steps per ms)
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (8544 resets) in 3429 ms. (1166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:54:30] [INFO ] Invariant cache hit.
[2025-05-29 17:54:30] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:31] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:31] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-05-29 17:54:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:31] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:32] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2025-05-29 17:54:32] [INFO ] Computed and/alt/rep : 441/1945/441 causal constraints (skipped 1418 transitions) in 89 ms.
[2025-05-29 17:54:33] [INFO ] Added : 84 causal constraints over 17 iterations in 1605 ms. Result :sat
Minimization took 2429 ms.
[2025-05-29 17:54:36] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:36] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:36] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2025-05-29 17:54:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:37] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:37] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2025-05-29 17:54:37] [INFO ] Computed and/alt/rep : 441/1945/441 causal constraints (skipped 1418 transitions) in 85 ms.
[2025-05-29 17:54:38] [INFO ] Added : 44 causal constraints over 9 iterations in 1092 ms. Result :sat
Minimization took 2316 ms.
[2025-05-29 17:54:41] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2025-05-29 17:54:41] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 27 ms returned sat
[2025-05-29 17:54:41] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2025-05-29 17:54:41] [INFO ] Computed and/alt/rep : 441/1945/441 causal constraints (skipped 1418 transitions) in 91 ms.
[2025-05-29 17:54:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:42] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 17 ms returned sat
[2025-05-29 17:54:42] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-05-29 17:54:42] [INFO ] Computed and/alt/rep : 441/1945/441 causal constraints (skipped 1418 transitions) in 93 ms.
[2025-05-29 17:54:43] [INFO ] Added : 37 causal constraints over 8 iterations in 753 ms. Result :sat
Minimization took 2297 ms.
[2025-05-29 17:54:45] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:45] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:46] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2025-05-29 17:54:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:46] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 16 ms returned sat
[2025-05-29 17:54:47] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2025-05-29 17:54:47] [INFO ] Computed and/alt/rep : 441/1945/441 causal constraints (skipped 1418 transitions) in 87 ms.
[2025-05-29 17:54:47] [INFO ] Added : 40 causal constraints over 8 iterations in 765 ms. Result :sat
Minimization took 2293 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 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1908/1908 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 781 transition count 1907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 780 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 779 transition count 1906
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 779 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 778 transition count 1905
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 778 transition count 1905
Applied a total of 6 rules in 77 ms. Remains 778 /781 variables (removed 3) and now considering 1905/1908 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 778/781 places, 1905/1908 transitions.
// Phase 1: matrix 1905 rows 778 cols
[2025-05-29 17:54:52] [INFO ] Computed 81 invariants in 24 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 (15955 resets) in 2508 ms. (398 steps per ms)
BEST_FIRST walk for 4000004 steps (8570 resets) in 3345 ms. (1195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:54:57] [INFO ] Invariant cache hit.
[2025-05-29 17:54:58] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:58] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 16 ms returned sat
[2025-05-29 17:54:58] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2025-05-29 17:54:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:54:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:54:58] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 18 ms returned sat
[2025-05-29 17:54:59] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2025-05-29 17:54:59] [INFO ] Computed and/alt/rep : 438/1940/438 causal constraints (skipped 1418 transitions) in 88 ms.
[2025-05-29 17:55:00] [INFO ] Added : 60 causal constraints over 12 iterations in 1090 ms. Result :sat
Minimization took 661 ms.
[2025-05-29 17:55:01] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:01] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 22 ms returned sat
[2025-05-29 17:55:01] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-05-29 17:55:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:01] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 18 ms returned sat
[2025-05-29 17:55:02] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2025-05-29 17:55:02] [INFO ] Computed and/alt/rep : 438/1940/438 causal constraints (skipped 1418 transitions) in 93 ms.
[2025-05-29 17:55:03] [INFO ] Added : 31 causal constraints over 7 iterations in 781 ms. Result :sat
Minimization took 678 ms.
[2025-05-29 17:55:03] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:03] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 17 ms returned sat
[2025-05-29 17:55:04] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2025-05-29 17:55:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:04] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 17 ms returned sat
[2025-05-29 17:55:05] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2025-05-29 17:55:05] [INFO ] Computed and/alt/rep : 438/1940/438 causal constraints (skipped 1418 transitions) in 93 ms.
[2025-05-29 17:55:05] [INFO ] Added : 34 causal constraints over 7 iterations in 656 ms. Result :sat
Minimization took 646 ms.
[2025-05-29 17:55:06] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:06] [INFO ] [Real]Absence check using 15 positive and 66 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:07] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2025-05-29 17:55:07] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-05-29 17:55:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:07] [INFO ] [Nat]Absence check using 15 positive and 66 generalized place invariants in 19 ms returned sat
[2025-05-29 17:55:08] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2025-05-29 17:55:08] [INFO ] Computed and/alt/rep : 438/1940/438 causal constraints (skipped 1418 transitions) in 88 ms.
[2025-05-29 17:55:09] [INFO ] Added : 53 causal constraints over 11 iterations in 1093 ms. Result :sat
Minimization took 1060 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 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1905/1905 transitions.
Applied a total of 0 rules in 30 ms. Remains 778 /778 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 778/778 places, 1905/1905 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 1905/1905 transitions.
Applied a total of 0 rules in 29 ms. Remains 778 /778 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2025-05-29 17:55:11] [INFO ] Invariant cache hit.
[2025-05-29 17:55:12] [INFO ] Implicit Places using invariants in 412 ms returned [367, 368]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 415 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 776/778 places, 1905/1905 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 775 transition count 1904
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 775 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 774 transition count 1903
Applied a total of 4 rules in 83 ms. Remains 774 /776 variables (removed 2) and now considering 1903/1905 (removed 2) transitions.
// Phase 1: matrix 1903 rows 774 cols
[2025-05-29 17:55:12] [INFO ] Computed 79 invariants in 21 ms
[2025-05-29 17:55:12] [INFO ] Implicit Places using invariants in 424 ms returned []
[2025-05-29 17:55:12] [INFO ] Invariant cache hit.
[2025-05-29 17:55:14] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 774/778 places, 1903/1905 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2513 ms. Remains : 774/778 places, 1903/1905 transitions.
[2025-05-29 17:55:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (16139 resets) in 2354 ms. (424 steps per ms)
BEST_FIRST walk for 4000004 steps (8553 resets) in 3111 ms. (1285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:55:19] [INFO ] Invariant cache hit.
[2025-05-29 17:55:19] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-05-29 17:55:19] [INFO ] [Real]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:20] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2025-05-29 17:55:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-05-29 17:55:20] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:20] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-05-29 17:55:20] [INFO ] Computed and/alt/rep : 445/1899/445 causal constraints (skipped 1409 transitions) in 88 ms.
[2025-05-29 17:55:21] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2025-05-29 17:55:21] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2025-05-29 17:55:22] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 0 ms to minimize.
[2025-05-29 17:55:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2025-05-29 17:55:22] [INFO ] Added : 52 causal constraints over 11 iterations in 1522 ms. Result :sat
Minimization took 799 ms.
[2025-05-29 17:55:23] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2025-05-29 17:55:23] [INFO ] [Real]Absence check using 16 positive and 63 generalized place invariants in 17 ms returned sat
[2025-05-29 17:55:23] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-05-29 17:55:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:23] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:24] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2025-05-29 17:55:24] [INFO ] Computed and/alt/rep : 445/1899/445 causal constraints (skipped 1409 transitions) in 82 ms.
[2025-05-29 17:55:25] [INFO ] Added : 38 causal constraints over 8 iterations in 754 ms. Result :sat
Minimization took 802 ms.
[2025-05-29 17:55:26] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:26] [INFO ] [Real]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:26] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2025-05-29 17:55:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:26] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:27] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2025-05-29 17:55:27] [INFO ] Computed and/alt/rep : 445/1899/445 causal constraints (skipped 1409 transitions) in 86 ms.
[2025-05-29 17:55:28] [INFO ] Added : 38 causal constraints over 11 iterations in 936 ms. Result :sat
Minimization took 767 ms.
[2025-05-29 17:55:29] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:29] [INFO ] [Real]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:29] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2025-05-29 17:55:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:55:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-05-29 17:55:29] [INFO ] [Nat]Absence check using 16 positive and 63 generalized place invariants in 16 ms returned sat
[2025-05-29 17:55:29] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2025-05-29 17:55:30] [INFO ] Computed and/alt/rep : 445/1899/445 causal constraints (skipped 1409 transitions) in 86 ms.
[2025-05-29 17:55:30] [INFO ] Added : 21 causal constraints over 5 iterations in 499 ms. Result :sat
Minimization took 751 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 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1903/1903 transitions.
Applied a total of 0 rules in 27 ms. Remains 774 /774 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 774/774 places, 1903/1903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1903/1903 transitions.
Applied a total of 0 rules in 27 ms. Remains 774 /774 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2025-05-29 17:55:32] [INFO ] Invariant cache hit.
[2025-05-29 17:55:32] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-05-29 17:55:32] [INFO ] Invariant cache hit.
[2025-05-29 17:55:34] [INFO ] Implicit Places using invariants and state equation in 1541 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2025-05-29 17:55:34] [INFO ] Redundant transitions in 117 ms returned []
Running 1854 sub problems to find dead transitions.
[2025-05-29 17:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/773 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/773 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/2677 variables, and 75 constraints, problems are : Problem set: 0 solved, 1854 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 62/63 constraints, State Equation: 0/774 constraints, PredecessorRefiner: 1854/1854 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1854 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/773 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/773 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 1854 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 1)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 1)
(s437 1)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 1)
(s561 1)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 1)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 1)
(s643 0)
(s644 1)
(s645 0)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 1)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 1)
(s720 0)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/2677 variables, and 75 constraints, problems are : Problem set: 0 solved, 1854 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 62/63 constraints, State Equation: 0/774 constraints, PredecessorRefiner: 0/1854 constraints, Known Traps: 0/0 constraints]
After SMT, in 61347ms problems are : Problem set: 0 solved, 1854 unsolved
Search for dead transitions found 0 dead transitions in 61375ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63485 ms. Remains : 774/774 places, 1903/1903 transitions.
RANDOM walk for 40000 steps (658 resets) in 1036 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (83 resets) in 329 ms. (121 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (84 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (86 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
[2025-05-29 17:56:36] [INFO ] Flatten gal took : 512 ms
BEST_FIRST walk for 40004 steps (83 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
[2025-05-29 17:56:36] [INFO ] Flatten gal took : 201 ms
[2025-05-29 17:56:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12231474802651489892.gal : 85 ms
[2025-05-29 17:56:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality212880203154356714.prop : 0 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/ReachabilityCardinality12231474802651489892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality212880203154356714.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 ...328
Loading property file /tmp/ReachabilityCardinality212880203154356714.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :6 after 44
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :18272 after 7.59834e+06
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :7.59834e+06 after 3.45826e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :3.45826e+09 after 3.57386e+09
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3.57386e+09 after 3.57475e+09
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.57475e+09 after 1.32657e+11
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.32657e+11 after 2.43478e+12
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.43478e+12 after 2.48714e+13
Interrupted probabilistic random walk after 138165 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 8
Probabilistic random walk after 138165 steps, saw 63781 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
[2025-05-29 17:56:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 229/232 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/240 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 285/525 variables, 27/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/534 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 148/682 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.48714e+13 after 1.46881e+14
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/699 variables, 3/68 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 0/68 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/750 variables, 7/75 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/750 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/772 variables, 3/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/774 variables, 1/79 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 0/79 constraints. Problems are: Problem set: 4 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.46881e+14 after 1.54285e+14
At refinement iteration 19 (OVERLAPS) 1903/2677 variables, 774/853 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2677 variables, 0/853 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2677 variables, 0/853 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2677/2677 variables, and 853 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 774/774 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 117/118 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/124 variables, 4/8 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 262/386 variables, 23/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 8/394 variables, 4/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 226/620 variables, 20/55 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 0/55 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 22/642 variables, 5/60 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/60 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 108/750 variables, 15/75 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/750 variables, 0/75 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/772 variables, 3/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/772 variables, 0/78 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/774 variables, 1/79 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 0/79 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1903/2677 variables, 774/853 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2677 variables, 2/855 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2677 variables, 0/855 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2677 variables, 0/855 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2677/2677 variables, and 855 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 774/774 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2574ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 440 ms.
Support contains 1 out of 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1903/1903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 774 transition count 1900
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 771 transition count 1900
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 771 transition count 1898
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 769 transition count 1898
Applied a total of 10 rules in 40 ms. Remains 769 /774 variables (removed 5) and now considering 1898/1903 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 769/774 places, 1898/1903 transitions.
RANDOM walk for 40000 steps (662 resets) in 924 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.28391e+14,6.82817,185268,2,145794,24,506708,6,0,5002,440601,0
Total reachable state count : 628390934050784

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,2448,6.84557,185268,2,1587,24,506708,7,0,5005,440601,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2448,6.86003,185268,2,1587,24,506708,8,0,5006,440601,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,44,6.86515,185268,2,1127,24,506708,9,0,5008,440601,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,44,6.86916,185268,2,1127,24,506708,10,0,5009,440601,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,328,6.87889,185268,2,1356,24,506708,11,0,5011,440601,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,328,6.88831,185268,2,1356,24,506708,12,0,5012,440601,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,18272,6.90507,185268,2,1817,24,506708,13,0,5014,440601,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,18272,6.92317,185268,2,1817,24,506708,14,0,5015,440601,0
Interrupted probabilistic random walk after 260733 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 2
Probabilistic random walk after 260733 steps, saw 125344 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
FORMULA ASLink-PT-10b-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-10b-UpperBounds-04 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 646920 ms.

BK_STOP 1748541406303

--------------------
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="ASLink-PT-10b"
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 ASLink-PT-10b, 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 r013-tall-174853743000055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10b.tgz
mv ASLink-PT-10b 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;