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-177944366200387.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-07b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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 1.1M 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-07b-LTLCardinality-00
FORMULA_NAME ASLink-PT-07b-LTLCardinality-01
FORMULA_NAME ASLink-PT-07b-LTLCardinality-02
FORMULA_NAME ASLink-PT-07b-LTLCardinality-03
FORMULA_NAME ASLink-PT-07b-LTLCardinality-04
FORMULA_NAME ASLink-PT-07b-LTLCardinality-05
FORMULA_NAME ASLink-PT-07b-LTLCardinality-06
FORMULA_NAME ASLink-PT-07b-LTLCardinality-07
FORMULA_NAME ASLink-PT-07b-LTLCardinality-08
FORMULA_NAME ASLink-PT-07b-LTLCardinality-09
FORMULA_NAME ASLink-PT-07b-LTLCardinality-10
FORMULA_NAME ASLink-PT-07b-LTLCardinality-11
FORMULA_NAME ASLink-PT-07b-LTLCardinality-12
FORMULA_NAME ASLink-PT-07b-LTLCardinality-13
FORMULA_NAME ASLink-PT-07b-LTLCardinality-14
FORMULA_NAME ASLink-PT-07b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779481136245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 20:18:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:18:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:18:57] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2026-05-22 20:18:57] [INFO ] Transformed 3222 places.
[2026-05-22 20:18:58] [INFO ] Transformed 3986 transitions.
[2026-05-22 20:18:58] [INFO ] Found NUPN structural information;
[2026-05-22 20:18:58] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ASLink-PT-07b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 3222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 197 place count 3025 transition count 3789
Iterating global reduction 0 with 197 rules applied. Total rules applied 394 place count 3025 transition count 3789
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 395 place count 3025 transition count 3788
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 470 place count 2950 transition count 3670
Iterating global reduction 1 with 75 rules applied. Total rules applied 545 place count 2950 transition count 3670
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 568 place count 2950 transition count 3647
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 579 place count 2939 transition count 3636
Iterating global reduction 2 with 11 rules applied. Total rules applied 590 place count 2939 transition count 3636
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 593 place count 2936 transition count 3626
Iterating global reduction 2 with 3 rules applied. Total rules applied 596 place count 2936 transition count 3626
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 599 place count 2933 transition count 3623
Iterating global reduction 2 with 3 rules applied. Total rules applied 602 place count 2933 transition count 3623
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 605 place count 2930 transition count 3613
Iterating global reduction 2 with 3 rules applied. Total rules applied 608 place count 2930 transition count 3613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 609 place count 2929 transition count 3605
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 2929 transition count 3605
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 611 place count 2928 transition count 3604
Iterating global reduction 2 with 1 rules applied. Total rules applied 612 place count 2928 transition count 3604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 613 place count 2927 transition count 3596
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 2927 transition count 3596
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 2926 transition count 3588
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 2926 transition count 3588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 617 place count 2925 transition count 3587
Iterating global reduction 2 with 1 rules applied. Total rules applied 618 place count 2925 transition count 3587
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 619 place count 2924 transition count 3579
Iterating global reduction 2 with 1 rules applied. Total rules applied 620 place count 2924 transition count 3579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 621 place count 2923 transition count 3571
Iterating global reduction 2 with 1 rules applied. Total rules applied 622 place count 2923 transition count 3571
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 623 place count 2922 transition count 3570
Iterating global reduction 2 with 1 rules applied. Total rules applied 624 place count 2922 transition count 3570
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 625 place count 2921 transition count 3562
Iterating global reduction 2 with 1 rules applied. Total rules applied 626 place count 2921 transition count 3562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 627 place count 2920 transition count 3554
Iterating global reduction 2 with 1 rules applied. Total rules applied 628 place count 2920 transition count 3554
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 629 place count 2919 transition count 3553
Iterating global reduction 2 with 1 rules applied. Total rules applied 630 place count 2919 transition count 3553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 631 place count 2918 transition count 3545
Iterating global reduction 2 with 1 rules applied. Total rules applied 632 place count 2918 transition count 3545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 633 place count 2917 transition count 3537
Iterating global reduction 2 with 1 rules applied. Total rules applied 634 place count 2917 transition count 3537
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 635 place count 2916 transition count 3536
Iterating global reduction 2 with 1 rules applied. Total rules applied 636 place count 2916 transition count 3536
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 637 place count 2915 transition count 3528
Iterating global reduction 2 with 1 rules applied. Total rules applied 638 place count 2915 transition count 3528
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 639 place count 2914 transition count 3520
Iterating global reduction 2 with 1 rules applied. Total rules applied 640 place count 2914 transition count 3520
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 641 place count 2913 transition count 3519
Iterating global reduction 2 with 1 rules applied. Total rules applied 642 place count 2913 transition count 3519
Applied a total of 642 rules in 5181 ms. Remains 2913 /3222 variables (removed 309) and now considering 3519/3986 (removed 467) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18402336792950054259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1515490530985478703.kers'
[2026-05-22 20:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18402336792950054259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1515490530985478703.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3519 rows 2913 cols 10880 entries
Finished phase 1 with 1862 SingleSign rule and 735 generalized
[2026-05-22 20:19:03] [INFO ] Computed 316 invariants in 28 ms
Computed 316 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-1515490530985478703.kers
Total runtime 32 ms.
[2026-05-22 20:19:06] [INFO ] Implicit Places using invariants in 2872 ms returned [2747, 2758, 2769, 2777, 2785, 2793, 2801, 2812, 2820, 2828, 2839]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2960 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2902/3222 places, 3519/3986 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2889 transition count 3506
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2889 transition count 3506
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2878 transition count 3495
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2878 transition count 3495
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2869 transition count 3486
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2869 transition count 3486
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2865 transition count 3482
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2865 transition count 3482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2863 transition count 3480
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2863 transition count 3480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2861 transition count 3478
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2861 transition count 3478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2859 transition count 3476
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2859 transition count 3476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2857 transition count 3474
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2857 transition count 3474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2856 transition count 3473
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2856 transition count 3473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2855 transition count 3472
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2855 transition count 3472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2854 transition count 3471
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2854 transition count 3471
Applied a total of 96 rules in 1970 ms. Remains 2854 /2902 variables (removed 48) and now considering 3471/3519 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4127812940600213880.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16175398854438626563.kers'
[2026-05-22 20:19:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4127812940600213880.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16175398854438626563.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3471 rows 2854 cols 10725 entries
Finished phase 1 with 1850 SingleSign rule and 699 generalized
[2026-05-22 20:19:08] [INFO ] Computed 305 invariants in 28 ms
Computed 305 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-16175398854438626563.kers
Total runtime 35 ms.
[2026-05-22 20:19:10] [INFO ] Implicit Places using invariants in 1977 ms returned []
[2026-05-22 20:19:10] [INFO ] Invariant cache hit.
[2026-05-22 20:19:27] [INFO ] Implicit Places using invariants and state equation in 16762 ms returned []
Implicit Place search using SMT with State Equation took 18766 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2854/3222 places, 3471/3986 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28898 ms. Remains : 2854/3222 places, 3471/3986 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Applied a total of 0 rules in 164 ms. Remains 2854 /2854 variables (removed 0) and now considering 3471/3471 (removed 0) transitions.
[2026-05-22 20:19:27] [INFO ] Invariant cache hit.
[2026-05-22 20:19:29] [INFO ] Implicit Places using invariants in 1845 ms returned []
[2026-05-22 20:19:29] [INFO ] Invariant cache hit.
[2026-05-22 20:19:46] [INFO ] Implicit Places using invariants and state equation in 17050 ms returned []
Implicit Place search using SMT with State Equation took 18913 ms to find 0 implicit places.
Running 3470 sub problems to find dead transitions.
[2026-05-22 20:19:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2853 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2853/6325 variables, and 182 constraints, problems are : Problem set: 0 solved, 3470 unsolved in 30154 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2854 constraints, PredecessorRefiner: 3470/3470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2853 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2853/6325 variables, and 182 constraints, problems are : Problem set: 0 solved, 3470 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2854 constraints, PredecessorRefiner: 0/3470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61959ms problems are : Problem set: 0 solved, 3470 unsolved
Search for dead transitions found 0 dead transitions in 62025ms
Finished structural reductions in LTL mode , in 1 iterations and 81190 ms. Remains : 2854/2854 places, 3471/3471 transitions.
Support contains 33 out of 2854 places after structural reductions.
[2026-05-22 20:20:48] [INFO ] Flatten gal took : 195 ms
[2026-05-22 20:20:49] [INFO ] Flatten gal took : 122 ms
[2026-05-22 20:20:49] [INFO ] Input system was already deterministic with 3471 transitions.
RANDOM walk for 40000 steps (65 resets) in 1712 ms. (23 steps per ms) remains 7/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
[2026-05-22 20:20:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 204/217 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 833/1050 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1681/2731 variables, 204/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2731 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 123/2854 variables, 39/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2854 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3471/6325 variables, 2854/3159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6325 variables, 0/3159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/6325 variables, 0/3159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6325/6325 variables, and 3159 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4065 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 243/243 constraints, State Equation: 2854/2854 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 204/217 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 833/1050 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1681/2731 variables, 204/266 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2731 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2731 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 123/2854 variables, 39/306 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2854/6325 variables, and 306 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 243/243 constraints, State Equation: 0/2854 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9138ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 527 transitions
Trivial Post-agglo rules discarded 527 transitions
Performed 527 trivial Post agglomeration. Transition count delta: 527
Iterating post reduction 0 with 527 rules applied. Total rules applied 527 place count 2854 transition count 2944
Reduce places removed 527 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 532 rules applied. Total rules applied 1059 place count 2327 transition count 2939
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1064 place count 2324 transition count 2937
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1066 place count 2322 transition count 2937
Performed 764 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 764 Pre rules applied. Total rules applied 1066 place count 2322 transition count 2173
Deduced a syphon composed of 764 places in 5 ms
Ensure Unique test removed 73 places
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 4 with 1601 rules applied. Total rules applied 2667 place count 1485 transition count 2173
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 52 rules applied. Total rules applied 2719 place count 1477 transition count 2129
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 45 rules applied. Total rules applied 2764 place count 1433 transition count 2128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2765 place count 1432 transition count 2128
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 2765 place count 1432 transition count 2099
Deduced a syphon composed of 29 places in 6 ms
Ensure Unique test removed 27 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 85 rules applied. Total rules applied 2850 place count 1376 transition count 2099
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2850 place count 1376 transition count 2073
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 2902 place count 1350 transition count 2073
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2903 place count 1349 transition count 2065
Iterating global reduction 7 with 1 rules applied. Total rules applied 2904 place count 1349 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2905 place count 1348 transition count 2057
Iterating global reduction 7 with 1 rules applied. Total rules applied 2906 place count 1348 transition count 2057
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2907 place count 1347 transition count 2049
Iterating global reduction 7 with 1 rules applied. Total rules applied 2908 place count 1347 transition count 2049
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 7 with 458 rules applied. Total rules applied 3366 place count 1117 transition count 1821
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3370 place count 1113 transition count 1817
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 3375 place count 1112 transition count 1817
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 7 with 1 rules applied. Total rules applied 3376 place count 1112 transition count 1816
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3377 place count 1111 transition count 1816
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3377 place count 1111 transition count 1815
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3379 place count 1110 transition count 1815
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3381 place count 1108 transition count 1813
Iterating global reduction 9 with 2 rules applied. Total rules applied 3383 place count 1108 transition count 1813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3385 place count 1108 transition count 1811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3386 place count 1107 transition count 1811
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3388 place count 1106 transition count 1816
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3396 place count 1106 transition count 1808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3404 place count 1098 transition count 1808
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3411 place count 1098 transition count 1801
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3418 place count 1091 transition count 1801
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 3425 place count 1091 transition count 1801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3426 place count 1090 transition count 1800
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 13 with 21 rules applied. Total rules applied 3447 place count 1076 transition count 1793
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 3454 place count 1069 transition count 1793
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 21 Pre rules applied. Total rules applied 3454 place count 1069 transition count 1772
Deduced a syphon composed of 21 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 15 with 43 rules applied. Total rules applied 3497 place count 1047 transition count 1772
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 15 with 8 rules applied. Total rules applied 3505 place count 1039 transition count 1772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3505 place count 1039 transition count 1771
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3507 place count 1038 transition count 1771
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 3537 place count 1023 transition count 1756
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 3544 place count 1016 transition count 1749
Iterating global reduction 16 with 7 rules applied. Total rules applied 3551 place count 1016 transition count 1749
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 3558 place count 1016 transition count 1742
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 3565 place count 1009 transition count 1742
Applied a total of 3565 rules in 1196 ms. Remains 1009 /2854 variables (removed 1845) and now considering 1742/3471 (removed 1729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1196 ms. Remains : 1009/2854 places, 1742/3471 transitions.
RANDOM walk for 40000 steps (406 resets) in 693 ms. (57 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (61 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (63 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (61 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (66 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 211488 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 7
Probabilistic random walk after 211488 steps, saw 46156 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) 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-4412708777989832448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8778989107928128405.kers'
[2026-05-22 20:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4412708777989832448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8778989107928128405.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1742 rows 996 cols 6857 entries
Finished phase 1 with 252 SingleSign rule and 586 generalized
[2026-05-22 20:21:04] [INFO ] Computed 171 invariants in 15 ms
Computed 171 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-8778989107928128405.kers
Total runtime 18 ms.
[2026-05-22 20:21:04] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 109/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 51/173 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 271/447 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 112/559 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 18/577 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/578 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 242/820 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/820 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 93/913 variables, 18/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/913 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 4/917 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/917 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 80/997 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/997 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 12/1009 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1009 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 1742/2751 variables, 1009/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2751 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2751 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (OVERLAPS) 0/2751 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2751/2751 variables, and 1182 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1009/1009 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 109/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 51/173 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/175 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/176 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 271/447 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 112/559 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 18/577 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/578 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/578 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 242/820 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/820 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 93/913 variables, 18/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/913 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 4/917 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/917 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 80/997 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/997 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 12/1009 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1009 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 1742/2751 variables, 1009/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2751 variables, 2/1182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2751 variables, 7/1189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2751 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 31 (OVERLAPS) 0/2751 variables, 4/1193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2751 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 33 (OVERLAPS) 0/2751 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2751/2751 variables, and 1193 constraints, problems are : Problem set: 0 solved, 7 unsolved in 39489 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 1009/1009 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42348ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 33353 ms.
Support contains 13 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 1742/1742 transitions.
Applied a total of 0 rules in 45 ms. Remains 1009 /1009 variables (removed 0) and now considering 1742/1742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1009/1009 places, 1742/1742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 1742/1742 transitions.
Applied a total of 0 rules in 41 ms. Remains 1009 /1009 variables (removed 0) and now considering 1742/1742 (removed 0) transitions.
[2026-05-22 20:22:19] [INFO ] Invariant cache hit.
[2026-05-22 20:22:21] [INFO ] Implicit Places using invariants in 1286 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 276, 295, 313, 384, 389, 400, 401, 403, 420, 438, 506, 511, 515, 516, 527, 529, 531, 548, 566, 635, 639, 640, 651, 652, 654, 671, 689, 724, 761, 765, 766, 777, 778, 780, 798, 816, 886, 890, 891, 894, 905, 906, 908, 926, 947, 948, 949, 950]
[2026-05-22 20:22:21] [INFO ] Actually due to overlaps returned [926, 908, 48, 168, 295, 420, 548, 671, 798, 31, 151, 276, 403, 531, 654, 780, 148, 271, 400, 527, 651, 777, 905, 947, 149, 272, 401, 529, 652, 778, 906, 948, 1, 18, 259, 260, 389, 515, 516, 639, 640, 765, 766, 890, 891, 66, 186, 313, 438, 566, 689, 816, 949, 19, 894, 950]
Discarding 56 places :
Implicit Place search using SMT only with invariants took 1301 ms to find 56 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 953/1009 places, 1742/1742 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 944 transition count 1622
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 128 rules applied. Total rules applied 257 place count 824 transition count 1614
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 260 place count 821 transition count 1614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 260 place count 821 transition count 1579
Deduced a syphon composed of 35 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 331 place count 785 transition count 1579
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 343 place count 781 transition count 1571
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 351 place count 773 transition count 1571
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 354 place count 770 transition count 1568
Iterating global reduction 5 with 3 rules applied. Total rules applied 357 place count 770 transition count 1568
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 360 place count 770 transition count 1565
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 452 place count 724 transition count 1519
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 459 place count 717 transition count 1512
Iterating global reduction 6 with 7 rules applied. Total rules applied 466 place count 717 transition count 1512
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 473 place count 717 transition count 1505
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 477 place count 715 transition count 1506
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 478 place count 715 transition count 1505
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 492 place count 715 transition count 1491
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 507 place count 700 transition count 1491
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 508 place count 700 transition count 1490
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 529 place count 700 transition count 1490
Applied a total of 529 rules in 406 ms. Remains 700 /953 variables (removed 253) and now considering 1490/1742 (removed 252) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16672964144472504319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12792149079812117573.kers'
[2026-05-22 20:22:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16672964144472504319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12792149079812117573.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1490 rows 699 cols 6048 entries
Finished phase 1 with 210 SingleSign rule and 390 generalized
[2026-05-22 20:22:21] [INFO ] Computed 100 invariants in 11 ms
Computed 100 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12792149079812117573.kers
Total runtime 13 ms.
[2026-05-22 20:22:22] [INFO ] Implicit Places using invariants in 595 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 252, 269, 275, 278, 280, 287, 288, 342, 358, 364, 367, 376, 377, 431, 447, 453, 456, 458, 463, 464, 517, 535, 541, 544, 546, 551, 552, 606, 623, 629, 632, 634]
[2026-05-22 20:22:22] [INFO ] Actually due to overlaps returned [104, 287, 376, 463, 551, 105, 288, 377, 464, 552, 89, 95, 100, 174, 180, 185, 269, 275, 280, 358, 364, 447, 453, 458, 535, 541, 546, 623, 629, 634, 73, 101, 157, 252, 342, 367, 431, 517, 606]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 599 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 661/1009 places, 1490/1742 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 635 transition count 1464
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 635 transition count 1464
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 628 transition count 1457
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 628 transition count 1457
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 614 transition count 1443
Free-agglomeration rule applied 20 times.
Iterating global reduction 0 with 20 rules applied. Total rules applied 114 place count 614 transition count 1423
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 134 place count 594 transition count 1423
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 141 place count 594 transition count 1416
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 148 place count 587 transition count 1416
Applied a total of 148 rules in 285 ms. Remains 587 /661 variables (removed 74) and now considering 1416/1490 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18363882278713291900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10848449296220705137.kers'
[2026-05-22 20:22:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18363882278713291900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10848449296220705137.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1416 rows 587 cols 5760 entries
Finished phase 1 with 156 SingleSign rule and 370 generalized
[2026-05-22 20:22:22] [INFO ] Computed 61 invariants in 24 ms
Computed 61 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-10848449296220705137.kers
Total runtime 26 ms.
[2026-05-22 20:22:23] [INFO ] Implicit Places using invariants in 621 ms returned []
[2026-05-22 20:22:23] [INFO ] Invariant cache hit.
[2026-05-22 20:22:24] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 587/1009 places, 1416/1742 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4694 ms. Remains : 587/1009 places, 1416/1742 transitions.
RANDOM walk for 40000 steps (592 resets) in 298 ms. (133 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (127 resets) in 60 ms. (655 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (135 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (120 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (132 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (131 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (119 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (138 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 215010 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 7
Probabilistic random walk after 215010 steps, saw 53291 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2026-05-22 20:22:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 227/360 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 93/453 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/454 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 107/561 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 21/582 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 5/587 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1416/2003 variables, 587/648 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/2003 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2003/2003 variables, and 648 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 118/131 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/133 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 227/360 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 93/453 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/454 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 107/561 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/561 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 21/582 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 5/587 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 1416/2003 variables, 587/648 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2003 variables, 7/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2003 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2003 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/2003 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2003/2003 variables, and 656 constraints, problems are : Problem set: 0 solved, 7 unsolved in 15807 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17321ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 9211 ms.
Support contains 13 out of 587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 587/587 places, 1416/1416 transitions.
Applied a total of 0 rules in 22 ms. Remains 587 /587 variables (removed 0) and now considering 1416/1416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 587/587 places, 1416/1416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 587/587 places, 1416/1416 transitions.
Applied a total of 0 rules in 20 ms. Remains 587 /587 variables (removed 0) and now considering 1416/1416 (removed 0) transitions.
[2026-05-22 20:22:54] [INFO ] Invariant cache hit.
[2026-05-22 20:22:55] [INFO ] Implicit Places using invariants in 549 ms returned []
[2026-05-22 20:22:55] [INFO ] Invariant cache hit.
[2026-05-22 20:22:56] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2026-05-22 20:22:56] [INFO ] Redundant transitions in 143 ms returned []
Running 1390 sub problems to find dead transitions.
[2026-05-22 20:22:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 36/57 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/2003 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 21/24 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/585 variables, 36/57 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/2003 variables, and 57 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 21/24 constraints, Generalized P Invariants (flows): 36/37 constraints, State Equation: 0/587 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62626 ms. Remains : 587/587 places, 1416/1416 transitions.
Computed a total of 117 stabilizing places and 117 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 2 out of 2854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 532 transitions
Trivial Post-agglo rules discarded 532 transitions
Performed 532 trivial Post agglomeration. Transition count delta: 532
Iterating post reduction 0 with 532 rules applied. Total rules applied 532 place count 2853 transition count 2938
Reduce places removed 532 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 537 rules applied. Total rules applied 1069 place count 2321 transition count 2933
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1073 place count 2318 transition count 2932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1074 place count 2317 transition count 2932
Performed 770 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 770 Pre rules applied. Total rules applied 1074 place count 2317 transition count 2162
Deduced a syphon composed of 770 places in 5 ms
Ensure Unique test removed 74 places
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 4 with 1614 rules applied. Total rules applied 2688 place count 1473 transition count 2162
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 53 rules applied. Total rules applied 2741 place count 1466 transition count 2116
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 2787 place count 1420 transition count 2116
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 29 Pre rules applied. Total rules applied 2787 place count 1420 transition count 2087
Deduced a syphon composed of 29 places in 4 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 87 rules applied. Total rules applied 2874 place count 1362 transition count 2087
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 2874 place count 1362 transition count 2059
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2930 place count 1334 transition count 2059
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2931 place count 1333 transition count 2058
Iterating global reduction 6 with 1 rules applied. Total rules applied 2932 place count 1333 transition count 2058
Performed 227 Post agglomeration using F-continuation condition.Transition count delta: 227
Deduced a syphon composed of 227 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 6 with 456 rules applied. Total rules applied 3388 place count 1104 transition count 1831
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3392 place count 1100 transition count 1827
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3397 place count 1099 transition count 1827
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 6 with 1 rules applied. Total rules applied 3398 place count 1099 transition count 1826
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3399 place count 1098 transition count 1826
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3399 place count 1098 transition count 1825
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3401 place count 1097 transition count 1825
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3403 place count 1095 transition count 1823
Iterating global reduction 8 with 2 rules applied. Total rules applied 3405 place count 1095 transition count 1823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3407 place count 1095 transition count 1821
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3408 place count 1094 transition count 1821
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3410 place count 1093 transition count 1826
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3412 place count 1091 transition count 1824
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 21 rules applied. Total rules applied 3433 place count 1077 transition count 1817
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3440 place count 1070 transition count 1817
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 21 Pre rules applied. Total rules applied 3440 place count 1070 transition count 1796
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 12 with 43 rules applied. Total rules applied 3483 place count 1048 transition count 1796
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 3498 place count 1033 transition count 1796
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3498 place count 1033 transition count 1795
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3500 place count 1032 transition count 1795
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 13 with 44 rules applied. Total rules applied 3544 place count 1010 transition count 1773
Discarding 14 places :
Symmetric choice reduction at 13 with 14 rule applications. Total rules 3558 place count 996 transition count 1759
Iterating global reduction 13 with 14 rules applied. Total rules applied 3572 place count 996 transition count 1759
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 3579 place count 989 transition count 1752
Iterating global reduction 13 with 7 rules applied. Total rules applied 3586 place count 989 transition count 1752
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 3593 place count 989 transition count 1745
Applied a total of 3593 rules in 648 ms. Remains 989 /2854 variables (removed 1865) and now considering 1745/3471 (removed 1726) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16006017354869829483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5461078590810371269.kers'
[2026-05-22 20:23:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16006017354869829483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5461078590810371269.kers]
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 1 ms.
// Phase 1: matrix 1745 rows 966 cols 6791 entries
Finished phase 1 with 221 SingleSign rule and 606 generalized
[2026-05-22 20:23:58] [INFO ] Computed 162 invariants in 21 ms
Computed 162 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-5461078590810371269.kers
Total runtime 23 ms.
[2026-05-22 20:23:59] [INFO ] Implicit Places using invariants in 941 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 204, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 744, 745, 757, 758, 760, 777, 795, 815, 866, 867, 870, 881, 882, 883, 904, 925, 926, 927, 928]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 945 ms to find 65 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 924/2854 places, 1745/3471 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 924 transition count 1627
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 806 transition count 1627
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 236 place count 806 transition count 1592
Deduced a syphon composed of 35 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 307 place count 770 transition count 1592
Discarding 4 places :
Implicit places reduction removed 4 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 2 with 12 rules applied. Total rules applied 319 place count 766 transition count 1584
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 327 place count 758 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 330 place count 755 transition count 1581
Iterating global reduction 4 with 3 rules applied. Total rules applied 333 place count 755 transition count 1581
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 336 place count 755 transition count 1578
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 446 place count 700 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 450 place count 698 transition count 1524
Applied a total of 450 rules in 138 ms. Remains 698 /924 variables (removed 226) and now considering 1524/1745 (removed 221) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9490982440322271575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5674725768901435130.kers'
[2026-05-22 20:23:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9490982440322271575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5674725768901435130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1524 rows 698 cols 6133 entries
Finished phase 1 with 196 SingleSign rule and 410 generalized
[2026-05-22 20:23:59] [INFO ] Computed 92 invariants in 26 ms
Computed 92 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-5674725768901435130.kers
Total runtime 27 ms.
[2026-05-22 20:24:00] [INFO ] Implicit Places using invariants in 695 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 614, 620, 625, 695]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 698 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 676/2854 places, 1524/3471 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 676 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 675 transition count 1523
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 661 transition count 1509
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 661 transition count 1509
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 44 place count 647 transition count 1495
Iterating global reduction 2 with 14 rules applied. Total rules applied 58 place count 647 transition count 1495
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 640 transition count 1488
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 640 transition count 1488
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 86 place count 633 transition count 1481
Applied a total of 86 rules in 108 ms. Remains 633 /676 variables (removed 43) and now considering 1481/1524 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4947004668192461192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1944124334504589544.kers'
[2026-05-22 20:24:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4947004668192461192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1944124334504589544.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1481 rows 633 cols 5974 entries
Finished phase 1 with 182 SingleSign rule and 381 generalized
[2026-05-22 20:24:00] [INFO ] Computed 70 invariants in 37 ms
Computed 70 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-1944124334504589544.kers
Total runtime 41 ms.
[2026-05-22 20:24:00] [INFO ] Implicit Places using invariants in 767 ms returned []
[2026-05-22 20:24:00] [INFO ] Invariant cache hit.
[2026-05-22 20:24:02] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 2291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 633/2854 places, 1481/3471 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4830 ms. Remains : 633/2854 places, 1481/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Stuttering acceptance computed with spot in 291 ms :[p0, true, p0]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-00
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-07b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07b-LTLCardinality-00 finished in 5218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X((F(G(p1))||p0))) U p2))))'
Support contains 6 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2847 transition count 3457
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2847 transition count 3457
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 2843 transition count 3446
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2843 transition count 3446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 2843 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2842 transition count 3444
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2842 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2841 transition count 3436
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2841 transition count 3436
Applied a total of 27 rules in 866 ms. Remains 2841 /2854 variables (removed 13) and now considering 3436/3471 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8351064951916879583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16294974916508313103.kers'
[2026-05-22 20:24:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8351064951916879583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16294974916508313103.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3436 rows 2841 cols 10606 entries
Finished phase 1 with 1846 SingleSign rule and 690 generalized
[2026-05-22 20:24:03] [INFO ] Computed 305 invariants in 69 ms
Computed 305 P flows in 70 ms.
Exported basis to /tmp/petrispot-output-16294974916508313103.kers
Total runtime 76 ms.
[2026-05-22 20:24:05] [INFO ] Implicit Places using invariants in 2229 ms returned []
[2026-05-22 20:24:05] [INFO ] Invariant cache hit.
[2026-05-22 20:24:15] [INFO ] Implicit Places using invariants and state equation in 9666 ms returned []
Implicit Place search using SMT with State Equation took 11928 ms to find 0 implicit places.
Running 3435 sub problems to find dead transitions.
[2026-05-22 20:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 3435/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 0/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61719ms problems are : Problem set: 0 solved, 3435 unsolved
Search for dead transitions found 0 dead transitions in 61736ms
Starting structural reductions in LTL mode, iteration 1 : 2841/2854 places, 3436/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74539 ms. Remains : 2841/2854 places, 3436/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X((F(G(p1))||p0))) U p2))))'
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-01
Product exploration explored 100000 steps with 152 reset in 432 ms.
Product exploration explored 100000 steps with 156 reset in 500 ms.
Computed a total of 116 stabilizing places and 116 stable transitions
Computed a total of 116 stabilizing places and 116 stable transitions
Knowledge based reduction with 5 factoid took 63 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 33092 steps (49 resets) in 373 ms. (88 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 573 ms.
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 6 out of 2841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2841/2841 places, 3436/3436 transitions.
Applied a total of 0 rules in 197 ms. Remains 2841 /2841 variables (removed 0) and now considering 3436/3436 (removed 0) transitions.
[2026-05-22 20:25:19] [INFO ] Invariant cache hit.
[2026-05-22 20:25:21] [INFO ] Implicit Places using invariants in 1901 ms returned []
[2026-05-22 20:25:21] [INFO ] Invariant cache hit.
[2026-05-22 20:25:30] [INFO ] Implicit Places using invariants and state equation in 9063 ms returned []
Implicit Place search using SMT with State Equation took 10974 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11174 ms. Remains : 2841/2841 places, 3436/3436 transitions.
Computed a total of 116 stabilizing places and 116 stable transitions
Computed a total of 116 stabilizing places and 116 stable transitions
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 21362 steps (29 resets) in 245 ms. (86 steps per ms) remains 0/4 properties
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 560 ms.
Stuttering acceptance computed with spot in 189 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 151 reset in 441 ms.
Product exploration explored 100000 steps with 156 reset in 437 ms.
Spot run failed in 123 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12192226785175887716
[2026-05-22 20:25:32] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12192226785175887716
Running compilation step : cd /tmp/ltsmin12192226785175887716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12192226785175887716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12192226785175887716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 2841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2841/2841 places, 3436/3436 transitions.
Applied a total of 0 rules in 180 ms. Remains 2841 /2841 variables (removed 0) and now considering 3436/3436 (removed 0) transitions.
[2026-05-22 20:25:36] [INFO ] Invariant cache hit.
[2026-05-22 20:25:37] [INFO ] Implicit Places using invariants in 1788 ms returned []
[2026-05-22 20:25:37] [INFO ] Invariant cache hit.
[2026-05-22 20:25:47] [INFO ] Implicit Places using invariants and state equation in 9325 ms returned []
Implicit Place search using SMT with State Equation took 11138 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 11334 ms. Remains : 2841/2841 places, 3436/3436 transitions.
Built C files in :
/tmp/ltsmin16337103345378960186
[2026-05-22 20:25:47] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16337103345378960186
Running compilation step : cd /tmp/ltsmin16337103345378960186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16337103345378960186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16337103345378960186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:25:50] [INFO ] Flatten gal took : 95 ms
[2026-05-22 20:25:50] [INFO ] Flatten gal took : 89 ms
[2026-05-22 20:25:50] [INFO ] Time to serialize gal into /tmp/LTL15401642899628705230.gal : 31 ms
[2026-05-22 20:25:50] [INFO ] Time to serialize properties into /tmp/LTL4317922878332558490.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15401642899628705230.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5843689370202635002.hoa' '-atoms' '/tmp/LTL4317922878332558490.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4317922878332558490.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5843689370202635002.hoa
Detected timeout of ITS tools.
[2026-05-22 20:26:05] [INFO ] Flatten gal took : 59 ms
[2026-05-22 20:26:06] [INFO ] Flatten gal took : 57 ms
[2026-05-22 20:26:06] [INFO ] Time to serialize gal into /tmp/LTL7672174058237245523.gal : 14 ms
[2026-05-22 20:26:06] [INFO ] Time to serialize properties into /tmp/LTL15782163974451634438.ltl : 5 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7672174058237245523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15782163974451634438.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(X((G(X(((F(G("((p341==0)||(p1250==1))")))||("(p343==0)"))||("(p2921==1)"))))U("(((p2100==0)||(p85==1))||(!((p341==0)||(p1250==1))...163
Formula 0 simplified : XF(!"(((p2100==0)||(p85==1))||(!((p341==0)||(p1250==1))))" & X(!"(((p2100==0)||(p85==1))||(!((p341==0)||(p1250==1))))" W F(!"(p343==...208
Detected timeout of ITS tools.
[2026-05-22 20:26:21] [INFO ] Flatten gal took : 77 ms
[2026-05-22 20:26:21] [INFO ] Applying decomposition
[2026-05-22 20:26:21] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5639143562041377835.txt' '-o' '/tmp/graph5639143562041377835.bin' '-w' '/tmp/graph5639143562041377835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5639143562041377835.bin' '-l' '-1' '-v' '-w' '/tmp/graph5639143562041377835.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:26:21] [INFO ] Decomposing Gal with order
[2026-05-22 20:26:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:26:22] [INFO ] Removed a total of 2535 redundant transitions.
[2026-05-22 20:26:22] [INFO ] Flatten gal took : 265 ms
[2026-05-22 20:26:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 38 ms.
[2026-05-22 20:26:22] [INFO ] Time to serialize gal into /tmp/LTL6307064942337770662.gal : 47 ms
[2026-05-22 20:26:22] [INFO ] Time to serialize properties into /tmp/LTL4878191016846994897.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6307064942337770662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4878191016846994897.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(X((G(X(((F(G("((i7.u120.p341==0)||(i17.u440.p1250==1))")))||("(i7.u119.p343==0)"))||("(i35.u1012.p2921==1)"))))U("(((i31.u735.p21...231
Formula 0 simplified : XF(!"(((i31.u735.p2100==0)||(i6.u29.p85==1))||(!((i7.u120.p341==0)||(i17.u440.p1250==1))))" & X(!"(((i31.u735.p2100==0)||(i6.u29.p85...309
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07b-LTLCardinality-01 finished in 154707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((G(p1)||X(X(X((p2||F(G(p2))))))))))'
Support contains 5 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2849 transition count 3459
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2849 transition count 3459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 2847 transition count 3450
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 2847 transition count 3450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2847 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 2846 transition count 3448
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 2846 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 2845 transition count 3440
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 2845 transition count 3440
Applied a total of 19 rules in 847 ms. Remains 2845 /2854 variables (removed 9) and now considering 3440/3471 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2953750805824237221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6350873264090316933.kers'
[2026-05-22 20:26:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2953750805824237221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6350873264090316933.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3440 rows 2845 cols 10615 entries
Finished phase 1 with 1850 SingleSign rule and 690 generalized
[2026-05-22 20:26:38] [INFO ] Computed 305 invariants in 44 ms
Computed 305 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-6350873264090316933.kers
Total runtime 47 ms.
[2026-05-22 20:26:40] [INFO ] Implicit Places using invariants in 1919 ms returned []
[2026-05-22 20:26:40] [INFO ] Invariant cache hit.
[2026-05-22 20:26:54] [INFO ] Implicit Places using invariants and state equation in 14031 ms returned []
Implicit Place search using SMT with State Equation took 15990 ms to find 0 implicit places.
Running 3439 sub problems to find dead transitions.
[2026-05-22 20:26:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2844 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2844/6285 variables, and 182 constraints, problems are : Problem set: 0 solved, 3439 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 3439/3439 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2844 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3439 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2844/6285 variables, and 182 constraints, problems are : Problem set: 0 solved, 3439 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2845 constraints, PredecessorRefiner: 0/3439 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61367ms problems are : Problem set: 0 solved, 3439 unsolved
Search for dead transitions found 0 dead transitions in 61382ms
Starting structural reductions in LTL mode, iteration 1 : 2845/2854 places, 3440/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78227 ms. Remains : 2845/2854 places, 3440/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((G(p1)||X(X(X((p2||F(G(p2))))))))))'
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Product exploration explored 100000 steps with 50000 reset in 775 ms.
Computed a total of 116 stabilizing places and 116 stable transitions
Computed a total of 116 stabilizing places and 116 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 27 ms. Proved property starting from automaton with 4 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 73 ms.
FORMULA ASLink-PT-07b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-07b-LTLCardinality-02 finished in 80239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 2854 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 532 transitions
Trivial Post-agglo rules discarded 532 transitions
Performed 532 trivial Post agglomeration. Transition count delta: 532
Iterating post reduction 0 with 532 rules applied. Total rules applied 532 place count 2853 transition count 2938
Reduce places removed 532 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 537 rules applied. Total rules applied 1069 place count 2321 transition count 2933
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1073 place count 2318 transition count 2932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1074 place count 2317 transition count 2932
Performed 768 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 768 Pre rules applied. Total rules applied 1074 place count 2317 transition count 2164
Deduced a syphon composed of 768 places in 5 ms
Ensure Unique test removed 73 places
Reduce places removed 841 places and 0 transitions.
Iterating global reduction 4 with 1609 rules applied. Total rules applied 2683 place count 1476 transition count 2164
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 53 rules applied. Total rules applied 2736 place count 1469 transition count 2118
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 2782 place count 1423 transition count 2118
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 2782 place count 1423 transition count 2090
Deduced a syphon composed of 28 places in 5 ms
Ensure Unique test removed 28 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 2866 place count 1367 transition count 2090
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 2866 place count 1367 transition count 2062
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2922 place count 1339 transition count 2062
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2924 place count 1337 transition count 2053
Iterating global reduction 6 with 2 rules applied. Total rules applied 2926 place count 1337 transition count 2053
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2927 place count 1336 transition count 2045
Iterating global reduction 6 with 1 rules applied. Total rules applied 2928 place count 1336 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2929 place count 1335 transition count 2037
Iterating global reduction 6 with 1 rules applied. Total rules applied 2930 place count 1335 transition count 2037
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 225
Deduced a syphon composed of 225 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 6 with 452 rules applied. Total rules applied 3382 place count 1108 transition count 1812
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3386 place count 1104 transition count 1808
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3391 place count 1103 transition count 1808
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 6 with 1 rules applied. Total rules applied 3392 place count 1103 transition count 1807
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3393 place count 1102 transition count 1807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3393 place count 1102 transition count 1806
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3395 place count 1101 transition count 1806
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3397 place count 1099 transition count 1804
Iterating global reduction 8 with 2 rules applied. Total rules applied 3399 place count 1099 transition count 1804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 3401 place count 1099 transition count 1802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3402 place count 1098 transition count 1802
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3406 place count 1096 transition count 1826
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3407 place count 1096 transition count 1826
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3408 place count 1095 transition count 1825
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 21 rules applied. Total rules applied 3429 place count 1081 transition count 1818
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3436 place count 1074 transition count 1818
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 21 Pre rules applied. Total rules applied 3436 place count 1074 transition count 1797
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 12 with 43 rules applied. Total rules applied 3479 place count 1052 transition count 1797
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 3494 place count 1037 transition count 1797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3494 place count 1037 transition count 1796
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3496 place count 1036 transition count 1796
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 13 with 44 rules applied. Total rules applied 3540 place count 1014 transition count 1774
Discarding 14 places :
Symmetric choice reduction at 13 with 14 rule applications. Total rules 3554 place count 1000 transition count 1760
Iterating global reduction 13 with 14 rules applied. Total rules applied 3568 place count 1000 transition count 1760
Discarding 7 places :
Symmetric choice reduction at 13 with 7 rule applications. Total rules 3575 place count 993 transition count 1753
Iterating global reduction 13 with 7 rules applied. Total rules applied 3582 place count 993 transition count 1753
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 3589 place count 993 transition count 1746
Applied a total of 3589 rules in 678 ms. Remains 993 /2854 variables (removed 1861) and now considering 1746/3471 (removed 1725) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12793804285018823521.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13621217842999144273.kers'
[2026-05-22 20:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12793804285018823521.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13621217842999144273.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 3 ms.
// Phase 1: matrix 1746 rows 972 cols 6843 entries
Finished phase 1 with 216 SingleSign rule and 613 generalized
[2026-05-22 20:27:58] [INFO ] Computed 164 invariants in 57 ms
Computed 164 P flows in 58 ms.
Exported basis to /tmp/petrispot-output-13621217842999144273.kers
Total runtime 59 ms.
[2026-05-22 20:27:59] [INFO ] Implicit Places using invariants in 1308 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 204, 258, 259, 271, 272, 274, 291, 309, 329, 380, 381, 393, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 637, 638, 640, 657, 675, 695, 746, 747, 759, 760, 762, 779, 797, 817, 870, 871, 874, 885, 886, 888, 906, 927, 928, 929, 930, 989, 992]
[2026-05-22 20:27:59] [INFO ] Actually due to overlaps returned [906, 888, 48, 167, 291, 413, 535, 657, 779, 31, 147, 150, 271, 274, 393, 396, 515, 518, 637, 640, 759, 762, 885, 927, 989, 148, 272, 394, 516, 638, 760, 886, 928, 1, 18, 258, 259, 380, 381, 502, 503, 624, 625, 746, 747, 870, 871, 929, 19, 66, 86, 137, 185, 204, 309, 329, 431, 451, 553, 573, 675, 695, 797, 817, 874, 930]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1328 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 927/2854 places, 1746/3471 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 927 transition count 1629
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 810 transition count 1629
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 234 place count 810 transition count 1594
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 305 place count 774 transition count 1594
Discarding 4 places :
Implicit places reduction removed 4 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 2 with 12 rules applied. Total rules applied 317 place count 770 transition count 1586
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 325 place count 762 transition count 1586
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 328 place count 759 transition count 1583
Iterating global reduction 4 with 3 rules applied. Total rules applied 331 place count 759 transition count 1583
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 334 place count 759 transition count 1580
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 440 place count 706 transition count 1527
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 450 place count 701 transition count 1540
Applied a total of 450 rules in 108 ms. Remains 701 /927 variables (removed 226) and now considering 1540/1746 (removed 206) transitions.
[2026-05-22 20:27:59] [INFO ] Flow matrix only has 1536 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15177273991578440081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9444159905209055029.kers'
[2026-05-22 20:27:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15177273991578440081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9444159905209055029.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1536 rows 701 cols 6202 entries
Finished phase 1 with 197 SingleSign rule and 411 generalized
[2026-05-22 20:27:59] [INFO ] Computed 93 invariants in 32 ms
Computed 93 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-9444159905209055029.kers
Total runtime 34 ms.
[2026-05-22 20:28:00] [INFO ] Implicit Places using invariants in 679 ms returned [88, 94, 99, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 618, 624, 629, 694, 700]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 684 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 678/2854 places, 1540/3471 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 678 transition count 1539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 677 transition count 1539
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 16 place count 663 transition count 1518
Iterating global reduction 2 with 14 rules applied. Total rules applied 30 place count 663 transition count 1518
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 43 place count 650 transition count 1505
Iterating global reduction 2 with 13 rules applied. Total rules applied 56 place count 650 transition count 1505
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 644 transition count 1499
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 644 transition count 1499
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 84 place count 636 transition count 1491
Applied a total of 84 rules in 91 ms. Remains 636 /678 variables (removed 42) and now considering 1491/1540 (removed 49) transitions.
[2026-05-22 20:28:00] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3895022683027865259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8398615620646879315.kers'
[2026-05-22 20:28:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3895022683027865259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8398615620646879315.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1487 rows 636 cols 6006 entries
Finished phase 1 with 189 SingleSign rule and 377 generalized
[2026-05-22 20:28:00] [INFO ] Computed 70 invariants in 14 ms
Computed 70 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8398615620646879315.kers
Total runtime 15 ms.
[2026-05-22 20:28:01] [INFO ] Implicit Places using invariants in 554 ms returned []
[2026-05-22 20:28:01] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:28:01] [INFO ] Invariant cache hit.
[2026-05-22 20:28:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:28:02] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 636/2854 places, 1491/3471 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5066 ms. Remains : 636/2854 places, 1491/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-03
Product exploration explored 100000 steps with 1224 reset in 289 ms.
Product exploration explored 100000 steps with 1218 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 17993 steps (216 resets) in 86 ms. (206 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 242 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 636 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 636/636 places, 1491/1491 transitions.
Applied a total of 0 rules in 29 ms. Remains 636 /636 variables (removed 0) and now considering 1491/1491 (removed 0) transitions.
[2026-05-22 20:28:03] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:28:03] [INFO ] Invariant cache hit.
[2026-05-22 20:28:04] [INFO ] Implicit Places using invariants in 535 ms returned []
[2026-05-22 20:28:04] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:28:04] [INFO ] Invariant cache hit.
[2026-05-22 20:28:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:28:06] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
[2026-05-22 20:28:06] [INFO ] Redundant transitions in 116 ms returned []
Running 1441 sub problems to find dead transitions.
[2026-05-22 20:28:06] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:28:06] [INFO ] Invariant cache hit.
[2026-05-22 20:28:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/2123 variables, and 54 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 39/51 constraints, State Equation: 0/636 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1441/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/2123 variables, and 54 constraints, problems are : Problem set: 0 solved, 1441 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 15/19 constraints, Generalized P Invariants (flows): 39/51 constraints, State Equation: 0/636 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1441 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 1441 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62922 ms. Remains : 636/636 places, 1491/1491 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 7587 steps (85 resets) in 35 ms. (210 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 344 ms.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1173 reset in 296 ms.
Product exploration explored 100000 steps with 1222 reset in 234 ms.
Built C files in :
/tmp/ltsmin2619941758518240634
[2026-05-22 20:29:07] [INFO ] Computing symmetric may disable matrix : 1491 transitions.
[2026-05-22 20:29:07] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:07] [INFO ] Computing symmetric may enable matrix : 1491 transitions.
[2026-05-22 20:29:07] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:08] [INFO ] Computing Do-Not-Accords matrix : 1491 transitions.
[2026-05-22 20:29:08] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:08] [INFO ] Built C files in 539ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2619941758518240634
Running compilation step : cd /tmp/ltsmin2619941758518240634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2619941758518240634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2619941758518240634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 636 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 636/636 places, 1491/1491 transitions.
Applied a total of 0 rules in 21 ms. Remains 636 /636 variables (removed 0) and now considering 1491/1491 (removed 0) transitions.
[2026-05-22 20:29:11] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:29:11] [INFO ] Invariant cache hit.
[2026-05-22 20:29:11] [INFO ] Implicit Places using invariants in 468 ms returned []
[2026-05-22 20:29:11] [INFO ] Flow matrix only has 1487 transitions (discarded 4 similar events)
[2026-05-22 20:29:11] [INFO ] Invariant cache hit.
[2026-05-22 20:29:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:29:13] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
[2026-05-22 20:29:13] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2194 ms. Remains : 636/636 places, 1491/1491 transitions.
Built C files in :
/tmp/ltsmin16450740129028662931
[2026-05-22 20:29:13] [INFO ] Computing symmetric may disable matrix : 1491 transitions.
[2026-05-22 20:29:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:13] [INFO ] Computing symmetric may enable matrix : 1491 transitions.
[2026-05-22 20:29:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:14] [INFO ] Computing Do-Not-Accords matrix : 1491 transitions.
[2026-05-22 20:29:14] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:29:14] [INFO ] Built C files in 400ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16450740129028662931
Running compilation step : cd /tmp/ltsmin16450740129028662931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16450740129028662931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16450740129028662931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:29:17] [INFO ] Flatten gal took : 33 ms
[2026-05-22 20:29:17] [INFO ] Flatten gal took : 30 ms
[2026-05-22 20:29:17] [INFO ] Time to serialize gal into /tmp/LTL7911335098029593801.gal : 7 ms
[2026-05-22 20:29:17] [INFO ] Time to serialize properties into /tmp/LTL2856532504837652006.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7911335098029593801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut418377388522323073.hoa' '-atoms' '/tmp/LTL2856532504837652006.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2856532504837652006.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut418377388522323073.hoa
Detected timeout of ITS tools.
[2026-05-22 20:29:32] [INFO ] Flatten gal took : 32 ms
[2026-05-22 20:29:32] [INFO ] Flatten gal took : 33 ms
[2026-05-22 20:29:32] [INFO ] Time to serialize gal into /tmp/LTL17099475090178795014.gal : 6 ms
[2026-05-22 20:29:32] [INFO ] Time to serialize properties into /tmp/LTL14590571682237843789.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17099475090178795014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14590571682237843789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p669==0)||(p3218==1))||(p2647==1))"))))
Formula 0 simplified : FG!"(((p669==0)||(p3218==1))||(p2647==1))"
Detected timeout of ITS tools.
[2026-05-22 20:29:47] [INFO ] Flatten gal took : 29 ms
[2026-05-22 20:29:47] [INFO ] Applying decomposition
[2026-05-22 20:29:47] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10897744079973031289.txt' '-o' '/tmp/graph10897744079973031289.bin' '-w' '/tmp/graph10897744079973031289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10897744079973031289.bin' '-l' '-1' '-v' '-w' '/tmp/graph10897744079973031289.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:29:47] [INFO ] Decomposing Gal with order
[2026-05-22 20:29:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:29:47] [INFO ] Removed a total of 2867 redundant transitions.
[2026-05-22 20:29:47] [INFO ] Flatten gal took : 56 ms
[2026-05-22 20:29:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 21 ms.
[2026-05-22 20:29:47] [INFO ] Time to serialize gal into /tmp/LTL16324766549792512878.gal : 10 ms
[2026-05-22 20:29:47] [INFO ] Time to serialize properties into /tmp/LTL7920780090308181660.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16324766549792512878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7920780090308181660.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i4.u45.p669==0)||(u146.p3218==1))||(i14.u135.p2647==1))"))))
Formula 0 simplified : FG!"(((i4.u45.p669==0)||(u146.p3218==1))||(i14.u135.p2647==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07b-LTLCardinality-03 finished in 125039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2847 transition count 3457
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2847 transition count 3457
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 2843 transition count 3446
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2843 transition count 3446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 2843 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2842 transition count 3444
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2842 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2841 transition count 3436
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2841 transition count 3436
Applied a total of 27 rules in 876 ms. Remains 2841 /2854 variables (removed 13) and now considering 3436/3471 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2852973615843209951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8818073294329765755.kers'
[2026-05-22 20:30:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2852973615843209951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8818073294329765755.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3436 rows 2841 cols 10606 entries
Finished phase 1 with 1846 SingleSign rule and 690 generalized
[2026-05-22 20:30:03] [INFO ] Computed 305 invariants in 27 ms
Computed 305 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-8818073294329765755.kers
Total runtime 34 ms.
[2026-05-22 20:30:05] [INFO ] Implicit Places using invariants in 1885 ms returned []
[2026-05-22 20:30:05] [INFO ] Invariant cache hit.
[2026-05-22 20:30:14] [INFO ] Implicit Places using invariants and state equation in 8920 ms returned []
Implicit Place search using SMT with State Equation took 10827 ms to find 0 implicit places.
Running 3435 sub problems to find dead transitions.
[2026-05-22 20:30:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 3435/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 0/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61579ms problems are : Problem set: 0 solved, 3435 unsolved
Search for dead transitions found 0 dead transitions in 61589ms
Starting structural reductions in LTL mode, iteration 1 : 2841/2854 places, 3436/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73317 ms. Remains : 2841/2854 places, 3436/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 221 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-07b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07b-LTLCardinality-04 finished in 73516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X(p0) U p1)) U X(X(!p2)))||X(F(p3))))'
Support contains 6 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2848 transition count 3458
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2848 transition count 3458
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 2844 transition count 3447
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2844 transition count 3447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 2844 transition count 3446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 2843 transition count 3445
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 2843 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2842 transition count 3437
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2842 transition count 3437
Applied a total of 25 rules in 826 ms. Remains 2842 /2854 variables (removed 12) and now considering 3437/3471 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8801588543886728022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9554723209358211959.kers'
[2026-05-22 20:31:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8801588543886728022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9554723209358211959.kers]
Culled 0 columns in 5 ms.
// Phase 1: matrix 3437 rows 2842 cols 10608 entries
Finished phase 1 with 1847 SingleSign rule and 690 generalized
[2026-05-22 20:31:17] [INFO ] Computed 305 invariants in 55 ms
Computed 305 P flows in 68 ms.
Exported basis to /tmp/petrispot-output-9554723209358211959.kers
Total runtime 71 ms.
[2026-05-22 20:31:19] [INFO ] Implicit Places using invariants in 1850 ms returned []
[2026-05-22 20:31:19] [INFO ] Invariant cache hit.
[2026-05-22 20:31:30] [INFO ] Implicit Places using invariants and state equation in 11777 ms returned []
Implicit Place search using SMT with State Equation took 13634 ms to find 0 implicit places.
Running 3436 sub problems to find dead transitions.
[2026-05-22 20:31:30] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 3436/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 0/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61602ms problems are : Problem set: 0 solved, 3436 unsolved
Search for dead transitions found 0 dead transitions in 61608ms
Starting structural reductions in LTL mode, iteration 1 : 2842/2854 places, 3437/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76079 ms. Remains : 2842/2854 places, 3437/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X(p0) U p1)) U X(X(!p2)))||X(F(p3))))'
Stuttering acceptance computed with spot in 329 ms :[(AND p2 (NOT p3)), (AND (NOT p3) (NOT p0) p2), (AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) (NOT p0) p2), (AND p2 (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-08
Product exploration explored 100000 steps with 161 reset in 416 ms.
Product exploration explored 100000 steps with 153 reset in 453 ms.
Computed a total of 116 stabilizing places and 116 stable transitions
Computed a total of 116 stabilizing places and 116 stable transitions
Knowledge based reduction with 13 factoid took 69 ms. Reduced automaton from 9 states, 15 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (59 resets) in 388 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 135654 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 9
Probabilistic random walk after 135654 steps, saw 28174 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2026-05-22 20:32:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 881/1043 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1672/2715 variables, 203/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2715 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 127/2842 variables, 40/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2842 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 3437/6279 variables, 2842/3147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6279 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/6279 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6279/6279 variables, and 3147 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4753 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 243/243 constraints, State Equation: 2842/2842 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 881/1043 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 1672/2715 variables, 203/266 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2715 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 127/2842 variables, 40/306 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2842/6279 variables, and 306 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 243/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9817ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 2842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2842/2842 places, 3437/3437 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 526 rules applied. Total rules applied 526 place count 2842 transition count 2911
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 529 rules applied. Total rules applied 1055 place count 2316 transition count 2908
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1058 place count 2314 transition count 2907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1059 place count 2313 transition count 2907
Performed 766 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 766 Pre rules applied. Total rules applied 1059 place count 2313 transition count 2141
Deduced a syphon composed of 766 places in 4 ms
Ensure Unique test removed 73 places
Reduce places removed 839 places and 0 transitions.
Iterating global reduction 4 with 1605 rules applied. Total rules applied 2664 place count 1474 transition count 2141
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 52 rules applied. Total rules applied 2716 place count 1466 transition count 2097
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 45 rules applied. Total rules applied 2761 place count 1422 transition count 2096
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2762 place count 1421 transition count 2096
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 2762 place count 1421 transition count 2067
Deduced a syphon composed of 29 places in 6 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 87 rules applied. Total rules applied 2849 place count 1363 transition count 2067
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 2849 place count 1363 transition count 2039
Deduced a syphon composed of 28 places in 5 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 2905 place count 1335 transition count 2039
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 7 with 458 rules applied. Total rules applied 3363 place count 1105 transition count 1811
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3367 place count 1101 transition count 1807
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 3372 place count 1100 transition count 1807
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 7 with 1 rules applied. Total rules applied 3373 place count 1100 transition count 1806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3374 place count 1099 transition count 1806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3374 place count 1099 transition count 1805
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3376 place count 1098 transition count 1805
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3378 place count 1096 transition count 1803
Iterating global reduction 9 with 2 rules applied. Total rules applied 3380 place count 1096 transition count 1803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3382 place count 1096 transition count 1801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3383 place count 1095 transition count 1801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3385 place count 1094 transition count 1806
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3393 place count 1094 transition count 1798
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3401 place count 1086 transition count 1798
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3408 place count 1086 transition count 1791
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3415 place count 1079 transition count 1791
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 3422 place count 1079 transition count 1791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3423 place count 1078 transition count 1790
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 13 with 21 rules applied. Total rules applied 3444 place count 1064 transition count 1783
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 3451 place count 1057 transition count 1783
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 21 Pre rules applied. Total rules applied 3451 place count 1057 transition count 1762
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 15 with 43 rules applied. Total rules applied 3494 place count 1035 transition count 1762
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 15 with 8 rules applied. Total rules applied 3502 place count 1027 transition count 1762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3502 place count 1027 transition count 1761
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3504 place count 1026 transition count 1761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 3534 place count 1011 transition count 1746
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 3541 place count 1004 transition count 1739
Iterating global reduction 16 with 7 rules applied. Total rules applied 3548 place count 1004 transition count 1739
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 3555 place count 1004 transition count 1732
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 3562 place count 997 transition count 1732
Applied a total of 3562 rules in 662 ms. Remains 997 /2842 variables (removed 1845) and now considering 1732/3437 (removed 1705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 997/2842 places, 1732/3437 transitions.
RANDOM walk for 40000 steps (407 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (59 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (60 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (59 resets) in 89 ms. (444 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (59 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (59 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 178588 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 8
Probabilistic random walk after 178588 steps, saw 41845 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) 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-13086408711025128517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5670969434629032708.kers'
[2026-05-22 20:32:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13086408711025128517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5670969434629032708.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 1732 rows 981 cols 6809 entries
Finished phase 1 with 254 SingleSign rule and 574 generalized
[2026-05-22 20:32:51] [INFO ] Computed 169 invariants in 15 ms
Computed 169 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-5670969434629032708.kers
Total runtime 17 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 184/325 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 53/378 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 137/524 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 120/644 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 21/665 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 2/667 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/667 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 240/907 variables, 41/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/907 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/907 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 62/969 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/969 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 1/970 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/970 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 25/995 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/995 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 2/997 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/997 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 1732/2729 variables, 997/1167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2729 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (OVERLAPS) 0/2729 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2729/2729 variables, and 1167 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4036 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 997/997 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 184/325 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 53/378 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 137/524 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 120/644 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 21/665 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 2/667 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/667 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 240/907 variables, 41/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/907 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 62/969 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/969 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 1/970 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/970 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (OVERLAPS) 25/995 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/995 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 2/997 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/997 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 34 (OVERLAPS) 1732/2729 variables, 997/1167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2729 variables, 8/1175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2729 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 0/2729 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2729/2729 variables, and 1175 constraints, problems are : Problem set: 0 solved, 8 unsolved in 12266 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 997/997 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16369ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5094 ms.
Support contains 6 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1732/1732 transitions.
Applied a total of 0 rules in 31 ms. Remains 997 /997 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 997/997 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1732/1732 transitions.
Applied a total of 0 rules in 29 ms. Remains 997 /997 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 20:33:12] [INFO ] Invariant cache hit.
[2026-05-22 20:33:13] [INFO ] Implicit Places using invariants in 1216 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 504, 508, 509, 520, 522, 524, 541, 559, 628, 632, 633, 644, 645, 647, 664, 682, 751, 755, 756, 767, 768, 770, 788, 806, 876, 880, 881, 884, 895, 896, 897, 915, 936, 937, 938, 939]
[2026-05-22 20:33:13] [INFO ] Actually due to overlaps returned [915, 897, 48, 168, 293, 416, 541, 664, 788, 31, 151, 274, 399, 524, 647, 770, 148, 271, 396, 520, 644, 767, 895, 936, 149, 272, 397, 522, 645, 768, 896, 937, 1, 18, 259, 260, 384, 385, 508, 509, 632, 633, 755, 756, 880, 881, 66, 186, 311, 434, 559, 682, 806, 938, 19, 884, 939]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1221 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 940/997 places, 1732/1732 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 933 transition count 1609
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 258 place count 810 transition count 1604
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 258 place count 810 transition count 1569
Deduced a syphon composed of 35 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 329 place count 774 transition count 1569
Discarding 4 places :
Implicit places reduction removed 4 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 2 with 12 rules applied. Total rules applied 341 place count 770 transition count 1561
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 349 place count 762 transition count 1561
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 352 place count 759 transition count 1558
Iterating global reduction 4 with 3 rules applied. Total rules applied 355 place count 759 transition count 1558
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 358 place count 759 transition count 1555
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 454 place count 711 transition count 1507
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 461 place count 704 transition count 1500
Iterating global reduction 5 with 7 rules applied. Total rules applied 468 place count 704 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 475 place count 704 transition count 1493
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 479 place count 702 transition count 1494
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 480 place count 702 transition count 1493
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 495 place count 702 transition count 1478
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 511 place count 686 transition count 1478
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 512 place count 686 transition count 1477
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 533 place count 686 transition count 1477
Applied a total of 533 rules in 240 ms. Remains 686 /940 variables (removed 254) and now considering 1477/1732 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10584429517399582734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18098580908040118797.kers'
[2026-05-22 20:33:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10584429517399582734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18098580908040118797.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1477 rows 685 cols 6037 entries
Finished phase 1 with 200 SingleSign rule and 387 generalized
[2026-05-22 20:33:14] [INFO ] Computed 99 invariants in 37 ms
Computed 99 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-18098580908040118797.kers
Total runtime 41 ms.
[2026-05-22 20:33:15] [INFO ] Implicit Places using invariants in 1431 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 246, 262, 268, 271, 273, 279, 280, 334, 350, 356, 359, 361, 366, 367, 421, 437, 443, 446, 448, 453, 454, 507, 523, 529, 532, 534, 539, 540, 594, 611, 617, 620, 622]
[2026-05-22 20:33:15] [INFO ] Actually due to overlaps returned [104, 190, 279, 366, 453, 539, 105, 191, 280, 367, 454, 540, 89, 95, 100, 174, 180, 185, 262, 268, 273, 350, 356, 361, 437, 443, 448, 523, 529, 534, 611, 617, 622, 73, 101, 158, 246, 334, 421, 507, 594]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1456 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 645/997 places, 1477/1732 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 619 transition count 1451
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 619 transition count 1451
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 612 transition count 1444
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 612 transition count 1444
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 598 transition count 1430
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 115 place count 598 transition count 1409
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 136 place count 577 transition count 1409
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 143 place count 577 transition count 1402
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 150 place count 570 transition count 1402
Applied a total of 150 rules in 115 ms. Remains 570 /645 variables (removed 75) and now considering 1402/1477 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8545733381346786762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9152901596959161480.kers'
[2026-05-22 20:33:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8545733381346786762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9152901596959161480.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1402 rows 570 cols 5719 entries
Finished phase 1 with 124 SingleSign rule and 388 generalized
[2026-05-22 20:33:15] [INFO ] Computed 58 invariants in 37 ms
Computed 58 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-9152901596959161480.kers
Total runtime 53 ms.
[2026-05-22 20:33:16] [INFO ] Implicit Places using invariants in 501 ms returned []
[2026-05-22 20:33:16] [INFO ] Invariant cache hit.
[2026-05-22 20:33:17] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1842 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 570/997 places, 1402/1732 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4903 ms. Remains : 570/997 places, 1402/1732 transitions.
RANDOM walk for 40000 steps (685 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (122 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (127 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (123 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (127 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (122 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (125 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (125 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 252490 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 8
Probabilistic random walk after 252490 steps, saw 59196 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2026-05-22 20:33:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 628 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 8/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1972 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1972 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1972/1972 variables, and 636 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7632ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 965 ms.
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 570/570 places, 1402/1402 transitions.
RANDOM walk for 40000 steps (716 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (106 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (126 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (126 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (123 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 168733 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 6
Probabilistic random walk after 168733 steps, saw 42291 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2026-05-22 20:33:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 628 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 6/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1972 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1972 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1972/1972 variables, and 634 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4517 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5796ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2020 ms.
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 21 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 570/570 places, 1402/1402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 21 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2026-05-22 20:33:40] [INFO ] Invariant cache hit.
[2026-05-22 20:33:41] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-05-22 20:33:41] [INFO ] Invariant cache hit.
[2026-05-22 20:33:42] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2026-05-22 20:33:42] [INFO ] Redundant transitions in 19 ms returned []
Running 1365 sub problems to find dead transitions.
[2026-05-22 20:33:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/1972 variables, and 56 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 1365/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/1972 variables, and 56 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 0/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60539ms problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 60541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62543 ms. Remains : 570/570 places, 1402/1402 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 194 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-367799209085933444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4728024214929509741.kers'
[2026-05-22 20:34:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-367799209085933444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4728024214929509741.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 3437 rows 2842 cols 10608 entries
Finished phase 1 with 1847 SingleSign rule and 690 generalized
[2026-05-22 20:34:43] [INFO ] Computed 305 invariants in 62 ms
Computed 305 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-4728024214929509741.kers
Total runtime 82 ms.
[2026-05-22 20:34:46] [INFO ] [Real]Absence check using 62 positive place invariants in 206 ms returned sat
[2026-05-22 20:34:58] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-22 20:34:58] [INFO ] [Real]Absence check using 62 positive and 243 generalized place invariants in 11953 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 20:34:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (AND p2 (NOT p3))
Could not prove EG (AND p2 (NOT p3))
Knowledge-based reduction took 145064 ms.
Stuttering acceptance computed with spot in 225 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Support contains 6 out of 2842 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2842/2842 places, 3437/3437 transitions.
Applied a total of 0 rules in 186 ms. Remains 2842 /2842 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-22 20:34:59] [INFO ] Invariant cache hit.
[2026-05-22 20:35:01] [INFO ] Implicit Places using invariants in 1886 ms returned []
[2026-05-22 20:35:01] [INFO ] Invariant cache hit.
[2026-05-22 20:35:13] [INFO ] Implicit Places using invariants and state equation in 12617 ms returned []
Implicit Place search using SMT with State Equation took 14512 ms to find 0 implicit places.
Running 3436 sub problems to find dead transitions.
[2026-05-22 20:35:13] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 3436/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 0/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61418ms problems are : Problem set: 0 solved, 3436 unsolved
Search for dead transitions found 0 dead transitions in 61425ms
Finished structural reductions in LTL mode , in 1 iterations and 76130 ms. Remains : 2842/2842 places, 3437/3437 transitions.
Computed a total of 116 stabilizing places and 116 stable transitions
Computed a total of 116 stabilizing places and 116 stable transitions
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (65 resets) in 350 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 151917 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 6
Probabilistic random walk after 151917 steps, saw 30746 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
[2026-05-22 20:36:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 881/1043 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1672/2715 variables, 203/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2715 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 127/2842 variables, 40/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2842 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3437/6279 variables, 2842/3147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/6279 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/6279 variables, 0/3147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6279/6279 variables, and 3147 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 243/243 constraints, State Equation: 2842/2842 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 156/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 881/1043 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1672/2715 variables, 203/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2715 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 9414ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 2842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2842/2842 places, 3437/3437 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 526 transitions
Trivial Post-agglo rules discarded 526 transitions
Performed 526 trivial Post agglomeration. Transition count delta: 526
Iterating post reduction 0 with 526 rules applied. Total rules applied 526 place count 2842 transition count 2911
Reduce places removed 526 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 529 rules applied. Total rules applied 1055 place count 2316 transition count 2908
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1058 place count 2314 transition count 2907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1059 place count 2313 transition count 2907
Performed 766 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 766 Pre rules applied. Total rules applied 1059 place count 2313 transition count 2141
Deduced a syphon composed of 766 places in 6 ms
Ensure Unique test removed 73 places
Reduce places removed 839 places and 0 transitions.
Iterating global reduction 4 with 1605 rules applied. Total rules applied 2664 place count 1474 transition count 2141
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 52 rules applied. Total rules applied 2716 place count 1466 transition count 2097
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 45 rules applied. Total rules applied 2761 place count 1422 transition count 2096
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2762 place count 1421 transition count 2096
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 2762 place count 1421 transition count 2067
Deduced a syphon composed of 29 places in 5 ms
Ensure Unique test removed 29 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 7 with 87 rules applied. Total rules applied 2849 place count 1363 transition count 2067
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 2849 place count 1363 transition count 2039
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 2905 place count 1335 transition count 2039
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 7 with 458 rules applied. Total rules applied 3363 place count 1105 transition count 1811
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3367 place count 1101 transition count 1807
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 3372 place count 1100 transition count 1807
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 7 with 1 rules applied. Total rules applied 3373 place count 1100 transition count 1806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3374 place count 1099 transition count 1806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3374 place count 1099 transition count 1805
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3376 place count 1098 transition count 1805
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3378 place count 1096 transition count 1803
Iterating global reduction 9 with 2 rules applied. Total rules applied 3380 place count 1096 transition count 1803
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3382 place count 1096 transition count 1801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3383 place count 1095 transition count 1801
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3385 place count 1094 transition count 1806
Free-agglomeration rule applied 8 times.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3393 place count 1094 transition count 1798
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 3401 place count 1086 transition count 1798
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 12 with 7 rules applied. Total rules applied 3408 place count 1086 transition count 1791
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3415 place count 1079 transition count 1791
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 3422 place count 1079 transition count 1791
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3423 place count 1078 transition count 1790
Reduce places removed 14 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 13 with 21 rules applied. Total rules applied 3444 place count 1064 transition count 1783
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 3451 place count 1057 transition count 1783
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 21 Pre rules applied. Total rules applied 3451 place count 1057 transition count 1762
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 15 with 43 rules applied. Total rules applied 3494 place count 1035 transition count 1762
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 15 with 8 rules applied. Total rules applied 3502 place count 1027 transition count 1762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3502 place count 1027 transition count 1761
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3504 place count 1026 transition count 1761
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 3534 place count 1011 transition count 1746
Discarding 7 places :
Symmetric choice reduction at 16 with 7 rule applications. Total rules 3541 place count 1004 transition count 1739
Iterating global reduction 16 with 7 rules applied. Total rules applied 3548 place count 1004 transition count 1739
Free-agglomeration rule applied 7 times.
Iterating global reduction 16 with 7 rules applied. Total rules applied 3555 place count 1004 transition count 1732
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 3562 place count 997 transition count 1732
Applied a total of 3562 rules in 684 ms. Remains 997 /2842 variables (removed 1845) and now considering 1732/3437 (removed 1705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 684 ms. Remains : 997/2842 places, 1732/3437 transitions.
RANDOM walk for 40000 steps (433 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (61 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (58 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (59 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 197004 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 6
Probabilistic random walk after 197004 steps, saw 45526 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) 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-14642381178707594246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3785374548866196281.kers'
[2026-05-22 20:36:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14642381178707594246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3785374548866196281.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 1732 rows 981 cols 6809 entries
Finished phase 1 with 254 SingleSign rule and 574 generalized
[2026-05-22 20:36:32] [INFO ] Computed 169 invariants in 15 ms
Computed 169 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-3785374548866196281.kers
Total runtime 17 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 184/325 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 53/378 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 137/524 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 120/644 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 21/665 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/667 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/667 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 240/907 variables, 41/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/907 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/907 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 62/969 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/969 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 1/970 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/970 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 25/995 variables, 8/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/995 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 2/997 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/997 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 1732/2729 variables, 997/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2729 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 0/2729 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2729/2729 variables, and 1167 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3484 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 997/997 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/139 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/141 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 184/325 variables, 25/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 53/378 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 9/387 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 137/524 variables, 22/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 120/644 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/644 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 21/665 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 2/667 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/667 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 240/907 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/907 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 62/969 variables, 14/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/969 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/970 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/970 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 25/995 variables, 8/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/995 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 2/997 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/997 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (OVERLAPS) 1732/2729 variables, 997/1168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2729 variables, 6/1174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2729 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 0/2729 variables, 0/1174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2729/2729 variables, and 1174 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7289 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 96/96 constraints, State Equation: 997/997 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10804ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1530 ms.
Support contains 6 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1732/1732 transitions.
Applied a total of 0 rules in 34 ms. Remains 997 /997 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 997/997 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 1732/1732 transitions.
Applied a total of 0 rules in 33 ms. Remains 997 /997 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 20:36:44] [INFO ] Invariant cache hit.
[2026-05-22 20:36:45] [INFO ] Implicit Places using invariants in 1046 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 504, 508, 509, 520, 522, 524, 541, 559, 628, 632, 633, 644, 645, 647, 664, 682, 751, 755, 756, 767, 768, 770, 788, 806, 876, 880, 881, 884, 895, 896, 897, 915, 936, 937, 938, 939]
[2026-05-22 20:36:45] [INFO ] Actually due to overlaps returned [915, 897, 48, 168, 293, 416, 541, 664, 788, 31, 151, 274, 399, 524, 647, 770, 148, 271, 396, 520, 644, 767, 895, 936, 149, 272, 397, 522, 645, 768, 896, 937, 1, 18, 259, 260, 384, 385, 508, 509, 632, 633, 755, 756, 880, 881, 66, 186, 311, 434, 559, 682, 806, 938, 19, 884, 939]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 1053 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 940/997 places, 1732/1732 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 933 transition count 1609
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 128 rules applied. Total rules applied 258 place count 810 transition count 1604
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 258 place count 810 transition count 1569
Deduced a syphon composed of 35 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 329 place count 774 transition count 1569
Discarding 4 places :
Implicit places reduction removed 4 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 2 with 12 rules applied. Total rules applied 341 place count 770 transition count 1561
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 349 place count 762 transition count 1561
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 352 place count 759 transition count 1558
Iterating global reduction 4 with 3 rules applied. Total rules applied 355 place count 759 transition count 1558
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 358 place count 759 transition count 1555
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 454 place count 711 transition count 1507
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 461 place count 704 transition count 1500
Iterating global reduction 5 with 7 rules applied. Total rules applied 468 place count 704 transition count 1500
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 475 place count 704 transition count 1493
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 479 place count 702 transition count 1494
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 480 place count 702 transition count 1493
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 495 place count 702 transition count 1478
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 511 place count 686 transition count 1478
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 512 place count 686 transition count 1477
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 533 place count 686 transition count 1477
Applied a total of 533 rules in 198 ms. Remains 686 /940 variables (removed 254) and now considering 1477/1732 (removed 255) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4547642153898196420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14363900054894305260.kers'
[2026-05-22 20:36:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4547642153898196420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14363900054894305260.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1477 rows 685 cols 6037 entries
Finished phase 1 with 200 SingleSign rule and 387 generalized
[2026-05-22 20:36:45] [INFO ] Computed 99 invariants in 36 ms
Computed 99 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-14363900054894305260.kers
Total runtime 40 ms.
[2026-05-22 20:36:46] [INFO ] Implicit Places using invariants in 898 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 158, 174, 180, 183, 185, 190, 191, 246, 262, 268, 271, 273, 279, 280, 334, 350, 356, 359, 361, 366, 367, 421, 437, 443, 446, 448, 453, 454, 507, 523, 529, 532, 534, 539, 540, 594, 611, 617, 620, 622]
[2026-05-22 20:36:46] [INFO ] Actually due to overlaps returned [104, 190, 279, 366, 453, 539, 105, 191, 280, 367, 454, 540, 89, 95, 100, 174, 180, 185, 262, 268, 273, 350, 356, 361, 437, 443, 448, 523, 529, 534, 611, 617, 622, 73, 101, 158, 246, 334, 421, 507, 594]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 901 ms to find 41 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 645/997 places, 1477/1732 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 619 transition count 1451
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 619 transition count 1451
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 612 transition count 1444
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 612 transition count 1444
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 598 transition count 1430
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 115 place count 598 transition count 1409
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 136 place count 577 transition count 1409
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 143 place count 577 transition count 1402
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 150 place count 570 transition count 1402
Applied a total of 150 rules in 135 ms. Remains 570 /645 variables (removed 75) and now considering 1402/1477 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16213148537233792468.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8287315147033988087.kers'
[2026-05-22 20:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16213148537233792468.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8287315147033988087.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1402 rows 570 cols 5719 entries
Finished phase 1 with 124 SingleSign rule and 388 generalized
[2026-05-22 20:36:46] [INFO ] Computed 58 invariants in 38 ms
Computed 58 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-8287315147033988087.kers
Total runtime 41 ms.
[2026-05-22 20:36:47] [INFO ] Implicit Places using invariants in 689 ms returned []
[2026-05-22 20:36:47] [INFO ] Invariant cache hit.
[2026-05-22 20:36:48] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 570/997 places, 1402/1732 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4458 ms. Remains : 570/997 places, 1402/1732 transitions.
RANDOM walk for 40000 steps (656 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (122 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (125 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (127 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (125 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 288604 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 6
Probabilistic random walk after 288604 steps, saw 64468 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2026-05-22 20:36:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 628 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 6/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1972 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1972 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1972/1972 variables, and 634 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3889 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5124ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 1075 ms.
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 19 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 570/570 places, 1402/1402 transitions.
RANDOM walk for 40000 steps (710 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (120 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (131 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (125 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (127 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 284556 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 4
Probabilistic random walk after 284556 steps, saw 64053 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-22 20:37:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1972 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1972/1972 variables, and 628 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 119/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/195 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 303/498 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 27/525 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 4/529 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 41/570 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1402/1972 variables, 570/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1972 variables, 4/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1972 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1972 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1972/1972 variables, and 632 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 570/570 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3964ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 739 ms.
Support contains 6 out of 570 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 20 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 570/570 places, 1402/1402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 570/570 places, 1402/1402 transitions.
Applied a total of 0 rules in 18 ms. Remains 570 /570 variables (removed 0) and now considering 1402/1402 (removed 0) transitions.
[2026-05-22 20:37:06] [INFO ] Invariant cache hit.
[2026-05-22 20:37:06] [INFO ] Implicit Places using invariants in 500 ms returned []
[2026-05-22 20:37:06] [INFO ] Invariant cache hit.
[2026-05-22 20:37:08] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
[2026-05-22 20:37:08] [INFO ] Redundant transitions in 50 ms returned []
Running 1365 sub problems to find dead transitions.
[2026-05-22 20:37:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 569/1972 variables, and 56 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 1365/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 569/1972 variables, and 56 constraints, problems are : Problem set: 0 solved, 1365 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 0/1365 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60498ms problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62752 ms. Remains : 570/570 places, 1402/1402 transitions.
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1771352429913195058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10299288879521802458.kers'
[2026-05-22 20:38:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1771352429913195058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10299288879521802458.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 3437 rows 2842 cols 10608 entries
Finished phase 1 with 1847 SingleSign rule and 690 generalized
[2026-05-22 20:38:09] [INFO ] Computed 305 invariants in 41 ms
Computed 305 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-10299288879521802458.kers
Total runtime 44 ms.
[2026-05-22 20:38:12] [INFO ] [Real]Absence check using 62 positive place invariants in 201 ms returned sat
[2026-05-22 20:38:23] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-22 20:38:24] [INFO ] [Real]Absence check using 62 positive and 243 generalized place invariants in 12023 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-22 20:38:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (AND p2 (NOT p3))
Could not prove EG (AND p2 (NOT p3))
Knowledge-based reduction took 129202 ms.
Stuttering acceptance computed with spot in 217 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 145 reset in 414 ms.
Product exploration explored 100000 steps with 154 reset in 432 ms.
Spot run failed in 69 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2296891273322938614
[2026-05-22 20:38:25] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2296891273322938614
Running compilation step : cd /tmp/ltsmin2296891273322938614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2296891273322938614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2296891273322938614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 2842 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2842/2842 places, 3437/3437 transitions.
Applied a total of 0 rules in 201 ms. Remains 2842 /2842 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-22 20:38:28] [INFO ] Invariant cache hit.
[2026-05-22 20:38:31] [INFO ] Implicit Places using invariants in 2083 ms returned []
[2026-05-22 20:38:31] [INFO ] Invariant cache hit.
[2026-05-22 20:38:42] [INFO ] Implicit Places using invariants and state equation in 11702 ms returned []
Implicit Place search using SMT with State Equation took 13816 ms to find 0 implicit places.
Running 3436 sub problems to find dead transitions.
[2026-05-22 20:38:42] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 3436/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2841 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3436 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2841/6279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3436 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2842 constraints, PredecessorRefiner: 0/3436 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61392ms problems are : Problem set: 0 solved, 3436 unsolved
Search for dead transitions found 0 dead transitions in 61407ms
Finished structural reductions in LTL mode , in 1 iterations and 75445 ms. Remains : 2842/2842 places, 3437/3437 transitions.
Built C files in :
/tmp/ltsmin15924730899605313354
[2026-05-22 20:39:44] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15924730899605313354
Running compilation step : cd /tmp/ltsmin15924730899605313354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15924730899605313354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15924730899605313354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 20:39:47] [INFO ] Flatten gal took : 54 ms
[2026-05-22 20:39:47] [INFO ] Flatten gal took : 53 ms
[2026-05-22 20:39:47] [INFO ] Time to serialize gal into /tmp/LTL2068741052939145390.gal : 12 ms
[2026-05-22 20:39:47] [INFO ] Time to serialize properties into /tmp/LTL5245479327340397404.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2068741052939145390.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17125089564788979302.hoa' '-atoms' '/tmp/LTL5245479327340397404.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5245479327340397404.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17125089564788979302.hoa
Detected timeout of ITS tools.
[2026-05-22 20:40:02] [INFO ] Flatten gal took : 47 ms
[2026-05-22 20:40:02] [INFO ] Flatten gal took : 47 ms
[2026-05-22 20:40:02] [INFO ] Time to serialize gal into /tmp/LTL689572983842177643.gal : 17 ms
[2026-05-22 20:40:02] [INFO ] Time to serialize properties into /tmp/LTL4190500832938534377.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL689572983842177643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4190500832938534377.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((G((X("((p1196==0)||(p2605==1))"))U("((p1656==0)||(p2471==1))")))U(X(X(!("((p902==0)||(p1384==1))")))))||(X(F("((p2605==0)&&(p1196...166
Formula 0 simplified : XG!"((p2605==0)&&(p1196==1))" & (F(!"((p1656==0)||(p2471==1))" & X(!"((p1656==0)||(p2471==1))" W !"((p1196==0)||(p2605==1))")) R XX"...180
Detected timeout of ITS tools.
[2026-05-22 20:40:17] [INFO ] Flatten gal took : 46 ms
[2026-05-22 20:40:17] [INFO ] Applying decomposition
[2026-05-22 20:40:17] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12324301563161736790.txt' '-o' '/tmp/graph12324301563161736790.bin' '-w' '/tmp/graph12324301563161736790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12324301563161736790.bin' '-l' '-1' '-v' '-w' '/tmp/graph12324301563161736790.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:40:18] [INFO ] Decomposing Gal with order
[2026-05-22 20:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:40:18] [INFO ] Removed a total of 2532 redundant transitions.
[2026-05-22 20:40:18] [INFO ] Flatten gal took : 96 ms
[2026-05-22 20:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 52 ms.
[2026-05-22 20:40:18] [INFO ] Time to serialize gal into /tmp/LTL3730161111247710100.gal : 28 ms
[2026-05-22 20:40:18] [INFO ] Time to serialize properties into /tmp/LTL17222320472181616891.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3730161111247710100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17222320472181616891.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((G((X("((i12.i4.i2.u417.p1196==0)||(i31.i1.i0.u903.p2605==1))"))U("((i14.i2.i2.u579.p1656==0)||(i33.u862.p2471==1))")))U(X(X(!("((...274
Formula 0 simplified : XG!"((i31.i1.i0.u903.p2605==0)&&(i12.i4.i2.u417.p1196==1))" & (F(!"((i14.i2.i2.u579.p1656==0)||(i33.u862.p2471==1))" & X(!"((i14.i2....312
Detected timeout of ITS tools.
Treatment of property ASLink-PT-07b-LTLCardinality-08 finished in 557328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p1 U (p2||G(!p1)))&&(X(!p3) U ((!p4&&X(!p3))||X(G(!p3))))&&p0))))'
Support contains 8 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2849 transition count 3459
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2849 transition count 3459
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 2846 transition count 3449
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 2846 transition count 3449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2845 transition count 3448
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2845 transition count 3448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2844 transition count 3440
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2844 transition count 3440
Applied a total of 20 rules in 960 ms. Remains 2844 /2854 variables (removed 10) and now considering 3440/3471 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14971488871911944699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13395243437777344306.kers'
[2026-05-22 20:40:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14971488871911944699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13395243437777344306.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 3440 rows 2844 cols 10614 entries
Finished phase 1 with 1849 SingleSign rule and 690 generalized
[2026-05-22 20:40:34] [INFO ] Computed 305 invariants in 73 ms
Computed 305 P flows in 73 ms.
Exported basis to /tmp/petrispot-output-13395243437777344306.kers
Total runtime 76 ms.
[2026-05-22 20:40:36] [INFO ] Implicit Places using invariants in 1961 ms returned []
[2026-05-22 20:40:36] [INFO ] Invariant cache hit.
[2026-05-22 20:40:47] [INFO ] Implicit Places using invariants and state equation in 11045 ms returned []
Implicit Place search using SMT with State Equation took 13021 ms to find 0 implicit places.
Running 3439 sub problems to find dead transitions.
[2026-05-22 20:40:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2843 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2843/6284 variables, and 182 constraints, problems are : Problem set: 0 solved, 3439 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2844 constraints, PredecessorRefiner: 3439/3439 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2843 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2843/6284 variables, and 182 constraints, problems are : Problem set: 0 solved, 3439 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2844 constraints, PredecessorRefiner: 0/3439 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61697ms problems are : Problem set: 0 solved, 3439 unsolved
Search for dead transitions found 0 dead transitions in 61716ms
Starting structural reductions in LTL mode, iteration 1 : 2844/2854 places, 3440/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75706 ms. Remains : 2844/2854 places, 3440/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((!p1 U (p2||G(!p1)))&&(X(!p3) U ((!p4&&X(!p3))||X(G(!p3))))&&p0))))'
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) p3 (AND p1 (NOT p2))), (OR (NOT p0) p3 (AND p1 (NOT p2))), (OR (NOT p0) p3 (AND p1 (NOT p2))), true, (AND (NOT p2) p1), p3, p3]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-07b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07b-LTLCardinality-10 finished in 76088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 3 out of 2854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2854/2854 places, 3471/3471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2847 transition count 3457
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2847 transition count 3457
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 2843 transition count 3446
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2843 transition count 3446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 2843 transition count 3445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2842 transition count 3444
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2842 transition count 3444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2841 transition count 3436
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2841 transition count 3436
Applied a total of 27 rules in 794 ms. Remains 2841 /2854 variables (removed 13) and now considering 3436/3471 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-670185899026079482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15336954433699717862.kers'
[2026-05-22 20:41:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-670185899026079482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15336954433699717862.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3436 rows 2841 cols 10606 entries
Finished phase 1 with 1846 SingleSign rule and 690 generalized
[2026-05-22 20:41:50] [INFO ] Computed 305 invariants in 46 ms
Computed 305 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-15336954433699717862.kers
Total runtime 53 ms.
[2026-05-22 20:41:52] [INFO ] Implicit Places using invariants in 1867 ms returned []
[2026-05-22 20:41:52] [INFO ] Invariant cache hit.
[2026-05-22 20:42:01] [INFO ] Implicit Places using invariants and state equation in 9504 ms returned []
Implicit Place search using SMT with State Equation took 11375 ms to find 0 implicit places.
Running 3435 sub problems to find dead transitions.
[2026-05-22 20:42:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 3435/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2840 variables, 182/182 constraints. Problems are: Problem set: 0 solved, 3435 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2840/6277 variables, and 182 constraints, problems are : Problem set: 0 solved, 3435 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/62 constraints, Generalized P Invariants (flows): 182/243 constraints, State Equation: 0/2841 constraints, PredecessorRefiner: 0/3435 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61357ms problems are : Problem set: 0 solved, 3435 unsolved
Search for dead transitions found 0 dead transitions in 61369ms
Starting structural reductions in LTL mode, iteration 1 : 2841/2854 places, 3436/3471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73553 ms. Remains : 2841/2854 places, 3436/3471 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-07b-LTLCardinality-14
Stuttering criterion allowed to conclude after 816 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-07b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-07b-LTLCardinality-14 finished in 73755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X((F(G(p1))||p0))) U p2))))'
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((X(p0) U p1)) U X(X(!p2)))||X(F(p3))))'
Spot run failed in 61 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 20:43:03] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6502727879239507876
[2026-05-22 20:43:03] [INFO ] Too many transitions (3471) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:43:03] [INFO ] Applying decomposition
[2026-05-22 20:43:03] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6502727879239507876
Running compilation step : cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 20:43:03] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10851038505494806372.txt' '-o' '/tmp/graph10851038505494806372.bin' '-w' '/tmp/graph10851038505494806372.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10851038505494806372.bin' '-l' '-1' '-v' '-w' '/tmp/graph10851038505494806372.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:43:04] [INFO ] Decomposing Gal with order
[2026-05-22 20:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:43:04] [INFO ] Removed a total of 2587 redundant transitions.
[2026-05-22 20:43:04] [INFO ] Flatten gal took : 122 ms
[2026-05-22 20:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 32 ms.
[2026-05-22 20:43:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality14704415605297621808.gal : 36 ms
[2026-05-22 20:43:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality5986542039745632297.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14704415605297621808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5986542039745632297.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(X((G(X(((F(G("((i4.u117.p341==0)||(i15.i1.i1.u440.p1250==1))")))||("(i4.u118.p343==0)"))||("(i36.i0.i0.u1020.p2921==1)"))))U("(((...256
Formula 0 simplified : XF(!"(((i30.u736.p2100==0)||(i13.i0.i0.u30.p85==1))||(!((i4.u117.p341==0)||(i15.i1.i1.u440.p1250==1))))" & X(!"(((i30.u736.p2100==0)...347
Compilation finished in 9940 ms.
Running link step : cd /tmp/ltsmin6502727879239507876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 140 ms.
Running LTSmin : cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](X(([](X((<>([]((LTLAPp1==true)))||(LTLAPp0==true)))) U (LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](X(([](X((<>([]((LTLAPp1==true)))||(LTLAPp0==true)))) U (LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(([]((X((LTLAPp4==true)) U (LTLAPp5==true))) U X(X(!(LTLAPp6==true))))||X(<>((LTLAPp7==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(([]((X((LTLAPp4==true)) U (LTLAPp5==true))) U X(X(!(LTLAPp6==true))))||X(<>((LTLAPp7==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6502727879239507876;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](X(([](X((<>([]((LTLAPp1==true)))||(LTLAPp0==true)))) U (LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 21:11:06] [INFO ] Applying decomposition
[2026-05-22 21:11:06] [INFO ] Flatten gal took : 56 ms
[2026-05-22 21:11:07] [INFO ] Decomposing Gal with order
[2026-05-22 21:11:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:11:07] [INFO ] Removed a total of 2366 redundant transitions.
[2026-05-22 21:11:07] [INFO ] Flatten gal took : 118 ms
[2026-05-22 21:11:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 3930 labels/synchronizations in 78 ms.
[2026-05-22 21:11:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality8670149055761672756.gal : 16 ms
[2026-05-22 21:11:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality10291054489682532076.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8670149055761672756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10291054489682532076.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(X((G(X(((F(G("((i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i5.i0.u40.p341==0)||(i0.i0.i0.i0.i0.i1.i0.u152.p1250==1))")))||("(i0.i0...458
Formula 0 simplified : XF(!"(((i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u256.p2100==0)||(i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u428.p85==1))||(!((i0.i0.i0.i0.i0.i0.i0.i1.i0.i...651

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-07b"
export BK_EXAMINATION="LTLCardinality"
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-07b, examination is LTLCardinality"
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-177944366200387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;