fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r254-tall-174931339700350
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ErlangenMainframeV0-PT-1104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 33600.00 0.00 0.00 FFTFFFFTTFFFFFFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339700350.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ErlangenMainframeV0-PT-1104, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339700350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 6 09:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 12:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 12:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Jun 6 09:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 38M Jun 5 20:08 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 ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749367034629

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1104
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 07:17:15] [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]
[2025-06-08 07:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 07:17:17] [INFO ] Load time of PNML (sax parser for PT used): 1554 ms
[2025-06-08 07:17:17] [INFO ] Transformed 281 places.
[2025-06-08 07:17:17] [INFO ] Transformed 31390 transitions.
[2025-06-08 07:17:17] [INFO ] Found NUPN structural information;
[2025-06-08 07:17:17] [INFO ] Parsed PT model containing 281 places and 31390 transitions and 788748 arcs in 1967 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 14803 ms. (2 steps per ms) remains 5/14 properties
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 3084 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5405 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 896 ms. (44 steps per ms) remains 4/5 properties
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1976 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1137 ms. (35 steps per ms) remains 4/4 properties
// Phase 1: matrix 31390 rows 281 cols
[2025-06-08 07:17:26] [INFO ] Flatten gal took : 6903 ms
[2025-06-08 07:17:26] [INFO ] Computed 28 invariants in 691 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-01 is UNSAT
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-10 is UNSAT
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 196/266 variables, 17/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 196/283 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-11 is UNSAT
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 15/281 variables, 11/294 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 15/309 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/309 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2025-06-08 07:17:31] [INFO ] Flatten gal took : 4624 ms
[2025-06-08 07:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14721469741114890574.gal : 767 ms
[2025-06-08 07:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7490024431262952068.prop : 1 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14721469741114890574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7490024431262952068.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
SMT process timed out in 6228ms, After SMT, problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 31390/31390 transitions.
Graph (trivial) has 170 edges and 281 vertex of which 6 / 281 are part of one of the 3 SCC in 10 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 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 60 place count 278 transition count 31325
Reduce places removed 59 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 128 place count 219 transition count 31316
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 137 place count 210 transition count 31316
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 137 place count 210 transition count 31306
Deduced a syphon composed of 10 places in 33 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 157 place count 200 transition count 31306
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 192 place count 165 transition count 31271
Iterating global reduction 3 with 35 rules applied. Total rules applied 227 place count 165 transition count 31271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 227 place count 165 transition count 31269
Deduced a syphon composed of 2 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 231 place count 163 transition count 31269
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 238 place count 156 transition count 21093
Ensure Unique test removed 4 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 152 transition count 21093
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 147 transition count 1221
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 147 transition count 1221
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 331 place count 111 transition count 1185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 110 transition count 1192
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 110 transition count 1191
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 335 place count 110 transition count 1190
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 346 place count 110 transition count 1179
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 360 place count 99 transition count 1176
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 361 place count 99 transition count 1175
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 362 place count 99 transition count 1174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 363 place count 98 transition count 1174
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 365 place count 98 transition count 3762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 367 place count 96 transition count 3762
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 96 transition count 3762
Applied a total of 368 rules in 6255 ms. Remains 96 /281 variables (removed 185) and now considering 3762/31390 (removed 27628) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6264 ms. Remains : 96/281 places, 3762/31390 transitions.
RANDOM walk for 40000 steps (8 resets) in 2267 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 225860 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 1
Probabilistic random walk after 225860 steps, saw 96583 distinct states, run finished after 3007 ms. (steps per millisecond=75 ) properties seen :0
[2025-06-08 07:17:42] [INFO ] Flow matrix only has 3756 transitions (discarded 6 similar events)
// Phase 1: matrix 3756 rows 96 cols
[2025-06-08 07:17:42] [INFO ] Computed 24 invariants in 33 ms
[2025-06-08 07:17:42] [INFO ] State equation strengthened by 1768 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/83 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/96 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3756/3852 variables, 96/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3852 variables, 1768/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3852 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3852 variables, 0/1888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3852/3852 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1768/1768 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/83 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:17:44] [INFO ] Deduced a trap composed of 15 places in 1132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:17:45] [INFO ] Deduced a trap composed of 16 places in 751 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:17:46] [INFO ] Deduced a trap composed of 17 places in 710 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/96 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3756/3852 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3852 variables, 1768/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3852 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3852 variables, 0/1891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3852/3852 variables, and 1891 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4301 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1768/1768 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5683ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 54 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
FORMULA ErlangenMainframeV0-PT-1104-ReachabilityCardinality-2025-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 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 32233 ms.

BK_STOP 1749367068229

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ErlangenMainframeV0-PT-1104"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-1104, 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 r254-tall-174931339700350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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