Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914000348.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 NoC3x3-PT-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.2K Mar 8 06:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 8 06:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 8 06:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 8 06:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 16 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 8 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 8 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 8 06:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 06:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 16 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 552K 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 NoC3x3-PT-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779761171345

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 02:06:12] [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-26 02:06:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:06:12] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2026-05-26 02:06:12] [INFO ] Transformed 1544 places.
[2026-05-26 02:06:12] [INFO ] Transformed 2229 transitions.
[2026-05-26 02:06:12] [INFO ] Found NUPN structural information;
[2026-05-26 02:06:12] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 359 places :
Symmetric choice reduction at 0 with 359 rule applications. Total rules 359 place count 1185 transition count 1870
Iterating global reduction 0 with 359 rules applied. Total rules applied 718 place count 1185 transition count 1870
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 823 place count 1080 transition count 1671
Iterating global reduction 0 with 105 rules applied. Total rules applied 928 place count 1080 transition count 1671
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 1019 place count 989 transition count 1517
Iterating global reduction 0 with 91 rules applied. Total rules applied 1110 place count 989 transition count 1517
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 1131 place count 968 transition count 1475
Iterating global reduction 0 with 21 rules applied. Total rules applied 1152 place count 968 transition count 1475
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 1166 place count 954 transition count 1443
Iterating global reduction 0 with 14 rules applied. Total rules applied 1180 place count 954 transition count 1443
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 1194 place count 940 transition count 1429
Iterating global reduction 0 with 14 rules applied. Total rules applied 1208 place count 940 transition count 1429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1210 place count 938 transition count 1425
Iterating global reduction 0 with 2 rules applied. Total rules applied 1212 place count 938 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1214 place count 936 transition count 1421
Iterating global reduction 0 with 2 rules applied. Total rules applied 1216 place count 936 transition count 1421
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1218 place count 934 transition count 1419
Iterating global reduction 0 with 2 rules applied. Total rules applied 1220 place count 934 transition count 1419
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 1224 place count 934 transition count 1415
Applied a total of 1224 rules in 544 ms. Remains 934 /1544 variables (removed 610) and now considering 1415/2229 (removed 814) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10884874072925777918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11165456176708247639.kers'
[2026-05-26 02:06:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10884874072925777918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11165456176708247639.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1415 rows 934 cols 4447 entries
Finished phase 1 with 868 SingleSign rule and 0 generalized
[2026-05-26 02:06:13] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11165456176708247639.kers
Total runtime 7 ms.
[2026-05-26 02:06:14] [INFO ] Implicit Places using invariants in 653 ms returned []
[2026-05-26 02:06:14] [INFO ] Invariant cache hit.
[2026-05-26 02:06:15] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
Running 1414 sub problems to find dead transitions.
[2026-05-26 02:06:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/2349 variables, and 0 constraints, problems are : Problem set: 0 solved, 1414 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 1414/1414 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1414 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/2349 variables, and 0 constraints, problems are : Problem set: 0 solved, 1414 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/1414 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60516ms problems are : Problem set: 0 solved, 1414 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 934/1544 places, 1415/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62840 ms. Remains : 934/1544 places, 1415/2229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Applied a total of 0 rules in 42 ms. Remains 934 /934 variables (removed 0) and now considering 1415/1415 (removed 0) transitions.
[2026-05-26 02:07:15] [INFO ] Invariant cache hit.
[2026-05-26 02:07:17] [INFO ] Implicit Places using invariants in 1099 ms returned []
[2026-05-26 02:07:17] [INFO ] Invariant cache hit.
[2026-05-26 02:07:18] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 2222 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2268 ms. Remains : 934/934 places, 1415/1415 transitions.
Support contains 46 out of 934 places after structural reductions.
[2026-05-26 02:07:18] [INFO ] Flatten gal took : 126 ms
[2026-05-26 02:07:18] [INFO ] Flatten gal took : 72 ms
[2026-05-26 02:07:18] [INFO ] Input system was already deterministic with 1415 transitions.
RANDOM walk for 40000 steps (89 resets) in 1643 ms. (24 steps per ms) remains 5/32 properties
BEST_FIRST walk for 40003 steps (9 resets) in 200 ms. (199 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 88 ms. (449 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 117 ms. (339 steps per ms) remains 2/3 properties
[2026-05-26 02:07:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 833/934 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1415/2349 variables, 934/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2349 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2349 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2349/2349 variables, and 1000 constraints, problems are : Problem set: 0 solved, 2 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 934/934 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 833/934 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1415/2349 variables, 934/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2349 variables, 2/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2349 variables, 4/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2349 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2349 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2349/2349 variables, and 1007 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2877 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 934/934 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3892ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 238 ms.
Support contains 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 934 transition count 1378
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 897 transition count 1378
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 74 place count 897 transition count 1281
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 268 place count 800 transition count 1281
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 302 place count 766 transition count 1117
Iterating global reduction 2 with 34 rules applied. Total rules applied 336 place count 766 transition count 1117
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 336 place count 766 transition count 1115
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 764 transition count 1115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 758 transition count 1093
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 758 transition count 1093
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 756 transition count 1089
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 756 transition count 1089
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 756 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 755 transition count 1086
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 755 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 755 transition count 1085
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 1 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 4 with 352 rules applied. Total rules applied 712 place count 579 transition count 909
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 713 place count 578 transition count 907
Iterating global reduction 4 with 1 rules applied. Total rules applied 714 place count 578 transition count 907
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 715 place count 577 transition count 905
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 577 transition count 905
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 918 place count 476 transition count 935
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 998 place count 436 transition count 957
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1022 place count 436 transition count 933
Free-agglomeration rule applied 23 times.
Iterating global reduction 4 with 23 rules applied. Total rules applied 1045 place count 436 transition count 910
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 1082 place count 413 transition count 896
Applied a total of 1082 rules in 367 ms. Remains 413 /934 variables (removed 521) and now considering 896/1415 (removed 519) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 413/934 places, 896/1415 transitions.
RANDOM walk for 31490 steps (210 resets) in 509 ms. (61 steps per ms) remains 0/1 properties
Computed a total of 65 stabilizing places and 65 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' '!(X(((p0 U G(p1)) U X(X(X((!p1 U (p2||G(!p1)))))))))'
Support contains 3 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 920 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 920 transition count 1392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 913 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 913 transition count 1380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 908 transition count 1367
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 908 transition count 1367
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 903 transition count 1360
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 903 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 901 transition count 1352
Applied a total of 71 rules in 101 ms. Remains 901 /934 variables (removed 33) and now considering 1352/1415 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3924292134121535297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18214047777749450704.kers'
[2026-05-26 02:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3924292134121535297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18214047777749450704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1352 rows 901 cols 4251 entries
Finished phase 1 with 835 SingleSign rule and 0 generalized
[2026-05-26 02:07:24] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18214047777749450704.kers
Total runtime 6 ms.
[2026-05-26 02:07:25] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-05-26 02:07:25] [INFO ] Invariant cache hit.
[2026-05-26 02:07:26] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2026-05-26 02:07:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/2253 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/2253 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60327ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 901/934 places, 1352/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61920 ms. Remains : 901/934 places, 1352/1415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1)) U X(X(X((!p1 U (G(!p1)||p2))))))))'
Stuttering acceptance computed with spot in 1166 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false, (AND p1 (NOT p2)), (AND p1 (NOT p2)), true, (AND (NOT p2) p1), (AND p1 (NOT p2)), false, false, false, false, (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false, false, false, false, false, false, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 438 steps with 1 reset in 8 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 63279 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 U p1) U (X(G(X(X(p0))))&&X(p0))))))'
Support contains 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 933 transition count 1377
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 896 transition count 1377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 74 place count 896 transition count 1280
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 268 place count 799 transition count 1280
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 303 place count 764 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 338 place count 764 transition count 1114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 338 place count 764 transition count 1112
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 762 transition count 1112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 349 place count 755 transition count 1088
Iterating global reduction 2 with 7 rules applied. Total rules applied 356 place count 755 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 359 place count 752 transition count 1082
Iterating global reduction 2 with 3 rules applied. Total rules applied 362 place count 752 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 752 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 751 transition count 1079
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 751 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 751 transition count 1078
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 720 place count 574 transition count 901
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 721 place count 573 transition count 899
Iterating global reduction 4 with 1 rules applied. Total rules applied 722 place count 573 transition count 899
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 723 place count 572 transition count 897
Iterating global reduction 4 with 1 rules applied. Total rules applied 724 place count 572 transition count 897
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 926 place count 471 transition count 927
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1000 place count 434 transition count 942
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1024 place count 434 transition count 918
Applied a total of 1024 rules in 235 ms. Remains 434 /934 variables (removed 500) and now considering 918/1415 (removed 497) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12869195551755353459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6078067306146946562.kers'
[2026-05-26 02:08:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12869195551755353459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6078067306146946562.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 918 rows 425 cols 3932 entries
Finished phase 1 with 351 SingleSign rule and 17 generalized
[2026-05-26 02:08:28] [INFO ] Computed 66 invariants in 6 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6078067306146946562.kers
Total runtime 7 ms.
[2026-05-26 02:08:28] [INFO ] Implicit Places using invariants in 225 ms returned [10, 46, 94, 133, 193, 273, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 228 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/934 places, 918/1415 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 894
Applied a total of 48 rules in 22 ms. Remains 401 /425 variables (removed 24) and now considering 894/918 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6676033163478373650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3845659277582463013.kers'
[2026-05-26 02:08:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6676033163478373650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3845659277582463013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 894 rows 401 cols 3836 entries
Finished phase 1 with 327 SingleSign rule and 17 generalized
[2026-05-26 02:08:28] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3845659277582463013.kers
Total runtime 4 ms.
[2026-05-26 02:08:28] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-26 02:08:28] [INFO ] Invariant cache hit.
[2026-05-26 02:08:28] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:08:29] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/934 places, 894/1415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1261 ms. Remains : 401/934 places, 894/1415 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 U p1) U (X(G(X(X(p0))))&&X(p0))))))'
Stuttering acceptance computed with spot in 212 ms :[p0, p0, false, p0, false]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01
Product exploration explored 100000 steps with 32415 reset in 1102 ms.
Product exploration explored 100000 steps with 32497 reset in 985 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 56 steps (0 resets) in 5 ms. (9 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 104 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 78 ms :[p0, p0]
Knowledge-based reduction took 309 ms.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Support contains 1 out of 401 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 894/894 transitions.
Applied a total of 0 rules in 20 ms. Remains 401 /401 variables (removed 0) and now considering 894/894 (removed 0) transitions.
[2026-05-26 02:08:32] [INFO ] Invariant cache hit.
[2026-05-26 02:08:32] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-26 02:08:32] [INFO ] Invariant cache hit.
[2026-05-26 02:08:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:08:32] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2026-05-26 02:08:32] [INFO ] Redundant transitions in 52 ms returned []
Running 884 sub problems to find dead transitions.
[2026-05-26 02:08:32] [INFO ] Invariant cache hit.
[2026-05-26 02:08:32] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 1 (OVERLAPS) 2/401 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 884 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1295 variables, and 60 constraints, problems are : Problem set: 0 solved, 884 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/401 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 884/884 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 884 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 1 (OVERLAPS) 2/401 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 4 (OVERLAPS) 894/1295 variables, 401/461 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 53/514 constraints. Problems are: Problem set: 0 solved, 884 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 884/1398 constraints. Problems are: Problem set: 0 solved, 884 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1295/1295 variables, and 1398 constraints, problems are : Problem set: 0 solved, 884 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 401/401 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 884/884 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60332ms problems are : Problem set: 0 solved, 884 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61231 ms. Remains : 401/401 places, 894/894 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 292 steps (1 resets) in 10 ms. (26 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 99 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 97 ms :[p0, p0]
Knowledge-based reduction took 308 ms.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Stuttering acceptance computed with spot in 84 ms :[p0, p0]
Product exploration explored 100000 steps with 1550 reset in 493 ms.
Product exploration explored 100000 steps with 1495 reset in 501 ms.
Built C files in :
/tmp/ltsmin18028870653869133395
[2026-05-26 02:09:34] [INFO ] Computing symmetric may disable matrix : 894 transitions.
[2026-05-26 02:09:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:09:34] [INFO ] Computing symmetric may enable matrix : 894 transitions.
[2026-05-26 02:09:34] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:09:34] [INFO ] Computing Do-Not-Accords matrix : 894 transitions.
[2026-05-26 02:09:34] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:09:34] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18028870653869133395
Running compilation step : cd /tmp/ltsmin18028870653869133395;'/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'
Compilation finished in 2656 ms.
Running link step : cd /tmp/ltsmin18028870653869133395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin18028870653869133395;'/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' '--hoa' '/tmp/stateBased11261073391231088593.hoa' '--buchi-type=spotba'
LTSmin run took 4518 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 74229 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 U X(G(!p0))))'
Support contains 1 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 933 transition count 1379
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 898 transition count 1379
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 70 place count 898 transition count 1282
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 264 place count 801 transition count 1282
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 766 transition count 1116
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 766 transition count 1116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 334 place count 766 transition count 1114
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 338 place count 764 transition count 1114
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 345 place count 757 transition count 1090
Iterating global reduction 2 with 7 rules applied. Total rules applied 352 place count 757 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 355 place count 754 transition count 1084
Iterating global reduction 2 with 3 rules applied. Total rules applied 358 place count 754 transition count 1084
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 359 place count 754 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 360 place count 753 transition count 1081
Iterating global reduction 3 with 1 rules applied. Total rules applied 361 place count 753 transition count 1081
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 753 transition count 1080
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 716 place count 576 transition count 903
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 717 place count 575 transition count 901
Iterating global reduction 4 with 1 rules applied. Total rules applied 718 place count 575 transition count 901
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 719 place count 574 transition count 899
Iterating global reduction 4 with 1 rules applied. Total rules applied 720 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 922 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1000 place count 434 transition count 944
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1024 place count 434 transition count 920
Applied a total of 1024 rules in 170 ms. Remains 434 /934 variables (removed 500) and now considering 920/1415 (removed 495) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1234766474346463377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3940408656249103438.kers'
[2026-05-26 02:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1234766474346463377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3940408656249103438.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 920 rows 425 cols 3944 entries
Finished phase 1 with 351 SingleSign rule and 17 generalized
[2026-05-26 02:09:42] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3940408656249103438.kers
Total runtime 10 ms.
[2026-05-26 02:09:42] [INFO ] Implicit Places using invariants in 222 ms returned [10, 45, 93, 132, 194, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 223 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/934 places, 920/1415 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 896
Applied a total of 48 rules in 18 ms. Remains 401 /425 variables (removed 24) and now considering 896/920 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10509049798129597766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12628652248291602605.kers'
[2026-05-26 02:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10509049798129597766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12628652248291602605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 896 rows 401 cols 3848 entries
Finished phase 1 with 327 SingleSign rule and 17 generalized
[2026-05-26 02:09:42] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12628652248291602605.kers
Total runtime 4 ms.
[2026-05-26 02:09:42] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 02:09:42] [INFO ] Invariant cache hit.
[2026-05-26 02:09:43] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:09:43] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/934 places, 896/1415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1158 ms. Remains : 401/934 places, 896/1415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Stuttering acceptance computed with spot in 97 ms :[p0, true, p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02
Entered a terminal (fully accepting) state of product in 164 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 5 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 921 transition count 1398
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 921 transition count 1398
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 915 transition count 1387
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 915 transition count 1387
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 911 transition count 1376
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 911 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 907 transition count 1371
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 907 transition count 1371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 907 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 906 transition count 1365
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 906 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 905 transition count 1364
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 905 transition count 1364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 905 transition count 1363
Applied a total of 63 rules in 114 ms. Remains 905 /934 variables (removed 29) and now considering 1363/1415 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7860887439479851951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-967954883224818929.kers'
[2026-05-26 02:09:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7860887439479851951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-967954883224818929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1363 rows 905 cols 4289 entries
Finished phase 1 with 839 SingleSign rule and 0 generalized
[2026-05-26 02:09:43] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-967954883224818929.kers
Total runtime 8 ms.
[2026-05-26 02:09:44] [INFO ] Implicit Places using invariants in 429 ms returned []
[2026-05-26 02:09:44] [INFO ] Invariant cache hit.
[2026-05-26 02:09:45] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2026-05-26 02:09:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 905/934 places, 1363/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61888 ms. Remains : 905/934 places, 1363/1415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(G(p1)&&p0)))))'
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04
Product exploration explored 100000 steps with 222 reset in 324 ms.
Product exploration explored 100000 steps with 220 reset in 318 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 11 factoid took 60 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (87 resets) in 395 ms. (101 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 145 ms. (274 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 181 ms. (219 steps per ms) remains 1/3 properties
[2026-05-26 02:10:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 805/905 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1363/2268 variables, 905/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2268 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2268 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2268/2268 variables, and 973 constraints, problems are : Problem set: 0 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 905/905 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 805/905 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1363/2268 variables, 905/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2268 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2268 variables, 6/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2268 variables, 2/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2268 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2268 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2268 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2268/2268 variables, and 983 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 905/905 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3885ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 905/905 places, 1363/1363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 905 transition count 1335
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 877 transition count 1335
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 56 place count 877 transition count 1238
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 250 place count 780 transition count 1238
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 274 place count 756 transition count 1088
Iterating global reduction 2 with 24 rules applied. Total rules applied 298 place count 756 transition count 1088
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 654 place count 578 transition count 910
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 655 place count 577 transition count 908
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 577 transition count 908
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 657 place count 576 transition count 906
Iterating global reduction 2 with 1 rules applied. Total rules applied 658 place count 576 transition count 906
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 860 place count 475 transition count 936
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 936 place count 437 transition count 958
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 960 place count 437 transition count 934
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 984 place count 437 transition count 910
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1022 place count 413 transition count 896
Applied a total of 1022 rules in 117 ms. Remains 413 /905 variables (removed 492) and now considering 896/1363 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 413/905 places, 896/1363 transitions.
RANDOM walk for 40000 steps (270 resets) in 375 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326422 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 326422 steps, saw 95978 distinct states, run finished after 3007 ms. (steps per millisecond=108 ) 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-3102546440061835156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-245440541860589066.kers'
[2026-05-26 02:10:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3102546440061835156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-245440541860589066.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 896 rows 405 cols 3680 entries
Finished phase 1 with 331 SingleSign rule and 16 generalized
[2026-05-26 02:10:53] [INFO ] Computed 66 invariants in 3 ms
Computed 66 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-245440541860589066.kers
Total runtime 5 ms.
[2026-05-26 02:10:53] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/409 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/413 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 896/1309 variables, 413/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 53/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1309 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 413/413 constraints, ReadFeed: 53/53 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/409 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/413 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 896/1309 variables, 413/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 53/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 413/413 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 897ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 896/896 transitions.
Applied a total of 0 rules in 10 ms. Remains 413 /413 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 413/413 places, 896/896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 896/896 transitions.
Applied a total of 0 rules in 9 ms. Remains 413 /413 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2026-05-26 02:10:54] [INFO ] Invariant cache hit.
[2026-05-26 02:10:54] [INFO ] Implicit Places using invariants in 221 ms returned [11, 46, 90, 129, 185, 258, 304, 344, 391]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 222 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 404/413 places, 896/896 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 380 transition count 872
Applied a total of 48 rules in 14 ms. Remains 380 /404 variables (removed 24) and now considering 872/896 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9208210448996990585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10012533052150536673.kers'
[2026-05-26 02:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9208210448996990585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10012533052150536673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 872 rows 380 cols 3582 entries
Finished phase 1 with 307 SingleSign rule and 16 generalized
[2026-05-26 02:10:55] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10012533052150536673.kers
Total runtime 6 ms.
[2026-05-26 02:10:55] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-26 02:10:55] [INFO ] Invariant cache hit.
[2026-05-26 02:10:55] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:10:55] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 380/413 places, 872/896 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1053 ms. Remains : 380/413 places, 872/896 transitions.
RANDOM walk for 40000 steps (299 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (15 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 356898 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 356898 steps, saw 95363 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2026-05-26 02:10:58] [INFO ] Invariant cache hit.
[2026-05-26 02:10:58] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/380 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 872/1252 variables, 380/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 52/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1252 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/380 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 872/1252 variables, 380/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 52/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1252 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1252 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 872/872 transitions.
Applied a total of 0 rules in 12 ms. Remains 380 /380 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 380/380 places, 872/872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 872/872 transitions.
Applied a total of 0 rules in 8 ms. Remains 380 /380 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2026-05-26 02:10:59] [INFO ] Invariant cache hit.
[2026-05-26 02:10:59] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-26 02:10:59] [INFO ] Invariant cache hit.
[2026-05-26 02:11:00] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:11:00] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2026-05-26 02:11:00] [INFO ] Redundant transitions in 13 ms returned []
Running 868 sub problems to find dead transitions.
[2026-05-26 02:11:00] [INFO ] Invariant cache hit.
[2026-05-26 02:11:00] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1252 variables, and 69 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/380 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 872/1252 variables, 380/449 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1252 variables, 52/501 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 868/1369 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 1369 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60216ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61026 ms. Remains : 380/380 places, 872/872 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 380 transition count 860
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 380 transition count 860
Applied a total of 16 rules in 27 ms. Remains 380 /380 variables (removed 0) and now considering 860/872 (removed 12) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18280022262563131695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12762579396861408462.kers'
[2026-05-26 02:12:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18280022262563131695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12762579396861408462.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 860 rows 380 cols 3540 entries
Finished phase 1 with 307 SingleSign rule and 16 generalized
[2026-05-26 02:12:00] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12762579396861408462.kers
Total runtime 4 ms.
[2026-05-26 02:12:00] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2026-05-26 02:12:00] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 02:12:01] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2026-05-26 02:12:01] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 02:12:01] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 02:12:01] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 724 ms.
Knowledge based reduction with 11 factoid took 136 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 75461 ms.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1363/1363 transitions.
Applied a total of 0 rules in 21 ms. Remains 905 /905 variables (removed 0) and now considering 1363/1363 (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-13438126931002475147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6044980126245125659.kers'
[2026-05-26 02:12:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13438126931002475147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6044980126245125659.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1363 rows 905 cols 4289 entries
Finished phase 1 with 839 SingleSign rule and 0 generalized
[2026-05-26 02:12:01] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-6044980126245125659.kers
Total runtime 13 ms.
[2026-05-26 02:12:02] [INFO ] Implicit Places using invariants in 432 ms returned []
[2026-05-26 02:12:02] [INFO ] Invariant cache hit.
[2026-05-26 02:12:03] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2026-05-26 02:12:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Finished structural reductions in LTL mode , in 1 iterations and 61842 ms. Remains : 905/905 places, 1363/1363 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 11 factoid took 69 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (89 resets) in 188 ms. (211 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
[2026-05-26 02:13:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 805/905 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1363/2268 variables, 905/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2268 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2268 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2268/2268 variables, and 973 constraints, problems are : Problem set: 0 solved, 1 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 905/905 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 805/905 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1363/2268 variables, 905/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2268 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2268 variables, 6/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2268 variables, 2/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2268 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2268 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2268 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2268/2268 variables, and 983 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3006 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 905/905 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 905 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 905/905 places, 1363/1363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 905 transition count 1335
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 877 transition count 1335
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 56 place count 877 transition count 1238
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 250 place count 780 transition count 1238
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 274 place count 756 transition count 1088
Iterating global reduction 2 with 24 rules applied. Total rules applied 298 place count 756 transition count 1088
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 654 place count 578 transition count 910
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 655 place count 577 transition count 908
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 577 transition count 908
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 657 place count 576 transition count 906
Iterating global reduction 2 with 1 rules applied. Total rules applied 658 place count 576 transition count 906
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 860 place count 475 transition count 936
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 936 place count 437 transition count 958
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 960 place count 437 transition count 934
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 984 place count 437 transition count 910
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1022 place count 413 transition count 896
Applied a total of 1022 rules in 114 ms. Remains 413 /905 variables (removed 492) and now considering 896/1363 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 413/905 places, 896/1363 transitions.
RANDOM walk for 40000 steps (264 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331211 steps, run timeout after 3007 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331211 steps, saw 97624 distinct states, run finished after 3008 ms. (steps per millisecond=110 ) 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-6821247992490196660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8122855020185862411.kers'
[2026-05-26 02:13:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6821247992490196660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8122855020185862411.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 896 rows 405 cols 3680 entries
Finished phase 1 with 331 SingleSign rule and 16 generalized
[2026-05-26 02:13:11] [INFO ] Computed 66 invariants in 3 ms
Computed 66 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8122855020185862411.kers
Total runtime 4 ms.
[2026-05-26 02:13:11] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/409 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/413 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 896/1309 variables, 413/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1309 variables, 53/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1309 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1309/1309 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 413/413 constraints, ReadFeed: 53/53 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 370/409 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/413 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 896/1309 variables, 413/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1309 variables, 53/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1309 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1309 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1309/1309 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 593 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 413/413 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 889ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 896/896 transitions.
Applied a total of 0 rules in 8 ms. Remains 413 /413 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 413/413 places, 896/896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 896/896 transitions.
Applied a total of 0 rules in 8 ms. Remains 413 /413 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2026-05-26 02:13:12] [INFO ] Invariant cache hit.
[2026-05-26 02:13:12] [INFO ] Implicit Places using invariants in 231 ms returned [11, 46, 90, 129, 185, 258, 304, 344, 391]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 232 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 404/413 places, 896/896 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 380 transition count 872
Applied a total of 48 rules in 12 ms. Remains 380 /404 variables (removed 24) and now considering 872/896 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12707978426055428460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11098579164708680083.kers'
[2026-05-26 02:13:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12707978426055428460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11098579164708680083.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 872 rows 380 cols 3582 entries
Finished phase 1 with 307 SingleSign rule and 16 generalized
[2026-05-26 02:13:12] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11098579164708680083.kers
Total runtime 4 ms.
[2026-05-26 02:13:12] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-26 02:13:12] [INFO ] Invariant cache hit.
[2026-05-26 02:13:12] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:13:13] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 380/413 places, 872/896 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1070 ms. Remains : 380/413 places, 872/896 transitions.
RANDOM walk for 40000 steps (296 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 352767 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 352767 steps, saw 94535 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2026-05-26 02:13:16] [INFO ] Invariant cache hit.
[2026-05-26 02:13:16] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/380 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 872/1252 variables, 380/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 52/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1252 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 344/380 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 872/1252 variables, 380/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 52/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1252 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1252 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1252 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 872/872 transitions.
Applied a total of 0 rules in 7 ms. Remains 380 /380 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 380/380 places, 872/872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 872/872 transitions.
Applied a total of 0 rules in 7 ms. Remains 380 /380 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2026-05-26 02:13:16] [INFO ] Invariant cache hit.
[2026-05-26 02:13:17] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 02:13:17] [INFO ] Invariant cache hit.
[2026-05-26 02:13:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:13:17] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2026-05-26 02:13:17] [INFO ] Redundant transitions in 10 ms returned []
Running 868 sub problems to find dead transitions.
[2026-05-26 02:13:17] [INFO ] Invariant cache hit.
[2026-05-26 02:13:17] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1252 variables, and 69 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/380 constraints, ReadFeed: 0/52 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 872/1252 variables, 380/449 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1252 variables, 52/501 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1252 variables, 868/1369 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 1369 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 380/380 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61078 ms. Remains : 380/380 places, 872/872 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 380 transition count 860
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 380 transition count 860
Applied a total of 16 rules in 22 ms. Remains 380 /380 variables (removed 0) and now considering 860/872 (removed 12) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12044887250964478059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3079639697456142253.kers'
[2026-05-26 02:14:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12044887250964478059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3079639697456142253.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 860 rows 380 cols 3540 entries
Finished phase 1 with 307 SingleSign rule and 16 generalized
[2026-05-26 02:14:18] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3079639697456142253.kers
Total runtime 6 ms.
[2026-05-26 02:14:18] [INFO ] [Real]Absence check using 57 positive place invariants in 9 ms returned sat
[2026-05-26 02:14:18] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 02:14:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2026-05-26 02:14:18] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 02:14:18] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 02:14:18] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 731 ms.
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 75309 ms.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 225 reset in 317 ms.
Product exploration explored 100000 steps with 224 reset in 340 ms.
Spot run failed in 76 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10039385210217164350
[2026-05-26 02:14:20] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10039385210217164350
Running compilation step : cd /tmp/ltsmin10039385210217164350;'/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'
Compilation finished in 2360 ms.
Running link step : cd /tmp/ltsmin10039385210217164350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10039385210217164350;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased5364646306734668940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 905 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 905/905 places, 1363/1363 transitions.
Applied a total of 0 rules in 15 ms. Remains 905 /905 variables (removed 0) and now considering 1363/1363 (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-11988193322512766004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17111186564913480860.kers'
[2026-05-26 02:14:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11988193322512766004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17111186564913480860.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1363 rows 905 cols 4289 entries
Finished phase 1 with 839 SingleSign rule and 0 generalized
[2026-05-26 02:14:35] [INFO ] Computed 66 invariants in 12 ms
Computed 66 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17111186564913480860.kers
Total runtime 16 ms.
[2026-05-26 02:14:35] [INFO ] Implicit Places using invariants in 419 ms returned []
[2026-05-26 02:14:35] [INFO ] Invariant cache hit.
[2026-05-26 02:14:36] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
Running 1362 sub problems to find dead transitions.
[2026-05-26 02:14:36] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2268 variables, and 0 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 905/905 places, 1363/1363 transitions.
Built C files in :
/tmp/ltsmin11415621075780892182
[2026-05-26 02:15:37] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11415621075780892182
Running compilation step : cd /tmp/ltsmin11415621075780892182;'/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'
Compilation finished in 2371 ms.
Running link step : cd /tmp/ltsmin11415621075780892182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11415621075780892182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased12156049553276531399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:15:52] [INFO ] Flatten gal took : 46 ms
[2026-05-26 02:15:52] [INFO ] Flatten gal took : 46 ms
[2026-05-26 02:15:52] [INFO ] Time to serialize gal into /tmp/LTL18113623049800939109.gal : 12 ms
[2026-05-26 02:15:52] [INFO ] Time to serialize properties into /tmp/LTL1203276508910228576.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/LTL18113623049800939109.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12615143676184088731.hoa' '-atoms' '/tmp/LTL1203276508910228576.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...319
Loading property file /tmp/LTL1203276508910228576.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12615143676184088731.hoa
Detected timeout of ITS tools.
[2026-05-26 02:16:07] [INFO ] Flatten gal took : 39 ms
[2026-05-26 02:16:07] [INFO ] Flatten gal took : 34 ms
[2026-05-26 02:16:07] [INFO ] Time to serialize gal into /tmp/LTL14938723793488068575.gal : 8 ms
[2026-05-26 02:16:07] [INFO ] Time to serialize properties into /tmp/LTL10054214557143419821.ltl : 3 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/LTL14938723793488068575.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10054214557143419821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("((!(((p847==1)&&(p1276==1))&&(p1498==1)))||(!((p1498==1)||(p955==1))))")U((G("((!(((p847==1)&&(p1276==1))&&(p1498==1)))||(!((p1...280
Formula 0 simplified : X(F!"(p1419!=1)" U !"((!(((p847==1)&&(p1276==1))&&(p1498==1)))||(!((p1498==1)||(p955==1))))")
Detected timeout of ITS tools.
[2026-05-26 02:16:22] [INFO ] Flatten gal took : 29 ms
[2026-05-26 02:16:22] [INFO ] Applying decomposition
[2026-05-26 02:16:22] [INFO ] Flatten gal took : 29 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/graph5269403493672543082.txt' '-o' '/tmp/graph5269403493672543082.bin' '-w' '/tmp/graph5269403493672543082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5269403493672543082.bin' '-l' '-1' '-v' '-w' '/tmp/graph5269403493672543082.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:16:22] [INFO ] Decomposing Gal with order
[2026-05-26 02:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:16:22] [INFO ] Removed a total of 1285 redundant transitions.
[2026-05-26 02:16:22] [INFO ] Flatten gal took : 170 ms
[2026-05-26 02:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 74 ms.
[2026-05-26 02:16:23] [INFO ] Time to serialize gal into /tmp/LTL2360521521112259844.gal : 28 ms
[2026-05-26 02:16:23] [INFO ] Time to serialize properties into /tmp/LTL11494139934927428206.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2360521521112259844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11494139934927428206.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 : !((X(("((!(((i11.u260.p847==1)&&(i11.u260.p1276==1))&&(i12.u302.p1498==1)))||(!((i12.u302.p1498==1)||(i6.i1.i3.u202.p955==1))))")U((G(...439
Formula 0 simplified : X(F!"(i11.u290.p1419!=1)" U !"((!(((i11.u260.p847==1)&&(i11.u260.p1276==1))&&(i12.u302.p1498==1)))||(!((i12.u302.p1498==1)||(i6.i1.i...175
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 414644 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 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 933 transition count 1377
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 896 transition count 1377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 74 place count 896 transition count 1280
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 268 place count 799 transition count 1280
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 303 place count 764 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 338 place count 764 transition count 1114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 338 place count 764 transition count 1112
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 762 transition count 1112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 349 place count 755 transition count 1088
Iterating global reduction 2 with 7 rules applied. Total rules applied 356 place count 755 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 359 place count 752 transition count 1082
Iterating global reduction 2 with 3 rules applied. Total rules applied 362 place count 752 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 752 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 751 transition count 1079
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 751 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 751 transition count 1078
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 4 with 354 rules applied. Total rules applied 720 place count 574 transition count 901
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 721 place count 573 transition count 899
Iterating global reduction 4 with 1 rules applied. Total rules applied 722 place count 573 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 924 place count 472 transition count 931
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1000 place count 434 transition count 946
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1024 place count 434 transition count 922
Applied a total of 1024 rules in 159 ms. Remains 434 /934 variables (removed 500) and now considering 922/1415 (removed 493) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7266313771016770744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3574919063556767300.kers'
[2026-05-26 02:16:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7266313771016770744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3574919063556767300.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 922 rows 425 cols 3952 entries
Finished phase 1 with 351 SingleSign rule and 17 generalized
[2026-05-26 02:16:38] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3574919063556767300.kers
Total runtime 8 ms.
[2026-05-26 02:16:38] [INFO ] Implicit Places using invariants in 249 ms returned [10, 45, 93, 132, 192, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 251 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/934 places, 922/1415 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 898
Applied a total of 48 rules in 14 ms. Remains 401 /425 variables (removed 24) and now considering 898/922 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1119022379069834572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8279542892751612553.kers'
[2026-05-26 02:16:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1119022379069834572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8279542892751612553.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 898 rows 401 cols 3856 entries
Finished phase 1 with 327 SingleSign rule and 17 generalized
[2026-05-26 02:16:38] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8279542892751612553.kers
Total runtime 5 ms.
[2026-05-26 02:16:38] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-26 02:16:38] [INFO ] Invariant cache hit.
[2026-05-26 02:16:39] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:16:39] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/934 places, 898/1415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1239 ms. Remains : 401/934 places, 898/1415 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 40 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-05
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-05 finished in 1318 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)&&F(G(p1)))))'
Support contains 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 933 transition count 1377
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 896 transition count 1377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 74 place count 896 transition count 1280
Deduced a syphon composed of 97 places in 2 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 268 place count 799 transition count 1280
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 303 place count 764 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 338 place count 764 transition count 1114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 338 place count 764 transition count 1112
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 762 transition count 1112
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 349 place count 755 transition count 1088
Iterating global reduction 2 with 7 rules applied. Total rules applied 356 place count 755 transition count 1088
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 359 place count 752 transition count 1082
Iterating global reduction 2 with 3 rules applied. Total rules applied 362 place count 752 transition count 1082
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 752 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 364 place count 751 transition count 1079
Iterating global reduction 3 with 1 rules applied. Total rules applied 365 place count 751 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 751 transition count 1078
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 4 with 350 rules applied. Total rules applied 716 place count 576 transition count 903
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 717 place count 575 transition count 901
Iterating global reduction 4 with 1 rules applied. Total rules applied 718 place count 575 transition count 901
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 719 place count 574 transition count 899
Iterating global reduction 4 with 1 rules applied. Total rules applied 720 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 922 place count 473 transition count 928
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1000 place count 434 transition count 964
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 1022 place count 434 transition count 942
Applied a total of 1022 rules in 152 ms. Remains 434 /934 variables (removed 500) and now considering 942/1415 (removed 473) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17866351928729839031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11765451216880853869.kers'
[2026-05-26 02:16:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17866351928729839031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11765451216880853869.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 2 ms.
// Phase 1: matrix 942 rows 426 cols 3971 entries
Finished phase 1 with 351 SingleSign rule and 17 generalized
[2026-05-26 02:16:39] [INFO ] Computed 66 invariants in 8 ms
Computed 66 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-11765451216880853869.kers
Total runtime 11 ms.
[2026-05-26 02:16:39] [INFO ] Implicit Places using invariants in 259 ms returned [12, 47, 96, 135, 195, 275, 364, 412]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 261 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/934 places, 942/1415 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 404 transition count 920
Applied a total of 44 rules in 15 ms. Remains 404 /426 variables (removed 22) and now considering 920/942 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3323143894493300656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9356551020997399140.kers'
[2026-05-26 02:16:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3323143894493300656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9356551020997399140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 404 cols 3883 entries
Finished phase 1 with 329 SingleSign rule and 17 generalized
[2026-05-26 02:16:39] [INFO ] Computed 58 invariants in 4 ms
Computed 58 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9356551020997399140.kers
Total runtime 5 ms.
[2026-05-26 02:16:40] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-26 02:16:40] [INFO ] Invariant cache hit.
[2026-05-26 02:16:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:16:40] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/934 places, 920/1415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1383 ms. Remains : 404/934 places, 920/1415 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-06
Product exploration explored 100000 steps with 699 reset in 409 ms.
Product exploration explored 100000 steps with 711 reset in 408 ms.
Computed a total of 4 stabilizing places and 12 stable transitions
Computed a total of 4 stabilizing places and 12 stable transitions
Detected a total of 4/404 stabilizing places and 12/920 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 3085 steps (19 resets) in 23 ms. (128 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 326 ms.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 920/920 transitions.
Applied a total of 0 rules in 14 ms. Remains 404 /404 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2026-05-26 02:16:42] [INFO ] Invariant cache hit.
[2026-05-26 02:16:42] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-26 02:16:42] [INFO ] Invariant cache hit.
[2026-05-26 02:16:42] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:16:43] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
[2026-05-26 02:16:43] [INFO ] Redundant transitions in 11 ms returned []
Running 915 sub problems to find dead transitions.
[2026-05-26 02:16:43] [INFO ] Invariant cache hit.
[2026-05-26 02:16:43] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/1324 variables, and 63 constraints, problems are : Problem set: 0 solved, 915 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 0/404 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 915/915 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 915 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (OVERLAPS) 2/404 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 4 (OVERLAPS) 920/1324 variables, 404/467 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1324 variables, 53/520 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 915/1435 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1435 constraints, problems are : Problem set: 0 solved, 915 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 404/404 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 915/915 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 915 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61161 ms. Remains : 404/404 places, 920/920 transitions.
Computed a total of 4 stabilizing places and 12 stable transitions
Computed a total of 4 stabilizing places and 12 stable transitions
Detected a total of 4/404 stabilizing places and 12/920 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 10784 steps (72 resets) in 61 ms. (173 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 352 ms.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 703 reset in 361 ms.
Product exploration explored 100000 steps with 695 reset in 386 ms.
Built C files in :
/tmp/ltsmin14200376430306549683
[2026-05-26 02:17:44] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2026-05-26 02:17:44] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:17:44] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2026-05-26 02:17:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:17:44] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2026-05-26 02:17:44] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:17:44] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14200376430306549683
Running compilation step : cd /tmp/ltsmin14200376430306549683;'/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'
Compilation finished in 2662 ms.
Running link step : cd /tmp/ltsmin14200376430306549683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14200376430306549683;'/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' '--hoa' '/tmp/stateBased4204280781080373321.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 920/920 transitions.
Applied a total of 0 rules in 11 ms. Remains 404 /404 variables (removed 0) and now considering 920/920 (removed 0) transitions.
[2026-05-26 02:17:59] [INFO ] Invariant cache hit.
[2026-05-26 02:18:00] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-26 02:18:00] [INFO ] Invariant cache hit.
[2026-05-26 02:18:00] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:18:00] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2026-05-26 02:18:00] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 989 ms. Remains : 404/404 places, 920/920 transitions.
Built C files in :
/tmp/ltsmin17151941749402824198
[2026-05-26 02:18:00] [INFO ] Computing symmetric may disable matrix : 920 transitions.
[2026-05-26 02:18:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:18:00] [INFO ] Computing symmetric may enable matrix : 920 transitions.
[2026-05-26 02:18:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:18:00] [INFO ] Computing Do-Not-Accords matrix : 920 transitions.
[2026-05-26 02:18:00] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:18:00] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17151941749402824198
Running compilation step : cd /tmp/ltsmin17151941749402824198;'/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'
Compilation finished in 2620 ms.
Running link step : cd /tmp/ltsmin17151941749402824198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin17151941749402824198;'/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' '--hoa' '/tmp/stateBased16405894260374996600.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:18:15] [INFO ] Flatten gal took : 29 ms
[2026-05-26 02:18:15] [INFO ] Flatten gal took : 29 ms
[2026-05-26 02:18:15] [INFO ] Time to serialize gal into /tmp/LTL17075494476898303378.gal : 5 ms
[2026-05-26 02:18:15] [INFO ] Time to serialize properties into /tmp/LTL5307162999068120166.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17075494476898303378.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9671956986388872075.hoa' '-atoms' '/tmp/LTL5307162999068120166.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/LTL5307162999068120166.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9671956986388872075.hoa
Detected timeout of ITS tools.
[2026-05-26 02:18:31] [INFO ] Flatten gal took : 23 ms
[2026-05-26 02:18:31] [INFO ] Flatten gal took : 20 ms
[2026-05-26 02:18:31] [INFO ] Time to serialize gal into /tmp/LTL13316147540564850212.gal : 5 ms
[2026-05-26 02:18:31] [INFO ] Time to serialize properties into /tmp/LTL13424044906553996845.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13316147540564850212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13424044906553996845.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(p267==0)"))&&(F(G("(p16==0)"))))))
Formula 0 simplified : F(G!"(p267==0)" | GF!"(p16==0)")
Detected timeout of ITS tools.
[2026-05-26 02:18:46] [INFO ] Flatten gal took : 22 ms
[2026-05-26 02:18:46] [INFO ] Applying decomposition
[2026-05-26 02:18:46] [INFO ] Flatten gal took : 19 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/graph6597198315371127224.txt' '-o' '/tmp/graph6597198315371127224.bin' '-w' '/tmp/graph6597198315371127224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6597198315371127224.bin' '-l' '-1' '-v' '-w' '/tmp/graph6597198315371127224.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:18:46] [INFO ] Decomposing Gal with order
[2026-05-26 02:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:18:46] [INFO ] Removed a total of 699 redundant transitions.
[2026-05-26 02:18:46] [INFO ] Flatten gal took : 61 ms
[2026-05-26 02:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 39 ms.
[2026-05-26 02:18:46] [INFO ] Time to serialize gal into /tmp/LTL4487723896476983370.gal : 7 ms
[2026-05-26 02:18:46] [INFO ] Time to serialize properties into /tmp/LTL4009899086561910627.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/LTL4487723896476983370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4009899086561910627.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("(i1.u8.p267==0)"))&&(F(G("(i6.u0.p16==0)"))))))
Formula 0 simplified : F(G!"(i1.u8.p267==0)" | GF!"(i6.u0.p16==0)")
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-6B-LTLFireability-06 finished in 141942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U X(p2))||X(p0))))'
Support contains 3 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 921 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 921 transition count 1393
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 914 transition count 1381
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 914 transition count 1381
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 909 transition count 1368
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 909 transition count 1368
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 904 transition count 1361
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 904 transition count 1361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 904 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 903 transition count 1355
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 902 transition count 1353
Applied a total of 69 rules in 114 ms. Remains 902 /934 variables (removed 32) and now considering 1353/1415 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12776466054875718679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-375138839982313051.kers'
[2026-05-26 02:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12776466054875718679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-375138839982313051.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1353 rows 902 cols 4253 entries
Finished phase 1 with 836 SingleSign rule and 0 generalized
[2026-05-26 02:19:01] [INFO ] Computed 66 invariants in 10 ms
Computed 66 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-375138839982313051.kers
Total runtime 14 ms.
[2026-05-26 02:19:01] [INFO ] Implicit Places using invariants in 451 ms returned []
[2026-05-26 02:19:02] [INFO ] Invariant cache hit.
[2026-05-26 02:19:03] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Running 1352 sub problems to find dead transitions.
[2026-05-26 02:19:03] [INFO ] Invariant cache hit.
(s508 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 901/2255 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/902 constraints, PredecessorRefiner: 1352/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/2255 variables, and 0 constraints, problems are : Problem set: 0 solved, 1352 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/902 constraints, PredecessorRefiner: 0/1352 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60323ms problems are : Problem set: 0 solved, 1352 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LTL mode, iteration 1 : 902/934 places, 1353/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61905 ms. Remains : 902/934 places, 1353/1415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U X(p2))||X(p0))))'
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 62284 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(G((p0||(p1 U (F(G(!p2)) U G(p3)))))))'
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 922 transition count 1395
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 922 transition count 1395
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 916 transition count 1385
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 916 transition count 1385
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 912 transition count 1374
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 912 transition count 1374
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 908 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 908 transition count 1368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 908 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 907 transition count 1362
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 907 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 906 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 906 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 906 transition count 1360
Applied a total of 61 rules in 106 ms. Remains 906 /934 variables (removed 28) and now considering 1360/1415 (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-3458823659012394651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4129956343333977225.kers'
[2026-05-26 02:20:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3458823659012394651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4129956343333977225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1360 rows 906 cols 4275 entries
Finished phase 1 with 840 SingleSign rule and 0 generalized
[2026-05-26 02:20:03] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4129956343333977225.kers
Total runtime 7 ms.
[2026-05-26 02:20:04] [INFO ] Implicit Places using invariants in 411 ms returned []
[2026-05-26 02:20:04] [INFO ] Invariant cache hit.
[2026-05-26 02:20:05] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Running 1359 sub problems to find dead transitions.
[2026-05-26 02:20:05] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 905/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/906 constraints, PredecessorRefiner: 1359/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/906 constraints, PredecessorRefiner: 0/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60266ms problems are : Problem set: 0 solved, 1359 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 906/934 places, 1360/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61834 ms. Remains : 906/934 places, 1360/1415 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(G((p0||(p1 U (F(G(!p2)) U G(p3)))))))'
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), p2, (NOT p3), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09
Product exploration explored 100000 steps with 221 reset in 233 ms.
Product exploration explored 100000 steps with 223 reset in 258 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge based reduction with 17 factoid took 76 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (89 resets) in 187 ms. (212 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
[2026-05-26 02:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 766/906 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1360/2266 variables, 906/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2266 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2266 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2266/2266 variables, and 972 constraints, problems are : Problem set: 0 solved, 2 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 906/906 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 135/140 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 766/906 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1360/2266 variables, 906/972 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2266 variables, 2/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2266 variables, 8/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2266 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2266 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2266/2266 variables, and 982 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 906/906 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 190 ms.
Support contains 3 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 1360/1360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 906 transition count 1331
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 877 transition count 1331
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 58 place count 877 transition count 1236
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 248 place count 782 transition count 1236
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 272 place count 758 transition count 1097
Iterating global reduction 2 with 24 rules applied. Total rules applied 296 place count 758 transition count 1097
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 296 place count 758 transition count 1096
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 757 transition count 1096
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 300 place count 755 transition count 1085
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 755 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 303 place count 754 transition count 1083
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 754 transition count 1083
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 658 place count 577 transition count 906
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 860 place count 476 transition count 936
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 940 place count 436 transition count 961
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 964 place count 436 transition count 937
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 987 place count 436 transition count 914
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1024 place count 413 transition count 900
Applied a total of 1024 rules in 116 ms. Remains 413 /906 variables (removed 493) and now considering 900/1360 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 413/906 places, 900/1360 transitions.
RANDOM walk for 35266 steps (247 resets) in 187 ms. (187 steps per ms) remains 0/1 properties
Knowledge based reduction with 17 factoid took 130 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p3) p2), p2, (NOT p3)]
[2026-05-26 02:21:10] [INFO ] Invariant cache hit.
[2026-05-26 02:21:11] [INFO ] [Real]Absence check using 66 positive place invariants in 291 ms returned sat
[2026-05-26 02:21:19] [INFO ] [Real]Absence check using state equation in 7812 ms returned sat
[2026-05-26 02:21:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 02:21:19] [INFO ] [Nat]Absence check using 66 positive place invariants in 208 ms returned sat
[2026-05-26 02:21:28] [INFO ] [Nat]Absence check using state equation in 8197 ms returned sat
[2026-05-26 02:21:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2026-05-26 02:21:28] [INFO ] Computed and/alt/rep : 1298/3878/1298 causal constraints (skipped 61 transitions) in 70 ms.
Could not prove EG (NOT p3)
Knowledge-based reduction took 27953 ms.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p3) p2), p2, (NOT p3)]
Support contains 3 out of 906 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 906/906 places, 1360/1360 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 905 transition count 1330
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 876 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 58 place count 876 transition count 1235
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 248 place count 781 transition count 1235
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 270 place count 759 transition count 1099
Iterating global reduction 2 with 22 rules applied. Total rules applied 292 place count 759 transition count 1099
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 642 place count 584 transition count 924
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 643 place count 583 transition count 915
Iterating global reduction 2 with 1 rules applied. Total rules applied 644 place count 583 transition count 915
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 846 place count 482 transition count 945
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 924 place count 443 transition count 957
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 948 place count 443 transition count 933
Applied a total of 948 rules in 90 ms. Remains 443 /906 variables (removed 463) and now considering 933/1360 (removed 427) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1396198920779204353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10557147615492857879.kers'
[2026-05-26 02:21:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1396198920779204353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10557147615492857879.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 2 ms.
// Phase 1: matrix 933 rows 436 cols 3664 entries
Finished phase 1 with 360 SingleSign rule and 17 generalized
[2026-05-26 02:21:34] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10557147615492857879.kers
Total runtime 9 ms.
[2026-05-26 02:21:34] [INFO ] Implicit Places using invariants in 250 ms returned [12, 50, 138, 200, 283, 333, 372, 421]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 252 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 435/906 places, 933/1360 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 414 transition count 912
Applied a total of 42 rules in 13 ms. Remains 414 /435 variables (removed 21) and now considering 912/933 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5367378065162851765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3701427886989252650.kers'
[2026-05-26 02:21:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5367378065162851765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3701427886989252650.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 912 rows 414 cols 3578 entries
Finished phase 1 with 339 SingleSign rule and 17 generalized
[2026-05-26 02:21:34] [INFO ] Computed 58 invariants in 5 ms
Computed 58 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3701427886989252650.kers
Total runtime 7 ms.
[2026-05-26 02:21:34] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-26 02:21:34] [INFO ] Invariant cache hit.
[2026-05-26 02:21:35] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:21:35] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 414/906 places, 912/1360 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1172 ms. Remains : 414/906 places, 912/1360 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Knowledge based reduction with 7 factoid took 62 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
RANDOM walk for 36173 steps (241 resets) in 190 ms. (189 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p3) p2), p2, (NOT p3)]
[2026-05-26 02:21:35] [INFO ] Invariant cache hit.
[2026-05-26 02:21:36] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2026-05-26 02:21:36] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2026-05-26 02:21:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 02:21:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 27 ms returned sat
[2026-05-26 02:21:37] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2026-05-26 02:21:37] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-26 02:21:38] [INFO ] [Nat]Added 52 Read/Feed constraints in 113 ms returned sat
[2026-05-26 02:21:38] [INFO ] Computed and/alt/rep : 660/4465/660 causal constraints (skipped 248 transitions) in 56 ms.
[2026-05-26 02:21:42] [INFO ] Added : 297 causal constraints over 60 iterations in 4755 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 7225 ms.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p3) p2), p2, (NOT p3)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p3) p2), p2, (NOT p3)]
Product exploration explored 100000 steps with 660 reset in 388 ms.
Product exploration explored 100000 steps with 661 reset in 415 ms.
Built C files in :
/tmp/ltsmin5483807170211519786
[2026-05-26 02:21:43] [INFO ] Computing symmetric may disable matrix : 912 transitions.
[2026-05-26 02:21:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:21:43] [INFO ] Computing symmetric may enable matrix : 912 transitions.
[2026-05-26 02:21:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:21:44] [INFO ] Computing Do-Not-Accords matrix : 912 transitions.
[2026-05-26 02:21:44] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:21:44] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5483807170211519786
Running compilation step : cd /tmp/ltsmin5483807170211519786;'/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'
Compilation finished in 2714 ms.
Running link step : cd /tmp/ltsmin5483807170211519786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5483807170211519786;'/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' '--hoa' '/tmp/stateBased15970810841526145692.hoa' '--buchi-type=spotba'
LTSmin run took 4702 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 107814 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((G((G(p1)||p0))&&X(p2))))'
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 920 transition count 1393
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 920 transition count 1393
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 914 transition count 1383
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 914 transition count 1383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 910 transition count 1372
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 910 transition count 1372
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 906 transition count 1366
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 906 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 905 transition count 1364
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 905 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 904 transition count 1363
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 904 transition count 1363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 904 transition count 1362
Applied a total of 61 rules in 119 ms. Remains 904 /934 variables (removed 30) and now considering 1362/1415 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13408615024026985076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16337428107937553103.kers'
[2026-05-26 02:21:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13408615024026985076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16337428107937553103.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1362 rows 904 cols 4287 entries
Finished phase 1 with 838 SingleSign rule and 0 generalized
[2026-05-26 02:21:51] [INFO ] Computed 66 invariants in 11 ms
Computed 66 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16337428107937553103.kers
Total runtime 14 ms.
[2026-05-26 02:21:52] [INFO ] Implicit Places using invariants in 434 ms returned []
[2026-05-26 02:21:52] [INFO ] Invariant cache hit.
[2026-05-26 02:21:53] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
Running 1361 sub problems to find dead transitions.
[2026-05-26 02:21:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 1361/1361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1361 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 0/1361 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 904/934 places, 1362/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61850 ms. Remains : 904/934 places, 1362/1415 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((G((G(p1)||p0))&&X(p2))))'
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1206 steps with 3 reset in 5 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-11 finished in 62141 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))&&(X(X(F(!p1))) U G((G(p2) U p3)))))'
Support contains 7 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 921 transition count 1394
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 921 transition count 1394
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 915 transition count 1384
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 915 transition count 1384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 911 transition count 1373
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 911 transition count 1373
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 907 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 907 transition count 1368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 907 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 906 transition count 1362
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 906 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 905 transition count 1361
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 905 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 905 transition count 1360
Applied a total of 63 rules in 110 ms. Remains 905 /934 variables (removed 29) and now considering 1360/1415 (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-8355743850144027144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1850928978738065844.kers'
[2026-05-26 02:22:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8355743850144027144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1850928978738065844.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1360 rows 905 cols 4279 entries
Finished phase 1 with 839 SingleSign rule and 0 generalized
[2026-05-26 02:22:53] [INFO ] Computed 66 invariants in 12 ms
Computed 66 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-1850928978738065844.kers
Total runtime 14 ms.
[2026-05-26 02:22:54] [INFO ] Implicit Places using invariants in 398 ms returned []
[2026-05-26 02:22:54] [INFO ] Invariant cache hit.
[2026-05-26 02:22:55] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
Running 1359 sub problems to find dead transitions.
[2026-05-26 02:22:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/2265 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 1359/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1359 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/2265 variables, and 0 constraints, problems are : Problem set: 0 solved, 1359 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/905 constraints, PredecessorRefiner: 0/1359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1359 unsolved
Search for dead transitions found 0 dead transitions in 60284ms
Starting structural reductions in LTL mode, iteration 1 : 905/934 places, 1360/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61769 ms. Remains : 905/934 places, 1360/1415 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))&&(X(X(F(!p1))) U G((G(p2) U p3)))))'
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), p1, (NOT p3), (AND p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) p2 p1), (NOT p3), (AND p1 (NOT p3)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12
Stuttering criterion allowed to conclude after 484 steps with 4 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 62381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0&&X(G(p1))))) U (p1 U p2))))'
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 920 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 920 transition count 1392
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 913 transition count 1380
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 913 transition count 1380
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 908 transition count 1367
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 908 transition count 1367
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 903 transition count 1360
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 903 transition count 1360
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 903 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 902 transition count 1354
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 902 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 901 transition count 1353
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 901 transition count 1353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 901 transition count 1352
Applied a total of 71 rules in 115 ms. Remains 901 /934 variables (removed 33) and now considering 1352/1415 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2703215539430537095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17972229535097937767.kers'
[2026-05-26 02:23:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2703215539430537095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17972229535097937767.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1352 rows 901 cols 4251 entries
Finished phase 1 with 835 SingleSign rule and 0 generalized
[2026-05-26 02:23:56] [INFO ] Computed 66 invariants in 9 ms
Computed 66 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17972229535097937767.kers
Total runtime 13 ms.
[2026-05-26 02:23:56] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-26 02:23:56] [INFO ] Invariant cache hit.
[2026-05-26 02:23:57] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2026-05-26 02:23:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/2253 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/2253 variables, and 0 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 901/934 places, 1352/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61798 ms. Remains : 901/934 places, 1352/1415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0&&X(G(p1))))) U (p1 U p2))))'
Stuttering acceptance computed with spot in 327 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 62172 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(G(p0))||(X(p1) U p2)))'
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 920 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 920 transition count 1392
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 914 transition count 1382
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 914 transition count 1382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 910 transition count 1375
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 910 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 906 transition count 1369
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 906 transition count 1369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 906 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 905 transition count 1363
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 905 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 904 transition count 1362
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 904 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 904 transition count 1361
Applied a total of 65 rules in 98 ms. Remains 904 /934 variables (removed 30) and now considering 1361/1415 (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-14852332977723573949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5851223908235954802.kers'
[2026-05-26 02:24:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14852332977723573949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5851223908235954802.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1361 rows 904 cols 4281 entries
Finished phase 1 with 838 SingleSign rule and 0 generalized
[2026-05-26 02:24:58] [INFO ] Computed 66 invariants in 5 ms
Computed 66 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5851223908235954802.kers
Total runtime 9 ms.
[2026-05-26 02:24:58] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-26 02:24:58] [INFO ] Invariant cache hit.
[2026-05-26 02:24:59] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Running 1360 sub problems to find dead transitions.
[2026-05-26 02:24:59] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2265 variables, and 0 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2265 variables, and 0 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/904 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Starting structural reductions in LTL mode, iteration 1 : 904/934 places, 1361/1415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61854 ms. Remains : 904/934 places, 1361/1415 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(G(p0))||(X(p1) U p2)))'
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 351 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-14 finished in 62030 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(G(p0)))'
Support contains 1 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 1415/1415 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 933 transition count 1377
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 896 transition count 1377
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 74 place count 896 transition count 1280
Deduced a syphon composed of 97 places in 3 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 268 place count 799 transition count 1280
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 302 place count 765 transition count 1116
Iterating global reduction 2 with 34 rules applied. Total rules applied 336 place count 765 transition count 1116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 336 place count 765 transition count 1114
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 763 transition count 1114
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 346 place count 757 transition count 1092
Iterating global reduction 2 with 6 rules applied. Total rules applied 352 place count 757 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 354 place count 755 transition count 1088
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 755 transition count 1088
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 755 transition count 1087
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 711 place count 578 transition count 910
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 712 place count 577 transition count 908
Iterating global reduction 3 with 1 rules applied. Total rules applied 713 place count 577 transition count 908
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 714 place count 576 transition count 906
Iterating global reduction 3 with 1 rules applied. Total rules applied 715 place count 576 transition count 906
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 917 place count 475 transition count 936
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 997 place count 435 transition count 951
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 1021 place count 435 transition count 927
Applied a total of 1021 rules in 131 ms. Remains 435 /934 variables (removed 499) and now considering 927/1415 (removed 488) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10025171285221424427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9817931191368683964.kers'
[2026-05-26 02:26:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10025171285221424427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9817931191368683964.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 927 rows 426 cols 3972 entries
Finished phase 1 with 352 SingleSign rule and 17 generalized
[2026-05-26 02:26:00] [INFO ] Computed 66 invariants in 7 ms
Computed 66 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9817931191368683964.kers
Total runtime 9 ms.
[2026-05-26 02:26:00] [INFO ] Implicit Places using invariants in 252 ms returned [10, 45, 93, 132, 192, 272, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 253 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/934 places, 927/1415 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 903
Applied a total of 48 rules in 14 ms. Remains 402 /426 variables (removed 24) and now considering 903/927 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7242882300774421952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6761822549783889633.kers'
[2026-05-26 02:26:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7242882300774421952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6761822549783889633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 903 rows 402 cols 3876 entries
Finished phase 1 with 328 SingleSign rule and 17 generalized
[2026-05-26 02:26:00] [INFO ] Computed 57 invariants in 3 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6761822549783889633.kers
Total runtime 4 ms.
[2026-05-26 02:26:00] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-26 02:26:00] [INFO ] Invariant cache hit.
[2026-05-26 02:26:01] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-26 02:26:01] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/934 places, 903/1415 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1343 ms. Remains : 402/934 places, 903/1415 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)))'
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-15
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-15 finished in 1395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Spot run failed in 38 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 40 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-26 02:26:01] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7474305673757758833
[2026-05-26 02:26:01] [INFO ] Computing symmetric may disable matrix : 1415 transitions.
[2026-05-26 02:26:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:26:01] [INFO ] Computing symmetric may enable matrix : 1415 transitions.
[2026-05-26 02:26:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:26:01] [INFO ] Applying decomposition
[2026-05-26 02:26:01] [INFO ] Flatten gal took : 38 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/graph8656007751840442674.txt' '-o' '/tmp/graph8656007751840442674.bin' '-w' '/tmp/graph8656007751840442674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8656007751840442674.bin' '-l' '-1' '-v' '-w' '/tmp/graph8656007751840442674.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:26:02] [INFO ] Decomposing Gal with order
[2026-05-26 02:26:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:26:02] [INFO ] Removed a total of 1363 redundant transitions.
[2026-05-26 02:26:02] [INFO ] Flatten gal took : 158 ms
[2026-05-26 02:26:02] [INFO ] Computing Do-Not-Accords matrix : 1415 transitions.
[2026-05-26 02:26:02] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:26:02] [INFO ] Built C files in 565ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7474305673757758833
Running compilation step : cd /tmp/ltsmin7474305673757758833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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-26 02:26:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 36 ms.
[2026-05-26 02:26:02] [INFO ] Time to serialize gal into /tmp/LTLFireability12787841414404870757.gal : 10 ms
[2026-05-26 02:26:02] [INFO ] Time to serialize properties into /tmp/LTLFireability15720328596904323213.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12787841414404870757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15720328596904323213.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...278
Read 2 LTL properties
Checking formula 0 : !((X(("((!(((i10.i1.i1.u193.p847==1)&&(i10.i1.i1.u193.p1276==1))&&(i11.u316.p1498==1)))||(!((i11.u316.p1498==1)||(i6.u215.p955==1))))"...463
Formula 0 simplified : X(F!"(i10.i0.i2.u305.p1419!=1)" U !"((!(((i10.i1.i1.u193.p847==1)&&(i10.i1.i1.u193.p1276==1))&&(i11.u316.p1498==1)))||(!((i11.u316.p...187
Compilation finished in 5486 ms.
Running link step : cd /tmp/ltsmin7474305673757758833;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 99 ms.
Running LTSmin : cd /tmp/ltsmin7474305673757758833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7474305673757758833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7474305673757758833;'/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' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 02:52:53] [INFO ] Applying decomposition
[2026-05-26 02:52:53] [INFO ] Flatten gal took : 308 ms
[2026-05-26 02:52:54] [INFO ] Decomposing Gal with order
[2026-05-26 02:52:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:52:55] [INFO ] Removed a total of 940 redundant transitions.
[2026-05-26 02:52:56] [INFO ] Flatten gal took : 373 ms
[2026-05-26 02:52:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2125 labels/synchronizations in 657 ms.
[2026-05-26 02:52:57] [INFO ] Time to serialize gal into /tmp/LTLFireability15349544442549546634.gal : 47 ms
[2026-05-26 02:52:57] [INFO ] Time to serialize properties into /tmp/LTLFireability753686571440331480.ltl : 4 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/LTLFireability15349544442549546634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability753686571440331480.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 2 LTL properties
Checking formula 0 : !((X(("((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u101.p847==1)&&(i0.i0.i0.i0.i0.i0....1047
Formula 0 simplified : X(F!"(i0.i0.i0.i0.i0.i0.i0.u123.p1419!=1)" U !"((!(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...389
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7474305673757758833;'/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' '[]((<>((LTLAPp2==true))&&<>([]((LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7474305673757758833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'

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="NoC3x3-PT-6B"
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 NoC3x3-PT-6B, 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 r194-tall-177969914000348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6B.tgz
mv NoC3x3-PT-6B 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 ;