Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399600502.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399600502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 100K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717225285495

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:01:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:01:27] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-01 07:01:27] [INFO ] Transformed 386 places.
[2024-06-01 07:01:27] [INFO ] Transformed 360 transitions.
[2024-06-01 07:01:27] [INFO ] Found NUPN structural information;
[2024-06-01 07:01:27] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 49 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (436 resets) in 1623 ms. (24 steps per ms) remains 3/10 properties
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (78 resets) in 399 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 596 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
// Phase 1: matrix 360 rows 386 cols
[2024-06-01 07:01:28] [INFO ] Computed 62 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 199/281 variables, 28/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 199/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 21/302 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 21/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-07-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-07-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 82/384 variables, 27/362 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 82/444 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/444 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/386 variables, 2/446 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/386 variables, 2/448 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/386 variables, 0/448 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 360/746 variables, 386/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/746 variables, 0/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/746 variables, 0/834 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 834 constraints, problems are : Problem set: 2 solved, 1 unsolved in 647 ms.
Refiners :[Domain max(s): 386/386 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 386/386 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 41/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 204/245 variables, 22/63 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 204/267 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 13 ms to minimize.
[2024-06-01 07:01:29] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 9/276 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 47/292 variables, 11/287 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 47/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:01:30] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 24 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 6/340 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/340 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 92/384 variables, 27/367 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 92/459 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:01:31] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 9 ms to minimize.
[2024-06-01 07:01:32] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/384 variables, 13/472 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/472 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/386 variables, 2/474 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/386 variables, 2/476 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/386 variables, 0/476 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/746 variables, 386/862 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/746 variables, 1/863 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 0/863 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:01:33] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/746 variables, 2/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/746 variables, 0/865 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 865 constraints, problems are : Problem set: 2 solved, 1 unsolved in 4203 ms.
Refiners :[Domain max(s): 386/386 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 386/386 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 30/30 constraints]
After SMT, in 5030ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 41 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 175 edges and 386 vertex of which 7 / 386 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 805 edges and 380 vertex of which 378 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 378 transition count 292
Reduce places removed 59 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 319 transition count 284
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 136 place count 311 transition count 284
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 136 place count 311 transition count 237
Deduced a syphon composed of 47 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 234 place count 260 transition count 237
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 267 place count 227 transition count 204
Iterating global reduction 3 with 33 rules applied. Total rules applied 300 place count 227 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 300 place count 227 transition count 202
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 304 place count 225 transition count 202
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 402 place count 176 transition count 153
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 405 place count 176 transition count 150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 408 place count 173 transition count 150
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 412 place count 173 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 172 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 414 place count 171 transition count 149
Applied a total of 414 rules in 225 ms. Remains 171 /386 variables (removed 215) and now considering 149/360 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 171/386 places, 149/360 transitions.
RANDOM walk for 4080 steps (80 resets) in 81 ms. (49 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7027 ms.
ITS solved all properties within timeout

BK_STOP 1717225294340

--------------------
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 ReachabilityCardinality -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="BusinessProcesses-PT-07"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399600502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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