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-177944366200318.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-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:02 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.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 357K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779472055792

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 17:47:37] [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 17:47:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:47:37] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2026-05-22 17:47:37] [INFO ] Transformed 821 places.
[2026-05-22 17:47:37] [INFO ] Transformed 1281 transitions.
[2026-05-22 17:47:37] [INFO ] Found NUPN structural information;
[2026-05-22 17:47:37] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (357 resets) in 2050 ms. (19 steps per ms) remains 7/12 properties
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 17:47:38] [INFO ] Flatten gal took : 258 ms
BEST_FIRST walk for 40004 steps (79 resets) in 608 ms. (65 steps per ms) remains 7/7 properties
[2026-05-22 17:47:38] [INFO ] Flatten gal took : 196 ms
BEST_FIRST walk for 40003 steps (74 resets) in 719 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (72 resets) in 267 ms. (149 steps per ms) remains 7/7 properties
[2026-05-22 17:47:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11120649269374210260.gal : 104 ms
[2026-05-22 17:47:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3243989268989386127.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/ReachabilityCardinality11120649269374210260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3243989268989386127.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (77 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 298 ms. (133 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality3243989268989386127.prop.
BEST_FIRST walk for 40004 steps (75 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12295514155518858642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9360361770025155101.kers'
[2026-05-22 17:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12295514155518858642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9360361770025155101.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1268 rows 809 cols 4789 entries
Finished phase 1 with 297 SingleSign rule and 368 generalized
[2026-05-22 17:47:39] [INFO ] Computed 156 invariants in 8 ms
Computed 156 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9360361770025155101.kers
Total runtime 10 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 34
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :34 after 60
All remaining problems are real, not stopping.
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :60 after 93
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :93 after 186
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :186 after 34646
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 226/351 variables, 28/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :34646 after 3.13649e+07
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 226/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 29/380 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 29/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :3.13649e+07 after 1.11459e+09
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 423/803 variables, 109/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/803 variables, 423/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/803 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 18/821 variables, 13/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/821 variables, 18/977 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/821 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1268/2089 variables, 821/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/2089 variables, 0/1798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2089/2089 variables, and 1798 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5072 ms.
Refiners :[Domain max(s): 821/821 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 123/123 constraints, State Equation: 821/821 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 226/351 variables, 28/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 226/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 29/380 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 29/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 423/803 variables, 109/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/803 variables, 423/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/803 variables, 3/949 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 803/2089 variables, and 949 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5036 ms.
Refiners :[Domain max(s): 803/821 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 110/123 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10254ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 11 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 804 transition count 1236
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 89 place count 772 transition count 1228
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 97 place count 764 transition count 1228
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 97 place count 764 transition count 1180
Deduced a syphon composed of 48 places in 3 ms
Ensure Unique test removed 9 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 202 place count 707 transition count 1180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 203 place count 707 transition count 1179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 204 place count 706 transition count 1179
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 210 place count 700 transition count 1150
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 217 place count 699 transition count 1150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 219 place count 699 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 219 place count 699 transition count 1147
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 222 place count 697 transition count 1147
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 696 transition count 1147
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 253 place count 681 transition count 1132
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 261 place count 681 transition count 1124
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 269 place count 673 transition count 1124
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 270 place count 673 transition count 1124
Applied a total of 270 rules in 307 ms. Remains 673 /821 variables (removed 148) and now considering 1124/1268 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 673/821 places, 1124/1268 transitions.
RANDOM walk for 40000 steps (455 resets) in 447 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (115 resets) in 359 ms. (111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (127 resets) in 230 ms. (173 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (106 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (127 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (113 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (120 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (115 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 156861 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :1 out of 7
Probabilistic random walk after 156861 steps, saw 69723 distinct states, run finished after 3024 ms. (steps per millisecond=51 ) properties seen :1
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14436402621147599453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8353237565977743819.kers'
[2026-05-22 17:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14436402621147599453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8353237565977743819.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1124 rows 671 cols 4392 entries
Finished phase 1 with 188 SingleSign rule and 358 generalized
[2026-05-22 17:47:53] [INFO ] Computed 127 invariants in 15 ms
Computed 127 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-8353237565977743819.kers
Total runtime 17 ms.
[2026-05-22 17:47:53] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 129/232 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 64/296 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 361/657 variables, 87/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/657 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 16/673 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1124/1797 variables, 673/800 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1797 variables, 13/813 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1797 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1797 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1797/1797 variables, and 813 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3676 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 673/673 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 129/232 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 64/296 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 361/657 variables, 87/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/657 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/673 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/673 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1124/1797 variables, 673/802 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1797 variables, 13/815 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1797 variables, 5/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1797 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1797 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1797/1797 variables, and 820 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43358 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 100/100 constraints, State Equation: 673/673 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47113ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 14225 ms.
Support contains 103 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 1124/1124 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 673 transition count 1122
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 671 transition count 1120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 669 transition count 1120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 8 place count 669 transition count 1114
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 659 transition count 1114
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 659 transition count 1114
Applied a total of 27 rules in 78 ms. Remains 659 /673 variables (removed 14) and now considering 1114/1124 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 659/673 places, 1114/1124 transitions.
RANDOM walk for 40000 steps (473 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (126 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (112 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (122 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (128 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (125 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (111 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 163622 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 6
Probabilistic random walk after 163622 steps, saw 77950 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) 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-688090287122163493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12719906275262928089.kers'
[2026-05-22 17:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-688090287122163493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12719906275262928089.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1114 rows 657 cols 4364 entries
Finished phase 1 with 179 SingleSign rule and 357 generalized
[2026-05-22 17:48:58] [INFO ] Computed 123 invariants in 8 ms
Computed 123 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12719906275262928089.kers
Total runtime 9 ms.
[2026-05-22 17:48:58] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 149/252 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 63/315 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 332/647 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 12/659 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1114/1773 variables, 659/782 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1773 variables, 13/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1773 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1773 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1773/1773 variables, and 795 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2912 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 659/659 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 149/252 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 63/315 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 332/647 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 12/659 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/659 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1114/1773 variables, 659/783 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1773 variables, 13/796 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1773 variables, 5/801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1773 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1773 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1773/1773 variables, and 801 constraints, problems are : Problem set: 0 solved, 6 unsolved in 26706 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 659/659 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29665ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30965 ms.
Support contains 91 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 1114/1114 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 658 transition count 1106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 658 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 657 transition count 1098
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 657 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 656 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 656 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 655 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 655 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 654 transition count 1074
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 654 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 653 transition count 1066
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 653 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 652 transition count 1058
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 652 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 651 transition count 1050
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 651 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 650 transition count 1042
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 650 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 649 transition count 1034
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 649 transition count 1034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 648 transition count 1026
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 648 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 647 transition count 1018
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 647 transition count 1018
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 645 transition count 1016
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 645 transition count 1016
Applied a total of 29 rules in 281 ms. Remains 645 /659 variables (removed 14) and now considering 1016/1114 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 645/659 places, 1016/1114 transitions.
RANDOM walk for 40000 steps (450 resets) in 229 ms. (173 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (110 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (123 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (125 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (125 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (122 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 115751 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 5
Probabilistic random walk after 115751 steps, saw 56801 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) 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-2753316401923714832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4027928522451348988.kers'
[2026-05-22 17:50:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2753316401923714832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4027928522451348988.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1016 rows 643 cols 3980 entries
Finished phase 1 with 160 SingleSign rule and 362 generalized
[2026-05-22 17:50:02] [INFO ] Computed 123 invariants in 7 ms
Computed 123 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4027928522451348988.kers
Total runtime 9 ms.
[2026-05-22 17:50:02] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 178/269 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 32/301 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 332/633 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/645 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1016/1661 variables, 645/768 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1661 variables, 13/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1661 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1661 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1661/1661 variables, and 781 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2076 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 645/645 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 178/269 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 32/301 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 332/633 variables, 83/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/645 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1016/1661 variables, 645/768 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1661 variables, 13/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1661 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1661 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1661 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1661/1661 variables, and 785 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32299 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 95/95 constraints, State Equation: 645/645 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34422ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 37020 ms.
Support contains 91 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1016/1016 transitions.
Applied a total of 0 rules in 32 ms. Remains 645 /645 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 645/645 places, 1016/1016 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1016/1016 transitions.
Applied a total of 0 rules in 31 ms. Remains 645 /645 variables (removed 0) and now considering 1016/1016 (removed 0) transitions.
[2026-05-22 17:51:14] [INFO ] Invariant cache hit.
[2026-05-22 17:51:15] [INFO ] Implicit Places using invariants in 819 ms returned [1, 19, 20, 32, 50, 127, 141, 163, 178, 182, 183, 184, 202, 220, 277, 293, 315, 328, 330, 331, 332, 350, 368, 406, 423, 439, 450, 463, 468, 479, 480, 481, 482, 483, 505, 507, 510, 528, 529, 530, 531, 546, 552, 566, 572, 578, 584, 590, 596, 602, 608]
[2026-05-22 17:51:15] [INFO ] Actually due to overlaps returned [505, 483, 32, 50, 202, 332, 350, 510, 184, 183, 331, 482, 529, 182, 330, 481, 507, 528, 1, 315, 463, 480, 20, 178, 220, 328, 368, 479, 531, 578, 596, 608, 19, 163, 468, 530, 546, 552, 566, 572, 584, 590, 602]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 837 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 602/645 places, 1016/1016 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 597 transition count 978
Reduce places removed 38 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 55 rules applied. Total rules applied 98 place count 559 transition count 961
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 115 place count 542 transition count 961
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 115 place count 542 transition count 948
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 141 place count 529 transition count 948
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 with 4 rules applied. Total rules applied 145 place count 527 transition count 946
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 149 place count 525 transition count 944
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 523 transition count 944
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 162 place count 512 transition count 933
Iterating global reduction 6 with 11 rules applied. Total rules applied 173 place count 512 transition count 933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 174 place count 512 transition count 932
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 177 place count 509 transition count 929
Iterating global reduction 7 with 3 rules applied. Total rules applied 180 place count 509 transition count 929
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 220 place count 489 transition count 909
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 236 place count 489 transition count 893
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 253 place count 472 transition count 893
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 261 place count 472 transition count 893
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 263 place count 472 transition count 893
Applied a total of 263 rules in 129 ms. Remains 472 /602 variables (removed 130) and now considering 893/1016 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7331788228018339469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4114377010244364457.kers'
[2026-05-22 17:51:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7331788228018339469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4114377010244364457.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 893 rows 471 cols 3485 entries
Finished phase 1 with 219 SingleSign rule and 181 generalized
[2026-05-22 17:51:15] [INFO ] Computed 72 invariants in 5 ms
Computed 72 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4114377010244364457.kers
Total runtime 7 ms.
[2026-05-22 17:51:15] [INFO ] Implicit Places using invariants in 298 ms returned [117, 119, 140, 227, 242, 245, 249, 257, 266, 333, 360, 373, 374, 445, 463, 465, 470]
[2026-05-22 17:51:15] [INFO ] Actually due to overlaps returned [140, 374, 119, 249, 227, 242, 257, 333, 360, 373, 445, 463, 465, 470]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 304 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 458/645 places, 893/1016 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 457 transition count 892
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 455 transition count 890
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 455 transition count 890
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 8 place count 454 transition count 889
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 454 transition count 888
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 454 transition count 886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 452 transition count 886
Applied a total of 13 rules in 76 ms. Remains 452 /458 variables (removed 6) and now considering 886/893 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-602805258357582964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4241765454367641021.kers'
[2026-05-22 17:51:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-602805258357582964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4241765454367641021.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 886 rows 451 cols 3400 entries
Finished phase 1 with 224 SingleSign rule and 170 generalized
[2026-05-22 17:51:15] [INFO ] Computed 58 invariants in 5 ms
Computed 58 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4241765454367641021.kers
Total runtime 6 ms.
[2026-05-22 17:51:15] [INFO ] Implicit Places using invariants in 295 ms returned [256]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 301 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 451/645 places, 886/1016 transitions.
Applied a total of 0 rules in 12 ms. Remains 451 /451 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1691 ms. Remains : 451/645 places, 886/1016 transitions.
RANDOM walk for 40000 steps (571 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (137 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (151 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (159 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (150 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 387565 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :2 out of 5
Probabilistic random walk after 387565 steps, saw 106174 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :2
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11510490661742558861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11946361140242214535.kers'
[2026-05-22 17:51:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11510490661742558861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11946361140242214535.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 886 rows 450 cols 3390 entries
Finished phase 1 with 224 SingleSign rule and 170 generalized
[2026-05-22 17:51:19] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11946361140242214535.kers
Total runtime 6 ms.
[2026-05-22 17:51:19] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 179/240 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/241 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 210/451 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 886/1337 variables, 451/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1337 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1337 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 451/451 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 179/240 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/241 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 210/451 variables, 41/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/451 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 886/1337 variables, 451/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1337 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1337 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1337 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 451/451 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2048 ms.
Support contains 59 out of 451 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 451/451 places, 886/886 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 451 transition count 876
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 441 transition count 874
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 439 transition count 874
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 24 place count 439 transition count 865
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 19 rules applied. Total rules applied 43 place count 429 transition count 865
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 45 place count 427 transition count 865
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 45 place count 427 transition count 863
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 49 place count 425 transition count 863
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 51 place count 423 transition count 861
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 423 transition count 861
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 63 place count 418 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 418 transition count 855
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 418 transition count 854
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 418 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 417 transition count 853
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 417 transition count 851
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 71 place count 415 transition count 851
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 73 place count 415 transition count 851
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 74 place count 415 transition count 851
Applied a total of 74 rules in 113 ms. Remains 415 /451 variables (removed 36) and now considering 851/886 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 415/451 places, 851/886 transitions.
RANDOM walk for 40000 steps (557 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (170 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 400396 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 2
Probabilistic random walk after 400396 steps, saw 109811 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) 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-3600205558906883861.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18440355267300079894.kers'
[2026-05-22 17:51:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3600205558906883861.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18440355267300079894.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 851 rows 413 cols 3331 entries
Finished phase 1 with 183 SingleSign rule and 178 generalized
[2026-05-22 17:51:27] [INFO ] Computed 54 invariants in 5 ms
Computed 54 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18440355267300079894.kers
Total runtime 7 ms.
[2026-05-22 17:51:27] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 178/237 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/238 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 177/415 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 851/1266 variables, 415/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1266 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1266/1266 variables, and 475 constraints, problems are : Problem set: 0 solved, 2 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 415/415 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 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/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 178/237 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/238 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 177/415 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 851/1266 variables, 415/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1266 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1266 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1266 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1266 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 476 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1322 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 415/415 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2027ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 918 ms.
Support contains 59 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 851/851 transitions.
Applied a total of 0 rules in 11 ms. Remains 415 /415 variables (removed 0) and now considering 851/851 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 415/415 places, 851/851 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 851/851 transitions.
Applied a total of 0 rules in 12 ms. Remains 415 /415 variables (removed 0) and now considering 851/851 (removed 0) transitions.
[2026-05-22 17:51:30] [INFO ] Invariant cache hit.
[2026-05-22 17:51:31] [INFO ] Implicit Places using invariants in 386 ms returned [111, 128, 213, 229, 230]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 390 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/415 places, 851/851 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 410 transition count 849
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 408 transition count 849
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 406 transition count 847
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 406 transition count 847
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 403 transition count 844
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 403 transition count 842
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 401 transition count 842
Applied a total of 18 rules in 43 ms. Remains 401 /410 variables (removed 9) and now considering 842/851 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15886958722350719457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6723279275927060910.kers'
[2026-05-22 17:51:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15886958722350719457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6723279275927060910.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 842 rows 400 cols 3279 entries
Finished phase 1 with 171 SingleSign rule and 181 generalized
[2026-05-22 17:51:31] [INFO ] Computed 49 invariants in 4 ms
Computed 49 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6723279275927060910.kers
Total runtime 5 ms.
[2026-05-22 17:51:31] [INFO ] Implicit Places using invariants in 288 ms returned [211, 212]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 289 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 399/415 places, 842/851 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 398 transition count 841
Applied a total of 2 rules in 24 ms. Remains 398 /399 variables (removed 1) and now considering 841/842 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12867947716330278891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9714732845457093620.kers'
[2026-05-22 17:51:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12867947716330278891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9714732845457093620.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 841 rows 397 cols 3253 entries
Finished phase 1 with 172 SingleSign rule and 179 generalized
[2026-05-22 17:51:31] [INFO ] Computed 47 invariants in 5 ms
Computed 47 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9714732845457093620.kers
Total runtime 7 ms.
[2026-05-22 17:51:31] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-22 17:51:31] [INFO ] Invariant cache hit.
[2026-05-22 17:51:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 17:51:32] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 398/415 places, 841/851 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2060 ms. Remains : 398/415 places, 841/851 transitions.
RANDOM walk for 40000 steps (594 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (182 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (174 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 434881 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 434881 steps, saw 114350 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-22 17:51:36] [INFO ] Invariant cache hit.
[2026-05-22 17:51:36] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 192/251 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 147/398 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/1239 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1239 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1239 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1239/1239 variables, and 447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 621 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 398/398 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/1 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/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 192/251 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 147/398 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 841/1239 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1239 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1239 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1239 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1239 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1239/1239 variables, and 448 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 398/398 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1797ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 476 ms.
Support contains 59 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 841/841 transitions.
Applied a total of 0 rules in 12 ms. Remains 398 /398 variables (removed 0) and now considering 841/841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 398/398 places, 841/841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 841/841 transitions.
Applied a total of 0 rules in 10 ms. Remains 398 /398 variables (removed 0) and now considering 841/841 (removed 0) transitions.
[2026-05-22 17:51:38] [INFO ] Invariant cache hit.
[2026-05-22 17:51:38] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-22 17:51:38] [INFO ] Invariant cache hit.
[2026-05-22 17:51:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 17:51:40] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2026-05-22 17:51:40] [INFO ] Redundant transitions in 58 ms returned []
Running 840 sub problems to find dead transitions.
[2026-05-22 17:51:40] [INFO ] Invariant cache hit.
[2026-05-22 17:51:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/1239 variables, and 47 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/398 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 840/840 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 840 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/1239 variables, and 51 constraints, problems are : Problem set: 0 solved, 840 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/398 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/840 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62197 ms. Remains : 398/398 places, 841/841 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 398 transition count 839
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 0 with 5 rules applied. Total rules applied 5 place count 395 transition count 839
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 394 transition count 839
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 1 with 2 rules applied. Total rules applied 8 place count 393 transition count 838
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 392 transition count 837
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 392 transition count 837
Applied a total of 10 rules in 38 ms. Remains 392 /398 variables (removed 6) and now considering 837/841 (removed 4) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14909384345314120583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2153826440254124748.kers'
[2026-05-22 17:52:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14909384345314120583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2153826440254124748.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 837 rows 391 cols 3237 entries
Finished phase 1 with 171 SingleSign rule and 176 generalized
[2026-05-22 17:52:40] [INFO ] Computed 45 invariants in 4 ms
Computed 45 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2153826440254124748.kers
Total runtime 16 ms.
[2026-05-22 17:52:40] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 17:52:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-22 17:52:40] [INFO ] [Nat]Absence check using 15 positive and 30 generalized place invariants in 17 ms returned sat
[2026-05-22 17:52:41] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 17:52:41] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 17:52:41] [INFO ] After 1230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 17:52:41] [INFO ] Flatten gal took : 38 ms
[2026-05-22 17:52:42] [INFO ] Flatten gal took : 38 ms
[2026-05-22 17:52:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10830716500779199108.gal : 9 ms
[2026-05-22 17:52:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2690751485062530608.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/ReachabilityCardinality10830716500779199108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2690751485062530608.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2690751485062530608.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :45 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 809
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :809 after 15151
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :15151 after 24089
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :24089 after 26784
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :26784 after 226699
Detected timeout of ITS tools.
[2026-05-22 17:52:57] [INFO ] Flatten gal took : 29 ms
[2026-05-22 17:52:57] [INFO ] Applying decomposition
[2026-05-22 17:52:57] [INFO ] Flatten gal took : 27 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/graph11905816968231571125.txt' '-o' '/tmp/graph11905816968231571125.bin' '-w' '/tmp/graph11905816968231571125.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11905816968231571125.bin' '-l' '-1' '-v' '-w' '/tmp/graph11905816968231571125.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:52:57] [INFO ] Decomposing Gal with order
[2026-05-22 17:52:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:52:57] [INFO ] Removed a total of 1595 redundant transitions.
[2026-05-22 17:52:57] [INFO ] Flatten gal took : 165 ms
[2026-05-22 17:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 41 ms.
[2026-05-22 17:52:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3262581509202578426.gal : 24 ms
[2026-05-22 17:52:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12355910315987635933.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/ReachabilityCardinality3262581509202578426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12355910315987635933.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/ReachabilityCardinality12355910315987635933.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 98047
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :98047 after 2.59185e+06
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.59185e+06 after 2.71813e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.71813e+06 after 4.06632e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.06632e+06 after 2.05422e+07
Invariant property ASLink-PT-03a-ReachabilityCardinality-2024-01 does not hold.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.25613e+07 after 5.81259e+08
Reachability property ASLink-PT-03a-ReachabilityCardinality-2024-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 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,4.65913e+09,5.38143,79840,5117,2608,116127,24952,1429,259260,298,191440,0
Total reachable state count : 4659129183

Verifying 2 reachability properties.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32264 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 17:53:12] [INFO ] Flatten gal took : 51 ms
[2026-05-22 17:53:12] [INFO ] Applying decomposition
[2026-05-22 17:53:12] [INFO ] Flatten gal took : 35 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/graph897044651993087716.txt' '-o' '/tmp/graph897044651993087716.bin' '-w' '/tmp/graph897044651993087716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph897044651993087716.bin' '-l' '-1' '-v' '-w' '/tmp/graph897044651993087716.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:53:13] [INFO ] Decomposing Gal with order
[2026-05-22 17:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:53:13] [INFO ] Removed a total of 1825 redundant transitions.
[2026-05-22 17:53:13] [INFO ] Flatten gal took : 66 ms
[2026-05-22 17:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 21 ms.
[2026-05-22 17:53:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15398616160079665662.gal : 12 ms
[2026-05-22 17:53:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16983857684192911097.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/ReachabilityCardinality15398616160079665662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16983857684192911097.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16983857684192911097.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 100423
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :100423 after 2.54561e+09
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.54561e+09 after 1.27629e+10
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.27629e+10 after 2.00999e+11
Invariant property ASLink-PT-03a-ReachabilityCardinality-2024-01 does not hold.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.00999e+11 after 5.96538e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.96538e+11 after 9.67378e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.09644e+12 after 9.37019e+12
Reachability property ASLink-PT-03a-ReachabilityCardinality-2024-06 is true.
FORMULA ASLink-PT-03a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,2.6411e+14,19.537,201168,11071,1685,400037,16577,2341,749440,426,76978,0
Total reachable state count : 264110000139021

Verifying 2 reachability properties.
Invariant property ASLink-PT-03a-ReachabilityCardinality-2024-01 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-03a-ReachabilityCardinality-2024-01,672,1068.68,201332,293,140,400037,16577,2609,749440,469,76978,0
Reachability property ASLink-PT-03a-ReachabilityCardinality-2024-06 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-03a-ReachabilityCardinality-2024-06,4176,1068.82,201332,260,136,400037,16577,2630,749440,471,76978,0
All properties solved without resorting to model-checking.
Total runtime 1405614 ms.

BK_STOP 1779473463215

--------------------
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-03a"
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-03a, 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-177944366200318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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