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.r530-tall-171683779400477.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 ShieldRVs-PT-004B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779400477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 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 49K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717227258218

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:34:19] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-06-01 07:34:19] [INFO ] Transformed 163 places.
[2024-06-01 07:34:19] [INFO ] Transformed 183 transitions.
[2024-06-01 07:34:19] [INFO ] Found NUPN structural information;
[2024-06-01 07:34:19] [INFO ] Parsed PT model containing 163 places and 183 transitions and 576 arcs in 157 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 163/163 places, 183/183 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 163 transition count 166
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 146 transition count 166
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 34 place count 146 transition count 146
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 74 place count 126 transition count 146
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 202 place count 62 transition count 82
Applied a total of 202 rules in 59 ms. Remains 62 /163 variables (removed 101) and now considering 82/183 (removed 101) transitions.
// Phase 1: matrix 82 rows 62 cols
[2024-06-01 07:34:19] [INFO ] Computed 17 invariants in 11 ms
[2024-06-01 07:34:19] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-06-01 07:34:19] [INFO ] Invariant cache hit.
[2024-06-01 07:34:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-06-01 07:34:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 5 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 7 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:34:20] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 82/144 variables, 62/166 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 7 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 7 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 14/180 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:34:22] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 2 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 13/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:23] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:34:24] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:34:25] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/144 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/144 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:34:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/144 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/144 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 21 (OVERLAPS) 0/144 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 217 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7284 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 76/155 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/144 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 81/298 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:34:28] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:34:29] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 306 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5067 ms.
Refiners :[Domain max(s): 62/62 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 84/84 constraints]
After SMT, in 12418ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 12435ms
Starting structural reductions in LIVENESS mode, iteration 1 : 62/163 places, 82/183 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 12842 ms. Remains : 62/163 places, 82/183 transitions.
Discarding 24 transitions out of 82. Remains 58
Initial state reduction rules removed 1 formulas.
RANDOM walk for 4708 steps (73 resets) in 339 ms. (13 steps per ms) remains 0/57 properties
Able to resolve query QuasiLiveness after proving 58 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 13207 ms.
ITS solved all properties within timeout

BK_STOP 1717227272573

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.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 QuasiLiveness -timeout 180 -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="ShieldRVs-PT-004B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldRVs-PT-004B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r530-tall-171683779400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-004B.tgz
mv ShieldRVs-PT-004B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;