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.r139-smll-174876533200038.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 MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K 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 4.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.1M May 29 14:32 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 MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748896601120

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:36:43] [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-02 20:36:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:36:44] [INFO ] Load time of PNML (sax parser for PT used): 710 ms
[2025-06-02 20:36:44] [INFO ] Transformed 4260 places.
[2025-06-02 20:36:44] [INFO ] Transformed 6027 transitions.
[2025-06-02 20:36:44] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 1206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:36:45] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2025-06-02 20:36:45] [INFO ] Computed 497 invariants in 673 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:[17, 17, 17, 17, 17, 23, 17, 17, 17, 17, 51, 17, 51, 51, 51, 17]
RANDOM walk for 10000 steps (239 resets) in 182 ms. (54 steps per ms)
BEST_FIRST walk for 160015 steps (976 resets) in 789 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1] Max Struct:[17, 17, 17, 17, 17, 23, 17, 17, 17, 17, 51, 17, 51, 51, 51, 17]
[2025-06-02 20:36:46] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
[2025-06-02 20:36:46] [INFO ] Invariant cache hit.
[2025-06-02 20:36:48] [INFO ] [Real]Absence check using 46 positive place invariants in 94 ms returned sat
[2025-06-02 20:36:48] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 166 ms returned unsat
[2025-06-02 20:36:49] [INFO ] [Real]Absence check using 46 positive place invariants in 81 ms returned sat
[2025-06-02 20:36:49] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 264 ms returned sat
[2025-06-02 20:36:53] [INFO ] [Real]Absence check using state equation in 3747 ms returned unknown
[2025-06-02 20:36:54] [INFO ] [Real]Absence check using 46 positive place invariants in 100 ms returned sat
[2025-06-02 20:36:54] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 155 ms returned unsat
[2025-06-02 20:36:55] [INFO ] [Real]Absence check using 46 positive place invariants in 85 ms returned sat
[2025-06-02 20:36:55] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 169 ms returned unsat
[2025-06-02 20:36:56] [INFO ] [Real]Absence check using 46 positive place invariants in 79 ms returned sat
[2025-06-02 20:36:56] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 172 ms returned unsat
[2025-06-02 20:36:57] [INFO ] [Real]Absence check using 46 positive place invariants in 80 ms returned sat
[2025-06-02 20:36:58] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 168 ms returned unsat
[2025-06-02 20:36:58] [INFO ] [Real]Absence check using 46 positive place invariants in 79 ms returned sat
[2025-06-02 20:36:59] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 169 ms returned unsat
[2025-06-02 20:36:59] [INFO ] [Real]Absence check using 46 positive place invariants in 128 ms returned sat
[2025-06-02 20:37:00] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 261 ms returned unsat
[2025-06-02 20:37:01] [INFO ] [Real]Absence check using 46 positive place invariants in 78 ms returned sat
[2025-06-02 20:37:01] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 169 ms returned unsat
[2025-06-02 20:37:02] [INFO ] [Real]Absence check using 46 positive place invariants in 125 ms returned sat
[2025-06-02 20:37:02] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 258 ms returned unsat
[2025-06-02 20:37:03] [INFO ] [Real]Absence check using 46 positive place invariants in 77 ms returned sat
[2025-06-02 20:37:03] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 164 ms returned unsat
[2025-06-02 20:37:04] [INFO ] [Real]Absence check using 46 positive place invariants in 76 ms returned sat
[2025-06-02 20:37:04] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 177 ms returned unsat
[2025-06-02 20:37:05] [INFO ] [Real]Absence check using 46 positive place invariants in 78 ms returned sat
[2025-06-02 20:37:05] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 143 ms returned unsat
[2025-06-02 20:37:06] [INFO ] [Real]Absence check using 46 positive place invariants in 76 ms returned sat
[2025-06-02 20:37:07] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 224 ms returned sat
[2025-06-02 20:37:10] [INFO ] [Real]Absence check using state equation in 3891 ms returned unknown
[2025-06-02 20:37:11] [INFO ] [Real]Absence check using 46 positive place invariants in 78 ms returned sat
[2025-06-02 20:37:12] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 238 ms returned unsat
[2025-06-02 20:37:12] [INFO ] [Real]Absence check using 46 positive place invariants in 79 ms returned sat
[2025-06-02 20:37:12] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 166 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1] Max Struct:[1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[17, 51]
Support contains 2 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.24 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1086 transitions
Trivial Post-agglo rules discarded 1086 transitions
Performed 1086 trivial Post agglomeration. Transition count delta: 1086
Iterating post reduction 0 with 1086 rules applied. Total rules applied 1087 place count 4232 transition count 4941
Reduce places removed 1086 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1087 rules applied. Total rules applied 2174 place count 3146 transition count 4940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2175 place count 3145 transition count 4940
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2175 place count 3145 transition count 4804
Deduced a syphon composed of 136 places in 14 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 950 places :
Symmetric choice reduction at 3 with 950 rule applications. Total rules 3397 place count 2059 transition count 3854
Iterating global reduction 3 with 950 rules applied. Total rules applied 4347 place count 2059 transition count 3854
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4347 place count 2059 transition count 3847
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4361 place count 2052 transition count 3847
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 4597 place count 1816 transition count 2903
Iterating global reduction 3 with 236 rules applied. Total rules applied 4833 place count 1816 transition count 2903
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4867 place count 1799 transition count 2886
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 5029 place count 1799 transition count 3432
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 5191 place count 1637 transition count 3432
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 5208 place count 1637 transition count 3432
Applied a total of 5208 rules in 2214 ms. Remains 1637 /4260 variables (removed 2623) and now considering 3432/6027 (removed 2595) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2231 ms. Remains : 1637/4260 places, 3432/6027 transitions.
[2025-06-02 20:37:15] [INFO ] Flow matrix only has 3034 transitions (discarded 398 similar events)
// Phase 1: matrix 3034 rows 1637 cols
[2025-06-02 20:37:15] [INFO ] Computed 469 invariants in 92 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 2]
RANDOM walk for 1000000 steps (39555 resets) in 15698 ms. (63 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6883 resets) in 3937 ms. (253 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2025-06-02 20:37:34] [INFO ] Flow matrix only has 3034 transitions (discarded 398 similar events)
[2025-06-02 20:37:34] [INFO ] Invariant cache hit.
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 31 positive place invariants in 55 ms returned sat
[2025-06-02 20:37:35] [INFO ] [Real]Absence check using 31 positive and 438 generalized place invariants in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 14 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-02 20:37:36] [INFO ] Flatten gal took : 586 ms
[2025-06-02 20:37:36] [INFO ] Flatten gal took : 241 ms
[2025-06-02 20:37:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5119763898758959580.gal : 101 ms
[2025-06-02 20:37:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2075232923709479221.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/ReachabilityCardinality5119763898758959580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2075232923709479221.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 ...328
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 53041 ms.

BK_STOP 1748896656803

--------------------
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="MultiCrashLeafsetExtension-PT-S16C04"
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 MultiCrashLeafsetExtension-PT-S16C04, 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 r139-smll-174876533200038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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