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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 81M
-rw-r--r-- 1 mcc users 9.7K May 27 08:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 27 08:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 27 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 27 10:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 27 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 27 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:36 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 81M 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-bP13C02-UpperBounds-00
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-01
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-02
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-03
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-04
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-05
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-06
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-07
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-08
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-09
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-10
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-11
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-12
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-13
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-14
FORMULA_NAME ErlangenMainframeV1-PT-bP13C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780320304495

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP13C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 13:25: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-06-01 13:25:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 13:25:11] [INFO ] Load time of PNML (sax parser for PT used): 5017 ms
[2026-06-01 13:25:12] [INFO ] Transformed 336 places.
[2026-06-01 13:25:12] [INFO ] Transformed 55645 transitions.
[2026-06-01 13:25:12] [INFO ] Found NUPN structural information;
[2026-06-01 13:25:12] [INFO ] Parsed PT model containing 336 places and 55645 transitions and 1622920 arcs in 6071 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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 55645 rows 336 cols
[2026-06-01 13:25:15] [INFO ] Computed 32 invariants in 2194 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 19312 ms. (0 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 29499 steps (6 resets) in 19532 ms. (1 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-06-01 13:25:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:25:55] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2026-06-01 13:25:55] [INFO ] [Real]Absence check using 19 positive and 13 generalized place invariants in 15 ms returned sat
[2026-06-01 13:25:59] [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 0
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.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 13:26:00] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2026-06-01 13:26:00] [INFO ] [Real]Absence check using 19 positive and 13 generalized place invariants in 8 ms returned sat
[2026-06-01 13:26:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 55645/55645 transitions.
Graph (trivial) has 282 edges and 336 vertex of which 12 / 336 are part of one of the 5 SCC in 23 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 329 transition count 55505
Reduce places removed 127 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 139 rules applied. Total rules applied 267 place count 202 transition count 55493
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 270 place count 199 transition count 55493
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 270 place count 199 transition count 55489
Deduced a syphon composed of 4 places in 81 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 278 place count 195 transition count 55489
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 311 place count 162 transition count 55456
Iterating global reduction 3 with 33 rules applied. Total rules applied 344 place count 162 transition count 55456
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 344 place count 162 transition count 55451
Deduced a syphon composed of 5 places in 83 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 354 place count 157 transition count 55451
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 375 place count 136 transition count 36994
Ensure Unique test removed 13 places
Iterating global reduction 3 with 34 rules applied. Total rules applied 409 place count 123 transition count 36994
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 424 place count 108 transition count 132
Iterating global reduction 3 with 15 rules applied. Total rules applied 439 place count 108 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 441 place count 106 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 443 place count 106 transition count 128
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 539 place count 58 transition count 80
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 559 place count 48 transition count 94
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 571 place count 48 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 574 place count 45 transition count 75
Iterating global reduction 4 with 3 rules applied. Total rules applied 577 place count 45 transition count 75
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 582 place count 45 transition count 70
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 586 place count 43 transition count 84
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 587 place count 43 transition count 83
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 617 place count 43 transition count 53
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 632 place count 43 transition count 38
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 662 place count 28 transition count 23
Ensure Unique test removed 9 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 671 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 672 place count 19 transition count 22
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 673 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 675 place count 18 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 676 place count 18 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 677 place count 17 transition count 19
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 683 place count 12 transition count 18
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 10 with 3 rules applied. Total rules applied 686 place count 10 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 690 place count 10 transition count 13
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 11 with 3 rules applied. Total rules applied 693 place count 8 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 695 place count 8 transition count 10
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 12 with 3 rules applied. Total rules applied 698 place count 6 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 700 place count 6 transition count 7
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 13 with 3 rules applied. Total rules applied 703 place count 4 transition count 6
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 4 vertex of which 2 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 13 with 2 rules applied. Total rules applied 705 place count 3 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 707 place count 3 transition count 3
Applied a total of 707 rules in 30145 ms. Remains 3 /336 variables (removed 333) and now considering 3/55645 (removed 55642) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30159 ms. Remains : 3/336 places, 3/55645 transitions.
// Phase 1: matrix 3 rows 3 cols
[2026-06-01 13:26:35] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 414 ms. (2409 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP13C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 358 ms. (2785 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:26:36] [INFO ] Flatten gal took : 169 ms
[2026-06-01 13:26:36] [INFO ] Flatten gal took : 2 ms
[2026-06-01 13:26:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12057435011382135694.gal : 6 ms
[2026-06-01 13:26:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11870625857388078386.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/ReachabilityCardinality12057435011382135694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11870625857388078386.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 89537 ms.

BK_STOP 1780320396351

--------------------
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-bP13C02"
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-bP13C02, 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-178021502100019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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