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.r351-smll-178021502100012.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 ErlangenMainframeV1-PT-bP06C06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-smll-178021502100012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 5.1K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.4K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 ErlangenMainframeV1-PT-bP06C06-UpperBounds-00
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-01
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-02
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-03
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-04
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-05
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-06
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-07
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-08
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-09
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-10
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-11
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-12
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-13
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-14
FORMULA_NAME ErlangenMainframeV1-PT-bP06C06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780319905662

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:18:28] [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 13:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:18:29] [INFO ] Load time of PNML (sax parser for PT used): 527 ms
[2026-06-01 13:18:29] [INFO ] Transformed 273 places.
[2026-06-01 13:18:29] [INFO ] Transformed 2487 transitions.
[2026-06-01 13:18:29] [INFO ] Found NUPN structural information;
[2026-06-01 13:18:29] [INFO ] Parsed PT model containing 273 places and 2487 transitions and 34329 arcs in 795 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 2487 rows 273 cols
[2026-06-01 13:18:29] [INFO ] Computed 18 invariants in 119 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 (2 resets) in 824 ms. (12 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 733 ms. (54 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-06-01 13:18:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:18:31] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2026-06-01 13:18:31] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 6 ms returned sat
[2026-06-01 13:18:32] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2026-06-01 13:18:35] [INFO ] Computed and/alt/rep : 265/629/265 causal constraints (skipped 2221 transitions) in 2283 ms.
[2026-06-01 13:18:36] [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 13:18:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 28 ms returned sat
[2026-06-01 13:18:36] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 4 ms returned sat
[2026-06-01 13:18:37] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:18:40] [INFO ] Deduced a trap composed of 25 places in 2872 ms of which 204 ms to minimize.
[2026-06-01 13:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3162 ms
[2026-06-01 13:18:43] [INFO ] Computed and/alt/rep : 265/629/265 causal constraints (skipped 2221 transitions) in 2604 ms.
[2026-06-01 13:18:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2606 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:18:43] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2026-06-01 13:18:43] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 5 ms returned sat
[2026-06-01 13:18:44] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:18:48] [INFO ] Deduced a trap composed of 25 places in 2972 ms of which 242 ms to minimize.
[2026-06-01 13:18:48] [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 13:18:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned sat
[2026-06-01 13:18:48] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 2 ms returned sat
[2026-06-01 13:18:49] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 13:18:51] [INFO ] Deduced a trap composed of 25 places in 2294 ms of which 238 ms to minimize.
[2026-06-01 13:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2522 ms
[2026-06-01 13:18:53] [INFO ] Computed and/alt/rep : 265/629/265 causal constraints (skipped 2221 transitions) in 1732 ms.
[2026-06-01 13:18:53] [INFO ] Added : 0 causal constraints over 0 iterations in 1734 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:18:53] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2026-06-01 13:18:53] [INFO ] [Real]Absence check using 12 positive and 6 generalized place invariants in 8 ms returned sat
[2026-06-01 13:18:54] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2026-06-01 13:18:57] [INFO ] Computed and/alt/rep : 265/629/265 causal constraints (skipped 2221 transitions) in 2361 ms.
[2026-06-01 13:18:57] [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 13:18:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2026-06-01 13:18:58] [INFO ] [Nat]Absence check using 12 positive and 6 generalized place invariants in 3 ms returned sat
[2026-06-01 13:18:59] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2026-06-01 13:19:00] [INFO ] Computed and/alt/rep : 265/629/265 causal constraints (skipped 2221 transitions) in 1399 ms.
[2026-06-01 13:19:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 273 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 2486/2486 transitions.
Graph (trivial) has 244 edges and 273 vertex of which 12 / 273 are part of one of the 5 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 266 transition count 2362
Reduce places removed 111 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 123 rules applied. Total rules applied 235 place count 155 transition count 2350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 238 place count 152 transition count 2350
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 238 place count 152 transition count 2346
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 246 place count 148 transition count 2346
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 276 place count 118 transition count 2316
Iterating global reduction 3 with 30 rules applied. Total rules applied 306 place count 118 transition count 2316
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 306 place count 118 transition count 2311
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 316 place count 113 transition count 2311
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 334 place count 95 transition count 1557
Ensure Unique test removed 6 places
Iterating global reduction 3 with 24 rules applied. Total rules applied 358 place count 89 transition count 1557
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 370 place count 77 transition count 101
Iterating global reduction 3 with 12 rules applied. Total rules applied 382 place count 77 transition count 101
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 387 place count 72 transition count 91
Iterating global reduction 3 with 5 rules applied. Total rules applied 392 place count 72 transition count 91
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 444 place count 46 transition count 65
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 470 place count 33 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 482 place count 33 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 485 place count 30 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 488 place count 30 transition count 68
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 493 place count 30 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 497 place count 28 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 498 place count 28 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 528 place count 28 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 536 place count 28 transition count 38
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 556 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 558 place count 20 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 19 transition count 23
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 570 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 573 place count 10 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 577 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 579 place count 10 transition count 12
Applied a total of 579 rules in 560 ms. Remains 10 /273 variables (removed 263) and now considering 12/2486 (removed 2474) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 10/273 places, 12/2486 transitions.
// Phase 1: matrix 12 rows 10 cols
[2026-06-01 13:19:03] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (27650 resets) in 733 ms. (1362 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP06C06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (8006 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after 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 13:19:05] [INFO ] Flatten gal took : 25 ms
[2026-06-01 13:19:05] [INFO ] Flatten gal took : 3 ms
[2026-06-01 13:19:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18198785811718198884.gal : 5 ms
[2026-06-01 13:19:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7483772530604969066.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18198785811718198884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7483772530604969066.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 36755 ms.

BK_STOP 1780319945171

--------------------
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="ErlangenMainframeV1-PT-bP06C06"
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 ErlangenMainframeV1-PT-bP06C06, 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 r351-smll-178021502100012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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