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.r207-tall-177969919700042.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 NoC3x3-PT-5B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r207-tall-177969919700042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.8K Mar 8 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 8 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 8 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 8 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 16 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 16 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 8 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 8 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 8 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 525K 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 NoC3x3-PT-5B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779719431748

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 14:30:33] [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 14:30:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:30:33] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-25 14:30:33] [INFO ] Transformed 1571 places.
[2026-05-25 14:30:33] [INFO ] Transformed 2173 transitions.
[2026-05-25 14:30:33] [INFO ] Found NUPN structural information;
[2026-05-25 14:30:33] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 246 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 2173 rows 1571 cols
[2026-05-25 14:30:33] [INFO ] Computed 66 invariants in 31 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 (16 resets) in 72 ms. (136 steps per ms)
FORMULA NoC3x3-PT-5B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 75 ms. (657 steps per ms)
FORMULA NoC3x3-PT-5B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 14:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 14:30:34] [INFO ] [Real]Absence check using 66 positive place invariants in 64 ms returned sat
[2026-05-25 14:30:34] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2026-05-25 14:30:34] [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 14:30:35] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2026-05-25 14:30:35] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2026-05-25 14:30:36] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 115 ms.
[2026-05-25 14:30: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
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 14:30:40] [INFO ] [Real]Absence check using 66 positive place invariants in 59 ms returned sat
[2026-05-25 14:30:40] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2026-05-25 14:30:40] [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 14:30:41] [INFO ] [Nat]Absence check using 66 positive place invariants in 72 ms returned sat
[2026-05-25 14:30:41] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:42] [INFO ] Deduced a trap composed of 88 places in 343 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:42] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 34 ms to minimize.
[2026-05-25 14:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 699 ms
[2026-05-25 14:30:42] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 131 ms.
[2026-05-25 14:30:45] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
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 14:30:46] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2026-05-25 14:30:46] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2026-05-25 14:30:46] [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 14:30:47] [INFO ] [Nat]Absence check using 66 positive place invariants in 59 ms returned sat
[2026-05-25 14:30:48] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:48] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:48] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:48] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 14:30:48] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 6 ms to minimize.
[2026-05-25 14:30:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 832 ms
[2026-05-25 14:30:48] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 116 ms.
[2026-05-25 14:30:51] [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: Broken pipe ... 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: 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:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
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 14:30:52] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2026-05-25 14:30:52] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2026-05-25 14:30:52] [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 14:30:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 57 ms returned sat
[2026-05-25 14:30:53] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2026-05-25 14:30:54] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 93 ms.
[2026-05-25 14:30:57] [INFO ] Added : 205 causal constraints over 41 iterations in 3982 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1571 transition count 1845
Reduce places removed 328 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 330 rules applied. Total rules applied 658 place count 1243 transition count 1843
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 660 place count 1241 transition count 1843
Discarding 273 places :
Symmetric choice reduction at 3 with 273 rule applications. Total rules 933 place count 968 transition count 1570
Iterating global reduction 3 with 273 rules applied. Total rules applied 1206 place count 968 transition count 1570
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 1206 place count 968 transition count 1536
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 1274 place count 934 transition count 1536
Discarding 111 places :
Symmetric choice reduction at 3 with 111 rule applications. Total rules 1385 place count 823 transition count 1337
Iterating global reduction 3 with 111 rules applied. Total rules applied 1496 place count 823 transition count 1337
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1552 place count 767 transition count 1222
Iterating global reduction 3 with 56 rules applied. Total rules applied 1608 place count 767 transition count 1222
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1629 place count 746 transition count 1180
Iterating global reduction 3 with 21 rules applied. Total rules applied 1650 place count 746 transition count 1180
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1656 place count 740 transition count 1168
Iterating global reduction 3 with 6 rules applied. Total rules applied 1662 place count 740 transition count 1168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1666 place count 736 transition count 1160
Iterating global reduction 3 with 4 rules applied. Total rules applied 1670 place count 736 transition count 1160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1674 place count 732 transition count 1148
Iterating global reduction 3 with 4 rules applied. Total rules applied 1678 place count 732 transition count 1148
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 2018 place count 562 transition count 978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2022 place count 562 transition count 974
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2224 place count 461 transition count 996
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2236 place count 461 transition count 984
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 2312 place count 423 transition count 992
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2314 place count 423 transition count 990
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 6 with 62 rules applied. Total rules applied 2376 place count 423 transition count 928
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2385 place count 414 transition count 928
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 2385 place count 414 transition count 923
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2395 place count 409 transition count 923
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2433 place count 390 transition count 904
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 2438 place count 390 transition count 904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2439 place count 389 transition count 903
Applied a total of 2439 rules in 533 ms. Remains 389 /1571 variables (removed 1182) and now considering 903/2173 (removed 1270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 389/1571 places, 903/2173 transitions.
// Phase 1: matrix 903 rows 389 cols
[2026-05-25 14:30:59] [INFO ] Computed 57 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 1, 1]
FORMULA NoC3x3-PT-5B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (4963 resets) in 3402 ms. (293 steps per ms)
FORMULA NoC3x3-PT-5B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (260 resets) in 1034 ms. (966 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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-05-25 14:31:03] [INFO ] Flatten gal took : 110 ms
[2026-05-25 14:31:03] [INFO ] Flatten gal took : 61 ms
[2026-05-25 14:31:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3237581688209954786.gal : 33 ms
[2026-05-25 14:31:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4731440944528518086.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/ReachabilityCardinality3237581688209954786.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4731440944528518086.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 31090 ms.

BK_STOP 1779719464180

--------------------
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="NoC3x3-PT-5B"
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 NoC3x3-PT-5B, 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 r207-tall-177969919700042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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