About the Execution of ITS-Tools for PermAdmissibility-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.888 | 3600000.00 | 5580864.00 | 585213.50 | FFFT?TF?FFFFFFFF | normal |
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-177969914200635.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 PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 11K Mar 8 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 8 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 79K Mar 8 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 407K Mar 8 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 16 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 16 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 8 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 79K Mar 8 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 392K Mar 8 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 16 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 16 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 336K 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 PermAdmissibility-PT-20-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779803328004
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 13:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 13:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:48:49] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-05-26 13:48:49] [INFO ] Transformed 168 places.
[2026-05-26 13:48:49] [INFO ] Transformed 592 transitions.
[2026-05-26 13:48:49] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-PT-20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 126 transition count 592
Applied a total of 42 rules in 24 ms. Remains 126 /168 variables (removed 42) and now considering 592/592 (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-14993879270795007977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9520781622098805627.kers'
[2026-05-26 13:48:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14993879270795007977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9520781622098805627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 592 rows 126 cols 3120 entries
Finished phase 1 with 70 SingleSign rule and 38 generalized
[2026-05-26 13:48:49] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9520781622098805627.kers
Total runtime 3 ms.
[2026-05-26 13:48:49] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-26 13:48:49] [INFO ] Invariant cache hit.
[2026-05-26 13:48:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2026-05-26 13:48:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 17/120 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/712 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 6 (OVERLAPS) 6/718 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 8 (OVERLAPS) 0/718 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 718/718 variables, and 144 constraints, problems are : Problem set: 0 solved, 588 unsolved in 15486 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 17/120 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/712 variables, 120/138 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 332/470 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 712/718 variables, and 470 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 120/126 constraints, PredecessorRefiner: 332/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46256ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 46272ms
Starting structural reductions in LTL mode, iteration 1 : 126/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46866 ms. Remains : 126/168 places, 592/592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2026-05-26 13:49:36] [INFO ] Invariant cache hit.
[2026-05-26 13:49:36] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-26 13:49:36] [INFO ] Invariant cache hit.
[2026-05-26 13:49:36] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 126/126 places, 592/592 transitions.
Support contains 88 out of 126 places after structural reductions.
[2026-05-26 13:49:36] [INFO ] Flatten gal took : 80 ms
[2026-05-26 13:49:36] [INFO ] Flatten gal took : 53 ms
[2026-05-26 13:49:37] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 9619 steps (25 resets) in 121 ms. (78 steps per ms) remains 0/33 properties
FORMULA PermAdmissibility-PT-20-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 126 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 126 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 18 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Graph (complete) has 1195 edges and 126 vertex of which 94 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 87 transition count 352
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 87 transition count 352
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 29 place count 73 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 43 place count 73 transition count 226
Applied a total of 43 rules in 34 ms. Remains 73 /126 variables (removed 53) and now considering 226/592 (removed 366) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12342639282509990124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17868537623757326673.kers'
[2026-05-26 13:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12342639282509990124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17868537623757326673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 226 rows 73 cols 1153 entries
Finished phase 1 with 38 SingleSign rule and 20 generalized
[2026-05-26 13:49:37] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17868537623757326673.kers
Total runtime 1 ms.
[2026-05-26 13:49:37] [INFO ] Implicit Places using invariants in 73 ms returned [0, 28, 39]
[2026-05-26 13:49:37] [INFO ] Actually due to overlaps returned [0, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/126 places, 226/592 transitions.
Applied a total of 0 rules in 10 ms. Remains 71 /71 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 71/126 places, 226/592 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 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-01
Stuttering criterion allowed to conclude after 280 steps with 0 reset in 21 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-01 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(p1&&G(p2)))))'
Support contains 9 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 74 place count 78 transition count 344
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 61 transition count 122
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 61 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 59 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 59 transition count 106
Applied a total of 112 rules in 23 ms. Remains 59 /126 variables (removed 67) and now considering 106/592 (removed 486) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5306965793515294210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8499146691709739982.kers'
[2026-05-26 13:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5306965793515294210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8499146691709739982.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 106 rows 59 cols 575 entries
Finished phase 1 with 19 SingleSign rule and 24 generalized
[2026-05-26 13:49:38] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8499146691709739982.kers
Total runtime 1 ms.
[2026-05-26 13:49:38] [INFO ] Implicit Places using invariants in 56 ms returned [0, 5, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 57 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/126 places, 106/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 56/126 places, 106/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(G(p1)&&p2))))'
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 7474 steps with 1502 reset in 40 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-02 finished in 528 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(p0) U p1) U X((X((F(p2)||p3))&&p4)))))'
Support contains 29 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 41 place count 85 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 60 place count 85 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 80 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 80 transition count 292
Applied a total of 70 rules in 17 ms. Remains 80 /126 variables (removed 46) and now considering 292/592 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17093391162165300793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4032401010898846856.kers'
[2026-05-26 13:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17093391162165300793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4032401010898846856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 80 cols 1573 entries
Finished phase 1 with 32 SingleSign rule and 32 generalized
[2026-05-26 13:49:38] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4032401010898846856.kers
Total runtime 2 ms.
[2026-05-26 13:49:38] [INFO ] Implicit Places using invariants in 71 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/126 places, 292/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 79/126 places, 292/592 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(p0) U p1) U X((X((F(p2)||p3))&&p4)))))'
Stuttering acceptance computed with spot in 699 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3))), (OR (NOT p4) (AND (NOT p2) (NOT p3))), (OR (NOT p4) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p1) (NOT p2) (NOT p3) p4)), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-04
Product exploration explored 100000 steps with 10157 reset in 335 ms.
Product exploration explored 100000 steps with 10105 reset in 402 ms.
Computed a total of 79 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 1238 ms. Reduced automaton from 14 states, 36 edges and 5 AP (stutter sensitive) to 14 states, 36 edges and 5 AP (stutter sensitive).
RANDOM walk for 40031 steps (116 resets) in 419 ms. (95 steps per ms) remains 6/31 properties
BEST_FIRST walk for 40002 steps (10 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15862489478690904866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7615122942434513282.kers'
[2026-05-26 13:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15862489478690904866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7615122942434513282.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 79 cols 1505 entries
Finished phase 1 with 35 SingleSign rule and 29 generalized
[2026-05-26 13:49:42] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7615122942434513282.kers
Total runtime 2 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf6 is UNSAT
Problem apf14 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
After SMT solving in domain Real declared 72/371 variables, and 12 constraints, problems are : Problem set: 6 solved, 0 unsolved in 49 ms.
Refiners :[Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/79 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge based reduction with 22 factoid took 18939 ms. Reduced automaton from 14 states, 36 edges and 5 AP (stutter sensitive) to 12 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2026-05-26 13:50:01] [INFO ] Invariant cache hit.
[2026-05-26 13:50:01] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 13:50:01] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-26 13:50:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:50:01] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 13:50:01] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-26 13:50:02] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 260 transitions) in 34 ms.
[2026-05-26 13:50:02] [INFO ] Added : 14 causal constraints over 3 iterations in 123 ms. Result :sat
Could not prove EG (NOT p4)
[2026-05-26 13:50:02] [INFO ] Invariant cache hit.
[2026-05-26 13:50:02] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 13:50:02] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-26 13:50:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:50:02] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 13:50:02] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-26 13:50:02] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 260 transitions) in 33 ms.
[2026-05-26 13:50:02] [INFO ] Added : 20 causal constraints over 6 iterations in 159 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Knowledge-based reduction took 22411 ms.
Stuttering acceptance computed with spot in 537 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 29 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 292/292 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2026-05-26 13:50:03] [INFO ] Invariant cache hit.
[2026-05-26 13:50:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-26 13:50:03] [INFO ] Invariant cache hit.
[2026-05-26 13:50:03] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2026-05-26 13:50:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 292/371 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 288 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/371 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 94 constraints, problems are : Problem set: 0 solved, 288 unsolved in 6675 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 292/371 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 288/382 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 382 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36876ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 36878ms
Finished structural reductions in LTL mode , in 1 iterations and 37091 ms. Remains : 79/79 places, 292/292 transitions.
Computed a total of 79 stabilizing places and 292 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 79 transition count 292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 12 factoid took 1186 ms. Reduced automaton from 12 states, 25 edges and 5 AP (stutter sensitive) to 12 states, 25 edges and 5 AP (stutter sensitive).
RANDOM walk for 40052 steps (116 resets) in 68 ms. (580 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (16 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2026-05-26 13:50:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 292/371 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/371 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/79 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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/68 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/79 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 292/371 variables, 79/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/371 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 869 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 220 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 8 ms.
Knowledge based reduction with 12 factoid took 23541 ms. Reduced automaton from 12 states, 25 edges and 5 AP (stutter sensitive) to 12 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2026-05-26 13:51:06] [INFO ] Invariant cache hit.
[2026-05-26 13:51:06] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 10 ms returned sat
[2026-05-26 13:51:06] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-26 13:51:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:51:06] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 13:51:07] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-26 13:51:07] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 260 transitions) in 25 ms.
[2026-05-26 13:51:07] [INFO ] Added : 14 causal constraints over 3 iterations in 100 ms. Result :sat
Could not prove EG (NOT p4)
[2026-05-26 13:51:07] [INFO ] Invariant cache hit.
[2026-05-26 13:51:07] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 6 ms returned sat
[2026-05-26 13:51:07] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-26 13:51:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 13:51:07] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 13:51:07] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-26 13:51:07] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 260 transitions) in 27 ms.
[2026-05-26 13:51:07] [INFO ] Added : 20 causal constraints over 6 iterations in 151 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Knowledge-based reduction took 27377 ms.
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (NOT p4) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), true, (AND (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 10145 reset in 272 ms.
Product exploration explored 100000 steps with 10125 reset in 282 ms.
Spot run failed in 80 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/ltsmin6580250915041658095
[2026-05-26 13:51:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6580250915041658095
Running compilation step : cd /tmp/ltsmin6580250915041658095;'/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 582 ms.
Running link step : cd /tmp/ltsmin6580250915041658095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6580250915041658095;'/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/stateBased7835426261325814779.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 29 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 292/292 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2026-05-26 13:51:24] [INFO ] Invariant cache hit.
[2026-05-26 13:51:24] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-26 13:51:24] [INFO ] Invariant cache hit.
[2026-05-26 13:51:24] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 79/79 places, 292/292 transitions.
Built C files in :
/tmp/ltsmin3209985207535966135
[2026-05-26 13:51:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3209985207535966135
Running compilation step : cd /tmp/ltsmin3209985207535966135;'/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 464 ms.
Running link step : cd /tmp/ltsmin3209985207535966135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3209985207535966135;'/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/stateBased16043344640502021597.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 13:51:39] [INFO ] Flatten gal took : 17 ms
[2026-05-26 13:51:39] [INFO ] Flatten gal took : 16 ms
[2026-05-26 13:51:39] [INFO ] Time to serialize gal into /tmp/LTL9394655901272585464.gal : 3 ms
[2026-05-26 13:51:39] [INFO ] Time to serialize properties into /tmp/LTL17296701470792654435.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/LTL9394655901272585464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9673822621073157291.hoa' '-atoms' '/tmp/LTL17296701470792654435.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/LTL17296701470792654435.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9673822621073157291.hoa
Detected timeout of ITS tools.
[2026-05-26 13:51:54] [INFO ] Flatten gal took : 13 ms
[2026-05-26 13:51:54] [INFO ] Flatten gal took : 16 ms
[2026-05-26 13:51:54] [INFO ] Time to serialize gal into /tmp/LTL11697660123413313866.gal : 4 ms
[2026-05-26 13:51:54] [INFO ] Time to serialize properties into /tmp/LTL7035917010235859814.ltl : 12 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/LTL11697660123413313866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7035917010235859814.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((X("((((aux15_2+aux15_1)+(aux15_0+aux15_6))+((aux15_5+aux15_4)+(aux15_3+aux15_7)))<=((aux6_0+aux6_5)+(aux6_1+aux6_4)))"))U("(((a...329
Formula 0 simplified : X((!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" & X(!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" W !"((((aux15_2+aux15_1)+(aux15_0+aux15...366
Detected timeout of ITS tools.
[2026-05-26 13:52:09] [INFO ] Flatten gal took : 15 ms
[2026-05-26 13:52:09] [INFO ] Applying decomposition
[2026-05-26 13:52:09] [INFO ] Flatten gal took : 17 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/graph7365756207347103240.txt' '-o' '/tmp/graph7365756207347103240.bin' '-w' '/tmp/graph7365756207347103240.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7365756207347103240.bin' '-l' '-1' '-v' '-w' '/tmp/graph7365756207347103240.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:52:09] [INFO ] Decomposing Gal with order
[2026-05-26 13:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:52:10] [INFO ] Removed a total of 330 redundant transitions.
[2026-05-26 13:52:10] [INFO ] Flatten gal took : 102 ms
[2026-05-26 13:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 17 ms.
[2026-05-26 13:52:10] [INFO ] Time to serialize gal into /tmp/LTL12852997541656559083.gal : 4 ms
[2026-05-26 13:52:10] [INFO ] Time to serialize properties into /tmp/LTL14848793751998627489.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/LTL12852997541656559083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14848793751998627489.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(((X("((((gu3.aux15_2+gu3.aux15_1)+(gu3.aux15_0+gu3.aux15_6))+((gu3.aux15_5+gu3.aux15_4)+(gu3.aux15_3+gu3.aux15_7)))<=((gu3.aux6_0...453
Formula 0 simplified : X((!"(((gu4.aux8_7+gu4.aux8_3)+(gu4.aux8_6+gu4.aux8_2))>gu4.c12)" & X(!"(((gu4.aux8_7+gu4.aux8_3)+(gu4.aux8_6+gu4.aux8_2))>gu4.c12)"...510
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-04 finished in 166588 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&&(X(F((p2&&F(p3))))||p1))))'
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 112 transition count 592
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 34 place count 92 transition count 356
Iterating global reduction 1 with 20 rules applied. Total rules applied 54 place count 92 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 68 place count 78 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 82 place count 78 transition count 230
Applied a total of 82 rules in 8 ms. Remains 78 /126 variables (removed 48) and now considering 230/592 (removed 362) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12304387229926320809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14853281158254447771.kers'
[2026-05-26 13:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12304387229926320809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14853281158254447771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 78 cols 1254 entries
Finished phase 1 with 30 SingleSign rule and 31 generalized
[2026-05-26 13:52:25] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14853281158254447771.kers
Total runtime 1 ms.
[2026-05-26 13:52:25] [INFO ] Implicit Places using invariants in 95 ms returned [0, 5, 33, 44]
[2026-05-26 13:52:25] [INFO ] Actually due to overlaps returned [5, 0, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 97 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/126 places, 230/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 75/126 places, 230/592 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&&(X(F((p2&&F(p3))))||p1))))'
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (NOT p2) (NOT p3)), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 75 stabilizing places and 230 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 230
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 11 factoid took 66 ms. Proved property starting from automaton with 5 states, 7 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 128 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-20-LTLCardinality-05 finished in 681 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)&&G(X(p1))) U p2))'
Support contains 23 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 112 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 27 place count 99 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 40 place count 99 transition count 468
Applied a total of 40 rules in 5 ms. Remains 99 /126 variables (removed 27) and now considering 468/592 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3224534094237728599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11915973276887318.kers'
[2026-05-26 13:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3224534094237728599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11915973276887318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 99 cols 2432 entries
Finished phase 1 with 35 SingleSign rule and 47 generalized
[2026-05-26 13:52:25] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11915973276887318.kers
Total runtime 3 ms.
[2026-05-26 13:52:26] [INFO ] Implicit Places using invariants in 91 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/126 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 98/126 places, 468/592 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)&&G(X(p1))) U p2))'
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p2), (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-06 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(p0) U (!p0 U p1)) U G((p2 U !p0))))'
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Graph (complete) has 1195 edges and 126 vertex of which 104 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 85 transition count 372
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 49 place count 75 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 75 transition count 262
Applied a total of 59 rules in 23 ms. Remains 75 /126 variables (removed 51) and now considering 262/592 (removed 330) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1110871046364864255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17634684346328801098.kers'
[2026-05-26 13:52:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1110871046364864255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17634684346328801098.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 75 cols 1390 entries
Finished phase 1 with 32 SingleSign rule and 27 generalized
[2026-05-26 13:52:26] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17634684346328801098.kers
Total runtime 1 ms.
[2026-05-26 13:52:26] [INFO ] Implicit Places using invariants in 80 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/126 places, 262/592 transitions.
Applied a total of 0 rules in 8 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 74/126 places, 262/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(p0) U (!p0 U p1)) U G((p2 U !p0))))'
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-07
Product exploration explored 100000 steps with 428 reset in 708 ms.
Product exploration explored 100000 steps with 429 reset in 744 ms.
Computed a total of 74 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 123 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40054 steps (116 resets) in 57 ms. (690 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12488749444856463813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6240555283414128791.kers'
[2026-05-26 13:52:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12488749444856463813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6240555283414128791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 74 cols 1322 entries
Finished phase 1 with 36 SingleSign rule and 23 generalized
[2026-05-26 13:52:28] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6240555283414128791.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 16/336 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Generalized P Invariants (flows): 2/15 constraints, State Equation: 0/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 17 factoid took 211 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Knowledge-based reduction took 576 ms.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 11 out of 74 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 : 74/74 places, 262/262 transitions.
Applied a total of 0 rules in 10 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-26 13:52:28] [INFO ] Invariant cache hit.
[2026-05-26 13:52:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-26 13:52:28] [INFO ] Invariant cache hit.
[2026-05-26 13:52:28] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2026-05-26 13:52:28] [INFO ] Redundant transitions in 11 ms returned []
Running 258 sub problems to find dead transitions.
[2026-05-26 13:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 262/336 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 89 constraints, problems are : Problem set: 0 solved, 258 unsolved in 4647 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 262/336 variables, 74/89 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 258/347 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 336/336 variables, and 347 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34752ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 34753ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35020 ms. Remains : 74/74 places, 262/262 transitions.
Computed a total of 74 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 74 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 9 factoid took 57 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 27078 steps (78 resets) in 23 ms. (1128 steps per ms) remains 0/3 properties
Knowledge based reduction with 9 factoid took 106 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 122 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Knowledge-based reduction took 349 ms.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 434 reset in 671 ms.
Product exploration explored 100000 steps with 414 reset in 691 ms.
Built C files in :
/tmp/ltsmin3296649118191623850
[2026-05-26 13:53:05] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-26 13:53:05] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:05] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-26 13:53:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:05] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-26 13:53:05] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:05] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3296649118191623850
Running compilation step : cd /tmp/ltsmin3296649118191623850;'/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 572 ms.
Running link step : cd /tmp/ltsmin3296649118191623850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3296649118191623850;'/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/stateBased9440132207092082659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 11 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-26 13:53:20] [INFO ] Invariant cache hit.
[2026-05-26 13:53:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-26 13:53:20] [INFO ] Invariant cache hit.
[2026-05-26 13:53:20] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2026-05-26 13:53:20] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 74/74 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin15917184315831511377
[2026-05-26 13:53:20] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-05-26 13:53:20] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:20] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-05-26 13:53:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:20] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-05-26 13:53:20] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:53:20] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15917184315831511377
Running compilation step : cd /tmp/ltsmin15917184315831511377;'/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 578 ms.
Running link step : cd /tmp/ltsmin15917184315831511377;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15917184315831511377;'/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/stateBased88974196862368595.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 13:53:35] [INFO ] Flatten gal took : 16 ms
[2026-05-26 13:53:35] [INFO ] Flatten gal took : 31 ms
[2026-05-26 13:53:35] [INFO ] Time to serialize gal into /tmp/LTL146209371531975897.gal : 3 ms
[2026-05-26 13:53:35] [INFO ] Time to serialize properties into /tmp/LTL4426789355294125797.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/LTL146209371531975897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2468222738381977764.hoa' '-atoms' '/tmp/LTL4426789355294125797.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL4426789355294125797.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2468222738381977764.hoa
Detected timeout of ITS tools.
[2026-05-26 13:53:51] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:53:51] [INFO ] Flatten gal took : 11 ms
[2026-05-26 13:53:51] [INFO ] Time to serialize gal into /tmp/LTL5617463070130256955.gal : 3 ms
[2026-05-26 13:53:51] [INFO ] Time to serialize properties into /tmp/LTL13309648174105736649.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/LTL5617463070130256955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13309648174105736649.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((!(((G("((((aux16_0+aux16_1)+(aux16_2+aux16_3))+((aux16_4+aux16_5)+(aux16_6+aux16_7)))<3)"))U(("((((aux16_0+aux16_1)+(aux16_2+aux16_...338
Formula 0 simplified : (G"((((aux16_0+aux16_1)+(aux16_2+aux16_3))+((aux16_4+aux16_5)+(aux16_6+aux16_7)))<3)" U ("((((aux16_0+aux16_1)+(aux16_2+aux16_3))+((...326
Detected timeout of ITS tools.
[2026-05-26 13:54:06] [INFO ] Flatten gal took : 9 ms
[2026-05-26 13:54:06] [INFO ] Applying decomposition
[2026-05-26 13:54:06] [INFO ] Flatten gal took : 9 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/graph16400589806313122559.txt' '-o' '/tmp/graph16400589806313122559.bin' '-w' '/tmp/graph16400589806313122559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16400589806313122559.bin' '-l' '-1' '-v' '-w' '/tmp/graph16400589806313122559.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:54:06] [INFO ] Decomposing Gal with order
[2026-05-26 13:54:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:54:06] [INFO ] Removed a total of 212 redundant transitions.
[2026-05-26 13:54:06] [INFO ] Flatten gal took : 37 ms
[2026-05-26 13:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 9 ms.
[2026-05-26 13:54:06] [INFO ] Time to serialize gal into /tmp/LTL13688242532433436290.gal : 2 ms
[2026-05-26 13:54:06] [INFO ] Time to serialize properties into /tmp/LTL10227279938576364599.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/LTL13688242532433436290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10227279938576364599.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("((((gu0.aux16_0+gu0.aux16_1)+(gu0.aux16_2+gu0.aux16_3))+((gu0.aux16_4+gu0.aux16_5)+(gu0.aux16_6+gu0.aux16_7)))<3)"))U(("((((...482
Formula 0 simplified : (G"((((gu0.aux16_0+gu0.aux16_1)+(gu0.aux16_2+gu0.aux16_3))+((gu0.aux16_4+gu0.aux16_5)+(gu0.aux16_6+gu0.aux16_7)))<3)" U ("((((gu0.au...470
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-20-LTLCardinality-07 finished in 115052 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(((G(p0) U G(p1)) U !p0)))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Graph (complete) has 1195 edges and 126 vertex of which 105 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 26 place count 80 transition count 346
Iterating global reduction 0 with 25 rules applied. Total rules applied 51 place count 80 transition count 346
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 72 place count 59 transition count 126
Iterating global reduction 0 with 21 rules applied. Total rules applied 93 place count 59 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 95 place count 57 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 97 place count 57 transition count 110
Applied a total of 97 rules in 13 ms. Remains 57 /126 variables (removed 69) and now considering 110/592 (removed 482) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18048512308643124347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4608980451183341090.kers'
[2026-05-26 13:54:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18048512308643124347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4608980451183341090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 57 cols 591 entries
Finished phase 1 with 17 SingleSign rule and 24 generalized
[2026-05-26 13:54:21] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4608980451183341090.kers
Total runtime 0 ms.
[2026-05-26 13:54:21] [INFO ] Implicit Places using invariants in 50 ms returned [0, 7, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/126 places, 110/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 54/126 places, 110/592 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(((G(p0) U G(p1)) U !p0)))'
Stuttering acceptance computed with spot in 160 ms :[p0, (AND (NOT p0) p1), (OR (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-08 finished in 259 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&&F(G(p1)))) U X(p2))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 74 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 52 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 52 transition count 92
Applied a total of 126 rules in 10 ms. Remains 52 /126 variables (removed 74) and now considering 92/592 (removed 500) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7486639576940479874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16853013331576316238.kers'
[2026-05-26 13:54:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7486639576940479874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16853013331576316238.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 52 cols 489 entries
Finished phase 1 with 13 SingleSign rule and 23 generalized
[2026-05-26 13:54:21] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16853013331576316238.kers
Total runtime 1 ms.
[2026-05-26 13:54:21] [INFO ] Implicit Places using invariants in 51 ms returned [0, 5, 18, 25]
[2026-05-26 13:54:21] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/126 places, 92/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 49/126 places, 92/592 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&&F(G(p1)))) U X(p2))))'
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-10
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-10 finished in 324 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)))'
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 592
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 46 place count 80 transition count 348
Iterating global reduction 1 with 25 rules applied. Total rules applied 71 place count 80 transition count 348
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 93 place count 58 transition count 118
Iterating global reduction 1 with 22 rules applied. Total rules applied 115 place count 58 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 56 transition count 102
Applied a total of 119 rules in 11 ms. Remains 56 /126 variables (removed 70) and now considering 102/592 (removed 490) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16421917974355929044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13594298527941805905.kers'
[2026-05-26 13:54:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16421917974355929044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13594298527941805905.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 56 cols 545 entries
Finished phase 1 with 18 SingleSign rule and 22 generalized
[2026-05-26 13:54:21] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13594298527941805905.kers
Total runtime 0 ms.
[2026-05-26 13:54:21] [INFO ] Implicit Places using invariants in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/126 places, 102/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 55/126 places, 102/592 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)))'
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 188 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-12 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&X(p1)))||(p0&&X((p1&&F(p2))))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 45 place count 81 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 69 place count 81 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 88 place count 62 transition count 154
Iterating global reduction 1 with 19 rules applied. Total rules applied 107 place count 62 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 61 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 61 transition count 146
Applied a total of 109 rules in 8 ms. Remains 61 /126 variables (removed 65) and now considering 146/592 (removed 446) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7998471394222662516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7534083964832142275.kers'
[2026-05-26 13:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7998471394222662516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7534083964832142275.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 61 cols 792 entries
Finished phase 1 with 19 SingleSign rule and 26 generalized
[2026-05-26 13:54:22] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7534083964832142275.kers
Total runtime 2 ms.
[2026-05-26 13:54:22] [INFO ] Implicit Places using invariants in 65 ms returned [0, 7, 22, 31]
[2026-05-26 13:54:22] [INFO ] Actually due to overlaps returned [0, 7, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/126 places, 146/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 58/126 places, 146/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&X(p1)))||(p0&&X((p1&&F(p2))))))))'
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-13 finished in 347 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((G(p0)||G((G(p1)||X(!p1)))||X(p2))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 74 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 51 transition count 84
Applied a total of 128 rules in 7 ms. Remains 51 /126 variables (removed 75) and now considering 84/592 (removed 508) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1545374794448530403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14554305978462197685.kers'
[2026-05-26 13:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1545374794448530403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14554305978462197685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 13:54:22] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14554305978462197685.kers
Total runtime 1 ms.
[2026-05-26 13:54:22] [INFO ] Implicit Places using invariants in 46 ms returned [0, 5, 18, 25]
[2026-05-26 13:54:22] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/126 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 48/126 places, 84/592 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((G(p0)||G((G(p1)||X(!p1)))||X(p2))))'
Stuttering acceptance computed with spot in 382 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false, false, false, p1, (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-14 finished in 486 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 X(X((p1&&G(F(!p2))))))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 592/592 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 48 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 74 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 51 transition count 84
Applied a total of 128 rules in 8 ms. Remains 51 /126 variables (removed 75) and now considering 84/592 (removed 508) transitions.
[2026-05-26 13:54:22] [INFO ] Invariant cache hit.
[2026-05-26 13:54:22] [INFO ] Implicit Places using invariants in 47 ms returned [0, 5, 18, 25]
[2026-05-26 13:54:22] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/126 places, 84/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 48/126 places, 84/592 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 X(X((p1&&G(F(!p2))))))))'
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) p2), (AND (NOT p0) (NOT p1)), (OR (NOT p1) p2), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : PermAdmissibility-PT-20-LTLCardinality-15
Stuttering criterion allowed to conclude after 320 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-20-LTLCardinality-15 finished in 567 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(p0) U p1) U X((X((F(p2)||p3))&&p4)))))'
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(p0) U (!p0 U p1)) U G((p2 U !p0))))'
Spot run failed in 45 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 13:54:23] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7396524965505172984
[2026-05-26 13:54:23] [INFO ] Applying decomposition
[2026-05-26 13:54:23] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2026-05-26 13:54:23] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:54:23] [INFO ] Flatten gal took : 18 ms
[2026-05-26 13:54:23] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2026-05-26 13:54:23] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph6579101139926271114.txt' '-o' '/tmp/graph6579101139926271114.bin' '-w' '/tmp/graph6579101139926271114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6579101139926271114.bin' '-l' '-1' '-v' '-w' '/tmp/graph6579101139926271114.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:54:23] [INFO ] Decomposing Gal with order
[2026-05-26 13:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:54:23] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2026-05-26 13:54:23] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 13:54:23] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7396524965505172984
Running compilation step : cd /tmp/ltsmin7396524965505172984;'/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 13:54:23] [INFO ] Removed a total of 1099 redundant transitions.
[2026-05-26 13:54:23] [INFO ] Flatten gal took : 185 ms
[2026-05-26 13:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 54 ms.
[2026-05-26 13:54:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality11226781863692871418.gal : 10 ms
[2026-05-26 13:54:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality13859608224901583355.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/LTLCardinality11226781863692871418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13859608224901583355.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...299
Read 2 LTL properties
Checking formula 0 : !((X(((X("((((gu4.aux15_2+gu4.aux15_1)+(gu4.aux15_0+gu4.aux15_6))+((gu4.aux15_5+gu4.aux15_4)+(gu4.aux15_3+gu4.aux15_7)))<=((gu4.aux6_0...517
Formula 0 simplified : X((!"(((gi2.gi1.gu5.aux8_7+gi2.gi1.gu5.aux8_3)+(gi2.gi1.gu5.aux8_6+gi2.gi1.gu5.aux8_2))>gi2.gi1.gu5.c12)" & X(!"(((gi2.gi1.gu5.aux8_...614
Compilation finished in 1580 ms.
Running link step : cd /tmp/ltsmin7396524965505172984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7396524965505172984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((X((LTLAPp0==true)) U (LTLAPp1==true)) U X((X((<>((LTLAPp2==true))||(LTLAPp3==true)))&&(LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7396524965505172984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((X((LTLAPp0==true)) U (LTLAPp1==true)) U X((X((<>((LTLAPp2==true))||(LTLAPp3==true)))&&(LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7396524965505172984;'/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' '!(([]((LTLAPp5==true)) U (!(LTLAPp5==true) U (LTLAPp6==true))) U [](((LTLAPp7==true) U !(LTLAPp5==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 14:16:18] [INFO ] Flatten gal took : 322 ms
[2026-05-26 14:16:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality16619096383425851002.gal : 43 ms
[2026-05-26 14:16:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality66043686832384903.ltl : 18 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/LTLCardinality16619096383425851002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality66043686832384903.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...296
Read 2 LTL properties
Checking formula 0 : !((X(((X("((((aux15_2+aux15_1)+(aux15_0+aux15_6))+((aux15_5+aux15_4)+(aux15_3+aux15_7)))<=((aux6_0+aux6_5)+(aux6_1+aux6_4)))"))U("(((a...329
Formula 0 simplified : X((!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" & X(!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" W !"((((aux15_2+aux15_1)+(aux15_0+aux15...366
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7396524965505172984;'/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' '!(([]((LTLAPp5==true)) U (!(LTLAPp5==true) U (LTLAPp6==true))) U [](((LTLAPp7==true) U !(LTLAPp5==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7396524965505172984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((X((LTLAPp0==true)) U (LTLAPp1==true)) U X((X((<>((LTLAPp2==true))||(LTLAPp3==true)))&&(LTLAPp4==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 14:38:21] [INFO ] Flatten gal took : 281 ms
[2026-05-26 14:38:22] [INFO ] Input system was already deterministic with 592 transitions.
[2026-05-26 14:38:23] [INFO ] Transformed 126 places.
[2026-05-26 14:38:23] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 14:38:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality15996488171185999301.gal : 13 ms
[2026-05-26 14:38:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality5163400945768433589.ltl : 2 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/LTLCardinality15996488171185999301.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5163400945768433589.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(((X("((((aux15_2+aux15_1)+(aux15_0+aux15_6))+((aux15_5+aux15_4)+(aux15_3+aux15_7)))<=((aux6_0+aux6_5)+(aux6_1+aux6_4)))"))U("(((a...329
Formula 0 simplified : X((!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" & X(!"(((aux8_7+aux8_3)+(aux8_6+aux8_2))>c12)" W !"((((aux15_2+aux15_1)+(aux15_0+aux15...366
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-tall-177969914200635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;