Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914200533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Parking-PT-432, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 7.8K Mar 8 08:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 8 08:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 8 08:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 8 08:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 16 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 16 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 8 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 8 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 8 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 8 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 192K Mar 3 18:30 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 Parking-PT-432-UpperBounds-00
FORMULA_NAME Parking-PT-432-UpperBounds-01
FORMULA_NAME Parking-PT-432-UpperBounds-02
FORMULA_NAME Parking-PT-432-UpperBounds-03
FORMULA_NAME Parking-PT-432-UpperBounds-04
FORMULA_NAME Parking-PT-432-UpperBounds-05
FORMULA_NAME Parking-PT-432-UpperBounds-06
FORMULA_NAME Parking-PT-432-UpperBounds-07
FORMULA_NAME Parking-PT-432-UpperBounds-08
FORMULA_NAME Parking-PT-432-UpperBounds-09
FORMULA_NAME Parking-PT-432-UpperBounds-10
FORMULA_NAME Parking-PT-432-UpperBounds-11
FORMULA_NAME Parking-PT-432-UpperBounds-12
FORMULA_NAME Parking-PT-432-UpperBounds-13
FORMULA_NAME Parking-PT-432-UpperBounds-14
FORMULA_NAME Parking-PT-432-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779785418877

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 08:50:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:50:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:50:20] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-26 08:50:20] [INFO ] Transformed 529 places.
[2026-05-26 08:50:20] [INFO ] Transformed 785 transitions.
[2026-05-26 08:50:20] [INFO ] Found NUPN structural information;
[2026-05-26 08:50:20] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8562343288990856102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3392554175479526896.kers'
[2026-05-26 08:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8562343288990856102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3392554175479526896.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 457 rows 529 cols 1425 entries
Finished phase 1 with 369 SingleSign rule and 36 generalized
[2026-05-26 08:50:20] [INFO ] Computed 124 invariants in 2 ms
Computed 124 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3392554175479526896.kers
Total runtime 3 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 (90 resets) in 93 ms. (106 steps per ms)
FORMULA Parking-PT-432-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-26 08:50:20] [INFO ] Invariant cache hit.
[2026-05-26 08:50:20] [INFO ] [Real]Absence check using 120 positive place invariants in 41 ms returned sat
[2026-05-26 08:50:20] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 08:50:21] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-26 08:50:21] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-26 08:50:21] [INFO ] [Real]Added 108 Read/Feed constraints in 81 ms returned sat
[2026-05-26 08:50:21] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 35 ms.
[2026-05-26 08:50:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:50:21] [INFO ] [Nat]Absence check using 120 positive place invariants in 32 ms returned sat
[2026-05-26 08:50:21] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2026-05-26 08:50:21] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-26 08:50:21] [INFO ] [Nat]Added 108 Read/Feed constraints in 75 ms returned sat
[2026-05-26 08:50:21] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 26 ms.
[2026-05-26 08:50:23] [INFO ] Added : 134 causal constraints over 27 iterations in 1868 ms. Result :sat
Minimization took 140 ms.
[2026-05-26 08:50:23] [INFO ] [Real]Absence check using 120 positive place invariants in 28 ms returned sat
[2026-05-26 08:50:23] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-26 08:50:23] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-26 08:50:24] [INFO ] [Real]Added 108 Read/Feed constraints in 45 ms returned sat
[2026-05-26 08:50:24] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 32 ms.
[2026-05-26 08:50:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:50:24] [INFO ] [Nat]Absence check using 120 positive place invariants in 28 ms returned sat
[2026-05-26 08:50:24] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 08:50:24] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2026-05-26 08:50:24] [INFO ] [Nat]Added 108 Read/Feed constraints in 76 ms returned sat
[2026-05-26 08:50:24] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 28 ms.
[2026-05-26 08:50:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2026-05-26 08:50:26] [INFO ] Added : 117 causal constraints over 24 iterations in 1804 ms. Result :sat
Minimization took 138 ms.
[2026-05-26 08:50:26] [INFO ] [Real]Absence check using 120 positive place invariants in 29 ms returned sat
[2026-05-26 08:50:26] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-26 08:50:26] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-26 08:50:26] [INFO ] [Real]Added 108 Read/Feed constraints in 25 ms returned sat
[2026-05-26 08:50:26] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 25 ms.
[2026-05-26 08:50:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:50:27] [INFO ] [Nat]Absence check using 120 positive place invariants in 27 ms returned sat
[2026-05-26 08:50:27] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2026-05-26 08:50:27] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-26 08:50:27] [INFO ] [Nat]Added 108 Read/Feed constraints in 26 ms returned sat
[2026-05-26 08:50:27] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 24 ms.
[2026-05-26 08:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-26 08:50:28] [INFO ] Added : 142 causal constraints over 29 iterations in 1407 ms. Result :sat
Minimization took 134 ms.
[2026-05-26 08:50:28] [INFO ] [Real]Absence check using 120 positive place invariants in 28 ms returned sat
[2026-05-26 08:50:28] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 08:50:29] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2026-05-26 08:50:29] [INFO ] [Real]Added 108 Read/Feed constraints in 25 ms returned sat
[2026-05-26 08:50:29] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 23 ms.
[2026-05-26 08:50:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:50:29] [INFO ] [Nat]Absence check using 120 positive place invariants in 29 ms returned sat
[2026-05-26 08:50:29] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 1 ms returned sat
[2026-05-26 08:50:29] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-26 08:50:29] [INFO ] [Nat]Added 108 Read/Feed constraints in 25 ms returned sat
[2026-05-26 08:50:29] [INFO ] Computed and/alt/rep : 384/1136/384 causal constraints (skipped 72 transitions) in 26 ms.
[2026-05-26 08:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2026-05-26 08:50:31] [INFO ] Added : 151 causal constraints over 31 iterations in 1661 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA Parking-PT-432-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 457/457 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 529 transition count 441
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 513 transition count 441
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 513 transition count 425
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 497 transition count 425
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 493 transition count 421
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 493 transition count 421
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 112 place count 473 transition count 401
Free-agglomeration rule applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 192 place count 473 transition count 321
Reduce places removed 80 places and 0 transitions.
Graph (complete) has 840 edges and 393 vertex of which 201 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 152 output transitions
Drop transitions (Output transitions of discarded places.) removed 152 transitions
Iterating post reduction 2 with 81 rules applied. Total rules applied 273 place count 201 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 281 place count 201 transition count 161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 282 place count 200 transition count 160
Reduce places removed 44 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 4 with 121 rules applied. Total rules applied 403 place count 156 transition count 83
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 101 rules applied. Total rules applied 504 place count 79 transition count 59
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 17 rules applied. Total rules applied 521 place count 63 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 522 place count 62 transition count 58
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 522 place count 62 transition count 40
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 558 place count 44 transition count 40
Applied a total of 558 rules in 173 ms. Remains 44 /529 variables (removed 485) and now considering 40/457 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 44/529 places, 40/457 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9144621032287331879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6170867587554027941.kers'
[2026-05-26 08:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9144621032287331879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6170867587554027941.kers]
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 40 rows 27 cols 86 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-26 08:50:32] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6170867587554027941.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1615 ms. (618 steps per ms)
FORMULA Parking-PT-432-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Parking-PT-432-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 14342 ms.

BK_STOP 1779785434391

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="Parking-PT-432"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Parking-PT-432, 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 r194-tall-177969914200533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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