About the Execution of 2025-gold for ASLink-PT-03b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1235.880 | 148734.00 | 200322.00 | 142.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r015-oct2-177944372400041.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-oct2-177944372400041
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 5.0K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 544K Mar 3 18:30 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-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779685499598
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 05:05:01] [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]
[2026-05-25 05:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:05:01] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2026-05-25 05:05:01] [INFO ] Transformed 1638 places.
[2026-05-25 05:05:01] [INFO ] Transformed 2094 transitions.
[2026-05-25 05:05:01] [INFO ] Found NUPN structural information;
[2026-05-25 05:05:01] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 2094 rows 1638 cols
[2026-05-25 05:05:01] [INFO ] Computed 160 invariants in 78 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 (26 resets) in 81 ms. (121 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (25 resets) in 82 ms. (602 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 05:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:02] [INFO ] [Real]Absence check using 37 positive place invariants in 128 ms returned sat
[2026-05-25 05:05:02] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 88 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Real]Absence check using state equation in 1111 ms returned sat
[2026-05-25 05:05:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 33 ms returned sat
[2026-05-25 05:05:04] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 81 ms returned sat
[2026-05-25 05:05:05] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:06] [INFO ] Deduced a trap composed of 42 places in 838 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:07] [INFO ] Deduced a trap composed of 50 places in 985 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:08] [INFO ] Deduced a trap composed of 51 places in 346 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:08] [INFO ] Deduced a trap composed of 53 places in 342 ms of which 43 ms to minimize.
[2026-05-25 05:05:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3041 ms
[2026-05-25 05:05:08] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 229 ms.
[2026-05-25 05:05:09] [INFO ] Added : 5 causal constraints over 1 iterations in 541 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:09] [INFO ] [Real]Absence check using 37 positive place invariants in 29 ms returned sat
[2026-05-25 05:05:09] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 81 ms returned sat
[2026-05-25 05:05:10] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2026-05-25 05:05:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 33 ms returned sat
[2026-05-25 05:05:10] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 88 ms returned sat
[2026-05-25 05:05:12] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:12] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 70 ms to minimize.
[2026-05-25 05:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
[2026-05-25 05:05:12] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 96 ms.
[2026-05-25 05:05:15] [INFO ] Added : 70 causal constraints over 14 iterations in 2667 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:15] [INFO ] [Real]Absence check using 37 positive place invariants in 31 ms returned sat
[2026-05-25 05:05:15] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 75 ms returned sat
[2026-05-25 05:05:17] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:17] [INFO ] Deduced a trap composed of 21 places in 633 ms of which 38 ms to minimize.
[2026-05-25 05:05:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 78 ms returned sat
[2026-05-25 05:05:18] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 122 ms returned sat
[2026-05-25 05:05:20] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:21] [INFO ] Deduced a trap composed of 21 places in 878 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:21] [INFO ] Deduced a trap composed of 21 places in 713 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:22] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:23] [INFO ] Deduced a trap composed of 58 places in 448 ms of which 54 ms to minimize.
[2026-05-25 05:05:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:23] [INFO ] [Real]Absence check using 37 positive place invariants in 32 ms returned sat
[2026-05-25 05:05:23] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 165 ms returned sat
[2026-05-25 05:05:24] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2026-05-25 05:05:25] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 143 ms.
[2026-05-25 05:05:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2026-05-25 05:05:26] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 70 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:27] [INFO ] Deduced a trap composed of 22 places in 672 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:28] [INFO ] Deduced a trap composed of 42 places in 706 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:29] [INFO ] Deduced a trap composed of 47 places in 708 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:30] [INFO ] Deduced a trap composed of 49 places in 664 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:30] [INFO ] Deduced a trap composed of 103 places in 828 ms of which 166 ms to minimize.
[2026-05-25 05:05:30] [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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:31] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2026-05-25 05:05:31] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 125 ms returned sat
[2026-05-25 05:05:33] [INFO ] [Real]Absence check using state equation in 1478 ms returned sat
[2026-05-25 05:05:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 32 ms returned sat
[2026-05-25 05:05:33] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 156 ms returned sat
[2026-05-25 05:05:35] [INFO ] [Nat]Absence check using state equation in 1565 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:35] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:36] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:37] [INFO ] Deduced a trap composed of 34 places in 650 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:37] [INFO ] Deduced a trap composed of 49 places in 437 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:38] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 77 ms to minimize.
[2026-05-25 05:05:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
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 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 1638 transition count 1722
Reduce places removed 372 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 390 rules applied. Total rules applied 762 place count 1266 transition count 1704
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 768 place count 1261 transition count 1703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 769 place count 1260 transition count 1703
Performed 377 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 377 Pre rules applied. Total rules applied 769 place count 1260 transition count 1326
Deduced a syphon composed of 377 places in 3 ms
Ensure Unique test removed 31 places
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 785 rules applied. Total rules applied 1554 place count 852 transition count 1326
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 25 rules applied. Total rules applied 1579 place count 848 transition count 1305
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1600 place count 827 transition count 1305
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1600 place count 827 transition count 1294
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1633 place count 805 transition count 1294
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1633 place count 805 transition count 1283
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1655 place count 794 transition count 1283
Discarding 51 places :
Symmetric choice reduction at 6 with 51 rule applications. Total rules 1706 place count 743 transition count 1232
Iterating global reduction 6 with 51 rules applied. Total rules applied 1757 place count 743 transition count 1232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1758 place count 743 transition count 1231
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1758 place count 743 transition count 1213
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1795 place count 724 transition count 1213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1795 place count 724 transition count 1212
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1798 place count 722 transition count 1212
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1802 place count 718 transition count 1185
Iterating global reduction 7 with 4 rules applied. Total rules applied 1806 place count 718 transition count 1185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1806 place count 718 transition count 1183
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1810 place count 716 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1811 place count 715 transition count 1175
Iterating global reduction 7 with 1 rules applied. Total rules applied 1812 place count 715 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1813 place count 714 transition count 1167
Iterating global reduction 7 with 1 rules applied. Total rules applied 1814 place count 714 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1815 place count 713 transition count 1159
Iterating global reduction 7 with 1 rules applied. Total rules applied 1816 place count 713 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1817 place count 712 transition count 1151
Iterating global reduction 7 with 1 rules applied. Total rules applied 1818 place count 712 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1819 place count 711 transition count 1143
Iterating global reduction 7 with 1 rules applied. Total rules applied 1820 place count 711 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1821 place count 710 transition count 1135
Iterating global reduction 7 with 1 rules applied. Total rules applied 1822 place count 710 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1823 place count 709 transition count 1127
Iterating global reduction 7 with 1 rules applied. Total rules applied 1824 place count 709 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1825 place count 708 transition count 1119
Iterating global reduction 7 with 1 rules applied. Total rules applied 1826 place count 708 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1827 place count 707 transition count 1111
Iterating global reduction 7 with 1 rules applied. Total rules applied 1828 place count 707 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1829 place count 706 transition count 1103
Iterating global reduction 7 with 1 rules applied. Total rules applied 1830 place count 706 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1831 place count 705 transition count 1095
Iterating global reduction 7 with 1 rules applied. Total rules applied 1832 place count 705 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1833 place count 704 transition count 1087
Iterating global reduction 7 with 1 rules applied. Total rules applied 1834 place count 704 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1835 place count 703 transition count 1079
Iterating global reduction 7 with 1 rules applied. Total rules applied 1836 place count 703 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1837 place count 702 transition count 1071
Iterating global reduction 7 with 1 rules applied. Total rules applied 1838 place count 702 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1839 place count 701 transition count 1063
Iterating global reduction 7 with 1 rules applied. Total rules applied 1840 place count 701 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1841 place count 700 transition count 1055
Iterating global reduction 7 with 1 rules applied. Total rules applied 1842 place count 700 transition count 1055
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 7 with 180 rules applied. Total rules applied 2022 place count 610 transition count 965
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2023 place count 609 transition count 964
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2025 place count 608 transition count 964
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2026 place count 607 transition count 963
Iterating global reduction 7 with 1 rules applied. Total rules applied 2027 place count 607 transition count 963
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 7 with 2 rules applied. Total rules applied 2029 place count 607 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2030 place count 606 transition count 961
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2032 place count 605 transition count 970
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2036 place count 605 transition count 966
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2040 place count 601 transition count 966
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2043 place count 601 transition count 963
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2046 place count 598 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2047 place count 597 transition count 962
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 7 rules applied. Total rules applied 2054 place count 592 transition count 960
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 2056 place count 590 transition count 960
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 8 Pre rules applied. Total rules applied 2056 place count 590 transition count 952
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 13 with 17 rules applied. Total rules applied 2073 place count 581 transition count 952
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 2077 place count 577 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2077 place count 577 transition count 951
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2079 place count 576 transition count 951
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2080 place count 575 transition count 950
Iterating global reduction 14 with 1 rules applied. Total rules applied 2081 place count 575 transition count 950
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2082 place count 574 transition count 949
Iterating global reduction 14 with 1 rules applied. Total rules applied 2083 place count 574 transition count 949
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2084 place count 573 transition count 948
Iterating global reduction 14 with 1 rules applied. Total rules applied 2085 place count 573 transition count 948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 2086 place count 573 transition count 947
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 2098 place count 567 transition count 941
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2100 place count 565 transition count 939
Iterating global reduction 15 with 2 rules applied. Total rules applied 2102 place count 565 transition count 939
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2104 place count 565 transition count 937
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2106 place count 563 transition count 937
Applied a total of 2106 rules in 1051 ms. Remains 563 /1638 variables (removed 1075) and now considering 937/2094 (removed 1157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1058 ms. Remains : 563/1638 places, 937/2094 transitions.
// Phase 1: matrix 937 rows 563 cols
[2026-05-25 05:05:39] [INFO ] Computed 101 invariants in 39 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 (14376 resets) in 1985 ms. (503 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (7998 resets) in 2293 ms. (871 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:05:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:44] [INFO ] [Real]Absence check using 28 positive place invariants in 22 ms returned sat
[2026-05-25 05:05:44] [INFO ] [Real]Absence check using 28 positive and 73 generalized place invariants in 37 ms returned sat
[2026-05-25 05:05:44] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2026-05-25 05:05:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:44] [INFO ] [Nat]Absence check using 28 positive place invariants in 25 ms returned sat
[2026-05-25 05:05:44] [INFO ] [Nat]Absence check using 28 positive and 73 generalized place invariants in 34 ms returned sat
[2026-05-25 05:05:45] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2026-05-25 05:05:45] [INFO ] Computed and/alt/rep : 371/1464/371 causal constraints (skipped 544 transitions) in 79 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:50] [INFO ] Deduced a trap composed of 73 places in 393 ms of which 61 ms to minimize.
[2026-05-25 05:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
[2026-05-25 05:05:50] [INFO ] Added : 242 causal constraints over 49 iterations in 5558 ms. Result :sat
Minimization took 695 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:51] [INFO ] [Real]Absence check using 28 positive place invariants in 24 ms returned sat
[2026-05-25 05:05:51] [INFO ] [Real]Absence check using 28 positive and 73 generalized place invariants in 37 ms returned sat
[2026-05-25 05:05:52] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2026-05-25 05:05:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:52] [INFO ] [Nat]Absence check using 28 positive place invariants in 11 ms returned sat
[2026-05-25 05:05:52] [INFO ] [Nat]Absence check using 28 positive and 73 generalized place invariants in 41 ms returned sat
[2026-05-25 05:05:52] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2026-05-25 05:05:52] [INFO ] Computed and/alt/rep : 371/1464/371 causal constraints (skipped 544 transitions) in 103 ms.
[2026-05-25 05:05:57] [INFO ] Added : 246 causal constraints over 50 iterations in 4416 ms. Result :sat
Minimization took 714 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 937/937 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 563 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 562 transition count 936
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 560 transition count 934
Applied a total of 6 rules in 32 ms. Remains 560 /563 variables (removed 3) and now considering 934/937 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 560/563 places, 934/937 transitions.
// Phase 1: matrix 934 rows 560 cols
[2026-05-25 05:05:58] [INFO ] Computed 101 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (14454 resets) in 1942 ms. (514 steps per ms)
BEST_FIRST walk for 2000000 steps (7875 resets) in 1974 ms. (1012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:06:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:02] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2026-05-25 05:06:02] [INFO ] [Real]Absence check using 27 positive and 74 generalized place invariants in 16 ms returned sat
[2026-05-25 05:06:02] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:03] [INFO ] Deduced a trap composed of 73 places in 277 ms of which 47 ms to minimize.
[2026-05-25 05:06:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:03] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned sat
[2026-05-25 05:06:03] [INFO ] [Nat]Absence check using 27 positive and 74 generalized place invariants in 13 ms returned sat
[2026-05-25 05:06:03] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:03] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 47 ms to minimize.
[2026-05-25 05:06:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2026-05-25 05:06:03] [INFO ] Computed and/alt/rep : 367/1445/367 causal constraints (skipped 545 transitions) in 47 ms.
[2026-05-25 05:06:06] [INFO ] Added : 206 causal constraints over 42 iterations in 3169 ms. Result :sat
Minimization took 641 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:07] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2026-05-25 05:06:07] [INFO ] [Real]Absence check using 27 positive and 74 generalized place invariants in 16 ms returned sat
[2026-05-25 05:06:08] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2026-05-25 05:06:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2026-05-25 05:06:08] [INFO ] [Nat]Absence check using 27 positive and 74 generalized place invariants in 25 ms returned sat
[2026-05-25 05:06:08] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:09] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 61 ms to minimize.
[2026-05-25 05:06:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2026-05-25 05:06:09] [INFO ] Computed and/alt/rep : 367/1445/367 causal constraints (skipped 545 transitions) in 83 ms.
[2026-05-25 05:06:14] [INFO ] Added : 293 causal constraints over 59 iterations in 5340 ms. Result :sat
Minimization took 478 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 934/934 transitions.
Applied a total of 0 rules in 15 ms. Remains 560 /560 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 560/560 places, 934/934 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 934/934 transitions.
Applied a total of 0 rules in 14 ms. Remains 560 /560 variables (removed 0) and now considering 934/934 (removed 0) transitions.
[2026-05-25 05:06:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:16] [INFO ] Implicit Places using invariants in 725 ms returned [1, 18, 19, 31, 48, 66, 142, 146, 155, 156, 157, 159, 176, 194, 213, 230, 233, 267, 268, 279, 280, 282, 299, 317, 386, 390, 391, 394, 405, 406, 407, 425, 427, 431, 449, 450, 451, 452, 464, 470, 476, 482, 488, 494, 500, 506, 512, 518, 524]
[2026-05-25 05:06:16] [INFO ] Actually due to overlaps returned [425, 407, 31, 48, 176, 299, 431, 282, 156, 159, 279, 405, 449, 157, 280, 406, 427, 450, 1, 18, 267, 268, 390, 391, 66, 155, 317, 451, 494, 512, 524, 19, 194, 213, 394, 452, 464, 470, 476, 482, 488, 500, 506, 518]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 741 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/560 places, 934/934 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 514 transition count 856
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 436 transition count 854
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 160 place count 436 transition count 834
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 201 place count 415 transition count 834
Discarding 5 places :
Implicit places reduction removed 5 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 2 with 13 rules applied. Total rules applied 214 place count 410 transition count 826
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 402 transition count 826
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 237 place count 387 transition count 811
Iterating global reduction 4 with 15 rules applied. Total rules applied 252 place count 387 transition count 811
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 387 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 255 place count 387 transition count 807
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 386 transition count 807
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 383 transition count 801
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 383 transition count 801
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 382 transition count 800
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 382 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 381 transition count 798
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 381 transition count 798
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 327 place count 351 transition count 768
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 329 place count 349 transition count 766
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 349 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 333 place count 349 transition count 764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 337 place count 347 transition count 765
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 338 place count 347 transition count 764
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 339 place count 346 transition count 764
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 347 place count 346 transition count 756
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 356 place count 337 transition count 756
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 357 place count 337 transition count 755
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 366 place count 337 transition count 755
Applied a total of 366 rules in 225 ms. Remains 337 /516 variables (removed 179) and now considering 755/934 (removed 179) transitions.
// Phase 1: matrix 755 rows 337 cols
[2026-05-25 05:06:16] [INFO ] Computed 48 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:17] [INFO ] Implicit Places using invariants in 677 ms returned [73, 90, 96, 99, 101, 102, 105, 106, 165, 168, 176, 182, 185, 187, 192, 193, 245, 262, 268, 271, 273]
[2026-05-25 05:06:17] [INFO ] Actually due to overlaps returned [105, 192, 106, 193, 90, 96, 101, 176, 182, 187, 262, 268, 273, 73, 102, 165, 245]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 683 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 320/560 places, 755/934 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 308 transition count 743
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 308 transition count 743
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 305 transition count 740
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 305 transition count 740
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 300 transition count 735
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 49 place count 300 transition count 726
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 58 place count 291 transition count 726
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 291 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 289 transition count 724
Applied a total of 62 rules in 147 ms. Remains 289 /320 variables (removed 31) and now considering 724/755 (removed 31) transitions.
// Phase 1: matrix 724 rows 289 cols
[2026-05-25 05:06:17] [INFO ] Computed 31 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:17] [INFO ] Implicit Places using invariants in 279 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 303 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 288/560 places, 724/934 transitions.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2146 ms. Remains : 288/560 places, 724/934 transitions.
// Phase 1: matrix 724 rows 288 cols
[2026-05-25 05:06:17] [INFO ] Computed 30 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (21654 resets) in 1462 ms. (683 steps per ms)
BEST_FIRST walk for 2000001 steps (13684 resets) in 1306 ms. (1530 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 05:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 05:06:20] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2026-05-25 05:06:20] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2026-05-25 05:06:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2026-05-25 05:06:20] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 6 ms returned sat
[2026-05-25 05:06:20] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-25 05:06:20] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 56 ms.
[2026-05-25 05:06:21] [INFO ] Added : 7 causal constraints over 2 iterations in 167 ms. Result :sat
Minimization took 433 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:21] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 05:06:21] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 13 ms returned sat
[2026-05-25 05:06:21] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2026-05-25 05:06:21] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 51 ms.
[2026-05-25 05:06:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:06:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 05:06:22] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 8 ms returned sat
[2026-05-25 05:06:22] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2026-05-25 05:06:22] [INFO ] Computed and/alt/rep : 141/734/141 causal constraints (skipped 562 transitions) in 58 ms.
[2026-05-25 05:06:22] [INFO ] Added : 10 causal constraints over 2 iterations in 149 ms. Result :sat
Minimization took 340 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 724/724 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 288/288 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 724/724 transitions.
Applied a total of 0 rules in 9 ms. Remains 288 /288 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2026-05-25 05:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:23] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-25 05:06:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:06:24] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:06:24] [INFO ] Redundant transitions in 27 ms returned []
Running 703 sub problems to find dead transitions.
[2026-05-25 05:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 1/288 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:06:52] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 288/1012 variables, and 31 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/288 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (OVERLAPS) 1/288 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:07] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:07] [INFO ] Deduced a trap composed of 54 places in 267 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:08] [INFO ] Deduced a trap composed of 61 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:07:10] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 43 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 703 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 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(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 1)
(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 0)
(s70 0)
(s71 1)
(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 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(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 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(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 1)
(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 1)
(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 0)
(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 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(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 1)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 288/1012 variables, and 35 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/288 constraints, PredecessorRefiner: 0/703 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61473 ms. Remains : 288/288 places, 724/724 transitions.
RANDOM walk for 40000 steps (855 resets) in 1008 ms. (39 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (275 resets) in 239 ms. (166 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (276 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (276 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (284 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
[2026-05-25 05:07:25] [INFO ] Flatten gal took : 146 ms
[2026-05-25 05:07:25] [INFO ] Flatten gal took : 59 ms
[2026-05-25 05:07:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14397423492799173256.gal : 30 ms
[2026-05-25 05:07:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1557344908153218897.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14397423492799173256.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1557344908153218897.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1557344908153218897.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :44 after 1144
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1144 after 2376
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2376 after 2701
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2701 after 2800
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2800 after 3620
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3620 after 37152
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :37152 after 165761
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,684469,0.526389,23600,2,15145,18,44719,6,0,1879,29816,0
Total reachable state count : 684469
Verifying 4 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,1,0.527961,23728,2,289,18,44719,7,0,1882,29816,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,1,0.52898,23856,2,289,18,44719,8,0,1883,29816,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,6,0.5305,23856,2,398,18,44719,9,0,1885,29816,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,6,0.53216,23856,2,398,18,44719,10,0,1886,29816,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 403025 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :2 out of 4
Probabilistic random walk after 403025 steps, saw 153758 distinct states, run finished after 3005 ms. (steps per millisecond=134 ) properties seen :2
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 147194 ms.
BK_STOP 1779685648332
--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ASLink-PT-03b, 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 r015-oct2-177944372400041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-03b.tgz
mv ASLink-PT-03b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;