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.r223-tall-171649611400398.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611400398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K 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 7.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716550909227

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 11:41:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 11:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:41:51] [INFO ] Load time of PNML (sax parser for PT used): 687 ms
[2024-05-24 11:41:51] [INFO ] Transformed 21462 places.
[2024-05-24 11:41:51] [INFO ] Transformed 21129 transitions.
[2024-05-24 11:41:51] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 885 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1542 resets) in 3702 ms. (10 steps per ms) remains 12/16 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (53 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 724 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (57 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (55 resets) in 145 ms. (273 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 138 ms. (287 steps per ms) remains 11/12 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 1044 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (56 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (54 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 11:41:56] [INFO ] Computed 333 invariants in 2613 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20173/20385 variables, 151/152 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20385/42591 variables, and 152 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5061 ms.
Refiners :[Positive P Invariants (semi-flows): 1/67 constraints, Generalized P Invariants (flows): 151/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20174/20385 variables, 151/152 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20385/42591 variables, and 152 constraints, problems are : Problem set: 4 solved, 7 unsolved in 5104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/67 constraints, Generalized P Invariants (flows): 151/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 13057ms problems are : Problem set: 4 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 3298 are kept as prefixes of interest. Removing 18164 places using SCC suffix rule.42 ms
Discarding 18164 places :
Also discarding 9780 output transitions
Drop transitions (Output transitions of discarded places.) removed 9780 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4082 transitions
Reduce isomorphic transitions removed 4082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1347 transitions
Trivial Post-agglo rules discarded 1347 transitions
Performed 1347 trivial Post agglomeration. Transition count delta: 1347
Iterating post reduction 0 with 5429 rules applied. Total rules applied 5430 place count 3298 transition count 5920
Reduce places removed 1349 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1389 rules applied. Total rules applied 6819 place count 1949 transition count 5880
Reduce places removed 40 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 45 rules applied. Total rules applied 6864 place count 1909 transition count 5875
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 6869 place count 1904 transition count 5875
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 6869 place count 1904 transition count 5822
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 6975 place count 1851 transition count 5822
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 7037 place count 1789 transition count 5760
Iterating global reduction 4 with 62 rules applied. Total rules applied 7099 place count 1789 transition count 5760
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 4 with 26 rules applied. Total rules applied 7125 place count 1789 transition count 5734
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 7151 place count 1763 transition count 5734
Partial Free-agglomeration rule applied 1018 times.
Drop transitions (Partial Free agglomeration) removed 1018 transitions
Iterating global reduction 5 with 1018 rules applied. Total rules applied 8169 place count 1763 transition count 5734
Discarding 27 places :
Implicit places reduction removed 27 places
Iterating post reduction 5 with 27 rules applied. Total rules applied 8196 place count 1736 transition count 5734
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 8212 place count 1736 transition count 5718
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 8228 place count 1720 transition count 5718
Applied a total of 8228 rules in 1460 ms. Remains 1720 /21462 variables (removed 19742) and now considering 5718/21129 (removed 15411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1470 ms. Remains : 1720/21462 places, 5718/21129 transitions.
RANDOM walk for 40000 steps (4811 resets) in 1301 ms. (30 steps per ms) remains 5/7 properties
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (97 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (95 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (96 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
[2024-05-24 11:42:08] [INFO ] Flow matrix only has 3051 transitions (discarded 2667 similar events)
// Phase 1: matrix 3051 rows 1720 cols
[2024-05-24 11:42:08] [INFO ] Computed 3 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 217/234 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1867/2101 variables, 275/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2101 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 2660/4761 variables, 1421/1713 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4761 variables, 2/1715 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4761 variables, 0/1715 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/4762 variables, 1/1716 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4762 variables, 1/1717 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4762 variables, 0/1717 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 9/4771 variables, 6/1723 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4771 variables, 0/1723 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/4771 variables, 0/1723 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4771/4771 variables, and 1723 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1905 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1720/1720 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 180/194 variables, 14/14 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1785/1979 variables, 238/252 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1979 variables, 2/254 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1979 variables, 0/254 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2715/4694 variables, 1426/1680 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4694 variables, 1/1681 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4694 variables, 1/1682 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4694 variables, 0/1682 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/4698 variables, 2/1684 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4698 variables, 4/1688 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4698 variables, 0/1688 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 73/4771 variables, 38/1726 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4771 variables, 0/1726 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/4771 variables, 0/1726 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4771/4771 variables, and 1726 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2163 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1720/1720 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4123ms problems are : Problem set: 2 solved, 3 unsolved
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 30 ms.
All properties solved without resorting to model-checking.
Total runtime 22787 ms.
ITS solved all properties within timeout

BK_STOP 1716550933171

--------------------
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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is LeafsetExtension-PT-S64C3, 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 r223-tall-171649611400398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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