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.r146-tall-177961074100363.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 GPPP-PT-C1000N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Mar 7 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 11:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 11:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 10:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 7 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 7 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C1000N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779720749794

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C1000N0000000100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 14:52:31] [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-25 14:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 14:52:31] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2026-05-25 14:52:31] [INFO ] Transformed 33 places.
[2026-05-25 14:52:31] [INFO ] Transformed 22 transitions.
[2026-05-25 14:52:31] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 133 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 5 formulas.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12045251029306785768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12448417408570784854.kers'
[2026-05-25 14:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12045251029306785768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12448417408570784854.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 14:52:31] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12448417408570784854.kers
Total runtime 4 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 1 solved, 20 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20653ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 20667ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14748378318540804508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13337553121562865121.kers'
[2026-05-25 14:52:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14748378318540804508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13337553121562865121.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 27 cols 68 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 14:52:52] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13337553121562865121.kers
Total runtime 0 ms.
[2026-05-25 14:52:52] [WARNING] KERS value -104999993000 at col=5 row=24 overflows int; skipping row.
[2026-05-25 14:52:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 14:52:52] [INFO ] Invariant cache hit.
[2026-05-25 14:52:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20895 ms. Remains : 33/33 places, 21/22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 14:52:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 21/54 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 45 constraints, problems are : Problem set: 0 solved, 20 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 21/54 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 65 constraints, problems are : Problem set: 0 solved, 20 unsolved in 10325 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10730ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 10731ms
[2026-05-25 14:53:02] [INFO ] Invariant cache hit.
[2026-05-25 14:53:02] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 14:53:02] [INFO ] Invariant cache hit.
[2026-05-25 14:53:03] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 10825 ms. Remains : 33/33 places, 21/21 transitions.
Support contains 26 out of 33 places after structural reductions.
[2026-05-25 14:53:03] [INFO ] Flatten gal took : 17 ms
[2026-05-25 14:53:03] [INFO ] Flatten gal took : 6 ms
[2026-05-25 14:53:03] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40121 steps (12 resets) in 152 ms. (262 steps per ms) remains 5/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
[2026-05-25 14:53:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 4 (OVERLAPS) 11/26 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19/46 variables, 27/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 10 (OVERLAPS) 5/51 variables, 4/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 2/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/54 variables, 2/44 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/54 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/54 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/54 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 45 constraints, problems are : Problem set: 2 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 27/54 variables, and 9 constraints, problems are : Problem set: 3 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 5/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 19 stable transitions
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 X(X((p1||X(X(p2))||(p2 U p3)))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 4 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9645536590190635226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16337107533954484915.kers'
[2026-05-25 14:53:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9645536590190635226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16337107533954484915.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 14:53:04] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16337107533954484915.kers
Total runtime 0 ms.
[2026-05-25 14:53:04] [WARNING] KERS value -104999993000 at col=4 row=24 overflows int; skipping row.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 20 unsolved in 8329 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8625ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 8625ms
[2026-05-25 14:53:12] [INFO ] Invariant cache hit.
[2026-05-25 14:53:12] [INFO ] Implicit Places using invariants in 36 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8671 ms. Remains : 31/33 places, 21/21 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 X(X((p1||X(X(p2))||(p2 U p3)))))))'
Stuttering acceptance computed with spot in 840 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), true, (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-00
Product exploration explored 100000 steps with 25014 reset in 238 ms.
Product exploration explored 100000 steps with 25122 reset in 157 ms.
Computed a total of 29 stabilizing places and 19 stable transitions
Computed a total of 29 stabilizing places and 19 stable transitions
Detected a total of 29/31 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 14 factoid took 752 ms. Reduced automaton from 16 states, 23 edges and 4 AP (stutter sensitive) to 16 states, 23 edges and 4 AP (stutter sensitive).
RANDOM walk for 40292 steps (12 resets) in 77 ms. (516 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-143868758661647940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9866086946426991127.kers'
[2026-05-25 14:53:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-143868758661647940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9866086946426991127.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 14:53:15] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9866086946426991127.kers
Total runtime 0 ms.
[2026-05-25 14:53:15] [WARNING] KERS value -104999993000 at col=4 row=23 overflows int; skipping row.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/23 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/44 variables, 25/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/49 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/49 variables, 2/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/49 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/52 variables, 2/40 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 1/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/52 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 41 constraints, problems are : Problem set: 2 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/23 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Int declared 44/52 variables, and 32 constraints, problems are : Problem set: 3 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 4/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/31 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 17 factoid took 2835 ms. Reduced automaton from 16 states, 23 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p3))]
[2026-05-25 14:53:18] [INFO ] Invariant cache hit.
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 14:53:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 4 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-25 14:53:18] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 14:53:18] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p3))
[2026-05-25 14:53:18] [INFO ] Invariant cache hit.
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 14:53:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 5 ms returned sat
[2026-05-25 14:53:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 14:53:18] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 14:53:18] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p3))
Knowledge-based reduction took 4524 ms.
Stuttering acceptance computed with spot in 363 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p3))]
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 14:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 41 constraints, problems are : Problem set: 0 solved, 20 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/52 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 61 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1746 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1990ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1990ms
[2026-05-25 14:53:21] [INFO ] Invariant cache hit.
[2026-05-25 14:53:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 14:53:21] [INFO ] Invariant cache hit.
[2026-05-25 14:53:21] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2098 ms. Remains : 30/31 places, 21/21 transitions.
Computed a total of 28 stabilizing places and 19 stable transitions
Graph (complete) has 71 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 9 factoid took 169 ms. Reduced automaton from 8 states, 10 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
RANDOM walk for 23644 steps (6 resets) in 35 ms. (656 steps per ms) remains 0/5 properties
Knowledge based reduction with 9 factoid took 344 ms. Reduced automaton from 8 states, 10 edges and 4 AP (stutter sensitive) to 8 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p3))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16927285123496055050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15976469760558767398.kers'
[2026-05-25 14:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16927285123496055050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15976469760558767398.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 25 cols 65 entries
Finished phase 1 with 15 SingleSign rule and 5 generalized
[2026-05-25 14:53:22] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15976469760558767398.kers
Total runtime 0 ms.
[2026-05-25 14:53:22] [WARNING] KERS value 73447479000 at col=0 row=22 overflows int; skipping row.
[2026-05-25 14:53:22] [WARNING] KERS value -73398479000 at col=2 row=22 overflows int; skipping row.
[2026-05-25 14:53:22] [WARNING] KERS value -29377593000 at col=3 row=22 overflows int; skipping row.
[2026-05-25 14:53:22] [WARNING] KERS value 73433493000 at col=4 row=22 overflows int; skipping row.
[2026-05-25 14:53:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 14:53:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 14:53:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-25 14:53:22] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2026-05-25 14:53:22] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 14:53:22] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p3))
[2026-05-25 14:53:22] [INFO ] Invariant cache hit.
[2026-05-25 14:53:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 14:53:22] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-25 14:53:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 14:53:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 14:53:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 14:53:22] [INFO ] Computed and/alt/rep : 20/45/20 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 14:53:22] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p3))
Knowledge-based reduction took 1084 ms.
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 24962 reset in 83 ms.
Product exploration explored 100000 steps with 25053 reset in 196 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/ltsmin13553678072411027632
[2026-05-25 14:53:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13553678072411027632
Running compilation step : cd /tmp/ltsmin13553678072411027632;'/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 203 ms.
Running link step : cd /tmp/ltsmin13553678072411027632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13553678072411027632;'/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/stateBased6717892972272718532.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 14:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/51 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1058ms
[2026-05-25 14:53:39] [INFO ] Invariant cache hit.
[2026-05-25 14:53:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 14:53:39] [INFO ] Invariant cache hit.
[2026-05-25 14:53:39] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1186 ms. Remains : 30/30 places, 21/21 transitions.
Built C files in :
/tmp/ltsmin7390471331957881234
[2026-05-25 14:53:39] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7390471331957881234
Running compilation step : cd /tmp/ltsmin7390471331957881234;'/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 80 ms.
Running link step : cd /tmp/ltsmin7390471331957881234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7390471331957881234;'/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/stateBased17334075457017623454.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 14:53:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 14:53:54] [INFO ] Flatten gal took : 16 ms
[2026-05-25 14:53:54] [INFO ] Time to serialize gal into /tmp/LTL10171079395958266244.gal : 1 ms
[2026-05-25 14:53:54] [INFO ] Time to serialize properties into /tmp/LTL16430607281293418685.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10171079395958266244.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8782838762915442767.hoa' '-atoms' '/tmp/LTL16430607281293418685.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16430607281293418685.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8782838762915442767.hoa
Detected timeout of ITS tools.
[2026-05-25 14:54:09] [INFO ] Flatten gal took : 3 ms
[2026-05-25 14:54:09] [INFO ] Flatten gal took : 16 ms
[2026-05-25 14:54:09] [INFO ] Time to serialize gal into /tmp/LTL12723176419611246212.gal : 1 ms
[2026-05-25 14:54:09] [INFO ] Time to serialize properties into /tmp/LTL12942251239700371503.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/LTL12723176419611246212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12942251239700371503.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(("(_3PG<3)")U(X(X((("(ADP>=2)")||(X(X("(_3PG>=1)"))))||(("(_3PG>=1)")U("(_2PG>=3)"))))))))
Formula 0 simplified : F(!"(_3PG<3)" R XX(!"(ADP>=2)" & XX!"(_3PG>=1)" & (!"(_3PG>=1)" R !"(_2PG>=3)")))
Detected timeout of ITS tools.
[2026-05-25 14:54:24] [INFO ] Flatten gal took : 5 ms
[2026-05-25 14:54:24] [INFO ] Applying decomposition
[2026-05-25 14:54:24] [INFO ] Flatten gal took : 4 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/graph6020704571712311673.txt' '-o' '/tmp/graph6020704571712311673.bin' '-w' '/tmp/graph6020704571712311673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6020704571712311673.bin' '-l' '-1' '-v' '-w' '/tmp/graph6020704571712311673.weights' '-q' '0' '-e' '0.001'
[2026-05-25 14:54:24] [INFO ] Decomposing Gal with order
[2026-05-25 14:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 14:54:24] [INFO ] Removed a total of 2 redundant transitions.
[2026-05-25 14:54:24] [INFO ] Flatten gal took : 83 ms
[2026-05-25 14:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 14:54:24] [INFO ] Time to serialize gal into /tmp/LTL11838994728247490800.gal : 1 ms
[2026-05-25 14:54:24] [INFO ] Time to serialize properties into /tmp/LTL1660423820682025259.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/LTL11838994728247490800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1660423820682025259.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(u5._3PG<3)")U(X(X((("(i0.u1.ADP>=2)")||(X(X("(u5._3PG>=1)"))))||(("(u5._3PG>=1)")U("(u5._2PG>=3)"))))))))
Formula 0 simplified : F(!"(u5._3PG<3)" R XX(!"(i0.u1.ADP>=2)" & XX!"(u5._3PG>=1)" & (!"(u5._3PG>=1)" R !"(u5._2PG>=3)")))
Detected timeout of ITS tools.
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-00 finished in 95697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Applied a total of 7 rules in 12 ms. Remains 27 /33 variables (removed 6) and now considering 18/21 (removed 3) transitions.
Running 17 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-172412213140709760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2685711819405001297.kers'
[2026-05-25 14:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-172412213140709760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2685711819405001297.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 18 rows 22 cols 55 entries
Finished phase 1 with 13 SingleSign rule and 4 generalized
[2026-05-25 14:54:39] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2685711819405001297.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/45 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 37 constraints, problems are : Problem set: 0 solved, 17 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/45 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 54 constraints, problems are : Problem set: 0 solved, 17 unsolved in 8373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8719ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 8720ms
[2026-05-25 14:54:48] [INFO ] Invariant cache hit.
[2026-05-25 14:54:48] [INFO ] Implicit Places using invariants in 65 ms returned [0, 3, 15, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 68 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/33 places, 18/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 21 transition count 16
Applied a total of 4 rules in 4 ms. Remains 21 /23 variables (removed 2) and now considering 16/18 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6005808064356213508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12492898197816125968.kers'
[2026-05-25 14:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6005808064356213508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12492898197816125968.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 16 rows 18 cols 49 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 14:54:48] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12492898197816125968.kers
Total runtime 0 ms.
[2026-05-25 14:54:48] [WARNING] KERS value 20977502499 at col=2 row=0 overflows int; skipping row.
[2026-05-25 14:54:48] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 14:54:48] [INFO ] Invariant cache hit.
[2026-05-25 14:54:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/33 places, 16/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 8892 ms. Remains : 20/33 places, 16/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-01
Product exploration explored 100000 steps with 77 reset in 116 ms.
Stack based approach found an accepted trace after 2674 steps with 2 reset with depth 77 and stack size 75 in 3 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-01 finished in 9132 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((!p0&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2)))))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 0 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11192213577558920193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8866070032228128490.kers'
[2026-05-25 14:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11192213577558920193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8866070032228128490.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 14:54:49] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8866070032228128490.kers
Total runtime 0 ms.
[2026-05-25 14:54:49] [WARNING] KERS value -104999993000 at col=4 row=24 overflows int; skipping row.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4716 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5106ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 5106ms
[2026-05-25 14:54:54] [INFO ] Invariant cache hit.
[2026-05-25 14:54:54] [INFO ] Implicit Places using invariants in 45 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5170 ms. Remains : 31/33 places, 21/21 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((!p0&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2)))))))))'
Stuttering acceptance computed with spot in 291 ms :[true, true, true, (OR (NOT p1) p0), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-03 finished in 5491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 14:54:54] [INFO ] Invariant cache hit.
[2026-05-25 14:54:54] [INFO ] Implicit Places using invariants in 58 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 30/33 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-07
Product exploration explored 100000 steps with 2610 reset in 228 ms.
Stack based approach found an accepted trace after 102 steps with 2 reset with depth 37 and stack size 37 in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-07 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&G((p2&&X(p1))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 2 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 13 ms. Remains 27 /33 variables (removed 6) and now considering 17/21 (removed 4) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14465501662408333400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11501391629922099249.kers'
[2026-05-25 14:54:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14465501662408333400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11501391629922099249.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 16 rows 23 cols 57 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-25 14:54:55] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11501391629922099249.kers
Total runtime 0 ms.
[2026-05-25 14:54:55] [WARNING] KERS value -104999993000 at col=5 row=18 overflows int; skipping row.
[2026-05-25 14:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 16/43 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 38 constraints, problems are : Problem set: 0 solved, 16 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 27/27 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 27/44 variables, and 10 constraints, problems are : Problem set: 0 solved, 16 unsolved in 20011 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/27 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20606ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 20606ms
[2026-05-25 14:55:15] [INFO ] Invariant cache hit.
[2026-05-25 14:55:15] [INFO ] Implicit Places using invariants in 35 ms returned [3, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 17/21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 23 transition count 15
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 15/17 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6191675265984296406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9263585564265769840.kers'
[2026-05-25 14:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6191675265984296406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9263585564265769840.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 14 rows 20 cols 48 entries
Finished phase 1 with 10 SingleSign rule and 4 generalized
[2026-05-25 14:55:15] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9263585564265769840.kers
Total runtime 0 ms.
[2026-05-25 14:55:15] [INFO ] Implicit Places using invariants in 43 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/33 places, 15/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20718 ms. Remains : 22/33 places, 15/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (p1&&G((p2&&X(p1))))))'
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (OR (AND p1 (NOT p2)) (AND (NOT p1) p2))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-09 finished in 20905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(X(X(G(p2))))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18389853414480406094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17299567355873375423.kers'
[2026-05-25 14:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18389853414480406094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17299567355873375423.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 21 rows 26 cols 67 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 14:55:15] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17299567355873375423.kers
Total runtime 0 ms.
[2026-05-25 14:55:15] [WARNING] KERS value -104999993000 at col=4 row=24 overflows int; skipping row.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/53 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 63 constraints, problems are : Problem set: 0 solved, 20 unsolved in 7029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7360ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 7360ms
[2026-05-25 14:55:23] [INFO ] Invariant cache hit.
[2026-05-25 14:55:23] [INFO ] Implicit Places using invariants in 35 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7399 ms. Remains : 30/33 places, 21/21 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))&&X(X(X(G(p2))))))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 950 steps with 0 reset in 5 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-10 finished in 7643 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)||(p1 U (p2||G(p1)))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 14:55:23] [INFO ] Invariant cache hit.
[2026-05-25 14:55:23] [INFO ] Implicit Places using invariants in 40 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 30/33 places, 21/21 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)||(p1 U (p2||G(p1)))))'
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 24 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-11 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((G(p1)||(p1&&X((p2&&(p1 U (G(p1)||(p1&&G(p3))))))))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Applied a total of 1 rules in 1 ms. Remains 32 /33 variables (removed 1) and now considering 21/21 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 14:55:24] [INFO ] Invariant cache hit.
[2026-05-25 14:55:24] [INFO ] Implicit Places using invariants in 123 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 30/33 places, 21/21 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(p0)&&F((G(p1)||(p1&&X((p2&&(p1 U (G(p1)||(p1&&G(p3))))))))))))'
Stuttering acceptance computed with spot in 600 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-12
Product exploration explored 100000 steps with 33 reset in 178 ms.
Product exploration explored 100000 steps with 33 reset in 166 ms.
Computed a total of 28 stabilizing places and 19 stable transitions
Computed a total of 28 stabilizing places and 19 stable transitions
Detected a total of 28/30 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 34 factoid took 199 ms. Reduced automaton from 14 states, 67 edges and 4 AP (stutter sensitive) to 13 states, 64 edges and 4 AP (stutter sensitive).
RANDOM walk for 39698 steps (12 resets) in 42 ms. (923 steps per ms) remains 0/24 properties
Knowledge based reduction with 34 factoid took 530 ms. Reduced automaton from 13 states, 64 edges and 4 AP (stutter sensitive) to 13 states, 64 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Knowledge-based reduction took 1284 ms.
Stuttering acceptance computed with spot in 490 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18227965852172794361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7943075862704073107.kers'
[2026-05-25 14:55:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18227965852172794361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7943075862704073107.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 25 cols 62 entries
Finished phase 1 with 16 SingleSign rule and 4 generalized
[2026-05-25 14:55:27] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7943075862704073107.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 40 constraints, problems are : Problem set: 0 solved, 20 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/51 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 60 constraints, problems are : Problem set: 0 solved, 20 unsolved in 13727 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13998ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 13998ms
[2026-05-25 14:55:41] [INFO ] Invariant cache hit.
[2026-05-25 14:55:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 14:55:41] [INFO ] Invariant cache hit.
[2026-05-25 14:55:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/30 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14123 ms. Remains : 29/30 places, 21/21 transitions.
Computed a total of 27 stabilizing places and 19 stable transitions
Graph (complete) has 64 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 19 stable transitions
Detected a total of 27/29 stabilizing places and 19/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 33 factoid took 125 ms. Reduced automaton from 13 states, 64 edges and 4 AP (stutter sensitive) to 13 states, 64 edges and 4 AP (stutter sensitive).
RANDOM walk for 40265 steps (12 resets) in 31 ms. (1258 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16890696218066416805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18283233578280425368.kers'
[2026-05-25 14:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16890696218066416805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18283233578280425368.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 24 cols 60 entries
Finished phase 1 with 16 SingleSign rule and 4 generalized
[2026-05-25 14:55:41] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18283233578280425368.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/44 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/47 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/50 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/50 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/44 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/47 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/47 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/50 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/50 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/50 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 199ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1415 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=283 )
Parikh walk visited 1 properties in 20 ms.
Knowledge based reduction with 33 factoid took 466 ms. Reduced automaton from 13 states, 64 edges and 4 AP (stutter sensitive) to 13 states, 64 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Knowledge-based reduction took 1382 ms.
Stuttering acceptance computed with spot in 483 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 542 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33 reset in 130 ms.
Product exploration explored 100000 steps with 33 reset in 181 ms.
Spot run failed in 57 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/ltsmin12869313401130471688
[2026-05-25 14:55:43] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12869313401130471688
Running compilation step : cd /tmp/ltsmin12869313401130471688;'/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 94 ms.
Running link step : cd /tmp/ltsmin12869313401130471688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12869313401130471688;'/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/stateBased16322057603839712685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 14:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/50 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 38 constraints, problems are : Problem set: 0 solved, 20 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 29/50 variables, and 9 constraints, problems are : Problem set: 0 solved, 20 unsolved in 20006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/29 constraints, PredecessorRefiner: 0/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20305ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 20305ms
[2026-05-25 14:56:19] [INFO ] Invariant cache hit.
[2026-05-25 14:56:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 14:56:19] [INFO ] Invariant cache hit.
[2026-05-25 14:56:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20387 ms. Remains : 29/29 places, 21/21 transitions.
Built C files in :
/tmp/ltsmin9801131862420577567
[2026-05-25 14:56:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9801131862420577567
Running compilation step : cd /tmp/ltsmin9801131862420577567;'/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 85 ms.
Running link step : cd /tmp/ltsmin9801131862420577567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9801131862420577567;'/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/stateBased7841523716885915251.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 14:56:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 14:56:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 14:56:34] [INFO ] Time to serialize gal into /tmp/LTL5430362799730986149.gal : 0 ms
[2026-05-25 14:56:34] [INFO ] Time to serialize properties into /tmp/LTL13509306131929142892.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5430362799730986149.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3671619193572278107.hoa' '-atoms' '/tmp/LTL13509306131929142892.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/LTL13509306131929142892.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3671619193572278107.hoa
Detected timeout of ITS tools.
[2026-05-25 14:56:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 14:56:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 14:56:49] [INFO ] Time to serialize gal into /tmp/LTL1079916773974829640.gal : 1 ms
[2026-05-25 14:56:49] [INFO ] Time to serialize properties into /tmp/LTL2255675259705652324.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/LTL1079916773974829640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2255675259705652324.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...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("(ATP>DHAP)")))||((F("(ATP>DHAP)"))&&(F((G("(Pyr<1)"))||(("(Pyr<1)")&&(X(("(a2>_1_3_BPG)")&&(("(Pyr<1)")U((G("(Pyr<1)"))||(("(...190
Formula 0 simplified : FG!"(ATP>DHAP)" & (G!"(ATP>DHAP)" | G(F!"(Pyr<1)" & (!"(Pyr<1)" | X(!"(a2>_1_3_BPG)" | (F!"(GAP<1)" U !"(Pyr<1)")))))
Detected timeout of ITS tools.
[2026-05-25 14:57:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 14:57:04] [INFO ] Applying decomposition
[2026-05-25 14:57:04] [INFO ] Flatten gal took : 2 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/graph13343952379639468642.txt' '-o' '/tmp/graph13343952379639468642.bin' '-w' '/tmp/graph13343952379639468642.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13343952379639468642.bin' '-l' '-1' '-v' '-w' '/tmp/graph13343952379639468642.weights' '-q' '0' '-e' '0.001'
[2026-05-25 14:57:04] [INFO ] Decomposing Gal with order
[2026-05-25 14:57:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 14:57:04] [INFO ] Removed a total of 4 redundant transitions.
[2026-05-25 14:57:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 14:57:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2026-05-25 14:57:04] [INFO ] Time to serialize gal into /tmp/LTL2843671046108568764.gal : 0 ms
[2026-05-25 14:57:04] [INFO ] Time to serialize properties into /tmp/LTL5077399861117054194.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/LTL2843671046108568764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5077399861117054194.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...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("(gu0.ATP>gu0.DHAP)")))||((F("(gu0.ATP>gu0.DHAP)"))&&(F((G("(gu4.Pyr<1)"))||(("(gu4.Pyr<1)")&&(X(("(gu7.a2>gu7._1_3_BPG)")&&((...246
Formula 0 simplified : FG!"(gu0.ATP>gu0.DHAP)" & (G!"(gu0.ATP>gu0.DHAP)" | G(F!"(gu4.Pyr<1)" & (!"(gu4.Pyr<1)" | X(!"(gu7.a2>gu7._1_3_BPG)" | (F!"(gi2.gi1....188
Detected timeout of ITS tools.
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-12 finished in 115541 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||G(F(p0))))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 12 ms. Remains 25 /33 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6389716406002515832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10581248316943746942.kers'
[2026-05-25 14:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6389716406002515832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10581248316943746942.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 16 rows 20 cols 51 entries
Finished phase 1 with 11 SingleSign rule and 4 generalized
[2026-05-25 14:57:19] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10581248316943746942.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 25/41 variables, and 10 constraints, problems are : Problem set: 0 solved, 15 unsolved in 20005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/25 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20224ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 20224ms
[2026-05-25 14:57:39] [INFO ] Invariant cache hit.
[2026-05-25 14:57:39] [INFO ] Implicit Places using invariants in 47 ms returned [0, 3, 15, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 48 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/33 places, 16/21 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 14
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 14/16 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14509779148130377196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17571828468692500433.kers'
[2026-05-25 14:57:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14509779148130377196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17571828468692500433.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 14 rows 15 cols 42 entries
Finished phase 1 with 11 SingleSign rule and 2 generalized
[2026-05-25 14:57:39] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17571828468692500433.kers
Total runtime 0 ms.
[2026-05-25 14:57:39] [WARNING] KERS value 20977502499 at col=1 row=0 overflows int; skipping row.
[2026-05-25 14:57:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 14:57:39] [INFO ] Invariant cache hit.
[2026-05-25 14:57:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/33 places, 14/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 20378 ms. Remains : 18/33 places, 14/21 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||G(F(p0))))))'
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C1000N0000000100-LTLCardinality-13
Product exploration explored 100000 steps with 2263 reset in 100 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C1000N0000000100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C1000N0000000100-LTLCardinality-13 finished in 20572 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 X(X((p1||X(X(p2))||(p2 U p3)))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&F((G(p1)||(p1&&X((p2&&(p1 U (G(p1)||(p1&&G(p3))))))))))))'
Spot run failed in 51 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-25 14:57:40] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18039931688032923238
[2026-05-25 14:57:40] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2026-05-25 14:57:40] [INFO ] Applying decomposition
[2026-05-25 14:57:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:57:40] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2026-05-25 14:57:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:57:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 14:57:40] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2026-05-25 14:57:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 14:57:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18039931688032923238
Running compilation step : cd /tmp/ltsmin18039931688032923238;'/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'
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/graph7091962206068923130.txt' '-o' '/tmp/graph7091962206068923130.bin' '-w' '/tmp/graph7091962206068923130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7091962206068923130.bin' '-l' '-1' '-v' '-w' '/tmp/graph7091962206068923130.weights' '-q' '0' '-e' '0.001'
[2026-05-25 14:57:40] [INFO ] Decomposing Gal with order
[2026-05-25 14:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 14:57:40] [INFO ] Removed a total of 4 redundant transitions.
[2026-05-25 14:57:40] [INFO ] Flatten gal took : 15 ms
[2026-05-25 14:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2026-05-25 14:57:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality14526556164002970713.gal : 0 ms
[2026-05-25 14:57:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality9728287820660351674.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/LTLCardinality14526556164002970713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9728287820660351674.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...298
Read 2 LTL properties
Checking formula 0 : !((G(("(gi1.gi0.gu6._3PG<3)")U(X(X((("(gi1.gi0.gu7.ADP>=2)")||(X(X("(gi1.gi0.gu6._3PG>=1)"))))||(("(gi1.gi0.gu6._3PG>=1)")U("(gi1.gi0....176
Formula 0 simplified : F(!"(gi1.gi0.gu6._3PG<3)" R XX(!"(gi1.gi0.gu7.ADP>=2)" & XX!"(gi1.gi0.gu6._3PG>=1)" & (!"(gi1.gi0.gu6._3PG>=1)" R !"(gi1.gi0.gu6._2P...164
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin18039931688032923238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18039931688032923238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true) U X(X(((LTLAPp1==true)||X(X((LTLAPp2==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18039931688032923238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true) U X(X(((LTLAPp1==true)||X(X((LTLAPp2==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18039931688032923238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>((LTLAPp4==true)))||(<>((LTLAPp4==true))&&<>(([]((LTLAPp5==true))||((LTLAPp5==true)&&X(((LTLAPp6==true)&&((LTLAPp5==true) U ([]((LTLAPp5==true))||((LTLAPp5==true)&&[]((LTLAPp7==true))))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 15:19:36] [INFO ] Flatten gal took : 141 ms
[2026-05-25 15:19:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality14093685005416827917.gal : 40 ms
[2026-05-25 15:19:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality523055094697378831.ltl : 14 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/LTLCardinality14093685005416827917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality523055094697378831.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...297
Read 2 LTL properties
Checking formula 0 : !((G(("(_3PG<3)")U(X(X((("(ADP>=2)")||(X(X("(_3PG>=1)"))))||(("(_3PG>=1)")U("(_2PG>=3)"))))))))
Formula 0 simplified : F(!"(_3PG<3)" R XX(!"(ADP>=2)" & XX!"(_3PG>=1)" & (!"(_3PG>=1)" R !"(_2PG>=3)")))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin18039931688032923238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>((LTLAPp4==true)))||(<>((LTLAPp4==true))&&<>(([]((LTLAPp5==true))||((LTLAPp5==true)&&X(((LTLAPp6==true)&&((LTLAPp5==true) U ([]((LTLAPp5==true))||((LTLAPp5==true)&&[]((LTLAPp7==true))))))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin18039931688032923238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](((LTLAPp0==true) U X(X(((LTLAPp1==true)||X(X((LTLAPp2==true)))||((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 15:41:32] [INFO ] Flatten gal took : 10688 ms
[2026-05-25 15:41:32] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-25 15:41:32] [INFO ] Transformed 33 places.
[2026-05-25 15:41:32] [INFO ] Transformed 21 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-25 15:41:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality15544190671610768770.gal : 5 ms
[2026-05-25 15:41:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality5738319580232219062.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/LTLCardinality15544190671610768770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5738319580232219062.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 : !((G(("(_3PG<3)")U(X(X((("(ADP>=2)")||(X(X("(_3PG>=1)"))))||(("(_3PG>=1)")U("(_2PG>=3)"))))))))
Formula 0 simplified : F(!"(_3PG<3)" R XX(!"(ADP>=2)" & XX!"(_3PG>=1)" & (!"(_3PG>=1)" R !"(_2PG>=3)")))
Reverse transition relation is NOT exact ! Due to transitions t8, t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Computing Next relation with stutter on 4 deadlock states

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="GPPP-PT-C1000N0000000100"
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 GPPP-PT-C1000N0000000100, 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 r146-tall-177961074100363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;