Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r237-smll-174903502600009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is StigmergyCommit-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502600009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:33 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 StigmergyCommit-PT-06a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-06a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106490902

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:54:53] [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]
[2025-06-05 06:54:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:54:54] [INFO ] Load time of PNML (sax parser for PT used): 688 ms
[2025-06-05 06:54:54] [INFO ] Transformed 256 places.
[2025-06-05 06:54:54] [INFO ] Transformed 2816 transitions.
[2025-06-05 06:54:54] [INFO ] Found NUPN structural information;
[2025-06-05 06:54:54] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 926 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
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]
[2025-06-05 06:54:54] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2025-06-05 06:54:54] [INFO ] Computed 8 invariants in 36 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 184 ms. (54 steps per ms)
FORMULA StigmergyCommit-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 41 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-05 06:54:54] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
[2025-06-05 06:54:54] [INFO ] Invariant cache hit.
[2025-06-05 06:54:55] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2025-06-05 06:54:55] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2025-06-05 06:54:55] [INFO ] State equation strengthened by 351 read => feed constraints.
[2025-06-05 06:54:55] [INFO ] [Real]Added 351 Read/Feed constraints in 132 ms returned sat
[2025-06-05 06:54:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-05 06:54:56] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2025-06-05 06:54:56] [INFO ] [Nat]Added 351 Read/Feed constraints in 166 ms returned sat
[2025-06-05 06:54:56] [INFO ] Deduced a trap composed of 18 places in 313 ms of which 31 ms to minimize.
[2025-06-05 06:54:57] [INFO ] Deduced a trap composed of 18 places in 304 ms of which 4 ms to minimize.
[2025-06-05 06:54:57] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 3 ms to minimize.
[2025-06-05 06:54:57] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 2 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:54:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1995 ms
[2025-06-05 06:54:58] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 166 ms.
[2025-06-05 06:54:59] [INFO ] Added : 56 causal constraints over 12 iterations in 850 ms. Result :sat
Minimization took 193 ms.
[2025-06-05 06:54:59] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-05 06:55:00] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-05 06:55:00] [INFO ] [Real]Added 351 Read/Feed constraints in 86 ms returned sat
[2025-06-05 06:55:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-05 06:55:00] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2025-06-05 06:55:00] [INFO ] [Nat]Added 351 Read/Feed constraints in 76 ms returned sat
[2025-06-05 06:55:00] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 3 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 3 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 3 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2025-06-05 06:55:01] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2025-06-05 06:55:02] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2025-06-05 06:55:02] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2025-06-05 06:55:02] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1517 ms
[2025-06-05 06:55:02] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 131 ms.
[2025-06-05 06:55:02] [INFO ] Added : 52 causal constraints over 11 iterations in 704 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA StigmergyCommit-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 256 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p94) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 586/586 transitions.
Graph (complete) has 548 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 249 transition count 514
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 78 rules applied. Total rules applied 144 place count 206 transition count 479
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 151 place count 199 transition count 479
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 151 place count 199 transition count 430
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 249 place count 150 transition count 430
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 284 place count 115 transition count 395
Iterating global reduction 3 with 35 rules applied. Total rules applied 319 place count 115 transition count 395
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 354 place count 80 transition count 360
Iterating global reduction 3 with 35 rules applied. Total rules applied 389 place count 80 transition count 360
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 134 transitions.
Iterating post reduction 3 with 134 rules applied. Total rules applied 523 place count 80 transition count 226
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 530 place count 73 transition count 219
Iterating global reduction 4 with 7 rules applied. Total rules applied 537 place count 73 transition count 219
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 544 place count 66 transition count 212
Iterating global reduction 4 with 7 rules applied. Total rules applied 551 place count 66 transition count 212
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 557 place count 66 transition count 206
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 585 place count 52 transition count 192
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 599 place count 52 transition count 178
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 605 place count 46 transition count 172
Iterating global reduction 6 with 6 rules applied. Total rules applied 611 place count 46 transition count 172
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 617 place count 40 transition count 166
Iterating global reduction 6 with 6 rules applied. Total rules applied 623 place count 40 transition count 166
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 629 place count 34 transition count 160
Iterating global reduction 6 with 6 rules applied. Total rules applied 635 place count 34 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 636 place count 33 transition count 159
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 6 with 9 rules applied. Total rules applied 645 place count 32 transition count 151
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 653 place count 24 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 653 place count 24 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 655 place count 23 transition count 150
Performed 7 Post agglomeration using F-continuation condition with reduction of 120 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 669 place count 16 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 676 place count 16 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 696 place count 3 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 703 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 703 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 705 place count 2 transition count 1
Applied a total of 705 rules in 179 ms. Remains 2 /256 variables (removed 254) and now considering 1/586 (removed 585) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 2/256 places, 1/586 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-05 06:55:03] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA StigmergyCommit-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 309 ms. (3225 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 )
[2025-06-05 06:55:04] [INFO ] Flatten gal took : 346 ms
[2025-06-05 06:55:04] [INFO ] Flatten gal took : 2 ms
[2025-06-05 06:55:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12524756613043655600.gal : 7 ms
[2025-06-05 06:55:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8980129795133975488.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12524756613043655600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8980129795133975488.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 11245 ms.

BK_STOP 1749106504691

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyCommit-PT-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is StigmergyCommit-PT-06a, 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 r237-smll-174903502600009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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