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.r528-tall-171683760900349.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 ltsminxred
Input is ShieldIIPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760900349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 ShieldIIPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717241376100

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:29:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:29:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:29:37] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-06-01 11:29:38] [INFO ] Transformed 7003 places.
[2024-06-01 11:29:38] [INFO ] Transformed 6503 transitions.
[2024-06-01 11:29:38] [INFO ] Found NUPN structural information;
[2024-06-01 11:29:38] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 809 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 6503 rows 7003 cols
[2024-06-01 11:29:38] [INFO ] Computed 901 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 158 ms. (62 steps per ms)
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 71 ms. (694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 11:29:38] [INFO ] Invariant cache hit.
[2024-06-01 11:29:40] [INFO ] [Real]Absence check using 901 positive place invariants in 644 ms returned sat
[2024-06-01 11:29:43] [INFO ] [Real]Absence check using state equation in 3170 ms returned unknown
[2024-06-01 11:29:45] [INFO ] [Real]Absence check using 901 positive place invariants in 618 ms returned sat
[2024-06-01 11:29:48] [INFO ] [Real]Absence check using state equation in 3393 ms returned unknown
[2024-06-01 11:29:50] [INFO ] [Real]Absence check using 901 positive place invariants in 571 ms returned sat
[2024-06-01 11:29:53] [INFO ] [Real]Absence check using state equation in 3461 ms returned unknown
[2024-06-01 11:29:55] [INFO ] [Real]Absence check using 901 positive place invariants in 585 ms returned sat
[2024-06-01 11:29:58] [INFO ] [Real]Absence check using state equation in 3448 ms returned unknown
[2024-06-01 11:30:00] [INFO ] [Real]Absence check using 901 positive place invariants in 586 ms returned sat
[2024-06-01 11:30:03] [INFO ] [Real]Absence check using state equation in 3434 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1701 transitions
Trivial Post-agglo rules discarded 1701 transitions
Performed 1701 trivial Post agglomeration. Transition count delta: 1701
Iterating post reduction 0 with 1701 rules applied. Total rules applied 1701 place count 7003 transition count 4802
Reduce places removed 1701 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1703 rules applied. Total rules applied 3404 place count 5302 transition count 4800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3405 place count 5301 transition count 4800
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3405 place count 5301 transition count 4400
Deduced a syphon composed of 400 places in 32 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4205 place count 4901 transition count 4400
Discarding 698 places :
Symmetric choice reduction at 3 with 698 rule applications. Total rules 4903 place count 4203 transition count 3702
Iterating global reduction 3 with 698 rules applied. Total rules applied 5601 place count 4203 transition count 3702
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 297 Pre rules applied. Total rules applied 5601 place count 4203 transition count 3405
Deduced a syphon composed of 297 places in 44 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 6195 place count 3906 transition count 3405
Performed 1702 Post agglomeration using F-continuation condition.Transition count delta: 1702
Deduced a syphon composed of 1702 places in 7 ms
Reduce places removed 1702 places and 0 transitions.
Iterating global reduction 3 with 3404 rules applied. Total rules applied 9599 place count 2204 transition count 1703
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9801 place count 2103 transition count 1769
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10003 place count 2002 transition count 1834
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 6 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 10195 place count 1906 transition count 1899
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10196 place count 1906 transition count 1898
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 10296 place count 1906 transition count 1898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10297 place count 1905 transition count 1897
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10299 place count 1903 transition count 1897
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 10299 place count 1903 transition count 1896
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 10301 place count 1902 transition count 1896
Applied a total of 10301 rules in 2286 ms. Remains 1902 /7003 variables (removed 5101) and now considering 1896/6503 (removed 4607) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2305 ms. Remains : 1902/7003 places, 1896/6503 transitions.
// Phase 1: matrix 1896 rows 1902 cols
[2024-06-01 11:30:06] [INFO ] Computed 899 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 12432 ms. (80 steps per ms)
BEST_FIRST walk for 2686997 steps (5 resets) in 25005 ms. (107 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-06-01 11:30:43] [INFO ] Invariant cache hit.
[2024-06-01 11:30:43] [INFO ] [Real]Absence check using 899 positive place invariants in 132 ms returned sat
[2024-06-01 11:30:44] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2024-06-01 11:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:30:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 136 ms returned sat
[2024-06-01 11:30:45] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-06-01 11:30:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:30:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:30:45] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 96 ms.
[2024-06-01 11:31:05] [INFO ] Added : 920 causal constraints over 184 iterations in 20063 ms.(timeout) Result :sat
Minimization took 1073 ms.
[2024-06-01 11:31:07] [INFO ] [Real]Absence check using 899 positive place invariants in 135 ms returned sat
[2024-06-01 11:31:07] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2024-06-01 11:31:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:31:08] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 89 ms.
[2024-06-01 11:31:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:31:08] [INFO ] [Nat]Absence check using 899 positive place invariants in 135 ms returned sat
[2024-06-01 11:31:09] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-06-01 11:31:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:31:09] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 90 ms.
[2024-06-01 11:31:29] [INFO ] Added : 915 causal constraints over 183 iterations in 20179 ms.(timeout) Result :sat
Minimization took 1039 ms.
[2024-06-01 11:31:31] [INFO ] [Real]Absence check using 899 positive place invariants in 133 ms returned sat
[2024-06-01 11:31:31] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-06-01 11:31:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:31:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 137 ms returned sat
[2024-06-01 11:31:32] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2024-06-01 11:31:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:31:32] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 94 ms.
[2024-06-01 11:31:52] [INFO ] Added : 920 causal constraints over 184 iterations in 20077 ms.(timeout) Result :sat
Minimization took 1070 ms.
[2024-06-01 11:31:54] [INFO ] [Real]Absence check using 899 positive place invariants in 132 ms returned sat
[2024-06-01 11:31:55] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-06-01 11:31:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 11:31:55] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 74 ms.
[2024-06-01 11:31:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:31:55] [INFO ] [Nat]Absence check using 899 positive place invariants in 119 ms returned sat
[2024-06-01 11:31:56] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-06-01 11:31:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:31:56] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 85 ms.
[2024-06-01 11:32:16] [INFO ] Added : 950 causal constraints over 190 iterations in 20126 ms.(timeout) Result :sat
Minimization took 1136 ms.
[2024-06-01 11:32:18] [INFO ] [Real]Absence check using 899 positive place invariants in 134 ms returned sat
[2024-06-01 11:32:18] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2024-06-01 11:32:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:32:19] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 84 ms.
[2024-06-01 11:32:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:32:19] [INFO ] [Nat]Absence check using 899 positive place invariants in 135 ms returned sat
[2024-06-01 11:32:20] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-06-01 11:32:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 11:32:20] [INFO ] Computed and/alt/rep : 1893/3384/1893 causal constraints (skipped 0 transitions) in 82 ms.
[2024-06-01 11:32:40] [INFO ] Added : 930 causal constraints over 186 iterations in 20071 ms.(timeout) Result :sat
Minimization took 891 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided 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 190069 ms.
ITS solved all properties within timeout

BK_STOP 1717241567468

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-100B, 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 r528-tall-171683760900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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