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

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600270.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-0404, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 09:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:55 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 163K 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-0404-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749352028185

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-0404
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 03:07:09] [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 03:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:07:09] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-08 03:07:09] [INFO ] Transformed 183 places.
[2025-06-08 03:07:09] [INFO ] Transformed 445 transitions.
[2025-06-08 03:07:09] [INFO ] Found NUPN structural information;
[2025-06-08 03:07:09] [INFO ] Parsed PT model containing 183 places and 445 transitions and 3331 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2258 ms. (17 steps per ms) remains 4/15 properties
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 03:07:10] [INFO ] Flatten gal took : 202 ms
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
[2025-06-08 03:07:10] [INFO ] Flatten gal took : 158 ms
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-08 03:07:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12674530610872630764.gal : 97 ms
[2025-06-08 03:07:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3236830211339127443.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/ReachabilityCardinality12674530610872630764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3236830211339127443.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
Loading property file /tmp/ReachabilityCardinality3236830211339127443.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 3/3 properties
// Phase 1: matrix 445 rows 183 cols
[2025-06-08 03:07:10] [INFO ] Computed 14 invariants in 25 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 67
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :67 after 1666
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1666 after 13515
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :13515 after 13599
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :13599 after 13722
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :13722 after 27844
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :27844 after 74077
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 138/173 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :74077 after 767451
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 138/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/183 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 10/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 445/628 variables, 183/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 518 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-11 is UNSAT
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 138/173 variables, 10/45 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :767451 after 3.02385e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 138/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:11] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/183 variables, 4/188 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 10/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:11] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:11] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 2/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 445/628 variables, 183/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 2/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:12] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:07:12] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 2/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/628 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 387 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1324 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1953ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 107 ms.
Support contains 4 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 445/445 transitions.
Graph (trivial) has 148 edges and 183 vertex of which 6 / 183 are part of one of the 3 SCC in 2 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 180 transition count 380
Reduce places removed 59 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 121 place count 121 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 119 transition count 378
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 123 place count 119 transition count 374
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 115 transition count 374
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 158 place count 88 transition count 347
Iterating global reduction 3 with 27 rules applied. Total rules applied 185 place count 88 transition count 347
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 185 place count 88 transition count 343
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 84 transition count 343
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 199 place count 78 transition count 266
Ensure Unique test removed 2 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 76 transition count 266
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 213 place count 70 transition count 112
Iterating global reduction 3 with 6 rules applied. Total rules applied 219 place count 70 transition count 112
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 222 place count 67 transition count 106
Iterating global reduction 3 with 3 rules applied. Total rules applied 225 place count 67 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 269 place count 45 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 271 place count 43 transition count 64
Iterating global reduction 3 with 2 rules applied. Total rules applied 273 place count 43 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 275 place count 43 transition count 62
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 285 place count 38 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 286 place count 38 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 295 place count 38 transition count 72
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 304 place count 38 transition count 63
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 323 place count 29 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 326 place count 29 transition count 50
Graph (complete) has 138 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 327 place count 27 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 332 place count 27 transition count 45
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 333 place count 26 transition count 45
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 335 place count 26 transition count 43
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 345 place count 24 transition count 35
Applied a total of 345 rules in 111 ms. Remains 24 /183 variables (removed 159) and now considering 35/445 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 24/183 places, 35/445 transitions.
RANDOM walk for 209 steps (0 resets) in 9 ms. (20 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV0-PT-0404-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 3625 ms.

BK_STOP 1749352033081

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-0404"
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-0404, 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-174931339600270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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