Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 13K Mar 7 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Mar 15 11:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 7 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779932573159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 01:42:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 01:42:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 01:42:56] [INFO ] Load time of PNML (sax parser for PT used): 645 ms
[2026-05-28 01:42:56] [INFO ] Transformed 5622 places.
[2026-05-28 01:42:56] [INFO ] Transformed 5449 transitions.
[2026-05-28 01:42:56] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 937 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1537 resets) in 3311 ms. (12 steps per ms) remains 9/16 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (107 resets) in 1368 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (102 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (101 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 689 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (101 resets) in 1397 ms. (28 steps per ms) remains 9/9 properties
[2026-05-28 01:42:59] [INFO ] Flatten gal took : 1423 ms
BEST_FIRST walk for 40004 steps (102 resets) in 1088 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
[2026-05-28 01:42:59] [INFO ] Flatten gal took : 514 ms
BEST_FIRST walk for 40004 steps (102 resets) in 1248 ms. (32 steps per ms) remains 9/9 properties
[2026-05-28 01:42:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8373303770084869123.gal : 182 ms
[2026-05-28 01:42:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11348962539482277241.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8373303770084869123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11348962539482277241.prop' '--nowitness' '--gen-order' 'FOLLOW'
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1057830246881103807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11417079345344164290.kers'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2026-05-28 01:43:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1057830246881103807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11417079345344164290.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 7 ms.
// Phase 1: matrix 5449 rows 5586 cols 15220 entries
Finished phase 1 with 3287 SingleSign rule and 2162 generalized
[2026-05-28 01:43:00] [INFO ] Computed 173 invariants in 141 ms
Computed 173 P flows in 143 ms.
Exported basis to /tmp/petrispot-output-11417079345344164290.kers
Total runtime 154 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality11348962539482277241.prop.
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 4984/5211 variables, 39/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5211 variables, 4/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5211 variables, 0/43 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 26/5237 variables, 26/69 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5237 variables, 0/69 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 381/5618 variables, 100/169 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5618 variables, 0/169 constraints. Problems are: Problem set: 6 solved, 3 unsolved
SMT process timed out in 5699ms, After SMT, problems are : Problem set: 6 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 112 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 1766 are kept as prefixes of interest. Removing 3856 places using SCC suffix rule.24 ms
Discarding 3856 places :
Also discarding 1801 output transitions
Drop transitions (Output transitions of discarded places.) removed 1801 transitions
Drop transitions (Empty/Sink Transition effects.) removed 961 transitions
Reduce isomorphic transitions removed 961 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 1509 rules applied. Total rules applied 1510 place count 1766 transition count 2139
Reduce places removed 550 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 590 rules applied. Total rules applied 2100 place count 1216 transition count 2099
Reduce places removed 40 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 117 rules applied. Total rules applied 2217 place count 1176 transition count 2022
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 2294 place count 1099 transition count 2022
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 2294 place count 1099 transition count 1973
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 2392 place count 1050 transition count 1973
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2440 place count 1002 transition count 1925
Iterating global reduction 4 with 48 rules applied. Total rules applied 2488 place count 1002 transition count 1925
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 4 with 39 rules applied. Total rules applied 2527 place count 1002 transition count 1886
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 2566 place count 963 transition count 1886
Partial Free-agglomeration rule applied 314 times.
Drop transitions (Partial Free agglomeration) removed 314 transitions
Iterating global reduction 5 with 314 rules applied. Total rules applied 2880 place count 963 transition count 1886
Applied a total of 2880 rules in 967 ms. Remains 963 /5622 variables (removed 4659) and now considering 1886/5449 (removed 3563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 992 ms. Remains : 963/5622 places, 1886/5449 transitions.
RANDOM walk for 40000 steps (4385 resets) in 1859 ms. (21 steps per ms) remains 2/3 properties
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (148 resets) in 679 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (116 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
[2026-05-28 01:43:07] [INFO ] Flow matrix only has 1553 transitions (discarded 333 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1475283010405641876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13244930173739379332.kers'
[2026-05-28 01:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1475283010405641876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13244930173739379332.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 5 ms.
// Phase 1: matrix 1553 rows 962 cols 4097 entries
Finished phase 1 with 898 SingleSign rule and 59 generalized
[2026-05-28 01:43:07] [INFO ] Computed 6 invariants in 13 ms
Computed 6 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13244930173739379332.kers
Total runtime 16 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 725/946 variables, 221/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1357/2303 variables, 529/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2303 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 213/2516 variables, 213/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2516 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2516 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2516/2516 variables, and 969 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1398 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 963/963 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 725/946 variables, 221/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1357/2303 variables, 529/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2303 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 213/2516 variables, 213/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2516 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2516 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2516/2516 variables, and 969 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2708 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 963/963 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4202ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S32C3-ReachabilityCardinality-2024-02 TRUE 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-S32C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 22 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 16217 ms.

BK_STOP 1779932591791

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LeafsetExtension-PT-S32C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S32C3, 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 r162-smll-177961107900510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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