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

About the Execution of ITS-Tools for EisenbergMcGuire-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16180.407 3600000.00 5492544.00 19020.50 TFTFTFFFT?FTTFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740500286.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 EisenbergMcGuire-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 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 2.3M 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 EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779807062019

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-26 14:51:04] [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 14:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 14:51:05] [INFO ] Load time of PNML (sax parser for PT used): 631 ms
[2026-05-26 14:51:05] [INFO ] Transformed 891 places.
[2026-05-26 14:51:05] [INFO ] Transformed 3888 transitions.
[2026-05-26 14:51:05] [INFO ] Found NUPN structural information;
[2026-05-26 14:51:05] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 928 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3020 ms. (13 steps per ms) remains 5/15 properties
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 823 ms. (48 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 903 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
[2026-05-26 14:51:07] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2026-05-26 14:51:07] [INFO ] Flatten gal took : 836 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3369879265459974270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2920010630720622198.kers'
[2026-05-26 14:51:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3369879265459974270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2920010630720622198.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1809 rows 891 cols 3978 entries
Finished phase 1 with 854 SingleSign rule and 9 generalized
[2026-05-26 14:51:07] [INFO ] Computed 28 invariants in 8 ms
Computed 28 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-2920010630720622198.kers
Total runtime 15 ms.
[2026-05-26 14:51:07] [INFO ] State equation strengthened by 932 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2026-05-26 14:51:08] [INFO ] Flatten gal took : 362 ms
All remaining problems are real, not stopping.
[2026-05-26 14:51:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8407430674903111806.gal : 200 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2026-05-26 14:51:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality717234265530028371.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/ReachabilityCardinality8407430674903111806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality717234265530028371.prop' '--nowitness' '--gen-order' 'FOLLOW'
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved

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 ...327
At refinement iteration 2 (OVERLAPS) 457/511 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 457/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 74/585 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 74/603 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 297/882 variables, 9/612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/882 variables, 297/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Loading property file /tmp/ReachabilityCardinality717234265530028371.prop.
At refinement iteration 10 (INCLUDED_ONLY) 0/882 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1809/2691 variables, 882/1791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2691 variables, 932/2723 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2691 variables, 0/2723 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/2700 variables, 9/2732 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2700 variables, 9/2741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2700 variables, 1/2742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2700 variables, 0/2742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :14 after 67
At refinement iteration 18 (OVERLAPS) 0/2700 variables, 0/2742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :67 after 89
Error getting values : (error "Timeout of Z3 solver reached")
No progress, stopping.
After SMT solving in domain Real declared 2700/2700 variables, and 2742 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5123 ms.
Refiners :[Domain max(s): 891/891 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 891/891 constraints, ReadFeed: 932/932 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :89 after 213
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 457/511 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 457/521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :213 after 454
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 74/585 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 74/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :454 after 2524
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2524 after 7767
SMT process timed out in 10741ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 54 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 891 transition count 3882
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 885 transition count 3882
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 12 place count 885 transition count 3660
Deduced a syphon composed of 222 places in 13 ms
Reduce places removed 222 places and 0 transitions.
Iterating global reduction 2 with 444 rules applied. Total rules applied 456 place count 663 transition count 3660
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 522 place count 597 transition count 3066
Iterating global reduction 2 with 66 rules applied. Total rules applied 588 place count 597 transition count 3066
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 10 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 716 place count 533 transition count 3002
Applied a total of 716 rules in 781 ms. Remains 533 /891 variables (removed 358) and now considering 3002/3888 (removed 886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 794 ms. Remains : 533/891 places, 3002/3888 transitions.
RANDOM walk for 40000 steps (8 resets) in 1200 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 167050 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :3 out of 5
Probabilistic random walk after 167050 steps, saw 118174 distinct states, run finished after 3009 ms. (steps per millisecond=55 ) properties seen :3
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-26 14:51:22] [INFO ] Flow matrix only has 923 transitions (discarded 2079 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14260575192884306839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16405366136211054071.kers'
[2026-05-26 14:51:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14260575192884306839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16405366136211054071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 923 rows 533 cols 2206 entries
Finished phase 1 with 496 SingleSign rule and 9 generalized
[2026-05-26 14:51:22] [INFO ] Computed 28 invariants in 4 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16405366136211054071.kers
Total runtime 6 ms.
[2026-05-26 14:51:23] [INFO ] State equation strengthened by 404 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 293/317 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/331 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/413 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 726/1139 variables, 413/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 140/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1139 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/1180 variables, 9/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 115/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 48/1228 variables, 22/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1228 variables, 20/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 62/1290 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1290 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/1294 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1294 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 23/1317 variables, 2/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1317 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 139/1456 variables, 89/836 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1456 variables, 129/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1456 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1456 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1456/1456 variables, and 965 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 533/533 constraints, ReadFeed: 404/404 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 293/317 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/331 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :7767 after 47980
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/413 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 726/1139 variables, 413/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1139 variables, 140/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1139 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 41/1180 variables, 9/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 115/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1180 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/1228 variables, 22/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1228 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1228 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 62/1290 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1290 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/1294 variables, 2/750 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1294 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1294 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1294 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1294 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 23/1317 variables, 2/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1317 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 139/1456 variables, 89/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1456 variables, 129/977 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1456 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1456 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1456/1456 variables, and 977 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 533/533 constraints, ReadFeed: 404/404 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8960ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 753 ms.
Support contains 24 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 3002/3002 transitions.
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 0 with 1 rules applied. Total rules applied 1 place count 533 transition count 3001
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 532 transition count 3001
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 2 place count 532 transition count 2977
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 50 place count 508 transition count 2977
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 507 transition count 2968
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 507 transition count 2968
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 503 transition count 2964
Applied a total of 60 rules in 375 ms. Remains 503 /533 variables (removed 30) and now considering 2964/3002 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 503/533 places, 2964/3002 transitions.
RANDOM walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 194340 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 2
Probabilistic random walk after 194340 steps, saw 131440 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2026-05-26 14:51:36] [INFO ] Flow matrix only has 885 transitions (discarded 2079 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17962602644210013943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12157826598499090251.kers'
[2026-05-26 14:51:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17962602644210013943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12157826598499090251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 885 rows 503 cols 2130 entries
Finished phase 1 with 466 SingleSign rule and 9 generalized
[2026-05-26 14:51:36] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12157826598499090251.kers
Total runtime 4 ms.
[2026-05-26 14:51:36] [INFO ] State equation strengthened by 396 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 278/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/316 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 72/388 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 701/1089 variables, 388/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1089 variables, 140/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 41/1130 variables, 9/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1130 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1130 variables, 115/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1130 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 48/1178 variables, 22/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1178 variables, 20/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1178 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 60/1238 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1238 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/1242 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1242 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
At refinement iteration 21 (OVERLAPS) 20/1262 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :47980 after 104152
At refinement iteration 22 (INCLUDED_ONLY) 0/1262 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 126/1388 variables, 84/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1388 variables, 121/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1388 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1388 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1388/1388 variables, and 927 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 503/503 constraints, ReadFeed: 396/396 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/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 278/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/316 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 72/388 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 701/1089 variables, 388/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1089 variables, 140/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1089 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 41/1130 variables, 9/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1130 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1130 variables, 115/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1130 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 48/1178 variables, 22/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1178 variables, 20/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1178 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 60/1238 variables, 2/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1238 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/1242 variables, 2/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1242 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1242 variables, 5/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1242 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 20/1262 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1262 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 126/1388 variables, 84/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1388 variables, 121/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1388 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1388 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1388/1388 variables, and 941 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5965 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 503/503 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7679ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 681 ms.
Support contains 22 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 2964/2964 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 2963
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 2963
Applied a total of 2 rules in 272 ms. Remains 502 /503 variables (removed 1) and now considering 2963/2964 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 502/503 places, 2963/2964 transitions.
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 311450 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 311450 steps, saw 202693 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2026-05-26 14:51:48] [INFO ] Flow matrix only has 884 transitions (discarded 2079 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11334726937712387725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12304408010312601868.kers'
[2026-05-26 14:51:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11334726937712387725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12304408010312601868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 884 rows 502 cols 2128 entries
Finished phase 1 with 465 SingleSign rule and 9 generalized
[2026-05-26 14:51:48] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12304408010312601868.kers
Total runtime 5 ms.
[2026-05-26 14:51:48] [INFO ] State equation strengthened by 396 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/260 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/272 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/345 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/387 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 700/1087 variables, 387/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1087 variables, 140/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1087 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/1128 variables, 9/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1128 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1128 variables, 115/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1128 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 48/1176 variables, 22/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1176 variables, 20/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1176 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 60/1236 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1236 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/1240 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1240 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/1260 variables, 2/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 126/1386 variables, 84/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1386 variables, 121/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1386 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1386 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1386/1386 variables, and 926 constraints, problems are : Problem set: 0 solved, 1 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 502/502 constraints, ReadFeed: 396/396 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 238/260 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/260 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/272 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 73/345 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 42/387 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 700/1087 variables, 387/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 140/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 41/1128 variables, 9/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1128 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1128 variables, 115/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1128 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 48/1176 variables, 22/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1176 variables, 20/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1176 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 60/1236 variables, 2/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1236 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/1240 variables, 2/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1240 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1240 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1240 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1240 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 20/1260 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1260 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 126/1386 variables, 84/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1386 variables, 121/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1386 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/1386 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1386/1386 variables, and 935 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4444 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 502/502 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5424ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 22 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 2963/2963 transitions.
Applied a total of 0 rules in 189 ms. Remains 502 /502 variables (removed 0) and now considering 2963/2963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 502/502 places, 2963/2963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 2963/2963 transitions.
Applied a total of 0 rules in 184 ms. Remains 502 /502 variables (removed 0) and now considering 2963/2963 (removed 0) transitions.
[2026-05-26 14:51:54] [INFO ] Flow matrix only has 884 transitions (discarded 2079 similar events)
[2026-05-26 14:51:54] [INFO ] Invariant cache hit.
[2026-05-26 14:51:55] [INFO ] Implicit Places using invariants in 1617 ms returned []
[2026-05-26 14:51:55] [INFO ] Flow matrix only has 884 transitions (discarded 2079 similar events)
[2026-05-26 14:51:55] [INFO ] Invariant cache hit.
[2026-05-26 14:51:56] [INFO ] State equation strengthened by 396 read => feed constraints.
[2026-05-26 14:52:02] [INFO ] Implicit Places using invariants and state equation in 6918 ms returned []
Implicit Place search using SMT with State Equation took 8556 ms to find 0 implicit places.
[2026-05-26 14:52:02] [INFO ] Redundant transitions in 302 ms returned []
Running 2954 sub problems to find dead transitions.
[2026-05-26 14:52:03] [INFO ] Flow matrix only has 884 transitions (discarded 2079 similar events)
[2026-05-26 14:52:03] [INFO ] Invariant cache hit.
[2026-05-26 14:52:03] [INFO ] State equation strengthened by 396 read => feed constraints.
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :104152 after 223422
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2954 unsolved
SMT process timed out in 31958ms, After SMT, problems are : Problem set: 0 solved, 2954 unsolved
Search for dead transitions found 0 dead transitions in 31984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41084 ms. Remains : 502/502 places, 2963/2963 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2633 edges and 502 vertex of which 79 / 502 are part of one of the 9 SCC in 5 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 2056 transitions
Reduce isomorphic transitions removed 2317 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 432 transition count 552
Reduce places removed 94 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 97 rules applied. Total rules applied 192 place count 338 transition count 549
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 335 transition count 549
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 195 place count 335 transition count 538
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 220 place count 321 transition count 538
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 494 place count 184 transition count 401
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 559 place count 184 transition count 336
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 567 place count 180 transition count 351
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 570 place count 180 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 586 place count 180 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 586 place count 180 transition count 331
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 588 place count 179 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 590 place count 178 transition count 332
Free-agglomeration rule applied 58 times.
Iterating global reduction 5 with 58 rules applied. Total rules applied 648 place count 178 transition count 274
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 706 place count 120 transition count 274
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 715 place count 120 transition count 274
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 716 place count 120 transition count 274
Applied a total of 716 rules in 83 ms. Remains 120 /502 variables (removed 382) and now considering 274/2963 (removed 2689) 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-10958838486350950721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12762481014304796104.kers'
[2026-05-26 14:52:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10958838486350950721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12762481014304796104.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 4 ms.
// Phase 1: matrix 274 rows 117 cols 939 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-26 14:52:35] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12762481014304796104.kers
Total runtime 6 ms.
[2026-05-26 14:52:35] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 14:52:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2026-05-26 14:52:35] [INFO ] [Nat]Absence check using 19 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 14:52:35] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 14:52:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-26 14:52:35] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 14:52:35] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 14:52:35] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-26 14:52:35] [INFO ] Flatten gal took : 29 ms
[2026-05-26 14:52:35] [INFO ] Flatten gal took : 24 ms
[2026-05-26 14:52:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11941728578212561829.gal : 7 ms
[2026-05-26 14:52:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2590402500834313706.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/ReachabilityCardinality11941728578212561829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2590402500834313706.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/ReachabilityCardinality2590402500834313706.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 168
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :168 after 1540
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1540 after 2737
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2737 after 3388
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3388 after 7560
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7560 after 210600
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :210600 after 1.14716e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.14716e+07 after 2.37999e+09
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,5.45875e+09,0.313432,8776,2,1686,15,25446,7,0,788,14903,0
Total reachable state count : 5458752000

Verifying 1 reachability properties.
Invariant property EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-09 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
EisenbergMcGuire-PT-09-ReachabilityCardinality-2024-09,108000,0.326029,8884,2,418,15,25446,7,0,821,14903,0
Over-approximation ignoring read arcs solved 0 properties in 848 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 14:52:36] [INFO ] Flatten gal took : 141 ms
[2026-05-26 14:52:36] [INFO ] Applying decomposition
[2026-05-26 14:52:36] [INFO ] Flatten gal took : 130 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/graph14958706221739175930.txt' '-o' '/tmp/graph14958706221739175930.bin' '-w' '/tmp/graph14958706221739175930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14958706221739175930.bin' '-l' '-1' '-v' '-w' '/tmp/graph14958706221739175930.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:52:37] [INFO ] Decomposing Gal with order
[2026-05-26 14:52:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:52:38] [INFO ] Removed a total of 7890 redundant transitions.
[2026-05-26 14:52:38] [INFO ] Flatten gal took : 842 ms
[2026-05-26 14:52:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 427 labels/synchronizations in 257 ms.
[2026-05-26 14:52:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10629096155869803681.gal : 56 ms
[2026-05-26 14:52:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2351954130512704321.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10629096155869803681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2351954130512704321.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality2351954130512704321.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4 after 30
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :30 after 1068
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1068 after 122838
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :122838 after 362325
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :362325 after 1.15401e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.15401e+07 after 1.27775e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.78613e+09 after 1.79937e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.79937e+09 after 2.12225e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.12225e+09 after 2.20693e+09
Detected timeout of ITS tools.
[2026-05-26 15:22:39] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8230931800026332398
[2026-05-26 15:22:39] [INFO ] Too many transitions (2963) to apply POR reductions. Disabling POR matrices.
[2026-05-26 15:22:39] [INFO ] Applying decomposition
[2026-05-26 15:22:39] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8230931800026332398
Running compilation step : cd /tmp/ltsmin8230931800026332398;'/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 15:22:39] [INFO ] Flatten gal took : 80 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/graph14279486489452660275.txt' '-o' '/tmp/graph14279486489452660275.bin' '-w' '/tmp/graph14279486489452660275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14279486489452660275.bin' '-l' '-1' '-v' '-w' '/tmp/graph14279486489452660275.weights' '-q' '0' '-e' '0.001'
[2026-05-26 15:22:40] [INFO ] Decomposing Gal with order
[2026-05-26 15:22:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 15:22:40] [INFO ] Removed a total of 6416 redundant transitions.
[2026-05-26 15:22:40] [INFO ] Flatten gal took : 310 ms
[2026-05-26 15:22:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 718 labels/synchronizations in 102 ms.
[2026-05-26 15:22:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12185384814523267254.gal : 27 ms
[2026-05-26 15:22:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16318264859630106597.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12185384814523267254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16318264859630106597.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality16318264859630106597.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9062
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9062 after 434959
Compilation finished in 13184 ms.
Running link step : cd /tmp/ltsmin8230931800026332398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8230931800026332398;'/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' 'EisenbergMcGuirePT09ReachabilityCardinality202409==true'
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :434959 after 1.664e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.664e+06 after 5.07118e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.07118e+06 after 7.80823e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.80823e+07 after 1.51731e+08

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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r114-smll-177955740500286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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