Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 6 09:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 6 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 6 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 6 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:02 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 57M 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-1105-ReachabilityCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749369292042

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-1105
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 07:54:53] [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:54:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 07:54:55] [INFO ] Load time of PNML (sax parser for PT used): 2153 ms
[2025-06-08 07:54:55] [INFO ] Transformed 287 places.
[2025-06-08 07:54:55] [INFO ] Transformed 46948 transitions.
[2025-06-08 07:54:55] [INFO ] Found NUPN structural information;
[2025-06-08 07:54:56] [INFO ] Parsed PT model containing 287 places and 46948 transitions and 1182750 arcs in 2736 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 21607 ms. (1 steps per ms) remains 4/14 properties
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2002 ms. (19 steps per ms) remains 3/4 properties
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 8822 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 11192 ms. (3 steps per ms) remains 3/3 properties
// Phase 1: matrix 46948 rows 287 cols
[2025-06-08 07:55:10] [INFO ] Flatten gal took : 11354 ms
[2025-06-08 07:55:10] [INFO ] Computed 28 invariants in 1591 ms
Excessive predecessor constraint size, skipping predecessor.
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/55 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 108/163 variables, 17/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 108/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 124/287 variables, 11/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 124/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7450ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 46948/46948 transitions.
Graph (trivial) has 143 edges and 287 vertex of which 2 / 287 are part of one of the 1 SCC in 25 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 286 transition count 46898
[2025-06-08 07:55:17] [INFO ] Flatten gal took : 7170 ms
Reduce places removed 48 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 61 rules applied. Total rules applied 110 place count 238 transition count 46885
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 123 place count 225 transition count 46885
[2025-06-08 07:55:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15587481417876241546.gal : 1093 ms
[2025-06-08 07:55:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17571116238844811584.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/ReachabilityCardinality15587481417876241546.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17571116238844811584.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 ...330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 123 place count 225 transition count 46877
Deduced a syphon composed of 8 places in 63 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 139 place count 217 transition count 46877
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 165 place count 191 transition count 46851
Iterating global reduction 3 with 26 rules applied. Total rules applied 191 place count 191 transition count 46851
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 196 place count 186 transition count 32163
Ensure Unique test removed 3 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 204 place count 183 transition count 32163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 179 transition count 4515
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 179 transition count 4515
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 178 transition count 4513
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 178 transition count 4513
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 278 place count 146 transition count 4481
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 145 transition count 2744
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 145 transition count 2744
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 281 place count 145 transition count 2743
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 144 transition count 2743
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 144 transition count 2741
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 298 place count 144 transition count 2728
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 311 place count 131 transition count 2728
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 312 place count 131 transition count 4454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 313 place count 130 transition count 4454
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 315 place count 130 transition count 4454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 316 place count 129 transition count 4453
Applied a total of 316 rules in 14681 ms. Remains 129 /287 variables (removed 158) and now considering 4453/46948 (removed 42495) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14716 ms. Remains : 129/287 places, 4453/46948 transitions.
RANDOM walk for 40000 steps (8 resets) in 3457 ms. (11 steps per ms) remains 2/3 properties
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
[2025-06-08 07:55:31] [INFO ] Flow matrix only has 4444 transitions (discarded 9 similar events)
// Phase 1: matrix 4444 rows 129 cols
[2025-06-08 07:55:32] [INFO ] Computed 25 invariants in 46 ms
[2025-06-08 07:55:32] [INFO ] State equation strengthened by 3470 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/80 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/129 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4444/4573 variables, 129/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4573 variables, 3470/3624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4573 variables, 0/3624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4573 variables, 0/3624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4573/4573 variables, and 3624 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 129/129 constraints, ReadFeed: 3470/3470 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
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/80 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:34] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-05 is UNSAT
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 49/129 variables, 11/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:35] [INFO ] Deduced a trap composed of 10 places in 936 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:36] [INFO ] Deduced a trap composed of 10 places in 758 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:37] [INFO ] Deduced a trap composed of 13 places in 979 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:37] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:38] [INFO ] Deduced a trap composed of 11 places in 709 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:39] [INFO ] Deduced a trap composed of 12 places in 666 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 6/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4444/4573 variables, 129/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4573 variables, 3470/3631 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:42] [INFO ] Deduced a trap composed of 9 places in 981 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:42] [INFO ] Deduced a trap composed of 9 places in 865 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/4573 variables, 2/3633 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:43] [INFO ] Deduced a trap along path composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 07:55:43] [INFO ] Deduced a trap along path composed of 2 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4573 variables, 2/3635 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4573 variables, 0/3635 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4573 variables, 0/3635 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4573/4573 variables, and 3635 constraints, problems are : Problem set: 1 solved, 1 unsolved in 9969 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 129/129 constraints, ReadFeed: 3470/3470 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 12429ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1176 steps, including 47 resets, run visited all 1 properties in 30 ms. (steps per millisecond=39 )
FORMULA ErlangenMainframeV0-PT-1105-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 36 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 51433 ms.

BK_STOP 1749369344748

--------------------
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-1105"
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-1105, 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-174931339700358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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