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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 101M
-rw-r--r-- 1 mcc users 5.8K May 27 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 27 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 27 09:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 17K May 27 09:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K May 27 09:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 27 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:44 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 100M 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-bP10C08-ReachabilityCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780406174010

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-bP10C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-02 13:16:16] [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 13:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 13:16:21] [INFO ] Load time of PNML (sax parser for PT used): 4966 ms
[2026-06-02 13:16:21] [INFO ] Transformed 345 places.
[2026-06-02 13:16:22] [INFO ] Transformed 79094 transitions.
[2026-06-02 13:16:22] [INFO ] Found NUPN structural information;
[2026-06-02 13:16:22] [INFO ] Parsed PT model containing 345 places and 79094 transitions and 1995500 arcs in 5835 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-02 13:16:46] [INFO ] Flatten gal took : 21285 ms
RANDOM walk for 22343 steps (4 resets) in 120021 ms. (0 steps per ms) remains 4/12 properties
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 20117 steps (4 resets) in 20019 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 24271 steps (4 resets) in 20014 ms. (1 steps per ms) remains 4/4 properties
[2026-06-02 13:17:08] [INFO ] Flatten gal took : 21235 ms
BEST_FIRST walk for 15642 steps (4 resets) in 20008 ms. (0 steps per ms) remains 4/4 properties
[2026-06-02 13:17:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8538657209743644329.gal : 3047 ms
[2026-06-02 13:17:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12408113657979260254.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8538657209743644329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12408113657979260254.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 14513 steps (2 resets) in 20025 ms. (0 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2774510176997556333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14797099178499207693.kers'
[2026-06-02 13:17:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2774510176997556333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14797099178499207693.kers]
Culled 0 columns in 360 ms.
// Phase 1: matrix 79094 rows 345 cols 1995500 entries
Finished phase 1 with 314 SingleSign rule and 3 generalized
[2026-06-02 13:17:16] [INFO ] Computed 28 invariants in 2003 ms
Computed 28 P flows in 2008 ms.
Exported basis to /tmp/petrispot-output-14797099178499207693.kers
Total runtime 2278 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 150/212 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 150/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-02 is UNSAT
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 133/345 variables, 11/240 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 133/373 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SMT process timed out in 8792ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 79094/79094 transitions.
Graph (trivial) has 228 edges and 345 vertex of which 10 / 345 are part of one of the 4 SCC in 37 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 339 transition count 78993
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 96 rules applied. Total rules applied 187 place count 249 transition count 78987
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 202 place count 247 transition count 78974
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 216 place count 234 transition count 78973
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 216 place count 234 transition count 78969
Deduced a syphon composed of 4 places in 159 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 224 place count 230 transition count 78969
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 253 place count 201 transition count 78940
Iterating global reduction 4 with 29 rules applied. Total rules applied 282 place count 201 transition count 78940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 284 place count 201 transition count 78938
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 284 place count 201 transition count 78936
Deduced a syphon composed of 2 places in 153 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 288 place count 199 transition count 78936
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 298 place count 189 transition count 53109
Ensure Unique test removed 3 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 311 place count 186 transition count 53109
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 319 place count 178 transition count 1485
Iterating global reduction 5 with 8 rules applied. Total rules applied 327 place count 178 transition count 1485
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 328 place count 177 transition count 1483
Iterating global reduction 5 with 1 rules applied. Total rules applied 329 place count 177 transition count 1483
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 403 place count 140 transition count 1446
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 409 place count 137 transition count 1446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 410 place count 137 transition count 1445
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 414 place count 137 transition count 1441
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 429 place count 137 transition count 1426
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 444 place count 122 transition count 1426
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 445 place count 122 transition count 1425
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 446 place count 122 transition count 1424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 447 place count 121 transition count 1424
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 450 place count 121 transition count 1424
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 452 place count 121 transition count 1424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 453 place count 120 transition count 1423
Applied a total of 453 rules in 38669 ms. Remains 120 /345 variables (removed 225) and now considering 1423/79094 (removed 77671) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38687 ms. Remains : 120/345 places, 1423/79094 transitions.
RANDOM walk for 40000 steps (8 resets) in 3068 ms. (13 steps per ms) remains 1/3 properties
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1376 ms. (29 steps per ms) remains 1/1 properties
[2026-06-02 13:18:02] [INFO ] Flow matrix only has 1416 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9315300285488175411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5252093345070456479.kers'
[2026-06-02 13:18:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9315300285488175411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5252093345070456479.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 5 ms.
// Phase 1: matrix 1416 rows 118 cols 28034 entries
Finished phase 1 with 92 SingleSign rule and 3 generalized
[2026-06-02 13:18:02] [INFO ] Computed 25 invariants in 17 ms
Computed 25 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5252093345070456479.kers
Total runtime 23 ms.
[2026-06-02 13:18:02] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/86 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/106 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/120 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1416/1536 variables, 120/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1536 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1536 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1536 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1536/1536 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 14/14 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/86 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 20/106 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/120 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1416/1536 variables, 120/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1536 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1536 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1536/1536 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 120/120 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3250ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 13 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 1423/1423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 120 transition count 1412
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 109 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 108 transition count 1411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 108 transition count 1409
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 105 transition count 1409
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 39 place count 95 transition count 1037
Ensure Unique test removed 2 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 93 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 92 transition count 1013
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 92 transition count 1013
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 78 transition count 999
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 75 transition count 959
Ensure Unique test removed 2 places
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 73 transition count 959
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 71 transition count 959
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 71 transition count 957
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 107 place count 71 transition count 945
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 112 place count 71 transition count 940
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 117 place count 66 transition count 940
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 118 place count 66 transition count 939
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 65 transition count 938
Applied a total of 119 rules in 265 ms. Remains 65 /120 variables (removed 55) and now considering 938/1423 (removed 485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 65/120 places, 938/1423 transitions.
RANDOM walk for 40000 steps (8 resets) in 2015 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332050 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332050 steps, saw 58469 distinct states, run finished after 3008 ms. (steps per millisecond=110 ) properties seen :0
[2026-06-02 13:18:09] [INFO ] Flow matrix only has 932 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16315796989049387220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5078081591629938289.kers'
[2026-06-02 13:18:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16315796989049387220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5078081591629938289.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 2 ms.
// Phase 1: matrix 932 rows 61 cols 13264 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:18:09] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5078081591629938289.kers
Total runtime 13 ms.
[2026-06-02 13:18:09] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/59 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/65 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 932/997 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/997 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 997/997 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 10/10 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/52 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/59 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/65 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 932/997 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/997 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/997 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 997/997 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 65/65 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 938/938 transitions.
Applied a total of 0 rules in 23 ms. Remains 65 /65 variables (removed 0) and now considering 938/938 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 65/65 places, 938/938 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 938/938 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 938/938 (removed 0) transitions.
[2026-06-02 13:18:10] [INFO ] Flow matrix only has 932 transitions (discarded 6 similar events)
[2026-06-02 13:18:10] [INFO ] Invariant cache hit.
[2026-06-02 13:18:12] [INFO ] Implicit Places using invariants in 2216 ms returned [1, 13, 44, 47]
[2026-06-02 13:18:12] [INFO ] Actually due to overlaps returned [1, 44, 47]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 2235 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/65 places, 938/938 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 932
Applied a total of 6 rules in 35 ms. Remains 62 /62 variables (removed 0) and now considering 932/938 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11077874877303818647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11190222660016397562.kers'
[2026-06-02 13:18:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11077874877303818647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11190222660016397562.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 932 rows 61 cols 13264 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:18:12] [INFO ] Computed 17 invariants in 8 ms
Computed 17 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11190222660016397562.kers
Total runtime 11 ms.
[2026-06-02 13:18:14] [INFO ] Implicit Places using invariants in 1357 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1367 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/65 places, 932/938 transitions.
Applied a total of 0 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3679 ms. Remains : 61/65 places, 932/938 transitions.
RANDOM walk for 40000 steps (8 resets) in 1646 ms. (24 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 471927 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 471927 steps, saw 75679 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2555127744263727529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8356375027547509075.kers'
[2026-06-02 13:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2555127744263727529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8356375027547509075.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 932 rows 61 cols 13264 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:18:17] [INFO ] Computed 16 invariants in 13 ms
Computed 16 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8356375027547509075.kers
Total runtime 16 ms.
[2026-06-02 13:18:17] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/51 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/61 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 932/993 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/993 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/993 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/51 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/57 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/61 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 932/993 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/993 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/993 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/993 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 932/932 transitions.
Applied a total of 0 rules in 19 ms. Remains 61 /61 variables (removed 0) and now considering 932/932 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 61/61 places, 932/932 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 932/932 transitions.
Applied a total of 0 rules in 18 ms. Remains 61 /61 variables (removed 0) and now considering 932/932 (removed 0) transitions.
[2026-06-02 13:18:18] [INFO ] Invariant cache hit.
[2026-06-02 13:18:19] [INFO ] Implicit Places using invariants in 519 ms returned []
[2026-06-02 13:18:19] [INFO ] Invariant cache hit.
[2026-06-02 13:18:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-02 13:18:20] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2026-06-02 13:18:20] [INFO ] Redundant transitions in 118 ms returned [31, 931]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 925 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-811912980137377460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7048439753282535987.kers'
[2026-06-02 13:18:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-811912980137377460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7048439753282535987.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 930 rows 61 cols 13254 entries
Finished phase 1 with 43 SingleSign rule and 2 generalized
[2026-06-02 13:18:20] [INFO ] Computed 16 invariants in 14 ms
Computed 16 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-7048439753282535987.kers
Total runtime 17 ms.
[2026-06-02 13:18:20] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/61 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 925 unsolved
At refinement iteration 6 (OVERLAPS) 930/991 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 925 unsolved
SMT process timed out in 33296ms, After SMT, problems are : Problem set: 0 solved, 925 unsolved
Search for dead transitions found 0 dead transitions in 33323ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 930/932 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 928
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 59 transition count 928
Applied a total of 4 rules in 171 ms. Remains 59 /61 variables (removed 2) and now considering 928/930 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3159263696171770136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8188314369769627694.kers'
[2026-06-02 13:18:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3159263696171770136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8188314369769627694.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 928 rows 59 cols 13244 entries
Finished phase 1 with 41 SingleSign rule and 2 generalized
[2026-06-02 13:18:53] [INFO ] Computed 16 invariants in 15 ms
Computed 16 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-8188314369769627694.kers
Total runtime 26 ms.
[2026-06-02 13:18:54] [INFO ] Implicit Places using invariants in 892 ms returned []
[2026-06-02 13:18:54] [INFO ] Invariant cache hit.
[2026-06-02 13:18:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-06-02 13:18:55] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 59/61 places, 928/932 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37100 ms. Remains : 59/61 places, 928/932 transitions.
RANDOM walk for 36115 steps (7 resets) in 1128 ms. (31 steps per ms) remains 0/1 properties
FORMULA ErlangenMainframeV2-PT-bP10C08-ReachabilityCardinality-2024-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 160640 ms.

BK_STOP 1780406338983

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ErlangenMainframeV2-PT-bP10C08"
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-bP10C08, 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-178021499200286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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