Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530000293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is StigmergyElection-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530000293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 203K May 18 16:43 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

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717009460147

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:04:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-29 19:04:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:04:21] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-29 19:04:21] [INFO ] Transformed 563 places.
[2024-05-29 19:04:21] [INFO ] Transformed 780 transitions.
[2024-05-29 19:04:21] [INFO ] Found NUPN structural information;
[2024-05-29 19:04:21] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 780 rows 563 cols
[2024-05-29 19:04:21] [INFO ] Computed 5 invariants in 22 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 (135 resets) in 35 ms. (277 steps per ms)
FORMULA StigmergyElection-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (109 resets) in 36 ms. (1081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-29 19:04:21] [INFO ] Invariant cache hit.
[2024-05-29 19:04:22] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2024-05-29 19:04:22] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-29 19:04:22] [INFO ] Deduced a trap composed of 189 places in 291 ms of which 38 ms to minimize.
[2024-05-29 19:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:04:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2024-05-29 19:04:22] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-29 19:04:23] [INFO ] Deduced a trap composed of 189 places in 259 ms of which 3 ms to minimize.
[2024-05-29 19:04:23] [INFO ] Deduced a trap composed of 189 places in 173 ms of which 8 ms to minimize.
[2024-05-29 19:04:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2024-05-29 19:04:23] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 50 ms.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 191 places in 185 ms of which 3 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 191 places in 132 ms of which 2 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2024-05-29 19:04:27] [INFO ] Added : 354 causal constraints over 72 iterations in 3839 ms. Result :sat
Minimization took 302 ms.
[2024-05-29 19:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:04:27] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-29 19:04:27] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-29 19:04:28] [INFO ] Deduced a trap composed of 191 places in 220 ms of which 4 ms to minimize.
[2024-05-29 19:04:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:04:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2024-05-29 19:04:28] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-29 19:04:28] [INFO ] Deduced a trap composed of 191 places in 210 ms of which 3 ms to minimize.
[2024-05-29 19:04:28] [INFO ] Deduced a trap composed of 191 places in 145 ms of which 3 ms to minimize.
[2024-05-29 19:04:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2024-05-29 19:04:29] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 47 ms.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 191 places in 135 ms of which 4 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2024-05-29 19:04:32] [INFO ] Added : 320 causal constraints over 64 iterations in 3008 ms. Result :sat
Minimization took 280 ms.
[2024-05-29 19:04:32] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2024-05-29 19:04:32] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 191 places in 197 ms of which 4 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:04:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2024-05-29 19:04:33] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 191 places in 180 ms of which 3 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-29 19:04:33] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 39 ms.
[2024-05-29 19:04:36] [INFO ] Deduced a trap composed of 191 places in 151 ms of which 3 ms to minimize.
[2024-05-29 19:04:36] [INFO ] Deduced a trap composed of 190 places in 119 ms of which 2 ms to minimize.
[2024-05-29 19:04:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2024-05-29 19:04:36] [INFO ] Added : 309 causal constraints over 62 iterations in 3051 ms. Result :sat
Minimization took 344 ms.
[2024-05-29 19:04:36] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-29 19:04:37] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 189 places in 197 ms of which 4 ms to minimize.
[2024-05-29 19:04:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:04:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-05-29 19:04:37] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-29 19:04:37] [INFO ] Deduced a trap composed of 189 places in 198 ms of which 3 ms to minimize.
[2024-05-29 19:04:38] [INFO ] Deduced a trap composed of 190 places in 166 ms of which 3 ms to minimize.
[2024-05-29 19:04:38] [INFO ] Deduced a trap composed of 191 places in 126 ms of which 2 ms to minimize.
[2024-05-29 19:04:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 605 ms
[2024-05-29 19:04:38] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 44 ms.
[2024-05-29 19:04:41] [INFO ] Added : 315 causal constraints over 63 iterations in 2768 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA StigmergyElection-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 570 edges and 563 vertex of which 81 / 563 are part of one of the 12 SCC in 5 ms
Free SCC test removed 69 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 857 edges and 494 vertex of which 486 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 361 rules applied. Total rules applied 363 place count 486 transition count 327
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 377 rules applied. Total rules applied 740 place count 129 transition count 307
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 751 place count 119 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 752 place count 118 transition count 306
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 752 place count 118 transition count 296
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 772 place count 108 transition count 296
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 805 place count 75 transition count 263
Iterating global reduction 4 with 33 rules applied. Total rules applied 838 place count 75 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 838 place count 75 transition count 260
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 844 place count 72 transition count 260
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 854 place count 62 transition count 121
Iterating global reduction 4 with 10 rules applied. Total rules applied 864 place count 62 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 873 place count 62 transition count 112
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 897 place count 50 transition count 100
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 898 place count 50 transition count 99
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 902 place count 46 transition count 95
Iterating global reduction 6 with 4 rules applied. Total rules applied 906 place count 46 transition count 95
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 914 place count 42 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 915 place count 42 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 923 place count 42 transition count 94
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 944 place count 42 transition count 73
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 968 place count 21 transition count 70
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 972 place count 17 transition count 66
Iterating global reduction 8 with 4 rules applied. Total rules applied 976 place count 17 transition count 66
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 985 place count 17 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 992 place count 17 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 993 place count 16 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 994 place count 15 transition count 49
Performed 4 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 9 rules applied. Total rules applied 1003 place count 10 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1016 place count 10 transition count 14
Performed 2 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1020 place count 8 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1023 place count 8 transition count 10
Applied a total of 1023 rules in 115 ms. Remains 8 /563 variables (removed 555) and now considering 10/780 (removed 770) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 8/563 places, 10/780 transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-29 19:04:41] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA StigmergyElection-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 497 ms. (2008 steps per ms)
FORMULA StigmergyElection-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 227 ms. (4385 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21262 ms.
ITS solved all properties within timeout

BK_STOP 1717009482633

--------------------
content from stderr:

+ 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="StigmergyElection-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is StigmergyElection-PT-04b, 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 r399-tall-171690530000293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04b.tgz
mv StigmergyElection-PT-04b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;