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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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.3M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779486256130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 21:44:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:44:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:44:18] [INFO ] Load time of PNML (sax parser for PT used): 366 ms
[2026-05-22 21:44:18] [INFO ] Transformed 4014 places.
[2026-05-22 21:44:18] [INFO ] Transformed 4932 transitions.
[2026-05-22 21:44:18] [INFO ] Found NUPN structural information;
[2026-05-22 21:44:18] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ASLink-PT-09b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 4014 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Discarding 248 places :
Symmetric choice reduction at 0 with 248 rule applications. Total rules 248 place count 3766 transition count 4684
Iterating global reduction 0 with 248 rules applied. Total rules applied 496 place count 3766 transition count 4684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 497 place count 3766 transition count 4683
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 592 place count 3671 transition count 4540
Iterating global reduction 1 with 95 rules applied. Total rules applied 687 place count 3671 transition count 4540
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 716 place count 3671 transition count 4511
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 728 place count 3659 transition count 4499
Iterating global reduction 2 with 12 rules applied. Total rules applied 740 place count 3659 transition count 4499
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 744 place count 3655 transition count 4488
Iterating global reduction 2 with 4 rules applied. Total rules applied 748 place count 3655 transition count 4488
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 751 place count 3652 transition count 4485
Iterating global reduction 2 with 3 rules applied. Total rules applied 754 place count 3652 transition count 4485
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 757 place count 3649 transition count 4475
Iterating global reduction 2 with 3 rules applied. Total rules applied 760 place count 3649 transition count 4475
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 761 place count 3648 transition count 4467
Iterating global reduction 2 with 1 rules applied. Total rules applied 762 place count 3648 transition count 4467
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 763 place count 3647 transition count 4466
Iterating global reduction 2 with 1 rules applied. Total rules applied 764 place count 3647 transition count 4466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 765 place count 3646 transition count 4458
Iterating global reduction 2 with 1 rules applied. Total rules applied 766 place count 3646 transition count 4458
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 767 place count 3645 transition count 4450
Iterating global reduction 2 with 1 rules applied. Total rules applied 768 place count 3645 transition count 4450
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 769 place count 3644 transition count 4449
Iterating global reduction 2 with 1 rules applied. Total rules applied 770 place count 3644 transition count 4449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 771 place count 3643 transition count 4441
Iterating global reduction 2 with 1 rules applied. Total rules applied 772 place count 3643 transition count 4441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 773 place count 3642 transition count 4433
Iterating global reduction 2 with 1 rules applied. Total rules applied 774 place count 3642 transition count 4433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 775 place count 3641 transition count 4432
Iterating global reduction 2 with 1 rules applied. Total rules applied 776 place count 3641 transition count 4432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 777 place count 3640 transition count 4424
Iterating global reduction 2 with 1 rules applied. Total rules applied 778 place count 3640 transition count 4424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 779 place count 3639 transition count 4416
Iterating global reduction 2 with 1 rules applied. Total rules applied 780 place count 3639 transition count 4416
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 781 place count 3638 transition count 4415
Iterating global reduction 2 with 1 rules applied. Total rules applied 782 place count 3638 transition count 4415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 783 place count 3637 transition count 4407
Iterating global reduction 2 with 1 rules applied. Total rules applied 784 place count 3637 transition count 4407
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 785 place count 3636 transition count 4399
Iterating global reduction 2 with 1 rules applied. Total rules applied 786 place count 3636 transition count 4399
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 787 place count 3635 transition count 4398
Iterating global reduction 2 with 1 rules applied. Total rules applied 788 place count 3635 transition count 4398
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 789 place count 3634 transition count 4390
Iterating global reduction 2 with 1 rules applied. Total rules applied 790 place count 3634 transition count 4390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 791 place count 3633 transition count 4382
Iterating global reduction 2 with 1 rules applied. Total rules applied 792 place count 3633 transition count 4382
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 793 place count 3632 transition count 4381
Iterating global reduction 2 with 1 rules applied. Total rules applied 794 place count 3632 transition count 4381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 795 place count 3631 transition count 4373
Iterating global reduction 2 with 1 rules applied. Total rules applied 796 place count 3631 transition count 4373
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 797 place count 3630 transition count 4365
Iterating global reduction 2 with 1 rules applied. Total rules applied 798 place count 3630 transition count 4365
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 799 place count 3629 transition count 4364
Iterating global reduction 2 with 1 rules applied. Total rules applied 800 place count 3629 transition count 4364
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 801 place count 3628 transition count 4356
Iterating global reduction 2 with 1 rules applied. Total rules applied 802 place count 3628 transition count 4356
Applied a total of 802 rules in 9253 ms. Remains 3628 /4014 variables (removed 386) and now considering 4356/4932 (removed 576) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4815309796413318771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6552713678973082125.kers'
[2026-05-22 21:44:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4815309796413318771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6552713678973082125.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4356 rows 3628 cols 13436 entries
Finished phase 1 with 2339 SingleSign rule and 895 generalized
[2026-05-22 21:44:28] [INFO ] Computed 394 invariants in 44 ms
Computed 394 P flows in 65 ms.
Exported basis to /tmp/petrispot-output-6552713678973082125.kers
Total runtime 70 ms.
[2026-05-22 21:44:33] [INFO ] Implicit Places using invariants in 4676 ms returned [3462, 3473, 3484, 3492, 3500, 3508, 3516, 3527, 3535, 3543, 3554]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 4745 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3617/4014 places, 4356/4932 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3604 transition count 4343
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3604 transition count 4343
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 3593 transition count 4332
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 3593 transition count 4332
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 3584 transition count 4323
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 3584 transition count 4323
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 3580 transition count 4319
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 3580 transition count 4319
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 3578 transition count 4317
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 3578 transition count 4317
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 3576 transition count 4315
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 3576 transition count 4315
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 3574 transition count 4313
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 3574 transition count 4313
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 3572 transition count 4311
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 3572 transition count 4311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 3571 transition count 4310
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 3571 transition count 4310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 3570 transition count 4309
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 3570 transition count 4309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 3569 transition count 4308
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 3569 transition count 4308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 3568 transition count 4307
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 3568 transition count 4307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 3567 transition count 4306
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 3567 transition count 4306
Applied a total of 100 rules in 3899 ms. Remains 3567 /3617 variables (removed 50) and now considering 4306/4356 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2608469432477924770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15633361677086086716.kers'
[2026-05-22 21:44:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2608469432477924770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15633361677086086716.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4306 rows 3567 cols 13276 entries
Finished phase 1 with 2325 SingleSign rule and 859 generalized
[2026-05-22 21:44:37] [INFO ] Computed 383 invariants in 39 ms
Computed 383 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-15633361677086086716.kers
Total runtime 45 ms.
[2026-05-22 21:44:39] [INFO ] Implicit Places using invariants in 2923 ms returned []
[2026-05-22 21:44:39] [INFO ] Invariant cache hit.
[2026-05-22 21:45:02] [INFO ] Implicit Places using invariants and state equation in 22126 ms returned []
Implicit Place search using SMT with State Equation took 25075 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3567/4014 places, 4306/4932 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42989 ms. Remains : 3567/4014 places, 4306/4932 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Applied a total of 0 rules in 291 ms. Remains 3567 /3567 variables (removed 0) and now considering 4306/4306 (removed 0) transitions.
[2026-05-22 21:45:02] [INFO ] Invariant cache hit.
[2026-05-22 21:45:05] [INFO ] Implicit Places using invariants in 3014 ms returned []
[2026-05-22 21:45:05] [INFO ] Invariant cache hit.
[2026-05-22 21:45:28] [INFO ] Implicit Places using invariants and state equation in 23284 ms returned []
Implicit Place search using SMT with State Equation took 26304 ms to find 0 implicit places.
Running 4305 sub problems to find dead transitions.
[2026-05-22 21:45:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3566 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 4305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3566/7873 variables, and 232 constraints, problems are : Problem set: 0 solved, 4305 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 232/302 constraints, State Equation: 0/3567 constraints, PredecessorRefiner: 4305/4305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3566 variables, 232/232 constraints. Problems are: Problem set: 0 solved, 4305 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3566/7873 variables, and 232 constraints, problems are : Problem set: 0 solved, 4305 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 232/302 constraints, State Equation: 0/3567 constraints, PredecessorRefiner: 0/4305 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62882ms problems are : Problem set: 0 solved, 4305 unsolved
Search for dead transitions found 0 dead transitions in 62936ms
Finished structural reductions in LTL mode , in 1 iterations and 89610 ms. Remains : 3567/3567 places, 4306/4306 transitions.
Support contains 39 out of 3567 places after structural reductions.
[2026-05-22 21:46:32] [INFO ] Flatten gal took : 250 ms
[2026-05-22 21:46:32] [INFO ] Flatten gal took : 163 ms
[2026-05-22 21:46:32] [INFO ] Input system was already deterministic with 4306 transitions.
Support contains 36 out of 3567 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (49 resets) in 2470 ms. (16 steps per ms) remains 11/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
[2026-05-22 21:46:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 295/314 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1378 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1378 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2048/3426 variables, 257/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3426/7873 variables, and 342 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 257/302 constraints, State Equation: 0/3567 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 295/314 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1378 variables, 69/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1378 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2048/3426 variables, 257/338 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/3426 variables, 4/342 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3426 variables, 2/344 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3426/7873 variables, and 344 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 257/302 constraints, State Equation: 0/3567 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 3567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 662 place count 3567 transition count 3644
Reduce places removed 662 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 667 rules applied. Total rules applied 1329 place count 2905 transition count 3639
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 1333 place count 2902 transition count 3638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1334 place count 2901 transition count 3638
Performed 961 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 961 Pre rules applied. Total rules applied 1334 place count 2901 transition count 2677
Deduced a syphon composed of 961 places in 7 ms
Ensure Unique test removed 94 places
Reduce places removed 1055 places and 0 transitions.
Iterating global reduction 4 with 2016 rules applied. Total rules applied 3350 place count 1846 transition count 2677
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 66 rules applied. Total rules applied 3416 place count 1837 transition count 2620
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 58 rules applied. Total rules applied 3474 place count 1780 transition count 2619
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3475 place count 1779 transition count 2619
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 37 Pre rules applied. Total rules applied 3475 place count 1779 transition count 2582
Deduced a syphon composed of 37 places in 8 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 7 with 111 rules applied. Total rules applied 3586 place count 1705 transition count 2582
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 3586 place count 1705 transition count 2546
Deduced a syphon composed of 36 places in 20 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 3658 place count 1669 transition count 2546
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3659 place count 1668 transition count 2540
Iterating global reduction 7 with 1 rules applied. Total rules applied 3660 place count 1668 transition count 2540
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 7 with 566 rules applied. Total rules applied 4226 place count 1384 transition count 2258
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4230 place count 1380 transition count 2254
Iterating global reduction 7 with 4 rules applied. Total rules applied 4234 place count 1380 transition count 2254
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 4235 place count 1380 transition count 2253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4236 place count 1379 transition count 2253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4236 place count 1379 transition count 2252
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4238 place count 1378 transition count 2252
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 4240 place count 1376 transition count 2250
Iterating global reduction 9 with 2 rules applied. Total rules applied 4242 place count 1376 transition count 2250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 4245 place count 1375 transition count 2248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4246 place count 1374 transition count 2248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4248 place count 1373 transition count 2253
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 4259 place count 1373 transition count 2242
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 4270 place count 1362 transition count 2242
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 4278 place count 1362 transition count 2234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4286 place count 1354 transition count 2234
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 13 with 8 rules applied. Total rules applied 4294 place count 1354 transition count 2234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4295 place count 1353 transition count 2233
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 13 with 27 rules applied. Total rules applied 4322 place count 1335 transition count 2224
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 4331 place count 1326 transition count 2224
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 27 Pre rules applied. Total rules applied 4331 place count 1326 transition count 2197
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 15 with 55 rules applied. Total rules applied 4386 place count 1298 transition count 2197
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 15 with 11 rules applied. Total rules applied 4397 place count 1287 transition count 2197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 4397 place count 1287 transition count 2196
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 4399 place count 1286 transition count 2196
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 16 with 38 rules applied. Total rules applied 4437 place count 1267 transition count 2177
Discarding 9 places :
Symmetric choice reduction at 16 with 9 rule applications. Total rules 4446 place count 1258 transition count 2168
Iterating global reduction 16 with 9 rules applied. Total rules applied 4455 place count 1258 transition count 2168
Free-agglomeration rule applied 9 times.
Iterating global reduction 16 with 9 rules applied. Total rules applied 4464 place count 1258 transition count 2159
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 4473 place count 1249 transition count 2159
Applied a total of 4473 rules in 1457 ms. Remains 1249 /3567 variables (removed 2318) and now considering 2159/4306 (removed 2147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1458 ms. Remains : 1249/3567 places, 2159/4306 transitions.
RANDOM walk for 40000 steps (385 resets) in 562 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (39 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (36 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 186730 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 10
Probabilistic random walk after 186730 steps, saw 40845 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) 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-12221992563337443102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11028152901694600491.kers'
[2026-05-22 21:46:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12221992563337443102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11028152901694600491.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 1 ms.
// Phase 1: matrix 2159 rows 1230 cols 8477 entries
Finished phase 1 with 301 SingleSign rule and 738 generalized
[2026-05-22 21:46:49] [INFO ] Computed 210 invariants in 23 ms
Computed 210 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-11028152901694600491.kers
Total runtime 25 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/170 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 102/272 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 23/295 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 20/315 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 327/643 variables, 51/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 92/735 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 6/741 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/741 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 178/919 variables, 31/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/919 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 108/1027 variables, 17/163 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1027 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 5/1032 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1032 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 121/1153 variables, 21/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1153 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 32/1185 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1185 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 7/1192 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 49/1241 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1241 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (OVERLAPS) 2/1243 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1243 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (OVERLAPS) 1/1244 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1244 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (OVERLAPS) 5/1249 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1249 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (OVERLAPS) 2159/3408 variables, 1249/1459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3408 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 39 (OVERLAPS) 0/3408 variables, 0/1459 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3408/3408 variables, and 1459 constraints, problems are : Problem set: 0 solved, 10 unsolved in 11841 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 153/170 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 102/272 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 23/295 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 20/315 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 327/643 variables, 51/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 92/735 variables, 26/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 6/741 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/741 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 178/919 variables, 31/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/919 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 108/1027 variables, 17/163 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1027 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 5/1032 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1032 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 121/1153 variables, 21/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1153 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 32/1185 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1185 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 7/1192 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1192 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 49/1241 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1241 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1241 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 32 (OVERLAPS) 2/1243 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1243 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 34 (OVERLAPS) 1/1244 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1244 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 36 (OVERLAPS) 5/1249 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1249 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 38 (OVERLAPS) 2159/3408 variables, 1249/1460 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3408 variables, 5/1465 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3408 variables, 0/1465 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 0/3408 variables, 0/1465 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3408/3408 variables, and 1465 constraints, problems are : Problem set: 5 solved, 5 unsolved in 16374 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 1249/1249 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28282ms problems are : Problem set: 5 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 4138 ms.
Support contains 3 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 2159/2159 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 1249 transition count 2158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1248 transition count 2158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 1248 transition count 2152
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1242 transition count 2152
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 1239 transition count 2149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1238 transition count 2148
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1238 transition count 2148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1237 transition count 2147
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 1237 transition count 2147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 1237 transition count 2146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 1236 transition count 2145
Applied a total of 26 rules in 245 ms. Remains 1236 /1249 variables (removed 13) and now considering 2145/2159 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1236/1249 places, 2145/2159 transitions.
RANDOM walk for 40000 steps (411 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (41 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 214913 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 214913 steps, saw 47619 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) 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-132055595411959105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18349703230073218493.kers'
[2026-05-22 21:47:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-132055595411959105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18349703230073218493.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 4 ms.
// Phase 1: matrix 2145 rows 1215 cols 8430 entries
Finished phase 1 with 298 SingleSign rule and 728 generalized
[2026-05-22 21:47:25] [INFO ] Computed 210 invariants in 56 ms
Computed 210 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-18349703230073218493.kers
Total runtime 61 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/169 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 60/229 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/257 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 86/343 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 29/372 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 27/399 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/466 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/495 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 27/522 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/522 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 67/589 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/589 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 29/618 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/618 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 27/645 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 67/712 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 29/741 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/741 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 27/768 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/768 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 67/835 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/835 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 28/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 64/954 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/954 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 26/980 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/980 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 26/1006 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1006 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 63/1069 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1069 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 26/1095 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1095 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 26/1121 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1121 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 42/1163 variables, 10/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 12/1175 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 7/1182 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1182 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 46/1228 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 2/1230 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 1/1231 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1231 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 5/1236 variables, 4/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1236 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 2145/3381 variables, 1236/1446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/3381 variables, 1/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/3381 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 0/3381 variables, 0/1447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3381/3381 variables, and 1447 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7419 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 1236/1236 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/169 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 60/229 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 28/257 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 86/343 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 29/372 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 27/399 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/399 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/466 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/466 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 29/495 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/495 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 27/522 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/522 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 67/589 variables, 11/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/589 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 29/618 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/618 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 27/645 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/645 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 67/712 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 29/741 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/741 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 27/768 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/768 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 67/835 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/835 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 28/863 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/863 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 27/890 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/890 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 64/954 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/954 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 26/980 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/980 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 26/1006 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1006 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 63/1069 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1069 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 26/1095 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1095 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 26/1121 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1121 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 42/1163 variables, 10/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1163 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 12/1175 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 7/1182 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1182 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 46/1228 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1228 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 2/1230 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1230 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 1/1231 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1231 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1231 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1231 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 5/1236 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1236 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 2145/3381 variables, 1236/1448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/3381 variables, 2/1450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/3381 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 0/3381 variables, 0/1450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3381/3381 variables, and 1450 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4224 ms.
Refiners :[Positive P Invariants (semi-flows): 95/95 constraints, Generalized P Invariants (flows): 115/115 constraints, State Equation: 1236/1236 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11745ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1142 ms.
Support contains 3 out of 1236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1236/1236 places, 2145/2145 transitions.
Applied a total of 0 rules in 49 ms. Remains 1236 /1236 variables (removed 0) and now considering 2145/2145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1236/1236 places, 2145/2145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1236/1236 places, 2145/2145 transitions.
Applied a total of 0 rules in 45 ms. Remains 1236 /1236 variables (removed 0) and now considering 2145/2145 (removed 0) transitions.
[2026-05-22 21:47:38] [INFO ] Invariant cache hit.
[2026-05-22 21:47:39] [INFO ] Implicit Places using invariants in 1411 ms returned [1, 18, 20, 32, 49, 68, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 643, 644, 646, 663, 681, 750, 754, 755, 766, 767, 769, 786, 804, 824, 873, 874, 885, 886, 888, 905, 923, 992, 996, 997, 1008, 1009, 1011, 1028, 1046, 1115, 1119, 1120, 1123, 1134, 1135, 1136, 1154, 1175, 1176, 1177, 1178]
[2026-05-22 21:47:39] [INFO ] Actually due to overlaps returned [1154, 1136, 49, 171, 294, 417, 540, 663, 786, 905, 1028, 32, 154, 277, 400, 523, 646, 888, 1011, 151, 274, 397, 520, 643, 766, 769, 885, 1008, 1134, 1175, 152, 275, 398, 521, 644, 767, 886, 1009, 1135, 1176, 1, 18, 262, 263, 385, 386, 508, 509, 631, 632, 754, 755, 873, 874, 996, 997, 1119, 1120, 68, 189, 312, 435, 558, 681, 923, 1046, 1177, 20, 804, 824, 1123, 1178]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 1418 ms to find 72 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1164/1236 places, 2145/2145 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1156 transition count 1996
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 163 rules applied. Total rules applied 320 place count 1007 transition count 1982
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 325 place count 1002 transition count 1982
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 325 place count 1002 transition count 1939
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 412 place count 958 transition count 1939
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 424 place count 954 transition count 1931
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 432 place count 946 transition count 1931
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 435 place count 943 transition count 1928
Iterating global reduction 5 with 3 rules applied. Total rules applied 438 place count 943 transition count 1928
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 441 place count 943 transition count 1925
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 563 place count 882 transition count 1864
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 571 place count 874 transition count 1856
Iterating global reduction 6 with 8 rules applied. Total rules applied 579 place count 874 transition count 1856
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 587 place count 874 transition count 1848
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 591 place count 872 transition count 1849
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 611 place count 872 transition count 1829
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 632 place count 851 transition count 1829
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 656 place count 851 transition count 1829
Applied a total of 656 rules in 275 ms. Remains 851 /1164 variables (removed 313) and now considering 1829/2145 (removed 316) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8980564426002866960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6049765532375933771.kers'
[2026-05-22 21:47:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8980564426002866960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6049765532375933771.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1829 rows 850 cols 7502 entries
Finished phase 1 with 233 SingleSign rule and 494 generalized
[2026-05-22 21:47:39] [INFO ] Computed 124 invariants in 17 ms
Computed 124 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-6049765532375933771.kers
Total runtime 22 ms.
[2026-05-22 21:47:40] [INFO ] Implicit Places using invariants in 977 ms returned [75, 92, 98, 103, 104, 107, 108, 161, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 365, 366, 419, 435, 441, 444, 446, 451, 452, 505, 521, 527, 530, 532, 537, 538, 604, 610, 613, 615, 620, 621, 674, 690, 696, 699, 701, 706, 707, 760, 776, 782, 785, 787]
[2026-05-22 21:47:40] [INFO ] Actually due to overlaps returned [107, 193, 279, 365, 451, 537, 620, 706, 108, 194, 280, 366, 452, 538, 621, 707, 177, 183, 188, 263, 269, 274, 349, 355, 360, 435, 441, 446, 521, 527, 532, 604, 610, 615, 690, 696, 701, 776, 782, 787, 75, 92, 98, 103, 104, 161, 247, 333, 419, 505, 674, 760]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 985 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 799/1236 places, 1829/2145 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 765 transition count 1795
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 765 transition count 1795
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 78 place count 755 transition count 1785
Iterating global reduction 0 with 10 rules applied. Total rules applied 88 place count 755 transition count 1785
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 122 place count 738 transition count 1768
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 149 place count 738 transition count 1741
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 176 place count 711 transition count 1741
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 711 transition count 1733
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 192 place count 703 transition count 1733
Applied a total of 192 rules in 186 ms. Remains 703 /799 variables (removed 96) and now considering 1733/1829 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9852525249811427649.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10102735503638026517.kers'
[2026-05-22 21:47:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9852525249811427649.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10102735503638026517.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1733 rows 703 cols 7078 entries
Finished phase 1 with 164 SingleSign rule and 467 generalized
[2026-05-22 21:47:41] [INFO ] Computed 72 invariants in 48 ms
Computed 72 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-10102735503638026517.kers
Total runtime 50 ms.
[2026-05-22 21:47:41] [INFO ] Implicit Places using invariants in 768 ms returned []
[2026-05-22 21:47:41] [INFO ] Invariant cache hit.
[2026-05-22 21:47:43] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 3021 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 703/1236 places, 1733/2145 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5931 ms. Remains : 703/1236 places, 1733/2145 transitions.
RANDOM walk for 40000 steps (647 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (98 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 273379 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 273379 steps, saw 63787 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2026-05-22 21:47:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 49/95 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/132 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 60/216 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 110/328 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 74/402 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/404 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/472 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/472 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 37/509 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/509 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 24/533 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 30/563 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/563 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/569 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/569 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 120/689 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/689 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/690 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/690 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 13/703 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/703 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 1733/2436 variables, 703/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2436 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/2436 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2436/2436 variables, and 775 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2624 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/46 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 49/95 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/132 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 60/216 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 110/328 variables, 13/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 74/402 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/404 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/472 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/472 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 37/509 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/509 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 24/533 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/533 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 30/563 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/563 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 6/569 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/569 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 120/689 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/689 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/690 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/690 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 13/703 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/703 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/703 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 1733/2436 variables, 703/776 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2436 variables, 2/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2436 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 0/2436 variables, 0/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2436/2436 variables, and 778 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3304 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5960ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 471 ms.
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1733/1733 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 703 transition count 1732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 702 transition count 1732
Applied a total of 2 rules in 36 ms. Remains 702 /703 variables (removed 1) and now considering 1732/1733 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 702/703 places, 1732/1733 transitions.
RANDOM walk for 40000 steps (659 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (99 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 422355 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 422355 steps, saw 93629 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) 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-6787987489516058643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4265366669685657362.kers'
[2026-05-22 21:47:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6787987489516058643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4265366669685657362.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1732 rows 702 cols 7076 entries
Finished phase 1 with 163 SingleSign rule and 467 generalized
[2026-05-22 21:47:56] [INFO ] Computed 72 invariants in 16 ms
Computed 72 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-4265366669685657362.kers
Total runtime 22 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/102 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/162 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/303 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 91/394 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/471 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 37/508 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/508 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/532 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/562 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/562 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/568 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/568 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 120/688 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/689 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/689 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 13/702 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/702 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 33 (OVERLAPS) 1732/2434 variables, 702/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2434/2434 variables, and 774 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/74 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/102 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/162 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/164 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/303 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 91/394 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 75/471 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 37/508 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/508 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/532 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/532 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 30/562 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/562 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/568 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/568 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 120/688 variables, 15/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/688 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/689 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/689 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 13/702 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/702 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1732/2434 variables, 702/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2434 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2434 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/2434 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2434/2434 variables, and 775 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2605ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 205 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 702/702 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 28 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 21:47:59] [INFO ] Invariant cache hit.
[2026-05-22 21:48:00] [INFO ] Implicit Places using invariants in 688 ms returned []
[2026-05-22 21:48:00] [INFO ] Invariant cache hit.
[2026-05-22 21:48:02] [INFO ] Implicit Places using invariants and state equation in 2220 ms returned []
Implicit Place search using SMT with State Equation took 2913 ms to find 0 implicit places.
[2026-05-22 21:48:02] [INFO ] Redundant transitions in 125 ms returned []
Running 1687 sub problems to find dead transitions.
[2026-05-22 21:48:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60737ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60742ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63837 ms. Remains : 702/702 places, 1732/1732 transitions.
FORMULA ASLink-PT-09b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ASLink-PT-09b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-09b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 146 stabilizing places and 146 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' '!(F(G((p0 U p1))))'
Support contains 3 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 660 transitions
Trivial Post-agglo rules discarded 660 transitions
Performed 660 trivial Post agglomeration. Transition count delta: 660
Iterating post reduction 0 with 660 rules applied. Total rules applied 660 place count 3566 transition count 3645
Reduce places removed 660 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 665 rules applied. Total rules applied 1325 place count 2906 transition count 3640
Reduce places removed 3 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 1334 place count 2903 transition count 3634
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1340 place count 2897 transition count 3634
Performed 967 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 967 Pre rules applied. Total rules applied 1340 place count 2897 transition count 2667
Deduced a syphon composed of 967 places in 15 ms
Ensure Unique test removed 93 places
Reduce places removed 1060 places and 0 transitions.
Iterating global reduction 4 with 2027 rules applied. Total rules applied 3367 place count 1837 transition count 2667
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 66 rules applied. Total rules applied 3433 place count 1828 transition count 2610
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 5 with 57 rules applied. Total rules applied 3490 place count 1771 transition count 2610
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 36 Pre rules applied. Total rules applied 3490 place count 1771 transition count 2574
Deduced a syphon composed of 36 places in 7 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 3598 place count 1699 transition count 2574
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 35 Pre rules applied. Total rules applied 3598 place count 1699 transition count 2539
Deduced a syphon composed of 35 places in 8 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 3668 place count 1664 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3669 place count 1663 transition count 2533
Iterating global reduction 6 with 1 rules applied. Total rules applied 3670 place count 1663 transition count 2533
Performed 283 Post agglomeration using F-continuation condition.Transition count delta: 283
Deduced a syphon composed of 283 places in 5 ms
Ensure Unique test removed 3 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 6 with 569 rules applied. Total rules applied 4239 place count 1377 transition count 2250
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 4243 place count 1373 transition count 2246
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 4248 place count 1372 transition count 2246
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 4249 place count 1372 transition count 2245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4250 place count 1371 transition count 2245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4250 place count 1371 transition count 2244
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4252 place count 1370 transition count 2244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 4254 place count 1368 transition count 2242
Iterating global reduction 8 with 2 rules applied. Total rules applied 4256 place count 1368 transition count 2242
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 4258 place count 1368 transition count 2240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4259 place count 1367 transition count 2240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4261 place count 1366 transition count 2245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4263 place count 1364 transition count 2243
Reduce places removed 17 places and 0 transitions.
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 10 with 25 rules applied. Total rules applied 4288 place count 1347 transition count 2235
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 9 rules applied. Total rules applied 4297 place count 1339 transition count 2234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 4298 place count 1338 transition count 2234
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 25 Pre rules applied. Total rules applied 4298 place count 1338 transition count 2209
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 13 with 51 rules applied. Total rules applied 4349 place count 1312 transition count 2209
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 13 with 17 rules applied. Total rules applied 4366 place count 1295 transition count 2209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 4366 place count 1295 transition count 2208
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 4368 place count 1294 transition count 2208
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 14 with 50 rules applied. Total rules applied 4418 place count 1269 transition count 2183
Discarding 16 places :
Symmetric choice reduction at 14 with 16 rule applications. Total rules 4434 place count 1253 transition count 2167
Iterating global reduction 14 with 16 rules applied. Total rules applied 4450 place count 1253 transition count 2167
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 4457 place count 1246 transition count 2160
Iterating global reduction 14 with 7 rules applied. Total rules applied 4464 place count 1246 transition count 2160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 4471 place count 1246 transition count 2153
Applied a total of 4471 rules in 1063 ms. Remains 1246 /3567 variables (removed 2321) and now considering 2153/4306 (removed 2153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11060638968098275483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2167572092677382020.kers'
[2026-05-22 21:49:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11060638968098275483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2167572092677382020.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 1 ms.
// Phase 1: matrix 2153 rows 1219 cols 8373 entries
Finished phase 1 with 314 SingleSign rule and 726 generalized
[2026-05-22 21:49:05] [INFO ] Computed 206 invariants in 23 ms
Computed 206 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-2167572092677382020.kers
Total runtime 38 ms.
[2026-05-22 21:49:06] [INFO ] Implicit Places using invariants in 1271 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 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, 747, 748, 760, 761, 763, 780, 798, 869, 873, 874, 886, 887, 889, 906, 924, 944, 996, 997, 1009, 1010, 1012, 1029, 1047, 1125, 1130, 1143, 1144, 1145, 1163, 1184, 1185, 1186, 1187]
[2026-05-22 21:49:06] [INFO ] Actually due to overlaps returned [1163, 1145, 48, 167, 289, 411, 533, 655, 780, 906, 1029, 763, 31, 147, 150, 269, 272, 391, 394, 513, 516, 635, 638, 760, 886, 889, 1009, 1012, 1143, 1184, 148, 270, 392, 514, 636, 761, 887, 1010, 1144, 1185, 1, 18, 256, 257, 378, 379, 500, 501, 622, 623, 747, 748, 873, 874, 996, 997, 1125, 798, 1047, 1186, 19, 66, 86, 137, 185, 205, 307, 327, 429, 449, 551, 571, 673, 693, 924, 944, 1130, 1187]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1290 ms to find 78 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/3567 places, 2153/4306 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1166 transition count 2005
Reduce places removed 148 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1018 transition count 2003
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 1016 transition count 2003
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 302 place count 1016 transition count 1960
Deduced a syphon composed of 43 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 389 place count 972 transition count 1960
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 401 place count 968 transition count 1952
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 409 place count 960 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 412 place count 957 transition count 1949
Iterating global reduction 5 with 3 rules applied. Total rules applied 415 place count 957 transition count 1949
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 418 place count 957 transition count 1946
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 554 place count 889 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 555 place count 888 transition count 1877
Iterating global reduction 6 with 1 rules applied. Total rules applied 556 place count 888 transition count 1877
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 557 place count 888 transition count 1876
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 561 place count 886 transition count 1877
Applied a total of 561 rules in 238 ms. Remains 886 /1168 variables (removed 282) and now considering 1877/2153 (removed 276) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6808253101171702782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7643872097173167816.kers'
[2026-05-22 21:49:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6808253101171702782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7643872097173167816.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1877 rows 885 cols 7544 entries
Finished phase 1 with 265 SingleSign rule and 500 generalized
[2026-05-22 21:49:06] [INFO ] Computed 121 invariants in 18 ms
Computed 121 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-7643872097173167816.kers
Total runtime 41 ms.
[2026-05-22 21:49:07] [INFO ] Implicit Places using invariants in 843 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 601, 618, 624, 629, 707, 713, 718, 799, 805, 810, 883]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 849 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 858/3567 places, 1877/4306 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 858 transition count 1876
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 857 transition count 1876
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 19 place count 840 transition count 1859
Iterating global reduction 2 with 17 rules applied. Total rules applied 36 place count 840 transition count 1859
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 53 place count 823 transition count 1842
Iterating global reduction 2 with 17 rules applied. Total rules applied 70 place count 823 transition count 1842
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 814 transition count 1833
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 814 transition count 1833
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 108 place count 804 transition count 1823
Applied a total of 108 rules in 129 ms. Remains 804 /858 variables (removed 54) and now considering 1823/1877 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9561121309064516544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4638105825032246112.kers'
[2026-05-22 21:49:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9561121309064516544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4638105825032246112.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 7 ms.
// Phase 1: matrix 1823 rows 803 cols 7351 entries
Finished phase 1 with 242 SingleSign rule and 469 generalized
[2026-05-22 21:49:07] [INFO ] Computed 93 invariants in 55 ms
Computed 93 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-4638105825032246112.kers
Total runtime 57 ms.
[2026-05-22 21:49:08] [INFO ] Implicit Places using invariants in 695 ms returned []
[2026-05-22 21:49:08] [INFO ] Invariant cache hit.
[2026-05-22 21:49:10] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 804/3567 places, 1823/4306 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6748 ms. Remains : 804/3567 places, 1823/4306 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' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-01
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-01 finished in 7267 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(p0) U (!(p1 U p2)&&X(p1))))'
Support contains 4 out of 3567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3563 transition count 4297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3563 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 3563 transition count 4296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 3561 transition count 4294
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 3561 transition count 4294
Applied a total of 13 rules in 921 ms. Remains 3561 /3567 variables (removed 6) and now considering 4294/4306 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13620291176295046716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5066607208596485908.kers'
[2026-05-22 21:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13620291176295046716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5066607208596485908.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 4294 rows 3561 cols 13240 entries
Finished phase 1 with 2316 SingleSign rule and 862 generalized
[2026-05-22 21:49:12] [INFO ] Computed 383 invariants in 82 ms
Computed 383 P flows in 82 ms.
Exported basis to /tmp/petrispot-output-5066607208596485908.kers
Total runtime 91 ms.
[2026-05-22 21:49:15] [INFO ] Implicit Places using invariants in 2961 ms returned []
[2026-05-22 21:49:15] [INFO ] Invariant cache hit.
[2026-05-22 21:49:35] [INFO ] Implicit Places using invariants and state equation in 20140 ms returned []
Implicit Place search using SMT with State Equation took 23119 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2026-05-22 21:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3560 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3560/7855 variables, and 230 constraints, problems are : Problem set: 0 solved, 4293 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3561 constraints, PredecessorRefiner: 4293/4293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3560 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3560/7855 variables, and 230 constraints, problems are : Problem set: 0 solved, 4293 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3561 constraints, PredecessorRefiner: 0/4293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62537ms problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 62558ms
Starting structural reductions in LTL mode, iteration 1 : 3561/3567 places, 4294/4306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86626 ms. Remains : 3561/3567 places, 4294/4306 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(p0) U (!(p1 U p2)&&X(p1))))'
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) p2), true, p2, (NOT p0), (NOT p1), (NOT p1), p2]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA ASLink-PT-09b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-02 finished in 87045 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 2 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 668 transitions
Trivial Post-agglo rules discarded 668 transitions
Performed 668 trivial Post agglomeration. Transition count delta: 668
Iterating post reduction 0 with 668 rules applied. Total rules applied 668 place count 3566 transition count 3637
Reduce places removed 668 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 673 rules applied. Total rules applied 1341 place count 2898 transition count 3632
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1344 place count 2895 transition count 3632
Performed 966 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 966 Pre rules applied. Total rules applied 1344 place count 2895 transition count 2666
Deduced a syphon composed of 966 places in 6 ms
Ensure Unique test removed 94 places
Reduce places removed 1060 places and 0 transitions.
Iterating global reduction 3 with 2026 rules applied. Total rules applied 3370 place count 1835 transition count 2666
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3437 place count 1826 transition count 2608
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3495 place count 1768 transition count 2608
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3495 place count 1768 transition count 2571
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3606 place count 1694 transition count 2571
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3606 place count 1694 transition count 2535
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3678 place count 1658 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3679 place count 1657 transition count 2529
Iterating global reduction 5 with 1 rules applied. Total rules applied 3680 place count 1657 transition count 2529
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 5 with 566 rules applied. Total rules applied 4246 place count 1373 transition count 2247
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4250 place count 1369 transition count 2243
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4255 place count 1368 transition count 2243
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 5 with 1 rules applied. Total rules applied 4256 place count 1368 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4257 place count 1367 transition count 2242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4257 place count 1367 transition count 2241
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4259 place count 1366 transition count 2241
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4261 place count 1364 transition count 2239
Iterating global reduction 7 with 2 rules applied. Total rules applied 4263 place count 1364 transition count 2239
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 7 with 2 rules applied. Total rules applied 4265 place count 1364 transition count 2237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4266 place count 1363 transition count 2237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4268 place count 1362 transition count 2242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4270 place count 1360 transition count 2240
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4297 place count 1342 transition count 2231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4306 place count 1333 transition count 2231
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4306 place count 1333 transition count 2204
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4361 place count 1305 transition count 2204
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 11 with 18 rules applied. Total rules applied 4379 place count 1287 transition count 2204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4379 place count 1287 transition count 2203
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4381 place count 1286 transition count 2203
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 4435 place count 1259 transition count 2176
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 4452 place count 1242 transition count 2159
Iterating global reduction 12 with 17 rules applied. Total rules applied 4469 place count 1242 transition count 2159
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4477 place count 1234 transition count 2151
Iterating global reduction 12 with 8 rules applied. Total rules applied 4485 place count 1234 transition count 2151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4493 place count 1234 transition count 2143
Applied a total of 4493 rules in 936 ms. Remains 1234 /3567 variables (removed 2333) and now considering 2143/4306 (removed 2163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6888532089632989715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12613250404002778240.kers'
[2026-05-22 21:50:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6888532089632989715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12613250404002778240.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 4 ms.
// Phase 1: matrix 2143 rows 1206 cols 8339 entries
Finished phase 1 with 288 SingleSign rule and 743 generalized
[2026-05-22 21:50:39] [INFO ] Computed 203 invariants in 55 ms
Computed 203 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-12613250404002778240.kers
Total runtime 57 ms.
[2026-05-22 21:50:40] [INFO ] Implicit Places using invariants in 1515 ms returned [1, 18, 19, 31, 48, 67, 87, 139, 149, 150, 152, 169, 187, 207, 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, 868, 872, 873, 885, 886, 888, 905, 923, 943, 994, 995, 1007, 1008, 1010, 1027, 1045, 1065, 1116, 1117, 1120, 1131, 1132, 1133, 1151, 1172, 1173, 1174, 1175]
[2026-05-22 21:50:40] [INFO ] Actually due to overlaps returned [1151, 1133, 48, 169, 291, 413, 535, 657, 779, 905, 1027, 762, 31, 149, 152, 271, 274, 393, 396, 515, 518, 637, 640, 759, 885, 888, 1007, 1010, 1131, 1172, 150, 272, 394, 516, 638, 760, 886, 1008, 1132, 1173, 1, 18, 258, 259, 380, 381, 502, 503, 624, 625, 746, 747, 872, 873, 994, 995, 1116, 1117, 797, 1174, 19, 67, 87, 139, 187, 207, 309, 329, 431, 451, 553, 573, 675, 695, 923, 943, 1045, 1065, 1120, 1175]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1530 ms to find 80 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/3567 places, 2143/4306 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1153 transition count 1997
Reduce places removed 146 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 150 rules applied. Total rules applied 297 place count 1007 transition count 1993
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 301 place count 1003 transition count 1993
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 301 place count 1003 transition count 1950
Deduced a syphon composed of 43 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 388 place count 959 transition count 1950
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 400 place count 955 transition count 1942
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 408 place count 947 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 411 place count 944 transition count 1939
Iterating global reduction 5 with 3 rules applied. Total rules applied 414 place count 944 transition count 1939
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 417 place count 944 transition count 1936
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 553 place count 876 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 875 transition count 1867
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 875 transition count 1867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 556 place count 875 transition count 1866
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 7 with 4 rules applied. Total rules applied 560 place count 873 transition count 1867
Applied a total of 560 rules in 221 ms. Remains 873 /1154 variables (removed 281) and now considering 1867/2143 (removed 276) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5506152886770515006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13410891493805669063.kers'
[2026-05-22 21:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5506152886770515006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13410891493805669063.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1867 rows 873 cols 7509 entries
Finished phase 1 with 259 SingleSign rule and 497 generalized
[2026-05-22 21:50:41] [INFO ] Computed 117 invariants in 22 ms
Computed 117 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-13410891493805669063.kers
Total runtime 28 ms.
[2026-05-22 21:50:41] [INFO ] Implicit Places using invariants in 782 ms returned [90, 96, 101, 176, 182, 187, 264, 270, 275, 352, 358, 363, 440, 446, 451, 528, 534, 539, 601, 618, 624, 629, 706, 712, 717, 794, 800, 805, 870]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 784 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 844/3567 places, 1867/4306 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 844 transition count 1866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 843 transition count 1866
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 825 transition count 1848
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 825 transition count 1848
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 807 transition count 1830
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 807 transition count 1830
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 799 transition count 1822
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 799 transition count 1822
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 110 place count 789 transition count 1812
Applied a total of 110 rules in 133 ms. Remains 789 /844 variables (removed 55) and now considering 1812/1867 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4536968817678949743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5578597830685157566.kers'
[2026-05-22 21:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4536968817678949743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5578597830685157566.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1812 rows 789 cols 7313 entries
Finished phase 1 with 227 SingleSign rule and 474 generalized
[2026-05-22 21:50:41] [INFO ] Computed 88 invariants in 42 ms
Computed 88 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-5578597830685157566.kers
Total runtime 50 ms.
[2026-05-22 21:50:42] [INFO ] Implicit Places using invariants in 799 ms returned []
[2026-05-22 21:50:42] [INFO ] Invariant cache hit.
[2026-05-22 21:50:45] [INFO ] Implicit Places using invariants and state equation in 2379 ms returned []
Implicit Place search using SMT with State Equation took 3189 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 789/3567 places, 1812/4306 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6794 ms. Remains : 789/3567 places, 1812/4306 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 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-03
Product exploration explored 100000 steps with 1109 reset in 355 ms.
Product exploration explored 100000 steps with 1098 reset in 406 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 84 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 40000 steps (451 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (65 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191856 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191856 steps, saw 88870 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2026-05-22 21:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/80 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/175 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/177 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/338 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/394 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/419 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/485 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/487 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 211/698 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/698 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/727 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/727 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/789 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 1812/2601 variables, 789/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2601 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2601 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2601/2601 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/80 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/175 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/177 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/338 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/394 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/419 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/485 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/487 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 211/698 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/698 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/727 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/727 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/789 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1812/2601 variables, 789/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2601 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2601 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/2601 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2601/2601 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2705ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 204 ms.
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1812/1812 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 789 transition count 1767
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 99 place count 744 transition count 1758
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 125 place count 744 transition count 1732
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 151 place count 718 transition count 1732
Applied a total of 151 rules in 96 ms. Remains 718 /789 variables (removed 71) and now considering 1732/1812 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 718/789 places, 1732/1812 transitions.
RANDOM walk for 40000 steps (643 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (92 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 251084 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 251084 steps, saw 68682 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) 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-4775723190239197202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4115192232447156667.kers'
[2026-05-22 21:50:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4775723190239197202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4115192232447156667.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1732 rows 718 cols 7292 entries
Finished phase 1 with 213 SingleSign rule and 417 generalized
[2026-05-22 21:50:55] [INFO ] Computed 88 invariants in 43 ms
Computed 88 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-4115192232447156667.kers
Total runtime 75 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/309 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/364 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/449 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/451 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 185/636 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/636 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/665 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/665 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/718 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/718 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/718 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1732/2450 variables, 718/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2450 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 0/2450 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2450/2450 variables, and 807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/309 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/364 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/449 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/451 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 185/636 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/636 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/665 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/665 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/718 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/718 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/718 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1732/2450 variables, 718/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2450 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2450 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2450 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2450/2450 variables, and 808 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 219 ms.
Support contains 2 out of 718 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 718/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 27 ms. Remains 718 /718 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 718/718 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 718/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 26 ms. Remains 718 /718 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 21:50:58] [INFO ] Invariant cache hit.
[2026-05-22 21:50:59] [INFO ] Implicit Places using invariants in 908 ms returned [91, 92, 162, 163, 233, 234, 304, 305, 375, 376, 446, 447, 517, 518, 588, 589]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 926 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 702/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 32 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 984 ms. Remains : 702/718 places, 1732/1732 transitions.
RANDOM walk for 40000 steps (646 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (95 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 263540 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263540 steps, saw 72477 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) 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-12705679766714824108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4323082298396463225.kers'
[2026-05-22 21:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12705679766714824108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4323082298396463225.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1732 rows 702 cols 7076 entries
Finished phase 1 with 182 SingleSign rule and 448 generalized
[2026-05-22 21:51:02] [INFO ] Computed 72 invariants in 47 ms
Computed 72 P flows in 61 ms.
Exported basis to /tmp/petrispot-output-4323082298396463225.kers
Total runtime 64 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/305 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/360 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/384 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/445 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/447 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 177/624 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/653 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/653 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 49/702 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/702 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1732/2434 variables, 702/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2434/2434 variables, and 774 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/305 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/360 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/384 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/445 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/447 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 177/624 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/624 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/653 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/653 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 49/702 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/702 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/702 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1732/2434 variables, 702/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2434 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2434 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2434 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2434/2434 variables, and 777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2921ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 29 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 702/702 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 21:51:05] [INFO ] Invariant cache hit.
[2026-05-22 21:51:06] [INFO ] Implicit Places using invariants in 742 ms returned []
[2026-05-22 21:51:06] [INFO ] Invariant cache hit.
[2026-05-22 21:51:08] [INFO ] Implicit Places using invariants and state equation in 2195 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2026-05-22 21:51:08] [INFO ] Redundant transitions in 48 ms returned []
Running 1687 sub problems to find dead transitions.
[2026-05-22 21:51:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60750ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63805 ms. Remains : 702/702 places, 1732/1732 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:52:09] [INFO ] Invariant cache hit.
[2026-05-22 21:52:09] [INFO ] [Real]Absence check using 25 positive place invariants in 36 ms returned sat
[2026-05-22 21:52:09] [INFO ] [Real]Absence check using 25 positive and 47 generalized place invariants in 15 ms returned sat
[2026-05-22 21:52:10] [INFO ] After 1420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:52:10] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2026-05-22 21:52:10] [INFO ] [Nat]Absence check using 25 positive and 47 generalized place invariants in 24 ms returned sat
[2026-05-22 21:52:12] [INFO ] After 1054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:52:12] [INFO ] After 1176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:52:12] [INFO ] After 1477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2958 ms.
Knowledge based reduction with 3 factoid took 60 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 81 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 86402 ms.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1812/1812 transitions.
Applied a total of 0 rules in 37 ms. Remains 789 /789 variables (removed 0) and now considering 1812/1812 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4927604631765539850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12308750554646664379.kers'
[2026-05-22 21:52:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4927604631765539850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12308750554646664379.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1812 rows 789 cols 7313 entries
Finished phase 1 with 227 SingleSign rule and 474 generalized
[2026-05-22 21:52:12] [INFO ] Computed 88 invariants in 19 ms
Computed 88 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-12308750554646664379.kers
Total runtime 22 ms.
[2026-05-22 21:52:13] [INFO ] Implicit Places using invariants in 859 ms returned []
[2026-05-22 21:52:13] [INFO ] Invariant cache hit.
[2026-05-22 21:52:15] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 3452 ms to find 0 implicit places.
[2026-05-22 21:52:16] [INFO ] Redundant transitions in 60 ms returned []
Running 1749 sub problems to find dead transitions.
[2026-05-22 21:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/2601 variables, and 68 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 19/25 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 1749/1749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/2601 variables, and 68 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 19/25 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 0/1749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 1749 unsolved
Search for dead transitions found 0 dead transitions in 60702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64275 ms. Remains : 789/789 places, 1812/1812 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 69 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 40000 steps (436 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (63 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 195456 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195456 steps, saw 90968 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2026-05-22 21:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/80 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/175 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/177 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/338 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/394 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/419 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/485 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/487 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 211/698 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/698 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/727 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/727 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/789 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 1812/2601 variables, 789/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2601 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2601 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2601/2601 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/80 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/109 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/175 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/177 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 161/338 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 56/394 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 25/419 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 66/485 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/487 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 211/698 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/698 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/727 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/727 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 62/789 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/789 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1812/2601 variables, 789/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2601 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2601 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/2601 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2601/2601 variables, and 878 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 789/789 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2323ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 191 ms.
Support contains 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 1812/1812 transitions.
Free-agglomeration rule applied 45 times.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 789 transition count 1767
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 99 place count 744 transition count 1758
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 1 with 26 rules applied. Total rules applied 125 place count 744 transition count 1732
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 151 place count 718 transition count 1732
Applied a total of 151 rules in 93 ms. Remains 718 /789 variables (removed 71) and now considering 1732/1812 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 718/789 places, 1732/1812 transitions.
RANDOM walk for 40000 steps (632 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (96 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250374 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250374 steps, saw 68441 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) 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-11918299080980033551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4219636856135588524.kers'
[2026-05-22 21:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11918299080980033551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4219636856135588524.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1732 rows 718 cols 7292 entries
Finished phase 1 with 213 SingleSign rule and 417 generalized
[2026-05-22 21:53:25] [INFO ] Computed 88 invariants in 46 ms
Computed 88 P flows in 60 ms.
Exported basis to /tmp/petrispot-output-4219636856135588524.kers
Total runtime 61 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/309 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/364 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/449 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/451 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 185/636 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/636 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/665 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/665 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/718 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/718 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/718 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1732/2450 variables, 718/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2450 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (OVERLAPS) 0/2450 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2450/2450 variables, and 807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/309 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/364 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/388 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/449 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/451 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 185/636 variables, 29/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/636 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/665 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/665 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 53/718 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/718 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/718 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1732/2450 variables, 718/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2450 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2450 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/2450 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2450/2450 variables, and 808 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 718/718 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2508ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 196 ms.
Support contains 2 out of 718 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 718/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 28 ms. Remains 718 /718 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 718/718 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 718/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 26 ms. Remains 718 /718 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 21:53:28] [INFO ] Invariant cache hit.
[2026-05-22 21:53:29] [INFO ] Implicit Places using invariants in 695 ms returned [91, 92, 162, 163, 233, 234, 304, 305, 375, 376, 446, 447, 517, 518, 588, 589]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 699 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 702/718 places, 1732/1732 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 752 ms. Remains : 702/718 places, 1732/1732 transitions.
RANDOM walk for 40000 steps (648 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (97 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264114 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264114 steps, saw 72657 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) 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-14511281712009861031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13564868234435392897.kers'
[2026-05-22 21:53:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14511281712009861031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13564868234435392897.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1732 rows 702 cols 7076 entries
Finished phase 1 with 182 SingleSign rule and 448 generalized
[2026-05-22 21:53:32] [INFO ] Computed 72 invariants in 17 ms
Computed 72 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-13564868234435392897.kers
Total runtime 22 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/305 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/360 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/384 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/445 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/447 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 177/624 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 29/653 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/653 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 49/702 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/702 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1732/2434 variables, 702/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2434 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2434/2434 variables, and 774 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/79 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/168 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/170 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 135/305 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/360 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/384 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 61/445 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/447 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 177/624 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/624 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/624 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/653 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/653 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 49/702 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/702 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/702 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1732/2434 variables, 702/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2434 variables, 1/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2434 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/2434 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2434/2434 variables, and 777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1763 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3041ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 2 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 702/702 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 1732/1732 transitions.
Applied a total of 0 rules in 25 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2026-05-22 21:53:35] [INFO ] Invariant cache hit.
[2026-05-22 21:53:36] [INFO ] Implicit Places using invariants in 574 ms returned []
[2026-05-22 21:53:36] [INFO ] Invariant cache hit.
[2026-05-22 21:53:38] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 2582 ms to find 0 implicit places.
[2026-05-22 21:53:38] [INFO ] Redundant transitions in 33 ms returned []
Running 1687 sub problems to find dead transitions.
[2026-05-22 21:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 1687/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1687 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/701 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/701 variables, 47/70 constraints. Problems are: Problem set: 0 solved, 1687 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1687 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 23/25 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 0/1687 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60667ms problems are : Problem set: 0 solved, 1687 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63333 ms. Remains : 702/702 places, 1732/1732 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 51 ms. Remains 702 /702 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:54:38] [INFO ] Invariant cache hit.
[2026-05-22 21:54:39] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2026-05-22 21:54:39] [INFO ] [Real]Absence check using 25 positive and 47 generalized place invariants in 116 ms returned sat
[2026-05-22 21:54:40] [INFO ] After 1112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:54:40] [INFO ] [Nat]Absence check using 25 positive place invariants in 7 ms returned sat
[2026-05-22 21:54:40] [INFO ] [Nat]Absence check using 25 positive and 47 generalized place invariants in 13 ms returned sat
[2026-05-22 21:54:40] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:54:41] [INFO ] After 901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:54:41] [INFO ] After 1123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2303 ms.
Knowledge based reduction with 3 factoid took 98 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 126 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 84637 ms.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1102 reset in 275 ms.
Product exploration explored 100000 steps with 1115 reset in 289 ms.
Built C files in :
/tmp/ltsmin16496345382214276878
[2026-05-22 21:54:42] [INFO ] Too many transitions (1812) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:54:42] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16496345382214276878
Running compilation step : cd /tmp/ltsmin16496345382214276878;'/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/ltsmin16496345382214276878;'/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/ltsmin16496345382214276878;'/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 2 out of 789 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 789/789 places, 1812/1812 transitions.
Applied a total of 0 rules in 28 ms. Remains 789 /789 variables (removed 0) and now considering 1812/1812 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6406285305344021628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6258839560906707679.kers'
[2026-05-22 21:54:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6406285305344021628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6258839560906707679.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1812 rows 789 cols 7313 entries
Finished phase 1 with 227 SingleSign rule and 474 generalized
[2026-05-22 21:54:45] [INFO ] Computed 88 invariants in 47 ms
Computed 88 P flows in 48 ms.
Exported basis to /tmp/petrispot-output-6258839560906707679.kers
Total runtime 49 ms.
[2026-05-22 21:54:46] [INFO ] Implicit Places using invariants in 880 ms returned []
[2026-05-22 21:54:46] [INFO ] Invariant cache hit.
[2026-05-22 21:54:48] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2026-05-22 21:54:48] [INFO ] Redundant transitions in 37 ms returned []
Running 1749 sub problems to find dead transitions.
[2026-05-22 21:54:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/2601 variables, and 68 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 19/25 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 1749/1749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 779/2601 variables, and 68 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 19/25 constraints, Generalized P Invariants (flows): 49/63 constraints, State Equation: 0/789 constraints, PredecessorRefiner: 0/1749 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 1749 unsolved
Search for dead transitions found 0 dead transitions in 60630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63621 ms. Remains : 789/789 places, 1812/1812 transitions.
Built C files in :
/tmp/ltsmin1668914051475143286
[2026-05-22 21:55:49] [INFO ] Too many transitions (1812) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:55:49] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1668914051475143286
Running compilation step : cd /tmp/ltsmin1668914051475143286;'/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/ltsmin1668914051475143286;'/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/ltsmin1668914051475143286;'/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 21:55:52] [INFO ] Flatten gal took : 50 ms
[2026-05-22 21:55:52] [INFO ] Flatten gal took : 50 ms
[2026-05-22 21:55:52] [INFO ] Time to serialize gal into /tmp/LTL11689069501182191141.gal : 19 ms
[2026-05-22 21:55:52] [INFO ] Time to serialize properties into /tmp/LTL3942567778014350177.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/LTL11689069501182191141.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2516387778456984552.hoa' '-atoms' '/tmp/LTL3942567778014350177.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/LTL3942567778014350177.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2516387778456984552.hoa
Detected timeout of ITS tools.
[2026-05-22 21:56:07] [INFO ] Flatten gal took : 44 ms
[2026-05-22 21:56:07] [INFO ] Flatten gal took : 43 ms
[2026-05-22 21:56:07] [INFO ] Time to serialize gal into /tmp/LTL7471034424796152209.gal : 13 ms
[2026-05-22 21:56:07] [INFO ] Time to serialize properties into /tmp/LTL17656678360757467484.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/LTL7471034424796152209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17656678360757467484.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(F("((p136!=1)||(p286!=1))"))))
Formula 0 simplified : FG!"((p136!=1)||(p286!=1))"
Detected timeout of ITS tools.
[2026-05-22 21:56:22] [INFO ] Flatten gal took : 46 ms
[2026-05-22 21:56:22] [INFO ] Applying decomposition
[2026-05-22 21:56:22] [INFO ] Flatten gal took : 41 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/graph2438455603141159864.txt' '-o' '/tmp/graph2438455603141159864.bin' '-w' '/tmp/graph2438455603141159864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2438455603141159864.bin' '-l' '-1' '-v' '-w' '/tmp/graph2438455603141159864.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:56:23] [INFO ] Decomposing Gal with order
[2026-05-22 21:56:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:56:23] [INFO ] Removed a total of 3535 redundant transitions.
[2026-05-22 21:56:23] [INFO ] Flatten gal took : 197 ms
[2026-05-22 21:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 43 ms.
[2026-05-22 21:56:23] [INFO ] Time to serialize gal into /tmp/LTL9922567327975872757.gal : 21 ms
[2026-05-22 21:56:23] [INFO ] Time to serialize properties into /tmp/LTL14282030858295025084.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/LTL9922567327975872757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14282030858295025084.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("((i2.u27.p136!=1)||(i2.u26.p286!=1))"))))
Formula 0 simplified : FG!"((i2.u27.p136!=1)||(i2.u26.p286!=1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-09b-LTLFireability-03 finished in 360319 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' '!(F(p0))'
Support contains 1 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3566 transition count 3639
Reduce places removed 666 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 671 rules applied. Total rules applied 1337 place count 2900 transition count 3634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1340 place count 2897 transition count 3634
Performed 968 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 968 Pre rules applied. Total rules applied 1340 place count 2897 transition count 2666
Deduced a syphon composed of 968 places in 7 ms
Ensure Unique test removed 94 places
Reduce places removed 1062 places and 0 transitions.
Iterating global reduction 3 with 2030 rules applied. Total rules applied 3370 place count 1835 transition count 2666
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3437 place count 1826 transition count 2608
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3495 place count 1768 transition count 2608
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3495 place count 1768 transition count 2571
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3606 place count 1694 transition count 2571
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3606 place count 1694 transition count 2535
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3678 place count 1658 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3679 place count 1657 transition count 2529
Iterating global reduction 5 with 1 rules applied. Total rules applied 3680 place count 1657 transition count 2529
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 5 with 566 rules applied. Total rules applied 4246 place count 1373 transition count 2247
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4250 place count 1369 transition count 2243
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4255 place count 1368 transition count 2243
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 5 with 1 rules applied. Total rules applied 4256 place count 1368 transition count 2242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4257 place count 1367 transition count 2242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4257 place count 1367 transition count 2241
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4259 place count 1366 transition count 2241
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4261 place count 1364 transition count 2239
Iterating global reduction 7 with 2 rules applied. Total rules applied 4263 place count 1364 transition count 2239
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 7 with 2 rules applied. Total rules applied 4265 place count 1364 transition count 2237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4266 place count 1363 transition count 2237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4268 place count 1362 transition count 2242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4270 place count 1360 transition count 2240
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4297 place count 1342 transition count 2231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4306 place count 1333 transition count 2231
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4306 place count 1333 transition count 2204
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4361 place count 1305 transition count 2204
Discarding 18 places :
Implicit places reduction removed 18 places
Iterating post reduction 11 with 18 rules applied. Total rules applied 4379 place count 1287 transition count 2204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4379 place count 1287 transition count 2203
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4381 place count 1286 transition count 2203
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 4435 place count 1259 transition count 2176
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 4452 place count 1242 transition count 2159
Iterating global reduction 12 with 17 rules applied. Total rules applied 4469 place count 1242 transition count 2159
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4477 place count 1234 transition count 2151
Iterating global reduction 12 with 8 rules applied. Total rules applied 4485 place count 1234 transition count 2151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4493 place count 1234 transition count 2143
Applied a total of 4493 rules in 806 ms. Remains 1234 /3567 variables (removed 2333) and now considering 2143/4306 (removed 2163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16023295278985167733.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3418967807137461313.kers'
[2026-05-22 21:56:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16023295278985167733.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3418967807137461313.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 1 ms.
// Phase 1: matrix 2143 rows 1206 cols 8339 entries
Finished phase 1 with 295 SingleSign rule and 736 generalized
[2026-05-22 21:56:39] [INFO ] Computed 203 invariants in 30 ms
Computed 203 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-3418967807137461313.kers
Total runtime 46 ms.
[2026-05-22 21:56:41] [INFO ] Implicit Places using invariants in 1607 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 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, 866, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 1005, 1006, 1008, 1025, 1043, 1063, 1116, 1117, 1120, 1131, 1132, 1133, 1151, 1172, 1173, 1174, 1175]
[2026-05-22 21:56:41] [INFO ] Actually due to overlaps returned [1151, 1133, 48, 167, 289, 411, 533, 655, 777, 903, 1025, 760, 31, 147, 150, 269, 272, 391, 394, 513, 516, 635, 638, 757, 883, 886, 1005, 1008, 1131, 1172, 148, 270, 392, 514, 636, 758, 884, 1006, 1132, 1173, 1, 18, 256, 257, 378, 379, 500, 501, 622, 623, 744, 745, 870, 871, 992, 993, 1116, 1117, 795, 1174, 19, 66, 86, 137, 185, 205, 307, 327, 429, 449, 551, 571, 673, 693, 921, 941, 1043, 1063, 1120, 1175]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1612 ms to find 80 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1154/3567 places, 2143/4306 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1153 transition count 1993
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 301 place count 1003 transition count 1993
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 301 place count 1003 transition count 1950
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 388 place count 959 transition count 1950
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 400 place count 955 transition count 1942
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 408 place count 947 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 411 place count 944 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 414 place count 944 transition count 1939
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 417 place count 944 transition count 1936
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 553 place count 876 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 554 place count 875 transition count 1867
Iterating global reduction 5 with 1 rules applied. Total rules applied 555 place count 875 transition count 1867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 556 place count 875 transition count 1866
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 560 place count 873 transition count 1867
Applied a total of 560 rules in 155 ms. Remains 873 /1154 variables (removed 281) and now considering 1867/2143 (removed 276) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7767131215846261073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15594588748982466284.kers'
[2026-05-22 21:56:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7767131215846261073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15594588748982466284.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1867 rows 873 cols 7509 entries
Finished phase 1 with 266 SingleSign rule and 490 generalized
[2026-05-22 21:56:41] [INFO ] Computed 117 invariants in 51 ms
Computed 117 P flows in 52 ms.
Exported basis to /tmp/petrispot-output-15594588748982466284.kers
Total runtime 56 ms.
[2026-05-22 21:56:42] [INFO ] Implicit Places using invariants in 1032 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 599, 616, 622, 627, 704, 710, 715, 792, 800, 805, 870]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1043 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 844/3567 places, 1867/4306 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 844 transition count 1866
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 843 transition count 1865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 842 transition count 1865
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 21 place count 825 transition count 1848
Iterating global reduction 3 with 17 rules applied. Total rules applied 38 place count 825 transition count 1848
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 55 place count 808 transition count 1831
Iterating global reduction 3 with 17 rules applied. Total rules applied 72 place count 808 transition count 1831
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 80 place count 800 transition count 1823
Iterating global reduction 3 with 8 rules applied. Total rules applied 88 place count 800 transition count 1823
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 108 place count 790 transition count 1813
Applied a total of 108 rules in 121 ms. Remains 790 /844 variables (removed 54) and now considering 1813/1867 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15976457180699724460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12405173861299124224.kers'
[2026-05-22 21:56:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15976457180699724460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12405173861299124224.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1813 rows 790 cols 7316 entries
Finished phase 1 with 236 SingleSign rule and 466 generalized
[2026-05-22 21:56:42] [INFO ] Computed 88 invariants in 17 ms
Computed 88 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12405173861299124224.kers
Total runtime 20 ms.
[2026-05-22 21:56:43] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2026-05-22 21:56:43] [INFO ] Invariant cache hit.
[2026-05-22 21:56:45] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 3460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 790/3567 places, 1813/4306 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 7197 ms. Remains : 790/3567 places, 1813/4306 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' '!(F(p0))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-07
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-07 finished in 7316 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(p0)&&(p1||X(X(G(p2)))))))'
Support contains 3 out of 3567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3563 transition count 4297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3563 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 3563 transition count 4296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 3561 transition count 4294
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 3561 transition count 4294
Applied a total of 13 rules in 790 ms. Remains 3561 /3567 variables (removed 6) and now considering 4294/4306 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15960431610559470258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12852355389800461997.kers'
[2026-05-22 21:56:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15960431610559470258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12852355389800461997.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4294 rows 3561 cols 13240 entries
Finished phase 1 with 2316 SingleSign rule and 862 generalized
[2026-05-22 21:56:46] [INFO ] Computed 383 invariants in 61 ms
Computed 383 P flows in 62 ms.
Exported basis to /tmp/petrispot-output-12852355389800461997.kers
Total runtime 76 ms.
[2026-05-22 21:56:49] [INFO ] Implicit Places using invariants in 2851 ms returned []
[2026-05-22 21:56:49] [INFO ] Invariant cache hit.
[2026-05-22 21:57:05] [INFO ] Implicit Places using invariants and state equation in 15889 ms returned []
Implicit Place search using SMT with State Equation took 18765 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2026-05-22 21:57:05] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3560 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3560/7855 variables, and 230 constraints, problems are : Problem set: 0 solved, 4293 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3561 constraints, PredecessorRefiner: 4293/4293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3560 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3560/7855 variables, and 230 constraints, problems are : Problem set: 0 solved, 4293 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/78 constraints, Generalized P Invariants (flows): 230/305 constraints, State Equation: 0/3561 constraints, PredecessorRefiner: 0/4293 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62229ms problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 62236ms
Starting structural reductions in LTL mode, iteration 1 : 3561/3567 places, 4294/4306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81802 ms. Remains : 3561/3567 places, 4294/4306 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(p0)&&(p1||X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-09 finished in 82159 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' '!((p0||X((G(p1) U (p0&&G(p1))))))'
Support contains 3 out of 3567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3563 transition count 4297
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3563 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 3563 transition count 4296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 3561 transition count 4294
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 3561 transition count 4294
Applied a total of 13 rules in 845 ms. Remains 3561 /3567 variables (removed 6) and now considering 4294/4306 (removed 12) transitions.
[2026-05-22 21:58:08] [INFO ] Invariant cache hit.
[2026-05-22 21:58:11] [INFO ] Implicit Places using invariants in 2709 ms returned []
[2026-05-22 21:58:11] [INFO ] Invariant cache hit.
[2026-05-22 21:58:28] [INFO ] Implicit Places using invariants and state equation in 16454 ms returned []
Implicit Place search using SMT with State Equation took 19168 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 3561/3567 places, 4294/4306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20016 ms. Remains : 3561/3567 places, 4294/4306 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||X((G(p1) U (p0&&G(p1))))))'
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-11 finished in 20273 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' '!(F(p0))'
Support contains 1 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 4306/4306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 666 transitions
Trivial Post-agglo rules discarded 666 transitions
Performed 666 trivial Post agglomeration. Transition count delta: 666
Iterating post reduction 0 with 666 rules applied. Total rules applied 666 place count 3566 transition count 3639
Reduce places removed 666 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 671 rules applied. Total rules applied 1337 place count 2900 transition count 3634
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1340 place count 2897 transition count 3634
Performed 968 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 968 Pre rules applied. Total rules applied 1340 place count 2897 transition count 2666
Deduced a syphon composed of 968 places in 6 ms
Ensure Unique test removed 94 places
Reduce places removed 1062 places and 0 transitions.
Iterating global reduction 3 with 2030 rules applied. Total rules applied 3370 place count 1835 transition count 2666
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 3 with 67 rules applied. Total rules applied 3437 place count 1826 transition count 2608
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 3495 place count 1768 transition count 2608
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 3495 place count 1768 transition count 2571
Deduced a syphon composed of 37 places in 7 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 3606 place count 1694 transition count 2571
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 3606 place count 1694 transition count 2535
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 3678 place count 1658 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3679 place count 1657 transition count 2529
Iterating global reduction 5 with 1 rules applied. Total rules applied 3680 place count 1657 transition count 2529
Performed 283 Post agglomeration using F-continuation condition.Transition count delta: 283
Deduced a syphon composed of 283 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 285 places and 0 transitions.
Iterating global reduction 5 with 568 rules applied. Total rules applied 4248 place count 1372 transition count 2246
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 4252 place count 1368 transition count 2242
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 4257 place count 1367 transition count 2242
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 5 with 1 rules applied. Total rules applied 4258 place count 1367 transition count 2241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4259 place count 1366 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4259 place count 1366 transition count 2240
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4261 place count 1365 transition count 2240
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 4263 place count 1363 transition count 2238
Iterating global reduction 7 with 2 rules applied. Total rules applied 4265 place count 1363 transition count 2238
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 7 with 2 rules applied. Total rules applied 4267 place count 1363 transition count 2236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4268 place count 1362 transition count 2236
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4270 place count 1361 transition count 2241
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4272 place count 1359 transition count 2239
Reduce places removed 18 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 9 with 27 rules applied. Total rules applied 4299 place count 1341 transition count 2230
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4308 place count 1332 transition count 2230
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 27 Pre rules applied. Total rules applied 4308 place count 1332 transition count 2203
Deduced a syphon composed of 27 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 55 rules applied. Total rules applied 4363 place count 1304 transition count 2203
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 4382 place count 1285 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 4382 place count 1285 transition count 2202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 4384 place count 1284 transition count 2202
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 54 rules applied. Total rules applied 4438 place count 1257 transition count 2175
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 4455 place count 1240 transition count 2158
Iterating global reduction 12 with 17 rules applied. Total rules applied 4472 place count 1240 transition count 2158
Discarding 8 places :
Symmetric choice reduction at 12 with 8 rule applications. Total rules 4480 place count 1232 transition count 2150
Iterating global reduction 12 with 8 rules applied. Total rules applied 4488 place count 1232 transition count 2150
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 4496 place count 1232 transition count 2142
Applied a total of 4496 rules in 843 ms. Remains 1232 /3567 variables (removed 2335) and now considering 2142/4306 (removed 2164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2893862388546198513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2367983866005740578.kers'
[2026-05-22 21:58:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2893862388546198513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2367983866005740578.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 4 ms.
// Phase 1: matrix 2142 rows 1204 cols 8333 entries
Finished phase 1 with 295 SingleSign rule and 735 generalized
[2026-05-22 21:58:29] [INFO ] Computed 202 invariants in 33 ms
Computed 202 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-2367983866005740578.kers
Total runtime 50 ms.
[2026-05-22 21:58:30] [INFO ] Implicit Places using invariants in 1671 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 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, 870, 871, 883, 884, 886, 903, 921, 941, 992, 993, 1005, 1006, 1008, 1025, 1043, 1063, 1114, 1115, 1118, 1129, 1130, 1131, 1149, 1170, 1171, 1172, 1173]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 1679 ms to find 80 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1152/3567 places, 2142/4306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1152 transition count 1993
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1003 transition count 1993
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 298 place count 1003 transition count 1950
Deduced a syphon composed of 43 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 385 place count 959 transition count 1950
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 397 place count 955 transition count 1942
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 405 place count 947 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 408 place count 944 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 411 place count 944 transition count 1939
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 414 place count 944 transition count 1936
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 4 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 550 place count 876 transition count 1868
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 554 place count 874 transition count 1869
Applied a total of 554 rules in 254 ms. Remains 874 /1152 variables (removed 278) and now considering 1869/2142 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14166253665644082028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2242522164201628168.kers'
[2026-05-22 21:58:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14166253665644082028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2242522164201628168.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1869 rows 874 cols 7517 entries
Finished phase 1 with 266 SingleSign rule and 491 generalized
[2026-05-22 21:58:31] [INFO ] Computed 117 invariants in 17 ms
Computed 117 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-2242522164201628168.kers
Total runtime 19 ms.
[2026-05-22 21:58:31] [INFO ] Implicit Places using invariants in 738 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 532, 537, 617, 623, 628, 707, 713, 718, 795, 801, 806, 871]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 741 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 846/3567 places, 1869/4306 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 846 transition count 1868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 845 transition count 1868
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 20 place count 827 transition count 1850
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 827 transition count 1850
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 56 place count 809 transition count 1832
Iterating global reduction 2 with 18 rules applied. Total rules applied 74 place count 809 transition count 1832
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 800 transition count 1823
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 800 transition count 1823
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 791 transition count 1814
Applied a total of 110 rules in 123 ms. Remains 791 /846 variables (removed 55) and now considering 1814/1869 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2649820831864533022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14184240283575606189.kers'
[2026-05-22 21:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2649820831864533022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14184240283575606189.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1814 rows 791 cols 7314 entries
Finished phase 1 with 248 SingleSign rule and 454 generalized
[2026-05-22 21:58:32] [INFO ] Computed 89 invariants in 16 ms
Computed 89 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-14184240283575606189.kers
Total runtime 20 ms.
[2026-05-22 21:58:32] [INFO ] Implicit Places using invariants in 873 ms returned []
[2026-05-22 21:58:32] [INFO ] Invariant cache hit.
[2026-05-22 21:58:35] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 3298 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 791/3567 places, 1814/4306 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 6938 ms. Remains : 791/3567 places, 1814/4306 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' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-09b-LTLFireability-13
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-09b-LTLFireability-13 finished in 7039 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)))'
Spot run failed in 134 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 21:58:35] [INFO ] Flatten gal took : 81 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14476283612266639438
[2026-05-22 21:58:35] [INFO ] Too many transitions (4306) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:58:35] [INFO ] Applying decomposition
[2026-05-22 21:58:35] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14476283612266639438
Running compilation step : cd /tmp/ltsmin14476283612266639438;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 21:58:35] [INFO ] Flatten gal took : 79 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/graph9313589779811302417.txt' '-o' '/tmp/graph9313589779811302417.bin' '-w' '/tmp/graph9313589779811302417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9313589779811302417.bin' '-l' '-1' '-v' '-w' '/tmp/graph9313589779811302417.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:58:36] [INFO ] Decomposing Gal with order
[2026-05-22 21:58:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:58:36] [INFO ] Removed a total of 3125 redundant transitions.
[2026-05-22 21:58:36] [INFO ] Flatten gal took : 173 ms
[2026-05-22 21:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 81 ms.
[2026-05-22 21:58:37] [INFO ] Time to serialize gal into /tmp/LTLFireability17152303457679026168.gal : 110 ms
[2026-05-22 21:58:37] [INFO ] Time to serialize properties into /tmp/LTLFireability1837504836286820687.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/LTLFireability17152303457679026168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1837504836286820687.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 1 LTL properties
Checking formula 0 : !((G(F("((i5.i0.i0.u43.p136!=1)||(i5.i0.i0.u96.p286!=1))"))))
Formula 0 simplified : FG!"((i5.i0.i0.u43.p136!=1)||(i5.i0.i0.u96.p286!=1))"
Compilation finished in 13500 ms.
Running link step : cd /tmp/ltsmin14476283612266639438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 104 ms.
Running LTSmin : cd /tmp/ltsmin14476283612266639438;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 22:23:22] [INFO ] Applying decomposition
[2026-05-22 22:23:22] [INFO ] Flatten gal took : 77 ms
[2026-05-22 22:23:22] [INFO ] Decomposing Gal with order
[2026-05-22 22:23:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:23:22] [INFO ] Removed a total of 2895 redundant transitions.
[2026-05-22 22:23:23] [INFO ] Flatten gal took : 171 ms
[2026-05-22 22:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4957 labels/synchronizations in 99 ms.
[2026-05-22 22:23:23] [INFO ] Time to serialize gal into /tmp/LTLFireability5724542670291290963.gal : 24 ms
[2026-05-22 22:23:23] [INFO ] Time to serialize properties into /tmp/LTLFireability4461009092847735105.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/LTLFireability5724542670291290963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4461009092847735105.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u24.p136!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u33.p286!=...163
Formula 0 simplified : FG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i0.u24.p136!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u33.p286!=1)...157

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

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