Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200342.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 669K 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 ASLink-PT-04b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-04b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779475124292

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 18:38:45] [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-22 18:38:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:38:46] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2026-05-22 18:38:46] [INFO ] Transformed 2034 places.
[2026-05-22 18:38:46] [INFO ] Transformed 2567 transitions.
[2026-05-22 18:38:46] [INFO ] Found NUPN structural information;
[2026-05-22 18:38:46] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (91 resets) in 2060 ms. (19 steps per ms) remains 4/13 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 564 ms. (70 steps per ms) remains 4/4 properties
[2026-05-22 18:38:47] [INFO ] Flatten gal took : 451 ms
BEST_FIRST walk for 40003 steps (14 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 387 ms. (103 steps per ms) remains 4/4 properties
[2026-05-22 18:38:47] [INFO ] Flatten gal took : 230 ms
BEST_FIRST walk for 40001 steps (11 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
[2026-05-22 18:38:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1007808969942235100.gal : 88 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8019240253568203081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15467542528359448445.kers'
[2026-05-22 18:38:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7056990932477530910.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/ReachabilityCardinality1007808969942235100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7056990932477530910.prop' '--nowitness' '--gen-order' 'FOLLOW'

[2026-05-22 18:38:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8019240253568203081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15467542528359448445.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2567 rows 2034 cols 7875 entries
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
Finished phase 1 with 1365 SingleSign rule and 470 generalized
[2026-05-22 18:38:47] [INFO ] Computed 199 invariants in 25 ms
Computed 199 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-15467542528359448445.kers
Total runtime 28 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality7056990932477530910.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 727/831 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/831 variables, 727/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/831 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 103/934 variables, 12/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 103/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1060/1994 variables, 142/1118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1994 variables, 1060/2178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :416 after 569
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :569 after 15361
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :15361 after 618139
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :618139 after 5.45975e+08
SDD proceeding with computation,4 properties remain. new max is 4096
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :5.45975e+08 after 3.89853e+11
At refinement iteration 11 (OVERLAPS) 40/2034 variables, 15/2193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
At refinement iteration 12 (INCLUDED_ONLY) 0/2034 variables, 40/2233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2034/4601 variables, and 2233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5034 ms.
Refiners :[Domain max(s): 2034/2034 constraints, Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 157/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 727/831 variables, 30/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/831 variables, 727/861 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/831 variables, 3/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 103/934 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 103/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.51941e+17 after 5.54986e+23
At refinement iteration 8 (INCLUDED_ONLY) 0/934 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ASLink-PT-04b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-04b-ReachabilityCardinality-2024-13 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1060/1994 variables, 142/1121 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1994 variables, 1060/2181 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5.54986e+23 after 5.70061e+25
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1994/4601 variables, and 2184 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5009 ms.
Refiners :[Domain max(s): 1994/2034 constraints, Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 142/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10300ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 2034 transition count 2139
Reduce places removed 428 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 1 with 450 rules applied. Total rules applied 878 place count 1606 transition count 2117
Reduce places removed 6 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 15 rules applied. Total rules applied 893 place count 1600 transition count 2108
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 902 place count 1591 transition count 2108
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 452 Pre rules applied. Total rules applied 902 place count 1591 transition count 1656
Deduced a syphon composed of 452 places in 5 ms
Ensure Unique test removed 37 places
Reduce places removed 489 places and 0 transitions.
Iterating global reduction 4 with 941 rules applied. Total rules applied 1843 place count 1102 transition count 1656
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 29 rules applied. Total rules applied 1872 place count 1095 transition count 1634
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 25 rules applied. Total rules applied 1897 place count 1073 transition count 1631
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1900 place count 1070 transition count 1631
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 1900 place count 1070 transition count 1617
Deduced a syphon composed of 14 places in 7 ms
Ensure Unique test removed 13 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 41 rules applied. Total rules applied 1941 place count 1043 transition count 1617
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1941 place count 1043 transition count 1605
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1965 place count 1031 transition count 1605
Discarding 59 places :
Symmetric choice reduction at 7 with 59 rule applications. Total rules 2024 place count 972 transition count 1546
Iterating global reduction 7 with 59 rules applied. Total rules applied 2083 place count 972 transition count 1546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2084 place count 972 transition count 1545
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 2084 place count 972 transition count 1527
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 2120 place count 954 transition count 1527
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2124 place count 950 transition count 1500
Iterating global reduction 8 with 4 rules applied. Total rules applied 2128 place count 950 transition count 1500
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2128 place count 950 transition count 1499
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2130 place count 949 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2131 place count 948 transition count 1491
Iterating global reduction 8 with 1 rules applied. Total rules applied 2132 place count 948 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2133 place count 947 transition count 1483
Iterating global reduction 8 with 1 rules applied. Total rules applied 2134 place count 947 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2135 place count 946 transition count 1475
Iterating global reduction 8 with 1 rules applied. Total rules applied 2136 place count 946 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2137 place count 945 transition count 1467
Iterating global reduction 8 with 1 rules applied. Total rules applied 2138 place count 945 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2139 place count 944 transition count 1459
Iterating global reduction 8 with 1 rules applied. Total rules applied 2140 place count 944 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2141 place count 943 transition count 1451
Iterating global reduction 8 with 1 rules applied. Total rules applied 2142 place count 943 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2143 place count 942 transition count 1443
Iterating global reduction 8 with 1 rules applied. Total rules applied 2144 place count 942 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2145 place count 941 transition count 1435
Iterating global reduction 8 with 1 rules applied. Total rules applied 2146 place count 941 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2147 place count 940 transition count 1427
Iterating global reduction 8 with 1 rules applied. Total rules applied 2148 place count 940 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2149 place count 939 transition count 1419
Iterating global reduction 8 with 1 rules applied. Total rules applied 2150 place count 939 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2151 place count 938 transition count 1411
Iterating global reduction 8 with 1 rules applied. Total rules applied 2152 place count 938 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2153 place count 937 transition count 1403
Iterating global reduction 8 with 1 rules applied. Total rules applied 2154 place count 937 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2155 place count 936 transition count 1395
Iterating global reduction 8 with 1 rules applied. Total rules applied 2156 place count 936 transition count 1395
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 8 with 231 rules applied. Total rules applied 2387 place count 820 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2388 place count 819 transition count 1279
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2390 place count 818 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2391 place count 817 transition count 1278
Iterating global reduction 8 with 1 rules applied. Total rules applied 2392 place count 817 transition count 1278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2394 place count 817 transition count 1276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2395 place count 816 transition count 1276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2397 place count 815 transition count 1285
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 2402 place count 815 transition count 1280
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2407 place count 810 transition count 1280
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2414 place count 810 transition count 1273
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2421 place count 803 transition count 1273
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 2423 place count 803 transition count 1273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2424 place count 802 transition count 1272
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 6 rules applied. Total rules applied 2430 place count 798 transition count 1270
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 2432 place count 796 transition count 1270
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 6 Pre rules applied. Total rules applied 2432 place count 796 transition count 1264
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 14 with 12 rules applied. Total rules applied 2444 place count 790 transition count 1264
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 2446 place count 788 transition count 1264
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2454 place count 784 transition count 1260
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2456 place count 782 transition count 1258
Iterating global reduction 15 with 2 rules applied. Total rules applied 2458 place count 782 transition count 1258
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2460 place count 782 transition count 1256
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2462 place count 780 transition count 1256
Applied a total of 2462 rules in 1546 ms. Remains 780 /2034 variables (removed 1254) and now considering 1256/2567 (removed 1311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1559 ms. Remains : 780/2034 places, 1256/2567 transitions.
RANDOM walk for 40000 steps (374 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (74 resets) in 367 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (73 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 288199 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 288199 steps, saw 85992 distinct states, run finished after 3007 ms. (steps per millisecond=95 ) 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-11476064583907240303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8471666332535239220.kers'
[2026-05-22 18:39:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11476064583907240303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8471666332535239220.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 1256 rows 772 cols 4835 entries
Finished phase 1 with 204 SingleSign rule and 442 generalized
[2026-05-22 18:39:02] [INFO ] Computed 134 invariants in 17 ms
Computed 134 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8471666332535239220.kers
Total runtime 19 ms.
[2026-05-22 18:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/309 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/396 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 359/755 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/761 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/762 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 18/780 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :5.70061e+25 after 6.37066e+25
At refinement iteration 13 (OVERLAPS) 1256/2036 variables, 780/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2036 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2036 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2036 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2036/2036 variables, and 915 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 780/780 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/309 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 87/396 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/755 variables, 77/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/761 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/761 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/762 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/780 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/780 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1256/2036 variables, 780/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2036 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2036 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/2036 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2036/2036 variables, and 917 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3009 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 780/780 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4317ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 975 ms.
Support contains 56 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1256/1256 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 780 transition count 1254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 778 transition count 1254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 778 transition count 1253
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 777 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 775 transition count 1251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 774 transition count 1250
Applied a total of 11 rules in 83 ms. Remains 774 /780 variables (removed 6) and now considering 1250/1256 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 774/780 places, 1250/1256 transitions.
RANDOM walk for 40000 steps (378 resets) in 402 ms. (99 steps per ms) remains 1/2 properties
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (79 resets) in 195 ms. (204 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-11899167103146103095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11422964833736293905.kers'
[2026-05-22 18:39:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11899167103146103095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11422964833736293905.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 1250 rows 765 cols 4819 entries
Finished phase 1 with 201 SingleSign rule and 439 generalized
[2026-05-22 18:39:08] [INFO ] Computed 134 invariants in 10 ms
Computed 134 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-11422964833736293905.kers
Total runtime 11 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/249 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/323 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/325 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/685 variables, 69/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/726 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/726 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/728 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/769 variables, 21/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/769 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/770 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/770 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1248/2018 variables, 770/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2018 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/2024 variables, 4/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2024 variables, 2/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2024 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2024 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2024/2024 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 774/774 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/249 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/323 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/325 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 360/685 variables, 69/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/685 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 41/726 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/728 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/728 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/728 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 41/769 variables, 21/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/769 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/770 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/770 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1248/2018 variables, 770/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2018 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/2024 variables, 4/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2024 variables, 2/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2024 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2024 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 912 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2364 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 774/774 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 27 out of 774 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 774/774 places, 1250/1250 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 774 transition count 1243
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 767 transition count 1243
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 767 transition count 1228
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 748 transition count 1228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 748 transition count 1226
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 745 transition count 1226
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 744 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 743 transition count 1225
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 743 transition count 1225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 742 transition count 1224
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 742 transition count 1224
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 74 place count 733 transition count 1217
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 1 rules applied. Total rules applied 75 place count 733 transition count 1216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 732 transition count 1216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 76 place count 732 transition count 1213
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 83 place count 728 transition count 1213
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 85 place count 726 transition count 1213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 85 place count 726 transition count 1212
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 87 place count 725 transition count 1212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 93 place count 722 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 94 place count 721 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 95 place count 721 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 96 place count 720 transition count 1207
Iterating global reduction 6 with 1 rules applied. Total rules applied 97 place count 720 transition count 1207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 720 transition count 1206
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 99 place count 720 transition count 1205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 100 place count 719 transition count 1205
Applied a total of 100 rules in 324 ms. Remains 719 /774 variables (removed 55) and now considering 1205/1250 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 719/774 places, 1205/1250 transitions.
RANDOM walk for 40000 steps (453 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (103 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 492468 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 492468 steps, saw 109111 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) 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-8637609814736001364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14570066456262885059.kers'
[2026-05-22 18:39:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8637609814736001364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14570066456262885059.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 1205 rows 710 cols 4690 entries
Finished phase 1 with 166 SingleSign rule and 430 generalized
[2026-05-22 18:39:15] [INFO ] Computed 123 invariants in 8 ms
Computed 123 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14570066456262885059.kers
Total runtime 12 ms.
[2026-05-22 18:39:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 217/244 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/324 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/326 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 326/652 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/679 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/681 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/681 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/717 variables, 19/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/717 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/719 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/719 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1205/1924 variables, 719/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1924 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1924 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1924 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1924/1924 variables, and 843 constraints, problems are : Problem set: 0 solved, 1 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 719/719 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 217/244 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 80/324 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/326 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 326/652 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/679 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/681 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/681 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/717 variables, 19/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/717 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/719 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/719 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1205/1924 variables, 719/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1924 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1924 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1924 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1924/1924 variables, and 844 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 79/79 constraints, State Equation: 719/719 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1977ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 27 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1205/1205 transitions.
Applied a total of 0 rules in 22 ms. Remains 719 /719 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 719/719 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1205/1205 transitions.
Applied a total of 0 rules in 25 ms. Remains 719 /719 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-22 18:39:17] [INFO ] Invariant cache hit.
[2026-05-22 18:39:18] [INFO ] Implicit Places using invariants in 731 ms returned [1, 18, 19, 51, 70, 89, 140, 145, 154, 155, 158, 177, 196, 265, 271, 282, 284, 286, 303, 321, 402, 420, 421, 422, 424, 441, 459, 512, 533, 537, 538, 541, 554, 557, 578, 585, 603, 604, 605, 606, 620, 626, 633, 639, 645, 651, 657, 665, 671, 677, 683]
[2026-05-22 18:39:18] [INFO ] Actually due to overlaps returned [578, 557, 51, 177, 303, 441, 585, 158, 286, 424, 154, 282, 421, 603, 155, 284, 422, 554, 604, 1, 19, 271, 402, 420, 537, 538, 196, 321, 459, 605, 651, 671, 683, 18, 70, 89, 140, 145, 512, 541, 606, 620, 626, 633, 639, 645, 657, 665, 677]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 746 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 670/719 places, 1205/1205 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 668 transition count 1129
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 592 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 591 transition count 1128
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 156 place count 591 transition count 1107
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 199 place count 569 transition count 1107
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 210 place count 565 transition count 1100
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 218 place count 558 transition count 1099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 557 transition count 1099
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 233 place count 543 transition count 1085
Iterating global reduction 6 with 14 rules applied. Total rules applied 247 place count 543 transition count 1085
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 543 transition count 1083
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 249 place count 543 transition count 1082
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 251 place count 542 transition count 1082
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 256 place count 537 transition count 1075
Iterating global reduction 7 with 5 rules applied. Total rules applied 261 place count 537 transition count 1075
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 331 place count 502 transition count 1040
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 334 place count 499 transition count 1036
Iterating global reduction 7 with 3 rules applied. Total rules applied 337 place count 499 transition count 1036
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 339 place count 499 transition count 1034
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 498 transition count 1035
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 342 place count 498 transition count 1034
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 498 transition count 1033
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 344 place count 497 transition count 1033
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 359 place count 497 transition count 1018
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 375 place count 481 transition count 1018
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 377 place count 481 transition count 1016
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 389 place count 481 transition count 1016
Applied a total of 389 rules in 182 ms. Remains 481 /670 variables (removed 189) and now considering 1016/1205 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11212402716831198291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12274006525572348537.kers'
[2026-05-22 18:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11212402716831198291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12274006525572348537.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1016 rows 480 cols 4081 entries
Finished phase 1 with 147 SingleSign rule and 268 generalized
[2026-05-22 18:39:18] [INFO ] Computed 66 invariants in 10 ms
Computed 66 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12274006525572348537.kers
Total runtime 11 ms.
SDD proceeding with computation,4 properties remain. new max is 131072
[2026-05-22 18:39:18] [INFO ] Implicit Places using invariants in 349 ms returned [99, 105, 108, 110, 174, 191, 197, 200, 202, 209, 210, 284, 290, 293, 295, 299, 307, 308, 309, 362, 465]
[2026-05-22 18:39:18] [INFO ] Actually due to overlaps returned [209, 308, 210, 309, 465, 99, 105, 110, 191, 197, 202, 284, 290, 295, 174, 299, 307, 362]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 351 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 463/719 places, 1016/1205 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 449 transition count 1002
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 449 transition count 1002
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 446 transition count 999
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 446 transition count 999
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 442 transition count 995
SDD size :6.37066e+25 after 7.19464e+25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 442 transition count 994
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 442 transition count 988
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 55 place count 436 transition count 988
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 436 transition count 986
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 434 transition count 986
Applied a total of 59 rules in 94 ms. Remains 434 /463 variables (removed 29) and now considering 986/1016 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5947115919311127793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9599597121757576655.kers'
[2026-05-22 18:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5947115919311127793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9599597121757576655.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 986 rows 433 cols 3941 entries
Finished phase 1 with 120 SingleSign rule and 266 generalized
[2026-05-22 18:39:18] [INFO ] Computed 48 invariants in 6 ms
Computed 48 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9599597121757576655.kers
Total runtime 7 ms.
[2026-05-22 18:39:19] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-22 18:39:19] [INFO ] Invariant cache hit.
[2026-05-22 18:39:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:39:20] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 434/719 places, 986/1205 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2683 ms. Remains : 434/719 places, 986/1205 transitions.
RANDOM walk for 40000 steps (532 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (140 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 615790 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 615790 steps, saw 189836 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2026-05-22 18:39:23] [INFO ] Invariant cache hit.
[2026-05-22 18:39:23] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/223 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/409 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/425 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/434 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 986/1420 variables, 434/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1420 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1420 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1420 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1420/1420 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 434/434 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/219 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/223 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/409 variables, 27/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/425 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/434 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 986/1420 variables, 434/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1420 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1420 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1420 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1420 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1420/1420 variables, and 487 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 434/434 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1445ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 27 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 986/986 transitions.
Applied a total of 0 rules in 13 ms. Remains 434 /434 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 434/434 places, 986/986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 986/986 transitions.
Applied a total of 0 rules in 12 ms. Remains 434 /434 variables (removed 0) and now considering 986/986 (removed 0) transitions.
[2026-05-22 18:39:24] [INFO ] Invariant cache hit.
[2026-05-22 18:39:25] [INFO ] Implicit Places using invariants in 417 ms returned []
[2026-05-22 18:39:25] [INFO ] Invariant cache hit.
[2026-05-22 18:39:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:39:26] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2026-05-22 18:39:26] [INFO ] Redundant transitions in 61 ms returned []
Running 966 sub problems to find dead transitions.
[2026-05-22 18:39:26] [INFO ] Invariant cache hit.
[2026-05-22 18:39:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Problem TDEAD360 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :7.19464e+25 after 1.05181e+26
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1420 variables, and 37 constraints, problems are : Problem set: 4 solved, 962 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/18 constraints, Generalized P Invariants (flows): 23/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 12/12 constraints. Problems are: Problem set: 4 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 23/35 constraints. Problems are: Problem set: 4 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 4 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 962 unsolved
At refinement iteration 4 (OVERLAPS) 4/434 variables, 6/43 constraints. Problems are: Problem set: 4 solved, 962 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 7/50 constraints. Problems are: Problem set: 4 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1420 variables, and 53 constraints, problems are : Problem set: 4 solved, 962 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/434 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 4 solved, 962 unsolved
Search for dead transitions found 4 dead transitions in 60363ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 434/434 places, 982/986 transitions.
Applied a total of 0 rules in 17 ms. Remains 434 /434 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2026-05-22 18:40:26] [INFO ] Redundant transitions in 98 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62013 ms. Remains : 434/434 places, 982/986 transitions.
RANDOM walk for 40000 steps (511 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (130 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 610968 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 1
Probabilistic random walk after 610968 steps, saw 188669 distinct states, run finished after 3013 ms. (steps per millisecond=202 ) 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-11491787205866293644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-705101070225473525.kers'
[2026-05-22 18:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11491787205866293644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-705101070225473525.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 982 rows 433 cols 3925 entries
Finished phase 1 with 119 SingleSign rule and 267 generalized
[2026-05-22 18:40:29] [INFO ] Computed 48 invariants in 20 ms
Computed 48 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-705101070225473525.kers
Total runtime 23 ms.
[2026-05-22 18:40:29] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/213 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/217 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 192/409 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/425 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/434 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/434 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 982/1416 variables, 434/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1416 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1416 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1416 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 434/434 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 186/213 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/217 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 192/409 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/425 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/434 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/434 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 982/1416 variables, 434/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1416 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1416 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1416 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 434/434 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 27 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 982/982 transitions.
Applied a total of 0 rules in 13 ms. Remains 434 /434 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 434/434 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 982/982 transitions.
Applied a total of 0 rules in 14 ms. Remains 434 /434 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2026-05-22 18:40:31] [INFO ] Invariant cache hit.
[2026-05-22 18:40:31] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-22 18:40:31] [INFO ] Invariant cache hit.
[2026-05-22 18:40:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:40:32] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
[2026-05-22 18:40:32] [INFO ] Redundant transitions in 8 ms returned []
Running 962 sub problems to find dead transitions.
[2026-05-22 18:40:32] [INFO ] Invariant cache hit.
[2026-05-22 18:40:32] [INFO ] State equation strengthened by 3 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 524288
SDD size :1.05181e+26 after 6.41877e+26
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1416 variables, and 37 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/16 constraints, Generalized P Invariants (flows): 25/32 constraints, State Equation: 0/434 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 4 (OVERLAPS) 4/434 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 962 unsolved
SMT process timed out in 60379ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61813 ms. Remains : 434/434 places, 982/982 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 434 transition count 977
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 429 transition count 977
Applied a total of 10 rules in 28 ms. Remains 429 /434 variables (removed 5) and now considering 977/982 (removed 5) 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-1775895979516325427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11301439905122167519.kers'
[2026-05-22 18:41:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1775895979516325427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11301439905122167519.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 977 rows 427 cols 3886 entries
Finished phase 1 with 114 SingleSign rule and 267 generalized
[2026-05-22 18:41:33] [INFO ] Computed 48 invariants in 5 ms
Computed 48 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11301439905122167519.kers
Total runtime 8 ms.
[2026-05-22 18:41:33] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 18:41:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-22 18:41:33] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 11 ms returned sat
[2026-05-22 18:41:33] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 18:41:33] [INFO ] After 402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 18:41:33] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 18:41:33] [INFO ] Flatten gal took : 37 ms
[2026-05-22 18:41:34] [INFO ] Flatten gal took : 32 ms
[2026-05-22 18:41:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15412898763352232809.gal : 9 ms
[2026-05-22 18:41:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality744454957043019756.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/ReachabilityCardinality15412898763352232809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality744454957043019756.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/ReachabilityCardinality744454957043019756.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 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 518
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :518 after 4968
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4968 after 255024
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :255024 after 357696
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :357696 after 487570
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-09 is true.
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,3.06801e+06,2.29043,17868,2,10265,15,37924,6,0,2695,14338,0
Total reachable state count : 3068012

Verifying 1 reachability properties.
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityCardinality-2024-09,4,2.31731,17968,2,470,15,37924,7,0,2752,14338,0
Over-approximation ignoring read arcs solved 0 properties in 3159 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 18:41:36] [INFO ] Flatten gal took : 57 ms
[2026-05-22 18:41:36] [INFO ] Applying decomposition
[2026-05-22 18:41:36] [INFO ] Flatten gal took : 57 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/graph6340548454367679280.txt' '-o' '/tmp/graph6340548454367679280.bin' '-w' '/tmp/graph6340548454367679280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6340548454367679280.bin' '-l' '-1' '-v' '-w' '/tmp/graph6340548454367679280.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:41:37] [INFO ] Decomposing Gal with order
[2026-05-22 18:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:41:37] [INFO ] Removed a total of 1937 redundant transitions.
[2026-05-22 18:41:37] [INFO ] Flatten gal took : 239 ms
[2026-05-22 18:41:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 75 ms.
[2026-05-22 18:41:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17478809328740009239.gal : 38 ms
[2026-05-22 18:41:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1047437350039954135.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/ReachabilityCardinality17478809328740009239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1047437350039954135.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/ReachabilityCardinality1047437350039954135.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 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 127165
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :127165 after 6.35348e+16
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.35348e+16 after 1.11222e+27
Detected timeout of ITS tools.
[2026-05-22 19:11:38] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17964913331818427040
[2026-05-22 19:11:38] [INFO ] Applying decomposition
[2026-05-22 19:11:38] [INFO ] Flatten gal took : 23 ms
[2026-05-22 19:11:38] [INFO ] Computing symmetric may disable matrix : 982 transitions.
[2026-05-22 19:11:38] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:11:38] [INFO ] Computing symmetric may enable matrix : 982 transitions.
[2026-05-22 19:11:38] [INFO ] Computation of Complete enable matrix. took 2 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/graph10269138127445327304.txt' '-o' '/tmp/graph10269138127445327304.bin' '-w' '/tmp/graph10269138127445327304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10269138127445327304.bin' '-l' '-1' '-v' '-w' '/tmp/graph10269138127445327304.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:11:38] [INFO ] Decomposing Gal with order
[2026-05-22 19:11:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:11:38] [INFO ] Removed a total of 1909 redundant transitions.
[2026-05-22 19:11:38] [INFO ] Flatten gal took : 122 ms
[2026-05-22 19:11:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 48 ms.
[2026-05-22 19:11:38] [INFO ] Computing Do-Not-Accords matrix : 982 transitions.
[2026-05-22 19:11:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7286696125503964040.gal : 26 ms
[2026-05-22 19:11:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11097322115932793172.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/ReachabilityCardinality7286696125503964040.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11097322115932793172.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
[2026-05-22 19:11:38] [INFO ] Computation of Completed DNA matrix. took 53 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:11:38] [INFO ] Built C files in 520ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17964913331818427040
Loading property file /tmp/ReachabilityCardinality11097322115932793172.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 370
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :370 after 2872
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2872 after 57000
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :57000 after 117000
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-09 is true.
FORMULA ASLink-PT-04b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Running compilation step : cd /tmp/ltsmin17964913331818427040;'/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'
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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\_flat,1.04545e+07,0.284374,10540,968,344,6494,2403,1591,6189,361,4646,0
Total reachable state count : 10454484

Verifying 1 reachability properties.
Reachability property ASLink-PT-04b-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-04b-ReachabilityCardinality-2024-09,128,0.303752,10540,169,89,6494,2403,1717,6189,387,4646,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1973261 ms.

BK_STOP 1779477099246

--------------------
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="ASLink-PT-04b"
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 ASLink-PT-04b, 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 r002-oct2-177944366200342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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