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.r194-tall-177969914100381.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 itstools
Input is NoC3x3-PT-8B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914100381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 7.2K Mar 8 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 8 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 8 06:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 8 06:34 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 8 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 8 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 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 3.0M 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-8B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-8B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779768965321

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 04:16:06] [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-26 04:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 04:16:06] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2026-05-26 04:16:06] [INFO ] Transformed 9140 places.
[2026-05-26 04:16:07] [INFO ] Transformed 14577 transitions.
[2026-05-26 04:16:07] [INFO ] Found NUPN structural information;
[2026-05-26 04:16:07] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 589 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18056106385599297487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13706871682137553602.kers'
[2026-05-26 04:16:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18056106385599297487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13706871682137553602.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 14577 rows 9140 cols 30726 entries
Finished phase 1 with 9041 SingleSign rule and 0 generalized
[2026-05-26 04:16:07] [INFO ] Computed 99 invariants in 75 ms
Computed 99 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-13706871682137553602.kers
Total runtime 90 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 (4 resets) in 145 ms. (68 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 164 ms. (606 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-26 04:16:07] [INFO ] Invariant cache hit.
[2026-05-26 04:16:10] [INFO ] [Real]Absence check using 99 positive place invariants in 430 ms returned sat
[2026-05-26 04:16:12] [INFO ] [Real]Absence check using state equation in 2814 ms returned unknown
[2026-05-26 04:16:14] [INFO ] [Real]Absence check using 99 positive place invariants in 427 ms returned sat
[2026-05-26 04:16:17] [INFO ] [Real]Absence check using state equation in 3004 ms returned unknown
[2026-05-26 04:16:19] [INFO ] [Real]Absence check using 99 positive place invariants in 431 ms returned sat
[2026-05-26 04:16:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 04:16:24] [INFO ] [Real]Absence check using 99 positive place invariants in 414 ms returned sat
[2026-05-26 04:16:27] [INFO ] [Real]Absence check using state equation in 3240 ms returned unknown
[2026-05-26 04:16:29] [INFO ] [Real]Absence check using 99 positive place invariants in 445 ms returned sat
[2026-05-26 04:16:32] [INFO ] [Real]Absence check using state equation in 3030 ms returned unknown
[2026-05-26 04:16:34] [INFO ] [Real]Absence check using 99 positive place invariants in 415 ms returned sat
[2026-05-26 04:16:38] [INFO ] [Real]Absence check using state equation in 3144 ms returned unknown
[2026-05-26 04:16:39] [INFO ] [Real]Absence check using 99 positive place invariants in 404 ms returned sat
[2026-05-26 04:16:43] [INFO ] [Real]Absence check using state equation in 3099 ms returned unknown
[2026-05-26 04:16:44] [INFO ] [Real]Absence check using 99 positive place invariants in 398 ms returned sat
[2026-05-26 04:16:48] [INFO ] [Real]Absence check using state equation in 3100 ms returned unknown
[2026-05-26 04:16:49] [INFO ] [Real]Absence check using 99 positive place invariants in 402 ms returned sat
[2026-05-26 04:16:53] [INFO ] [Real]Absence check using state equation in 3170 ms returned unknown
[2026-05-26 04:16:54] [INFO ] [Real]Absence check using 99 positive place invariants in 392 ms returned sat
[2026-05-26 04:16:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13724 edges and 9140 vertex of which 2395 / 9140 are part of one of the 33 SCC in 35 ms
Free SCC test removed 2362 places
Drop transitions (Empty/Sink Transition effects.) removed 3752 transitions
Reduce isomorphic transitions removed 3752 transitions.
Graph (complete) has 12302 edges and 6778 vertex of which 6665 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.19 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4195 transitions
Trivial Post-agglo rules discarded 4195 transitions
Performed 4195 trivial Post agglomeration. Transition count delta: 4195
Iterating post reduction 0 with 4299 rules applied. Total rules applied 4301 place count 6665 transition count 6446
Reduce places removed 4195 places and 0 transitions.
Ensure Unique test removed 2370 transitions
Reduce isomorphic transitions removed 2370 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 1 with 7759 rules applied. Total rules applied 12060 place count 2470 transition count 2882
Reduce places removed 1194 places and 0 transitions.
Ensure Unique test removed 1194 transitions
Reduce isomorphic transitions removed 1194 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 2424 rules applied. Total rules applied 14484 place count 1276 transition count 1652
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 38 rules applied. Total rules applied 14522 place count 1240 transition count 1650
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 14525 place count 1238 transition count 1649
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 14525 place count 1238 transition count 1610
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 14603 place count 1199 transition count 1610
Discarding 359 places :
Symmetric choice reduction at 5 with 359 rule applications. Total rules 14962 place count 840 transition count 1251
Iterating global reduction 5 with 359 rules applied. Total rules applied 15321 place count 840 transition count 1251
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 15377 place count 840 transition count 1195
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 61 Pre rules applied. Total rules applied 15377 place count 840 transition count 1134
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 15499 place count 779 transition count 1134
Discarding 79 places :
Symmetric choice reduction at 6 with 79 rule applications. Total rules 15578 place count 700 transition count 963
Iterating global reduction 6 with 79 rules applied. Total rules applied 15657 place count 700 transition count 963
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 15681 place count 700 transition count 939
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 7 with 480 rules applied. Total rules applied 16161 place count 460 transition count 699
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 16185 place count 460 transition count 675
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 16189 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 16200 place count 458 transition count 686
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 16202 place count 457 transition count 705
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 16203 place count 457 transition count 704
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 16209 place count 457 transition count 698
Free-agglomeration rule applied 205 times.
Iterating global reduction 9 with 205 rules applied. Total rules applied 16414 place count 457 transition count 493
Reduce places removed 205 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 805 edges and 252 vertex of which 245 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 218 rules applied. Total rules applied 16632 place count 245 transition count 481
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 16639 place count 245 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 167 transitions
Redundant transition composition rules discarded 167 transitions
Iterating global reduction 11 with 167 rules applied. Total rules applied 16806 place count 245 transition count 307
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 623 edges and 237 vertex of which 214 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 9 rules applied. Total rules applied 16815 place count 214 transition count 307
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 12 with 23 rules applied. Total rules applied 16838 place count 214 transition count 284
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 13 with 26 rules applied. Total rules applied 16864 place count 214 transition count 284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 16865 place count 214 transition count 284
Applied a total of 16865 rules in 631 ms. Remains 214 /9140 variables (removed 8926) and now considering 284/14577 (removed 14293) transitions.
Running 275 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8651189635632256663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7174027633732452231.kers'
[2026-05-26 04:16:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8651189635632256663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7174027633732452231.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 284 rows 208 cols 1181 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 04:16:58] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7174027633732452231.kers
Total runtime 3 ms.
[2026-05-26 04:16:58] [INFO ] State equation strengthened by 186 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 275 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 3 (OVERLAPS) 284/498 variables, 214/272 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 186/458 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/498 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 458 constraints, problems are : Problem set: 1 solved, 274 unsolved in 15204 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 214/214 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 284/498 variables, 214/272 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/498 variables, 186/458 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/498 variables, 274/732 constraints. Problems are: Problem set: 1 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 4/736 constraints. Problems are: Problem set: 1 solved, 274 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/498 variables, and 736 constraints, problems are : Problem set: 1 solved, 274 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 214/214 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 274/275 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35426ms problems are : Problem set: 1 solved, 274 unsolved
Search for dead transitions found 1 dead transitions in 35438ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 214/9140 places, 283/14577 transitions.
Applied a total of 0 rules in 8 ms. Remains 214 /214 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36104 ms. Remains : 214/9140 places, 283/14577 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3659777214284225048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18356701154874579783.kers'
[2026-05-26 04:17:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3659777214284225048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18356701154874579783.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 283 rows 208 cols 1176 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-26 04:17:34] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18356701154874579783.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3085 ms. (324 steps per ms)
FORMULA NoC3x3-PT-8B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-8B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 861 ms. (1160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 91676 ms.

BK_STOP 1779769058182

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-8B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-8B, 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 r194-tall-177969914100381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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