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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 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 279K 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-02a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779471050599

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 17:30:51] [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:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:30:52] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2026-05-22 17:30:52] [INFO ] Transformed 626 places.
[2026-05-22 17:30:52] [INFO ] Transformed 1008 transitions.
[2026-05-22 17:30:52] [INFO ] Found NUPN structural information;
[2026-05-22 17:30:52] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (494 resets) in 1153 ms. (34 steps per ms) remains 5/13 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (117 resets) in 301 ms. (132 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (129 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
[2026-05-22 17:30:52] [INFO ] Flatten gal took : 180 ms
BEST_FIRST walk for 40003 steps (121 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (135 resets) in 188 ms. (211 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-22 17:30:52] [INFO ] Flatten gal took : 118 ms
BEST_FIRST walk for 40004 steps (135 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
[2026-05-22 17:30:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17129897940415226576.gal : 54 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18290876743909774631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5414962443408473890.kers'
[2026-05-22 17:30:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6409156275785701167.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/ReachabilityCardinality17129897940415226576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6409156275785701167.prop' '--nowitness' '--gen-order' 'FOLLOW'

[2026-05-22 17:30:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18290876743909774631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5414962443408473890.kers]
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
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 998 rows 618 cols 3784 entries
Finished phase 1 with 219 SingleSign rule and 289 generalized
[2026-05-22 17:30:53] [INFO ] Computed 118 invariants in 5 ms
Computed 118 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5414962443408473890.kers
Total runtime 7 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality6409156275785701167.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 141/172 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 141/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 77/249 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 77/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 29
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :39 after 64
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :64 after 189
At refinement iteration 9 (OVERLAPS) 359/608 variables, 81/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :189 after 3199
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 359/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3199 after 577401
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 18/626 variables, 12/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :577401 after 1.93815e+06
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 18/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.93815e+06 after 1.9723e+06
At refinement iteration 15 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1008 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 626/626 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/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 141/172 variables, 12/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 141/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 77/249 variables, 12/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 77/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem ASLink-PT-02a-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 359/608 variables, 81/355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 359/714 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 3/717 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/717 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 18/626 variables, 12/729 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 18/747 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 0/747 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 998/1624 variables, 626/1373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1624 variables, 1/1374 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1624 variables, 0/1374 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1624 variables, 0/1374 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1624/1624 variables, and 1374 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4213 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
SDD proceeding with computation,3 properties remain. new max is 4096
After SMT, in 5346ms problems are : Problem set: 1 solved, 2 unsolved
SDD size :1.9723e+06 after 1.69817e+07
Fused 2 Parikh solutions to 1 different solutions.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 275 ms.
Support contains 27 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 614 transition count 953
Reduce places removed 45 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 48 rules applied. Total rules applied 105 place count 569 transition count 950
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 566 transition count 950
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 108 place count 566 transition count 903
Deduced a syphon composed of 47 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 111 rules applied. Total rules applied 219 place count 502 transition count 903
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 502 transition count 902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 221 place count 501 transition count 902
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 226 place count 496 transition count 879
Ensure Unique test removed 1 places
Iterating global reduction 5 with 6 rules applied. Total rules applied 232 place count 495 transition count 879
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 with 5 rules applied. Total rules applied 237 place count 494 transition count 875
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 240 place count 492 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 241 place count 491 transition count 874
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 490 transition count 866
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 490 transition count 866
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 244 place count 489 transition count 858
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 489 transition count 858
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 246 place count 488 transition count 850
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 488 transition count 850
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 248 place count 487 transition count 842
Iterating global reduction 8 with 1 rules applied. Total rules applied 249 place count 487 transition count 842
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 250 place count 486 transition count 834
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 486 transition count 834
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 252 place count 485 transition count 826
Iterating global reduction 8 with 1 rules applied. Total rules applied 253 place count 485 transition count 826
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 254 place count 484 transition count 818
Iterating global reduction 8 with 1 rules applied. Total rules applied 255 place count 484 transition count 818
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 256 place count 483 transition count 810
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 483 transition count 810
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 258 place count 482 transition count 802
Iterating global reduction 8 with 1 rules applied. Total rules applied 259 place count 482 transition count 802
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 260 place count 481 transition count 794
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 481 transition count 794
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 262 place count 480 transition count 786
Iterating global reduction 8 with 1 rules applied. Total rules applied 263 place count 480 transition count 786
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 264 place count 479 transition count 778
Iterating global reduction 8 with 1 rules applied. Total rules applied 265 place count 479 transition count 778
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 266 place count 478 transition count 770
Iterating global reduction 8 with 1 rules applied. Total rules applied 267 place count 478 transition count 770
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 268 place count 477 transition count 762
Iterating global reduction 8 with 1 rules applied. Total rules applied 269 place count 477 transition count 762
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 270 place count 476 transition count 754
Iterating global reduction 8 with 1 rules applied. Total rules applied 271 place count 476 transition count 754
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 272 place count 475 transition count 746
Iterating global reduction 8 with 1 rules applied. Total rules applied 273 place count 475 transition count 746
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 301 place count 461 transition count 732
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 302 place count 461 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 303 place count 460 transition count 731
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 306 place count 460 transition count 731
Applied a total of 306 rules in 516 ms. Remains 460 /626 variables (removed 166) and now considering 731/998 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 460/626 places, 731/998 transitions.
RANDOM walk for 40000 steps (603 resets) in 393 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 470505 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 470505 steps, saw 194078 distinct states, run finished after 3015 ms. (steps per millisecond=156 ) 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-1551759381400879605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6610059865714977199.kers'
[2026-05-22 17:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1551759381400879605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6610059865714977199.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 731 rows 458 cols 2892 entries
Finished phase 1 with 91 SingleSign rule and 282 generalized
[2026-05-22 17:31:02] [INFO ] Computed 87 invariants in 15 ms
Computed 87 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6610059865714977199.kers
Total runtime 17 ms.
[2026-05-22 17:31:02] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/148 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/167 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/441 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/460 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 731/1191 variables, 460/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1191 variables, 12/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1191 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1191 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 460/460 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/148 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/167 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/441 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/460 variables, 14/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.69817e+07 after 7.08451e+07
At refinement iteration 9 (OVERLAPS) 731/1191 variables, 460/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1191 variables, 12/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1191 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1191 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 68/68 constraints, State Equation: 460/460 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 27 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 731/731 transitions.
Applied a total of 0 rules in 21 ms. Remains 460 /460 variables (removed 0) and now considering 731/731 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 460/460 places, 731/731 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 731/731 transitions.
Applied a total of 0 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 731/731 (removed 0) transitions.
[2026-05-22 17:31:03] [INFO ] Invariant cache hit.
[2026-05-22 17:31:04] [INFO ] Implicit Places using invariants in 396 ms returned [1, 19, 20, 22, 32, 50, 68, 106, 150, 163, 164, 165, 166, 167, 203, 242, 287, 292, 304, 306, 308, 326, 328, 331, 349, 350, 351, 352, 364, 370, 376, 382, 388, 394, 406, 412, 418, 424]
[2026-05-22 17:31:04] [INFO ] Actually due to overlaps returned [326, 308, 32, 50, 167, 331, 166, 350, 165, 306, 328, 349, 1, 164, 287, 19, 20, 68, 163, 203, 304, 352, 394, 412, 424, 22, 150, 292, 351, 364, 370, 376, 382, 388, 406, 418]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 408 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 424/460 places, 731/731 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 422 transition count 694
Reduce places removed 37 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 385 transition count 690
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 381 transition count 690
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 84 place count 381 transition count 677
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 111 place count 367 transition count 677
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 15 rules applied. Total rules applied 126 place count 360 transition count 669
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 134 place count 352 transition count 669
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 134 place count 352 transition count 668
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 351 transition count 668
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 145 place count 342 transition count 659
Iterating global reduction 5 with 9 rules applied. Total rules applied 154 place count 342 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 156 place count 342 transition count 657
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 158 place count 340 transition count 655
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 340 transition count 655
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 214 place count 313 transition count 628
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 215 place count 312 transition count 627
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 312 transition count 627
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 312 transition count 626
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 220 place count 312 transition count 623
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 224 place count 309 transition count 622
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 235 place count 309 transition count 611
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 247 place count 297 transition count 611
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 251 place count 297 transition count 611
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 253 place count 297 transition count 611
Applied a total of 253 rules in 132 ms. Remains 297 /424 variables (removed 127) and now considering 611/731 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8691248214906771260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6112921844689502537.kers'
[2026-05-22 17:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8691248214906771260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6112921844689502537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 611 rows 297 cols 2451 entries
Finished phase 1 with 116 SingleSign rule and 141 generalized
[2026-05-22 17:31:04] [INFO ] Computed 40 invariants in 3 ms
Computed 40 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6112921844689502537.kers
Total runtime 3 ms.
[2026-05-22 17:31:04] [INFO ] Implicit Places using invariants in 186 ms returned [74, 93, 99, 102, 104, 107, 109, 215, 287, 296]
[2026-05-22 17:31:04] [INFO ] Actually due to overlaps returned [107, 109, 93, 99, 104, 74, 215, 287, 296]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 188 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 288/460 places, 611/731 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 281 transition count 604
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 281 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 280 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 280 transition count 603
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 20 place count 278 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 278 transition count 600
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 278 transition count 597
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 275 transition count 597
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 275 transition count 596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 274 transition count 596
Applied a total of 29 rules in 61 ms. Remains 274 /288 variables (removed 14) and now considering 596/611 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9206163895545900585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4193302028459741447.kers'
[2026-05-22 17:31:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9206163895545900585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4193302028459741447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 596 rows 274 cols 2390 entries
Finished phase 1 with 111 SingleSign rule and 132 generalized
[2026-05-22 17:31:04] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4193302028459741447.kers
Total runtime 4 ms.
[2026-05-22 17:31:04] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 17:31:04] [INFO ] Invariant cache hit.
[2026-05-22 17:31:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 17:31:05] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 274/460 places, 596/731 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1496 ms. Remains : 274/460 places, 596/731 transitions.
RANDOM walk for 40000 steps (772 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (228 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 820674 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 820674 steps, saw 285605 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2026-05-22 17:31:08] [INFO ] Invariant cache hit.
[2026-05-22 17:31:08] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/189 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/274 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 596/870 variables, 274/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/870 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 870/870 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 274/274 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/189 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/274 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 596/870 variables, 274/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/870 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/870 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/870 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 870/870 variables, and 308 constraints, problems are : Problem set: 0 solved, 1 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 274/274 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 803ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 27 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 596/596 transitions.
Applied a total of 0 rules in 10 ms. Remains 274 /274 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 274/274 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 596/596 transitions.
Applied a total of 0 rules in 8 ms. Remains 274 /274 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2026-05-22 17:31:09] [INFO ] Invariant cache hit.
[2026-05-22 17:31:09] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-22 17:31:09] [INFO ] Invariant cache hit.
[2026-05-22 17:31:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 17:31:10] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2026-05-22 17:31:10] [INFO ] Redundant transitions in 22 ms returned []
Running 595 sub problems to find dead transitions.
[2026-05-22 17:31:10] [INFO ] Invariant cache hit.
[2026-05-22 17:31:10] [INFO ] State equation strengthened by 3 read => feed constraints.
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :7.08451e+07 after 3.16316e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 274/870 variables, and 44 constraints, problems are : Problem set: 0 solved, 595 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/274 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
At refinement iteration 6 (OVERLAPS) 596/870 variables, 274/318 constraints. Problems are: Problem set: 101 solved, 494 unsolved
SMT process timed out in 60264ms, After SMT, problems are : Problem set: 101 solved, 494 unsolved
Search for dead transitions found 101 dead transitions in 60269ms
Found 101 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 101 transitions
Dead transitions reduction (with SMT) removed 101 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 274/274 places, 495/596 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 271 transition count 495
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 271 transition count 493
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 269 transition count 493
Applied a total of 7 rules in 24 ms. Remains 269 /274 variables (removed 5) and now considering 493/495 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14989611816403656423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14158324483072864233.kers'
[2026-05-22 17:32:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14989611816403656423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14158324483072864233.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 269 cols 1978 entries
Finished phase 1 with 120 SingleSign rule and 118 generalized
[2026-05-22 17:32:10] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14158324483072864233.kers
Total runtime 11 ms.
[2026-05-22 17:32:10] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-22 17:32:10] [INFO ] Invariant cache hit.
[2026-05-22 17:32:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 17:32:11] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [25, 129, 130, 131, 132, 133, 134, 135, 136, 138]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 648 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 259/274 places, 493/596 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 259 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 258 transition count 492
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 258 transition count 492
Applied a total of 3 rules in 30 ms. Remains 258 /259 variables (removed 1) and now considering 492/493 (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-6364822903859818710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5675714947176827670.kers'
[2026-05-22 17:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6364822903859818710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5675714947176827670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 492 rows 258 cols 1955 entries
Finished phase 1 with 114 SingleSign rule and 116 generalized
[2026-05-22 17:32:11] [INFO ] Computed 28 invariants in 3 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5675714947176827670.kers
Total runtime 5 ms.
[2026-05-22 17:32:11] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-22 17:32:11] [INFO ] Invariant cache hit.
[2026-05-22 17:32:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:32:11] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 258/274 places, 492/596 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62337 ms. Remains : 258/274 places, 492/596 transitions.
RANDOM walk for 40000 steps (750 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (214 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 949735 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :0 out of 1
Probabilistic random walk after 949735 steps, saw 320250 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
[2026-05-22 17:32:14] [INFO ] Invariant cache hit.
[2026-05-22 17:32:14] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/242 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 473/715 variables, 242/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/734 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/750 variables, 9/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/750 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 750/750 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 258/258 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 154/181 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/242 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 473/715 variables, 242/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/715 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/734 variables, 7/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/750 variables, 9/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/750 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/750 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 750/750 variables, and 290 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 258/258 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 27 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 492/492 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/258 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 492/492 transitions.
Applied a total of 0 rules in 10 ms. Remains 258 /258 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2026-05-22 17:32:15] [INFO ] Invariant cache hit.
[2026-05-22 17:32:15] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-22 17:32:15] [INFO ] Invariant cache hit.
[2026-05-22 17:32:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:32:16] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2026-05-22 17:32:16] [INFO ] Redundant transitions in 8 ms returned []
Running 491 sub problems to find dead transitions.
[2026-05-22 17:32:16] [INFO ] Invariant cache hit.
[2026-05-22 17:32:16] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
At refinement iteration 7 (OVERLAPS) 492/750 variables, 258/297 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/750 variables, 4/301 constraints. Problems are: Problem set: 11 solved, 480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 750/750 variables, and 301 constraints, problems are : Problem set: 11 solved, 480 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 258/258 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 10/10 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/258 variables, 13/23 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 5/28 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 11/39 constraints. Problems are: Problem set: 11 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/39 constraints. Problems are: Problem set: 11 solved, 480 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 6 (OVERLAPS) 492/750 variables, 258/297 constraints. Problems are: Problem set: 107 solved, 384 unsolved
SMT process timed out in 60154ms, After SMT, problems are : Problem set: 107 solved, 384 unsolved
Search for dead transitions found 107 dead transitions in 60158ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 258/258 places, 385/492 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 256 transition count 377
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 248 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 247 transition count 376
Applied a total of 20 rules in 26 ms. Remains 247 /258 variables (removed 11) and now considering 376/385 (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-14882619454848002162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13697378967247963723.kers'
[2026-05-22 17:33:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14882619454848002162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13697378967247963723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 247 cols 1504 entries
Finished phase 1 with 88 SingleSign rule and 129 generalized
[2026-05-22 17:33:16] [INFO ] Computed 30 invariants in 7 ms
Computed 30 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13697378967247963723.kers
Total runtime 9 ms.
[2026-05-22 17:33:16] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-22 17:33:16] [INFO ] Invariant cache hit.
[2026-05-22 17:33:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 17:33:17] [INFO ] Implicit Places using invariants and state equation in 437 ms returned [2, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59]
Discarding 14 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 662 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/258 places, 375/492 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 233 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 374
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 232 transition count 375
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 229 transition count 375
Applied a total of 8 rules in 27 ms. Remains 229 /233 variables (removed 4) and now considering 375/375 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9716704104601049123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4059037872024885180.kers'
[2026-05-22 17:33:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9716704104601049123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4059037872024885180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 375 rows 229 cols 1473 entries
Finished phase 1 with 107 SingleSign rule and 95 generalized
[2026-05-22 17:33:17] [INFO ] Computed 27 invariants in 4 ms
Computed 27 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4059037872024885180.kers
Total runtime 5 ms.
[2026-05-22 17:33:17] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-22 17:33:17] [INFO ] Invariant cache hit.
[2026-05-22 17:33:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 17:33:18] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 229/258 places, 375/492 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62417 ms. Remains : 229/258 places, 375/492 transitions.
RANDOM walk for 40000 steps (765 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (214 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094174 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094174 steps, saw 351302 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2026-05-22 17:33:21] [INFO ] Invariant cache hit.
[2026-05-22 17:33:21] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/150 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/218 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 369/587 variables, 218/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/604 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 229/229 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/150 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 68/218 variables, 14/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 369/587 variables, 218/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 7/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/604 variables, 11/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 229/229 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 644ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 27 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 375/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 229/229 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 375/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2026-05-22 17:33:21] [INFO ] Invariant cache hit.
[2026-05-22 17:33:21] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-22 17:33:21] [INFO ] Invariant cache hit.
[2026-05-22 17:33:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 17:33:22] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2026-05-22 17:33:22] [INFO ] Redundant transitions in 44 ms returned []
Running 374 sub problems to find dead transitions.
[2026-05-22 17:33:22] [INFO ] Invariant cache hit.
[2026-05-22 17:33:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 374 unsolved
Problem TDEAD13 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 8 (OVERLAPS) 375/604 variables, 229/264 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 7/271 constraints. Problems are: Problem set: 19 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/604 variables, and 272 constraints, problems are : Problem set: 19 solved, 355 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 229/229 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 8/8 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 13/21 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 6/27 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 9/36 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 3/39 constraints. Problems are: Problem set: 19 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/39 constraints. Problems are: Problem set: 19 solved, 355 unsolved
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
At refinement iteration 7 (OVERLAPS) 375/604 variables, 229/268 constraints. Problems are: Problem set: 131 solved, 243 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 7/275 constraints. Problems are: Problem set: 131 solved, 243 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 243/518 constraints. Problems are: Problem set: 131 solved, 243 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 2/520 constraints. Problems are: Problem set: 131 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/604 variables, and 520 constraints, problems are : Problem set: 131 solved, 243 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 229/229 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 243/374 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 131 solved, 243 unsolved
Search for dead transitions found 131 dead transitions in 60128ms
Found 131 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 131 transitions
Dead transitions reduction (with SMT) removed 131 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 244/375 transitions.
Ensure Unique test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 213 transition count 230
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 48 place count 199 transition count 226
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 52 place count 195 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 195 transition count 225
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 194 transition count 225
Applied a total of 54 rules in 20 ms. Remains 194 /229 variables (removed 35) and now considering 225/244 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-68447788025833959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11991324179887486042.kers'
[2026-05-22 17:34:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-68447788025833959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11991324179887486042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 225 rows 194 cols 872 entries
Finished phase 1 with 82 SingleSign rule and 84 generalized
[2026-05-22 17:34:22] [INFO ] Computed 28 invariants in 1 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11991324179887486042.kers
Total runtime 1 ms.
[2026-05-22 17:34:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-22 17:34:22] [INFO ] Invariant cache hit.
[2026-05-22 17:34:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 17:34:23] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 194/229 places, 225/375 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61287 ms. Remains : 194/229 places, 225/375 transitions.
RANDOM walk for 40000 steps (1068 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (278 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1343401 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :0 out of 1
Probabilistic random walk after 1343401 steps, saw 460095 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
[2026-05-22 17:34:26] [INFO ] Invariant cache hit.
[2026-05-22 17:34:26] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/139 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/194 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/419 variables, 194/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 194/194 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/139 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 55/194 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 225/419 variables, 194/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/419 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 194/194 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 779ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 117 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=117 )
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 215011 ms.

BK_STOP 1779471267072

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

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