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.r146-tall-177961074400774.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 HirschbergSinclair-PT-30, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 9.0K Mar 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 7 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 357K Mar 3 18:30 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 HirschbergSinclair-PT-30-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-30-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779755182171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 00:26:23] [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-05-26 00:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:26:23] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-26 00:26:23] [INFO ] Transformed 670 places.
[2026-05-26 00:26:23] [INFO ] Transformed 605 transitions.
[2026-05-26 00:26:23] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2026-05-26 00:26:24] [INFO ] Flatten gal took : 176 ms
RANDOM walk for 40000 steps (64 resets) in 1889 ms. (21 steps per ms) remains 8/16 properties
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-26 00:26:24] [INFO ] Flatten gal took : 70 ms
[2026-05-26 00:26:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12702134971114592749.gal : 58 ms
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
[2026-05-26 00:26:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6586525810044934657.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/ReachabilityCardinality12702134971114592749.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6586525810044934657.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 8/8 properties

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 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality6586525810044934657.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :17 after 58
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :58 after 726
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3806783105901813275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9886414043560714156.kers'
[2026-05-26 00:26:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3806783105901813275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9886414043560714156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 670 cols 1849 entries
Finished phase 1 with 572 SingleSign rule and 33 generalized
[2026-05-26 00:26:24] [INFO ] Computed 65 invariants in 4 ms
Computed 65 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9886414043560714156.kers
Total runtime 5 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 326/433 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 21/454 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :726 after 439541
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-01 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 189/643 variables, 31/65 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 0/65 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-05 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-30-ReachabilityCardinality-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 605/1248 variables, 643/708 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1248 variables, 0/708 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 27/1275 variables, 27/735 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1275 variables, 0/735 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1275/1275 variables, and 735 constraints, problems are : Problem set: 5 solved, 3 unsolved in 2076 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/413 variables, 22/22 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 3/25 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 27/440 variables, 9/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 200/640 variables, 31/65 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/66 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 1/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 605/1245 variables, 640/707 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 2/709 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 0/709 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 30/1275 variables, 30/739 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1275 variables, 2/741 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1275/1275 variables, and 748 constraints, problems are : Problem set: 5 solved, 3 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 670/670 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7194ms problems are : Problem set: 5 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 670 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 670/670 places, 605/605 transitions.
Graph (complete) has 1278 edges and 670 vertex of which 645 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 645 transition count 453
Reduce places removed 152 places and 0 transitions.
Graph (complete) has 911 edges and 493 vertex of which 448 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 166 rules applied. Total rules applied 319 place count 448 transition count 440
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 377 place count 435 transition count 395
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 385 place count 427 transition count 387
Iterating global reduction 3 with 8 rules applied. Total rules applied 393 place count 427 transition count 387
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 400 place count 420 transition count 380
Iterating global reduction 3 with 7 rules applied. Total rules applied 407 place count 420 transition count 380
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 424 place count 420 transition count 363
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 441 place count 403 transition count 363
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 459 place count 385 transition count 345
Applied a total of 459 rules in 201 ms. Remains 385 /670 variables (removed 285) and now considering 345/605 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 385/670 places, 345/605 transitions.
RANDOM walk for 40000 steps (108 resets) in 351 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (20 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 598978 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :1 out of 3
Probabilistic random walk after 598978 steps, saw 143336 distinct states, run finished after 3006 ms. (steps per millisecond=199 ) properties seen :1
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439769472053550726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4326078712484105538.kers'
[2026-05-26 00:26:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439769472053550726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4326078712484105538.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 345 rows 385 cols 914 entries
Finished phase 1 with 311 SingleSign rule and 34 generalized
[2026-05-26 00:26:35] [INFO ] Computed 40 invariants in 1 ms
Computed 40 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4326078712484105538.kers
Total runtime 2 ms.
[2026-05-26 00:26:35] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/137 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 222/359 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 340/699 variables, 359/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 24/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 25/724 variables, 22/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/724 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/725 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/725 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/725 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 725/730 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 382/385 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 95/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/137 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 222/359 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 340/699 variables, 359/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 24/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 25/724 variables, 22/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/724 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/724 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/724 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/725 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/725 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/725 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 725/730 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11395 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 382/385 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12809ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 418 ms.
Support contains 39 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 345/345 transitions.
Graph (complete) has 736 edges and 385 vertex of which 371 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 371 transition count 302
Reduce places removed 35 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 567 edges and 336 vertex of which 324 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 85 place count 324 transition count 297
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 98 place count 321 transition count 287
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 98 place count 321 transition count 276
Deduced a syphon composed of 11 places in 11 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 120 place count 310 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 308 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 308 transition count 274
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 306 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 306 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 305 transition count 271
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 150 place count 305 transition count 251
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 170 place count 285 transition count 251
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 173 place count 282 transition count 248
Applied a total of 173 rules in 118 ms. Remains 282 /385 variables (removed 103) and now considering 248/345 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 282/385 places, 248/345 transitions.
RANDOM walk for 40000 steps (152 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (38 resets) in 183 ms. (217 steps per ms) remains 1/2 properties
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (33 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10341843839662926895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12649147964639147821.kers'
[2026-05-26 00:26:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10341843839662926895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12649147964639147821.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 3 ms.
// Phase 1: matrix 248 rows 272 cols 597 entries
Finished phase 1 with 239 SingleSign rule and 9 generalized
[2026-05-26 00:26:49] [INFO ] Computed 34 invariants in 4 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12649147964639147821.kers
Total runtime 5 ms.
[2026-05-26 00:26:49] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/254 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/255 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/269 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 244/513 variables, 269/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 28/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/528 variables, 12/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/530 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/530 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 346 constraints, problems are : Problem set: 0 solved, 1 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/254 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/255 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/269 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 244/513 variables, 269/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 28/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/528 variables, 12/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/528 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/530 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/530 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 347 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 282/282 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1929ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 26 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 248/248 transitions.
Graph (complete) has 501 edges and 282 vertex of which 280 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 280 transition count 242
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 276 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 275 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 275 transition count 239
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 17 place count 273 transition count 239
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 272 transition count 238
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 272 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 271 transition count 237
Applied a total of 20 rules in 54 ms. Remains 271 /282 variables (removed 11) and now considering 237/248 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 271/282 places, 237/248 transitions.
RANDOM walk for 40000 steps (160 resets) in 247 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (34 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1213848 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1213848 steps, saw 236353 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) 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-3281278672504871720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9358688746998311102.kers'
[2026-05-26 00:26:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3281278672504871720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9358688746998311102.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 237 rows 256 cols 557 entries
Finished phase 1 with 226 SingleSign rule and 11 generalized
[2026-05-26 00:26:54] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9358688746998311102.kers
Total runtime 5 ms.
[2026-05-26 00:26:54] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/243 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/244 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/261 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 234/495 variables, 261/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 25/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/507 variables, 9/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/508 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/508 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 271/271 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 211/243 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/244 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/261 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 234/495 variables, 261/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/495 variables, 25/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/495 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/507 variables, 9/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/508 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/508 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 271/271 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 26 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 237/237 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 271/271 places, 237/237 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 237/237 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 237/237 (removed 0) transitions.
[2026-05-26 00:26:55] [INFO ] Invariant cache hit.
[2026-05-26 00:26:56] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-26 00:26:56] [INFO ] Invariant cache hit.
[2026-05-26 00:26:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 00:27:01] [INFO ] Implicit Places using invariants and state equation in 4999 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 5184 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 268/271 places, 237/237 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 268 transition count 226
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 24 place count 257 transition count 224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 255 transition count 224
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 26 place count 255 transition count 216
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 247 transition count 216
Applied a total of 42 rules in 37 ms. Remains 247 /268 variables (removed 21) and now considering 216/237 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9932986303523626396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16643609691756019190.kers'
[2026-05-26 00:27:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9932986303523626396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16643609691756019190.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 216 rows 235 cols 515 entries
Finished phase 1 with 211 SingleSign rule and 5 generalized
[2026-05-26 00:27:01] [INFO ] Computed 31 invariants in 1 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16643609691756019190.kers
Total runtime 2 ms.
[2026-05-26 00:27:01] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-26 00:27:01] [INFO ] Invariant cache hit.
[2026-05-26 00:27:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 00:27:04] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned []
Implicit Place search using SMT with State Equation took 3477 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 247/271 places, 216/237 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8718 ms. Remains : 247/271 places, 216/237 transitions.
RANDOM walk for 40000 steps (175 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (39 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1332355 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1332355 steps, saw 255353 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
[2026-05-26 00:27:07] [INFO ] Invariant cache hit.
[2026-05-26 00:27:07] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 195/224 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/237 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/450 variables, 237/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 25/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/462 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 247/247 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 195/224 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/237 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/450 variables, 237/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 25/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/462 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/463 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 247/247 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 26 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 247 /247 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 247/247 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 247 /247 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-26 00:27:08] [INFO ] Invariant cache hit.
[2026-05-26 00:27:08] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-26 00:27:08] [INFO ] Invariant cache hit.
[2026-05-26 00:27:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-26 00:27:12] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 3451 ms to find 0 implicit places.
[2026-05-26 00:27:12] [INFO ] Redundant transitions in 7 ms returned []
Running 207 sub problems to find dead transitions.
[2026-05-26 00:27:12] [INFO ] Invariant cache hit.
[2026-05-26 00:27:12] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 3/240 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 6/246 variables, 14/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 216/462 variables, 246/277 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 25/302 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 207 unsolved
SMT process timed out in 30048ms, After SMT, problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 30053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33547 ms. Remains : 247/247 places, 216/216 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 309 edges and 247 vertex of which 245 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 235 transition count 143
Reduce places removed 73 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 78 rules applied. Total rules applied 162 place count 162 transition count 138
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 167 place count 157 transition count 138
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 167 place count 157 transition count 105
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 234 place count 123 transition count 105
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 237 place count 121 transition count 104
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 3 rules applied. Total rules applied 240 place count 120 transition count 102
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 242 place count 118 transition count 102
Renaming transitions due to excessive name length > 1024 char.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 248 place count 115 transition count 99
Applied a total of 248 rules in 30 ms. Remains 115 /247 variables (removed 132) and now considering 99/216 (removed 117) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8573192549749297160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4996927129650726160.kers'
[2026-05-26 00:27:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8573192549749297160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4996927129650726160.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 99 rows 114 cols 274 entries
Finished phase 1 with 97 SingleSign rule and 2 generalized
[2026-05-26 00:27:42] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4996927129650726160.kers
Total runtime 2 ms.
[2026-05-26 00:27:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 00:27:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-26 00:27:42] [INFO ] [Nat]Absence check using 1 positive and 15 generalized place invariants in 4 ms returned sat
[2026-05-26 00:27:42] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 00:27:42] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 00:27:42] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-26 00:27:42] [INFO ] Flatten gal took : 13 ms
[2026-05-26 00:27:42] [INFO ] Flatten gal took : 5 ms
[2026-05-26 00:27:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6569687638695433143.gal : 4 ms
[2026-05-26 00:27:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13872534694919313650.prop : 0 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/ReachabilityCardinality6569687638695433143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13872534694919313650.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
Loading property file /tmp/ReachabilityCardinality13872534694919313650.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 84
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :84 after 1848
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1848 after 177408
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.83853e+06 after 4.67518e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.67518e+06 after 1.59002e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.59002e+07 after 2.82424e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.17782e+08,0.038022,5604,2,1499,14,6295,7,0,564,4407,0
Total reachable state count : 217782204

Verifying 1 reachability properties.
Invariant property HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03,12,0.039775,5648,2,116,14,6295,7,0,577,4407,0
Over-approximation ignoring read arcs solved 0 properties in 329 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 00:27:42] [INFO ] Flatten gal took : 32 ms
[2026-05-26 00:27:42] [INFO ] Applying decomposition
[2026-05-26 00:27:42] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9561960704098372645.txt' '-o' '/tmp/graph9561960704098372645.bin' '-w' '/tmp/graph9561960704098372645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9561960704098372645.bin' '-l' '-1' '-v' '-w' '/tmp/graph9561960704098372645.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:27:42] [INFO ] Decomposing Gal with order
[2026-05-26 00:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:27:43] [INFO ] Removed a total of 95 redundant transitions.
[2026-05-26 00:27:43] [INFO ] Flatten gal took : 115 ms
[2026-05-26 00:27:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 20 ms.
[2026-05-26 00:27:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16112452791098551343.gal : 11 ms
[2026-05-26 00:27:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality321974951992647127.prop : 0 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/ReachabilityCardinality16112452791098551343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality321974951992647127.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 ...328
Loading property file /tmp/ReachabilityCardinality321974951992647127.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 58
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :58 after 726
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :726 after 439541
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :439541 after 5.15497e+11
Detected timeout of ITS tools.
[2026-05-26 00:57:43] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7065650698231714473
[2026-05-26 00:57:43] [INFO ] Applying decomposition
[2026-05-26 00:57:43] [INFO ] Flatten gal took : 9 ms
[2026-05-26 00:57:43] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2026-05-26 00:57:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:57:43] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2026-05-26 00:57:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10071919858848920719.txt' '-o' '/tmp/graph10071919858848920719.bin' '-w' '/tmp/graph10071919858848920719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10071919858848920719.bin' '-l' '-1' '-v' '-w' '/tmp/graph10071919858848920719.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:57:43] [INFO ] Decomposing Gal with order
[2026-05-26 00:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:57:43] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2026-05-26 00:57:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:57:43] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7065650698231714473
Running compilation step : cd /tmp/ltsmin7065650698231714473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 00:57:43] [INFO ] Removed a total of 91 redundant transitions.
[2026-05-26 00:57:43] [INFO ] Flatten gal took : 55 ms
[2026-05-26 00:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 22 ms.
[2026-05-26 00:57:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11398410893664631271.gal : 24 ms
[2026-05-26 00:57:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11652965570344799126.prop : 0 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/ReachabilityCardinality11398410893664631271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11652965570344799126.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 ...330
Loading property file /tmp/ReachabilityCardinality11652965570344799126.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 1568
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1568 after 7392
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7392 after 4.99699e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.99398e+06 after 2.19899e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.19899e+08 after 4.25756e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.25756e+08 after 1.13838e+09
Compilation finished in 949 ms.
Running link step : cd /tmp/ltsmin7065650698231714473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7065650698231714473;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'HirschbergSinclairPT30ReachabilityCardinality202403==true'
Invariant property HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03 does not hold.
FORMULA HirschbergSinclair-PT-30-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,2.83911e+09,1123.47,8840,2,3624,16,20633,6,0,1181,11000,0
Total reachable state count : 2839109976

Verifying 1 reachability properties.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="HirschbergSinclair-PT-30"
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 HirschbergSinclair-PT-30, 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 r146-tall-177961074400774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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