Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r367-tall-178024404700028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is SupplyChain-PT-00500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r367-tall-178024404700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 7.0K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 27 07:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 27 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 2.1M May 26 18:17 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 SupplyChain-PT-00500-UpperBounds-00
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-01
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-02
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-03
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-04
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-05
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-06
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-07
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-08
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-09
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-10
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-11
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-12
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-13
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-14
FORMULA_NAME SupplyChain-PT-00500-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780305772826

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00500
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 09:22:54] [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-06-01 09:22:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 09:22:54] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2026-06-01 09:22:54] [INFO ] Transformed 6504 places.
[2026-06-01 09:22:54] [INFO ] Transformed 4003 transitions.
[2026-06-01 09:22:54] [INFO ] Parsed PT model containing 6504 places and 4003 transitions and 18006 arcs in 425 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 4003 rows 6504 cols
[2026-06-01 09:22:55] [INFO ] Computed 3092 invariants in 676 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2]
RANDOM walk for 10000 steps (4 resets) in 909 ms. (10 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 2103 ms. (76 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2]
[2026-06-01 09:22:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:22:59] [INFO ] [Real]Absence check using 1002 positive place invariants in 332 ms returned sat
[2026-06-01 09:23:00] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 439 ms returned sat
[2026-06-01 09:23:01] [INFO ] [Real]Absence check using state equation in 1532 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:02] [INFO ] [Real]Absence check using 1002 positive place invariants in 320 ms returned sat
[2026-06-01 09:23:03] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 437 ms returned sat
[2026-06-01 09:23:03] [INFO ] [Real]Absence check using state equation in 519 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:04] [INFO ] [Real]Absence check using 1002 positive place invariants in 312 ms returned sat
[2026-06-01 09:23:05] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 454 ms returned sat
[2026-06-01 09:23:06] [INFO ] [Real]Absence check using state equation in 1563 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:07] [INFO ] [Real]Absence check using 1002 positive place invariants in 299 ms returned sat
[2026-06-01 09:23:08] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 460 ms returned sat
[2026-06-01 09:23:09] [INFO ] [Real]Absence check using state equation in 1660 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:10] [INFO ] [Real]Absence check using 1002 positive place invariants in 314 ms returned sat
[2026-06-01 09:23:11] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 423 ms returned sat
[2026-06-01 09:23:14] [INFO ] [Real]Absence check using state equation in 3241 ms returned sat
[2026-06-01 09:23:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-06-01 09:23:14] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2026-06-01 09:23:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:15] [INFO ] [Nat]Absence check using 1002 positive place invariants in 304 ms returned sat
[2026-06-01 09:23:16] [INFO ] [Nat]Absence check using 1002 positive and 2090 generalized place invariants in 457 ms returned sat
[2026-06-01 09:23:19] [INFO ] [Nat]Absence check using state equation in 3458 ms returned sat
[2026-06-01 09:23:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:23:23] [INFO ] Deduced a trap composed of 91 places in 3247 ms of which 316 ms to minimize.
[2026-06-01 09:23: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 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)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:24] [INFO ] [Real]Absence check using 1002 positive place invariants in 291 ms returned sat
[2026-06-01 09:23:24] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 478 ms returned sat
[2026-06-01 09:23:24] [INFO ] [Real]Absence check using state equation in 460 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:25] [INFO ] [Real]Absence check using 1002 positive place invariants in 284 ms returned sat
[2026-06-01 09:23:26] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 431 ms returned sat
[2026-06-01 09:23:27] [INFO ] [Real]Absence check using state equation in 1623 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:28] [INFO ] [Real]Absence check using 1002 positive place invariants in 303 ms returned sat
[2026-06-01 09:23:29] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 466 ms returned sat
[2026-06-01 09:23:31] [INFO ] [Real]Absence check using state equation in 1710 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:32] [INFO ] [Real]Absence check using 1002 positive place invariants in 297 ms returned sat
[2026-06-01 09:23:32] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 439 ms returned sat
[2026-06-01 09:23:32] [INFO ] [Real]Absence check using state equation in 373 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:33] [INFO ] [Real]Absence check using 1002 positive place invariants in 299 ms returned sat
[2026-06-01 09:23:34] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 462 ms returned sat
[2026-06-01 09:23:34] [INFO ] [Real]Absence check using state equation in 475 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:35] [INFO ] [Real]Absence check using 1002 positive place invariants in 322 ms returned sat
[2026-06-01 09:23:36] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 470 ms returned sat
[2026-06-01 09:23:39] [INFO ] [Real]Absence check using state equation in 3339 ms returned sat
[2026-06-01 09:23: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 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:863)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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-06-01 09:23:40] [INFO ] [Real]Absence check using 1002 positive place invariants in 322 ms returned sat
[2026-06-01 09:23:41] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 455 ms returned sat
[2026-06-01 09:23:44] [INFO ] [Real]Absence check using state equation in 2922 ms returned sat
[2026-06-01 09:23:44] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-06-01 09:23:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:957)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
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-06-01 09:23:45] [INFO ] [Real]Absence check using 1002 positive place invariants in 300 ms returned sat
[2026-06-01 09:23:46] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 418 ms returned sat
[2026-06-01 09:23:47] [INFO ] [Real]Absence check using state equation in 1672 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:48] [INFO ] [Real]Absence check using 1002 positive place invariants in 290 ms returned sat
[2026-06-01 09:23:49] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 456 ms returned sat
[2026-06-01 09:23:50] [INFO ] [Real]Absence check using state equation in 1618 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:51] [INFO ] [Real]Absence check using 1002 positive place invariants in 287 ms returned sat
[2026-06-01 09:23:52] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 419 ms returned sat
[2026-06-01 09:23:53] [INFO ] [Real]Absence check using state equation in 1556 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:54] [INFO ] [Real]Absence check using 1002 positive place invariants in 288 ms returned sat
[2026-06-01 09:23:55] [INFO ] [Real]Absence check using 1002 positive and 2090 generalized place invariants in 437 ms returned sat
[2026-06-01 09:23:56] [INFO ] [Real]Absence check using state equation in 1545 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]
FORMULA SupplyChain-PT-00500-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 1]
Support contains 3 out of 6504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6504/6504 places, 4003/4003 transitions.
Graph (complete) has 17362 edges and 6504 vertex of which 6502 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1590 places
Iterating post reduction 0 with 1590 rules applied. Total rules applied 1591 place count 4912 transition count 4001
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 500 Pre rules applied. Total rules applied 1591 place count 4912 transition count 3501
Deduced a syphon composed of 500 places in 3 ms
Ensure Unique test removed 500 places
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 1 with 1500 rules applied. Total rules applied 3091 place count 3912 transition count 3501
Free-agglomeration rule applied 910 times.
Iterating global reduction 1 with 910 rules applied. Total rules applied 4001 place count 3912 transition count 2591
Ensure Unique test removed 500 places
Reduce places removed 1410 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 1 with 2410 rules applied. Total rules applied 6411 place count 2502 transition count 1591
Reduce places removed 500 places and 0 transitions.
Iterating post reduction 2 with 500 rules applied. Total rules applied 6911 place count 2002 transition count 1591
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 6911 place count 2002 transition count 1091
Deduced a syphon composed of 500 places in 1 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 7911 place count 1502 transition count 1091
Free-agglomeration rule (complex) applied 89 times.
Iterating global reduction 3 with 89 rules applied. Total rules applied 8000 place count 1502 transition count 1002
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 3 with 89 rules applied. Total rules applied 8089 place count 1413 transition count 1002
Applied a total of 8089 rules in 1591 ms. Remains 1413 /6504 variables (removed 5091) and now considering 1002/4003 (removed 3001) transitions.
Running 501 sub problems to find dead transitions.
// Phase 1: matrix 1002 rows 1413 cols
[2026-06-01 09:23:58] [INFO ] Computed 501 invariants in 8 ms
[2026-06-01 09:23:58] [INFO ] State equation strengthened by 89 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1412 variables, 1/1 constraints. Problems are: Problem set: 410 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1412 variables, 499/500 constraints. Problems are: Problem set: 410 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:24:01] [INFO ] Deduced a trap composed of 2 places in 90 ms of which 5 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1412 variables, 1/501 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1412 variables, 0/501 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/1413 variables, 1/502 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1413 variables, 0/502 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1002/2415 variables, 1413/1915 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2415 variables, 89/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2415 variables, 0/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2415 variables, 0/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2415/2415 variables, and 2004 constraints, problems are : Problem set: 500 solved, 1 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 500/500 constraints, State Equation: 1413/1413 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 501/500 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 500 solved, 1 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 501/1002 variables, 500/500 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1002 variables, 0/500 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 411/1413 variables, 1/501 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1413 variables, 1/502 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1413 variables, 0/502 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1002/2415 variables, 1413/1915 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2415 variables, 89/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2415 variables, 0/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2415 variables, 0/2004 constraints. Problems are: Problem set: 500 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2415/2415 variables, and 2004 constraints, problems are : Problem set: 500 solved, 1 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 500/500 constraints, State Equation: 1413/1413 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1/500 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5325ms problems are : Problem set: 500 solved, 1 unsolved
Search for dead transitions found 500 dead transitions in 5340ms
Found 500 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 500 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1413/6504 places, 502/4003 transitions.
Graph (complete) has 1002 edges and 1413 vertex of which 1003 are kept as prefixes of interest. Removing 410 places using SCC suffix rule.1 ms
Discarding 410 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 1003 /1413 variables (removed 410) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7001 ms. Remains : 1003/6504 places, 502/4003 transitions.
// Phase 1: matrix 502 rows 1003 cols
[2026-06-01 09:24:03] [INFO ] Computed 501 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 2, 1]
RANDOM walk for 999358 steps (2995 resets) in 30001 ms. (33 steps per ms)
FORMULA SupplyChain-PT-00500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1547378 steps (19 resets) in 10004 ms. (154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[2, 2]
[2026-06-01 09:24:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-01 09:24:43] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2026-06-01 09:24:43] [INFO ] [Real]Absence check using 1 positive and 500 generalized place invariants in 69 ms returned sat
[2026-06-01 09:24:43] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-01 09:24:44] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2026-06-01 09:24:44] [INFO ] [Real]Absence check using 1 positive and 500 generalized place invariants in 94 ms returned sat
[2026-06-01 09:24:44] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[1, 1]
FORMULA SupplyChain-PT-00500-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00500-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-06-01 09:24:44] [INFO ] Flatten gal took : 169 ms
[2026-06-01 09:24:44] [INFO ] Flatten gal took : 56 ms
[2026-06-01 09:24:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15709251853535324388.gal : 19 ms
[2026-06-01 09:24:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1726026777390481550.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15709251853535324388.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1726026777390481550.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 110548 ms.

BK_STOP 1780305884909

--------------------
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
++ 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.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="SupplyChain-PT-00500"
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 SupplyChain-PT-00500, 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 r367-tall-178024404700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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