fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r338-smll-178021499200254
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for ErlangenMainframeV2-PT-bP06C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
979.888 39052.00 112964.00 120.50 FFFFFFTTFTFFTFTT normal

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.r338-smll-178021499200254.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 ErlangenMainframeV2-PT-bP06C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.2K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 7.5K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.9M May 26 18:17 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 ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780384867042

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP06C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-02 07:21:08] [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-06-02 07:21:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 07:21:09] [INFO ] Load time of PNML (sax parser for PT used): 435 ms
[2026-06-02 07:21:09] [INFO ] Transformed 279 places.
[2026-06-02 07:21:09] [INFO ] Transformed 2491 transitions.
[2026-06-02 07:21:09] [INFO ] Found NUPN structural information;
[2026-06-02 07:21:09] [INFO ] Parsed PT model containing 279 places and 2491 transitions and 38716 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2026-06-02 07:21:12] [INFO ] Flatten gal took : 1491 ms
RANDOM walk for 40000 steps (8 resets) in 9420 ms. (4 steps per ms) remains 11/16 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 07:21:12] [INFO ] Flatten gal took : 538 ms
[2026-06-02 07:21:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3407067055961405348.gal : 296 ms
BEST_FIRST walk for 40000 steps (8 resets) in 2427 ms. (16 steps per ms) remains 11/11 properties
[2026-06-02 07:21:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12953146575185974501.prop : 2 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/ReachabilityCardinality3407067055961405348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12953146575185974501.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (8 resets) in 1280 ms. (31 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 684 ms. (58 steps per ms) remains 10/11 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 1944 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1123 ms. (35 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality12953146575185974501.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 1303 ms. (30 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1073 ms. (37 steps per ms) remains 9/10 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1182 ms. (33 steps per ms) remains 8/9 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 1164 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1543 ms. (25 steps per ms) remains 8/8 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :6 after 11
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8983191698465166352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1476223611278150242.kers'
[2026-06-02 07:21:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8983191698465166352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1476223611278150242.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 2491 rows 279 cols 38716 entries
Finished phase 1 with 256 SingleSign rule and 3 generalized
[2026-06-02 07:21:16] [INFO ] Computed 20 invariants in 26 ms
Computed 20 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-1476223611278150242.kers
Total runtime 33 ms.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :11 after 1437
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1437 after 1524
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1524 after 1696
Excessive predecessor constraint size, skipping predecessor.
Invariant property ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-00 does not hold.
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1696 after 22086
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :22086 after 23264
At refinement iteration 2 (OVERLAPS) 128/204 variables, 13/89 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 128/217 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 75/279 variables, 7/224 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 75/299 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :23264 after 109017
At refinement iteration 8 (OVERLAPS) 2491/2770 variables, 279/578 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Reachability property ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-12 is true.
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :109017 after 1.01148e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/2770 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/2770 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2770/2770 variables, and 578 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2679 ms.
Refiners :[Domain max(s): 279/279 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 279/279 constraints, PredecessorRefiner: 8/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 128/202 variables, 13/87 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 128/215 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/216 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Invariant property ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-04 does not hold.
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.01148e+07 after 6.64179e+07
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 77/279 variables, 7/223 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 77/300 constraints. Problems are: Problem set: 3 solved, 5 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :6.64179e+07 after 7.08738e+07
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :7.08738e+07 after 2.59301e+08
SMT process timed out in 9383ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 69 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 2491/2491 transitions.
Graph (trivial) has 139 edges and 279 vertex of which 7 / 279 are part of one of the 3 SCC in 9 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 275 transition count 2435
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 104 place count 226 transition count 2430
Reduce places removed 2 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 16 rules applied. Total rules applied 120 place count 224 transition count 2416
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 135 place count 210 transition count 2415
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 135 place count 210 transition count 2404
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 199 transition count 2404
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 178 place count 178 transition count 2383
Iterating global reduction 4 with 21 rules applied. Total rules applied 199 place count 178 transition count 2383
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 203 place count 174 transition count 1963
Iterating global reduction 4 with 4 rules applied. Total rules applied 207 place count 174 transition count 1963
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 245 place count 155 transition count 1944
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 251 place count 155 transition count 1938
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 267 place count 155 transition count 1922
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 283 place count 139 transition count 1922
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 284 place count 139 transition count 1921
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 139 transition count 1921
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 288 place count 139 transition count 1921
Applied a total of 288 rules in 2209 ms. Remains 139 /279 variables (removed 140) and now considering 1921/2491 (removed 570) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2220 ms. Remains : 139/279 places, 1921/2491 transitions.
RANDOM walk for 40000 steps (8 resets) in 6099 ms. (6 steps per ms) remains 3/5 properties
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 384 ms. (103 steps per ms) remains 3/3 properties
[2026-06-02 07:21:30] [INFO ] Flow matrix only has 1919 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11643715075083867167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11435876112641322805.kers'
[2026-06-02 07:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11643715075083867167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11435876112641322805.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 1919 rows 139 cols 31794 entries
Finished phase 1 with 116 SingleSign rule and 3 generalized
[2026-06-02 07:21:30] [INFO ] Computed 20 invariants in 20 ms
Computed 20 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-11435876112641322805.kers
Total runtime 26 ms.
[2026-06-02 07:21:30] [INFO ] State equation strengthened by 17 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/113 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/139 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1919/2058 variables, 139/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2058 variables, 17/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2058 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2058 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2058/2058 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/113 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/139 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1919/2058 variables, 139/164 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2058 variables, 17/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2058 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2058 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2058/2058 variables, and 181 constraints, problems are : Problem set: 1 solved, 2 unsolved in 7812 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9069ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 375 ms.
Support contains 27 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 1921/1921 transitions.
Graph (trivial) has 57 edges and 139 vertex of which 6 / 139 are part of one of the 3 SCC in 1 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 136 transition count 1897
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 118 transition count 1896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 117 transition count 1896
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 117 transition count 1893
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 46 place count 113 transition count 1893
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 109 transition count 1728
Ensure Unique test removed 1 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 108 transition count 1728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 106 transition count 1670
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 106 transition count 1670
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 91 place count 90 transition count 1654
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 90 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 89 transition count 1598
Ensure Unique test removed 1 places
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 88 transition count 1598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 86 transition count 1611
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 86 transition count 1609
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 106 place count 86 transition count 1605
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 110 place count 82 transition count 1605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 81 transition count 1604
Applied a total of 111 rules in 401 ms. Remains 81 /139 variables (removed 58) and now considering 1604/1921 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 81/139 places, 1604/1921 transitions.
RANDOM walk for 40000 steps (8 resets) in 1471 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 292210 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 292210 steps, saw 128572 distinct states, run finished after 3012 ms. (steps per millisecond=97 ) properties seen :0
[2026-06-02 07:21:43] [INFO ] Flow matrix only has 1602 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6669842306693523142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2236782809793025719.kers'
[2026-06-02 07:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6669842306693523142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2236782809793025719.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1602 rows 81 cols 22841 entries
Finished phase 1 with 61 SingleSign rule and 3 generalized
[2026-06-02 07:21:43] [INFO ] Computed 17 invariants in 13 ms
Computed 17 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-2236782809793025719.kers
Total runtime 17 ms.
[2026-06-02 07:21:43] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/81 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1602/1683 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1683 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1683 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 29/29 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
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/81 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1602/1683 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1683 variables, 29/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1683 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1683 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1683 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1706 steps, including 90 resets, run visited all 1 properties in 32 ms. (steps per millisecond=53 )
FORMULA ErlangenMainframeV2-PT-bP06C06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 39 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 37171 ms.

BK_STOP 1780384906094

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ErlangenMainframeV2-PT-bP06C06"
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 ErlangenMainframeV2-PT-bP06C06, 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 r338-smll-178021499200254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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