fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r002-oct2-177944366000147
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for Anderson-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
587.579 241165.00 315867.00 234.40 FFFTFTFFFFFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366000147.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Anderson-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.1K Mar 4 18:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 4 18:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 4 18:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 4 18:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 4 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 4 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 4 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 4 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 103K 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 Anderson-PT-04-LTLCardinality-00
FORMULA_NAME Anderson-PT-04-LTLCardinality-01
FORMULA_NAME Anderson-PT-04-LTLCardinality-02
FORMULA_NAME Anderson-PT-04-LTLCardinality-03
FORMULA_NAME Anderson-PT-04-LTLCardinality-04
FORMULA_NAME Anderson-PT-04-LTLCardinality-05
FORMULA_NAME Anderson-PT-04-LTLCardinality-06
FORMULA_NAME Anderson-PT-04-LTLCardinality-07
FORMULA_NAME Anderson-PT-04-LTLCardinality-08
FORMULA_NAME Anderson-PT-04-LTLCardinality-09
FORMULA_NAME Anderson-PT-04-LTLCardinality-10
FORMULA_NAME Anderson-PT-04-LTLCardinality-11
FORMULA_NAME Anderson-PT-04-LTLCardinality-12
FORMULA_NAME Anderson-PT-04-LTLCardinality-13
FORMULA_NAME Anderson-PT-04-LTLCardinality-14
FORMULA_NAME Anderson-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779461948150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 14:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 14:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 14:59:10] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-22 14:59:10] [INFO ] Transformed 105 places.
[2026-05-22 14:59:10] [INFO ] Transformed 200 transitions.
[2026-05-22 14:59:10] [INFO ] Found NUPN structural information;
[2026-05-22 14:59:10] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 94 transition count 153
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 94 transition count 153
Applied a total of 22 rules in 34 ms. Remains 94 /105 variables (removed 11) and now considering 153/200 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18336319299326851345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11441880915363152823.kers'
[2026-05-22 14:59:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18336319299326851345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11441880915363152823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 94 cols 542 entries
Finished phase 1 with 41 SingleSign rule and 42 generalized
[2026-05-22 14:59:10] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11441880915363152823.kers
Total runtime 3 ms.
[2026-05-22 14:59:10] [INFO ] Implicit Places using invariants in 572 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 613 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 153/200 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 675 ms. Remains : 93/105 places, 153/200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6760426874717752060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8428504993074965440.kers'
[2026-05-22 14:59:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6760426874717752060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8428504993074965440.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 93 cols 510 entries
Finished phase 1 with 57 SingleSign rule and 26 generalized
[2026-05-22 14:59:10] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8428504993074965440.kers
Total runtime 1 ms.
[2026-05-22 14:59:11] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-22 14:59:11] [INFO ] Invariant cache hit.
[2026-05-22 14:59:11] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 14:59:11] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-22 14:59:11] [INFO ] Invariant cache hit.
[2026-05-22 14:59:11] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 153/246 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 132 constraints, problems are : Problem set: 0 solved, 149 unsolved in 18142 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 153/246 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 149/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 287 constraints, problems are : Problem set: 0 solved, 149 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48357ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 48386ms
Finished structural reductions in LTL mode , in 1 iterations and 49131 ms. Remains : 93/93 places, 153/153 transitions.
Support contains 44 out of 93 places after structural reductions.
[2026-05-22 15:00:00] [INFO ] Flatten gal took : 42 ms
[2026-05-22 15:00:00] [INFO ] Flatten gal took : 16 ms
[2026-05-22 15:00:00] [INFO ] Input system was already deterministic with 153 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (8 resets) in 1428 ms. (27 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
[2026-05-22 15:00:01] [INFO ] Invariant cache hit.
[2026-05-22 15:00:01] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp30 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/93 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 153/246 variables, 93/103 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 12/115 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 115 constraints, problems are : Problem set: 1 solved, 3 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/68 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/89 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/93 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 153/246 variables, 93/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 12/115 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/117 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 117 constraints, problems are : Problem set: 2 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 93/93 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 1 properties in 20 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 93 transition count 139
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 79 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 77 transition count 137
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 77 transition count 127
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 67 transition count 127
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 63 place count 56 transition count 80
Iterating global reduction 3 with 11 rules applied. Total rules applied 74 place count 56 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 54 transition count 78
Applied a total of 78 rules in 51 ms. Remains 54 /93 variables (removed 39) and now considering 78/153 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 54/93 places, 78/153 transitions.
RANDOM walk for 40000 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1061 steps, run visited all 1 properties in 9 ms. (steps per millisecond=117 )
Probabilistic random walk after 1061 steps, saw 521 distinct states, run finished after 13 ms. (steps per millisecond=81 ) properties seen :1
FORMULA Anderson-PT-04-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA Anderson-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1||(X(p2)&&F(p3))))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 83 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 83 transition count 113
Applied a total of 20 rules in 6 ms. Remains 83 /93 variables (removed 10) and now considering 113/153 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2991365213766256274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12736546365082090926.kers'
[2026-05-22 15:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2991365213766256274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12736546365082090926.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 83 cols 360 entries
Finished phase 1 with 47 SingleSign rule and 26 generalized
[2026-05-22 15:00:02] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12736546365082090926.kers
Total runtime 1 ms.
[2026-05-22 15:00:02] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-22 15:00:02] [INFO ] Invariant cache hit.
[2026-05-22 15:00:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:00:02] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-22 15:00:02] [INFO ] Invariant cache hit.
[2026-05-22 15:00:02] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 113/196 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 114 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 113/196 variables, 83/102 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 109/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 223 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13857 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18921ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 18923ms
Starting structural reductions in LTL mode, iteration 1 : 83/93 places, 113/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19353 ms. Remains : 83/93 places, 113/153 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)&&X((p1||(X(p2)&&F(p3))))))'
Stuttering acceptance computed with spot in 574 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), true]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-00
Product exploration explored 100000 steps with 2 reset in 308 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-00 finished in 20405 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 G((X(p0)||p1))) U (G(F(!p2))||G(p3))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 83 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 83 transition count 113
Applied a total of 20 rules in 10 ms. Remains 83 /93 variables (removed 10) and now considering 113/153 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8213831160683426936.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-132064610533974273.kers'
[2026-05-22 15:00:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8213831160683426936.kers, --Pflows, --basisKERS=/tmp/petrispot-output-132064610533974273.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 83 cols 360 entries
Finished phase 1 with 47 SingleSign rule and 26 generalized
[2026-05-22 15:00:22] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-132064610533974273.kers
Total runtime 2 ms.
[2026-05-22 15:00:22] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-22 15:00:22] [INFO ] Invariant cache hit.
[2026-05-22 15:00:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:00:22] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 83/93 places, 113/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 83/93 places, 113/153 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 G((X(p0)||p1))) U (G(F(!p2))||G(p3))))'
Stuttering acceptance computed with spot in 1226 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p2), (AND (NOT p0) p2 p3 (NOT p1)), (AND (NOT p0) p2 p3 (NOT p1)), (AND (NOT p3) (NOT p0) p2), false, (AND p2 (NOT p0)), (AND p3 (NOT p1) p2 (NOT p0)), (AND p2 (NOT p3)), (AND p3 (NOT p0) p2 (NOT p1)), (AND p2 (NOT p3) (NOT p0)), false, p2, p2, (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-02
Product exploration explored 100000 steps with 230 reset in 154 ms.
Stack based approach found an accepted trace after 1638 steps with 3 reset with depth 536 and stack size 301 in 4 ms.
FORMULA Anderson-PT-04-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-02 finished in 1812 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(X(((X(G((!p0 U G(p0)))) U p0)&&p1))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 81 transition count 105
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 81 transition count 105
Applied a total of 24 rules in 3 ms. Remains 81 /93 variables (removed 12) and now considering 105/153 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17695965802743467608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13612014917224803644.kers'
[2026-05-22 15:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17695965802743467608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13612014917224803644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 81 cols 330 entries
Finished phase 1 with 45 SingleSign rule and 26 generalized
[2026-05-22 15:00:24] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13612014917224803644.kers
Total runtime 2 ms.
[2026-05-22 15:00:24] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-22 15:00:24] [INFO ] Invariant cache hit.
[2026-05-22 15:00:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:00:24] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 15:00:24] [INFO ] Invariant cache hit.
[2026-05-22 15:00:24] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/81 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 105/186 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (OVERLAPS) 0/186 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 108 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6083 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/81 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 105/186 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 101/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (OVERLAPS) 0/186 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 15045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21176ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 21177ms
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 105/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21470 ms. Remains : 81/93 places, 105/153 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(X(((X(G((!p0 U G(p0)))) U p0)&&p1))))'
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 44 ms. Proved property starting from automaton with 4 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 51 ms.
FORMULA Anderson-PT-04-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-03 finished in 22105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))&&(F(G(p2)) U p2)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 81 transition count 105
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 81 transition count 105
Applied a total of 24 rules in 4 ms. Remains 81 /93 variables (removed 12) and now considering 105/153 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5516216668683340065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18058944581805334849.kers'
[2026-05-22 15:00:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5516216668683340065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18058944581805334849.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 81 cols 330 entries
Finished phase 1 with 45 SingleSign rule and 26 generalized
[2026-05-22 15:00:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18058944581805334849.kers
Total runtime 0 ms.
[2026-05-22 15:00:46] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-22 15:00:46] [INFO ] Invariant cache hit.
[2026-05-22 15:00:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:00:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 105/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 81/93 places, 105/153 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1))&&(F(G(p2)) U p2)))'
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 104 ms.
Stack based approach found an accepted trace after 50 steps with 1 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-04 finished in 754 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||G(p1)) U X(p2)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 80 transition count 104
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 80 transition count 104
Applied a total of 26 rules in 3 ms. Remains 80 /93 variables (removed 13) and now considering 104/153 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17346505075993089555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9913625336306774886.kers'
[2026-05-22 15:00:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17346505075993089555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9913625336306774886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 80 cols 328 entries
Finished phase 1 with 44 SingleSign rule and 26 generalized
[2026-05-22 15:00:47] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9913625336306774886.kers
Total runtime 0 ms.
[2026-05-22 15:00:47] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 15:00:47] [INFO ] Invariant cache hit.
[2026-05-22 15:00:47] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:00:47] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-22 15:00:47] [INFO ] Invariant cache hit.
[2026-05-22 15:00:47] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 104/184 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (OVERLAPS) 0/184 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 106 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5544 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 104/184 variables, 80/94 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 12/106 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 100/206 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/184 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 207 constraints, problems are : Problem set: 0 solved, 100 unsolved in 21007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26594ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 26595ms
Starting structural reductions in LTL mode, iteration 1 : 80/93 places, 104/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26933 ms. Remains : 80/93 places, 104/153 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||G(p1)) U X(p2)))'
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 26 ms. Proved property starting from automaton with 6 states, 12 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA Anderson-PT-04-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-05 finished in 27578 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((G(p1)||p0))))&&(p1 U (p2||G(p1)))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 81 transition count 111
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 81 transition count 111
Applied a total of 24 rules in 3 ms. Remains 81 /93 variables (removed 12) and now considering 111/153 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12144316425273844663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7065990755341255331.kers'
[2026-05-22 15:01:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12144316425273844663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7065990755341255331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 81 cols 356 entries
Finished phase 1 with 45 SingleSign rule and 26 generalized
[2026-05-22 15:01:14] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7065990755341255331.kers
Total runtime 3 ms.
[2026-05-22 15:01:14] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 15:01:14] [INFO ] Invariant cache hit.
[2026-05-22 15:01:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:01:15] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-22 15:01:15] [INFO ] Invariant cache hit.
[2026-05-22 15:01:15] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 111/192 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 108 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 111/192 variables, 81/96 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 216 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14061 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18794ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 18794ms
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 111/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19071 ms. Remains : 81/93 places, 111/153 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((G(p1)||p0))))&&(p1 U (p2||G(p1)))))'
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 8 steps with 1 reset in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-08 finished in 19443 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(p1))||p0)))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 82 transition count 112
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 82 transition count 112
Applied a total of 22 rules in 28 ms. Remains 82 /93 variables (removed 11) and now considering 112/153 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17806834175408373247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11853376147061297996.kers'
[2026-05-22 15:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17806834175408373247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11853376147061297996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 82 cols 358 entries
Finished phase 1 with 46 SingleSign rule and 26 generalized
[2026-05-22 15:01:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11853376147061297996.kers
Total runtime 2 ms.
[2026-05-22 15:01:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-22 15:01:34] [INFO ] Invariant cache hit.
[2026-05-22 15:01:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:01:34] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2026-05-22 15:01:34] [INFO ] Invariant cache hit.
[2026-05-22 15:01:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 112/194 variables, 82/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 109 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 112/194 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 108/217 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 219 constraints, problems are : Problem set: 0 solved, 108 unsolved in 18258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23158ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 23158ms
Starting structural reductions in LTL mode, iteration 1 : 82/93 places, 112/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23666 ms. Remains : 82/93 places, 112/153 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(p1))||p0)))'
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 145 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 46 ms. Proved property starting from automaton with 5 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 47 ms.
FORMULA Anderson-PT-04-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-11 finished in 24291 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(F(p0)))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 81 transition count 111
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 81 transition count 111
Applied a total of 24 rules in 2 ms. Remains 81 /93 variables (removed 12) and now considering 111/153 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11064446873705125636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13769143566513169208.kers'
[2026-05-22 15:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11064446873705125636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13769143566513169208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 81 cols 356 entries
Finished phase 1 with 45 SingleSign rule and 26 generalized
[2026-05-22 15:01:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13769143566513169208.kers
Total runtime 1 ms.
[2026-05-22 15:01:59] [INFO ] Implicit Places using invariants in 441 ms returned []
[2026-05-22 15:01:59] [INFO ] Invariant cache hit.
[2026-05-22 15:01:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:01:59] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-22 15:01:59] [INFO ] Invariant cache hit.
[2026-05-22 15:01:59] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 111/192 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 107 constraints, problems are : Problem set: 0 solved, 107 unsolved in 9463 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 111/192 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 12/107 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 107/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 215 constraints, problems are : Problem set: 0 solved, 107 unsolved in 14102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23597ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 23597ms
Starting structural reductions in LTL mode, iteration 1 : 81/93 places, 111/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24223 ms. Remains : 81/93 places, 111/153 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(F(p0)))))'
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 456 steps (0 resets) in 6 ms. (65 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 324 ms.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2026-05-22 15:02:23] [INFO ] Invariant cache hit.
[2026-05-22 15:02:23] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 15:02:23] [INFO ] Invariant cache hit.
[2026-05-22 15:02:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:02:24] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 81/81 places, 111/111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 3674 steps (0 resets) in 38 ms. (94 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 288 ms.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 163 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Spot run failed in 190 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/ltsmin10488767567477797168
[2026-05-22 15:02:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10488767567477797168
Running compilation step : cd /tmp/ltsmin10488767567477797168;'/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 411 ms.
Running link step : cd /tmp/ltsmin10488767567477797168;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin10488767567477797168;'/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/stateBased6351857201663651609.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA Anderson-PT-04-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-12 finished in 27533 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 G((F(p1)||X(X((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 83 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 83 transition count 107
Applied a total of 20 rules in 2 ms. Remains 83 /93 variables (removed 10) and now considering 107/153 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1497498456513567492.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1790150786793492740.kers'
[2026-05-22 15:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1497498456513567492.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1790150786793492740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 83 cols 334 entries
Finished phase 1 with 47 SingleSign rule and 26 generalized
[2026-05-22 15:02:26] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1790150786793492740.kers
Total runtime 1 ms.
[2026-05-22 15:02:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 15:02:26] [INFO ] Invariant cache hit.
[2026-05-22 15:02:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:02:26] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-22 15:02:26] [INFO ] Invariant cache hit.
[2026-05-22 15:02:26] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 1/83 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 107/190 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 112 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 1/83 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 107/190 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 103/215 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 12 (OVERLAPS) 0/190 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/190 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 216 constraints, problems are : Problem set: 0 solved, 103 unsolved in 18518 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24850ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 24850ms
Starting structural reductions in LTL mode, iteration 1 : 83/93 places, 107/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25297 ms. Remains : 83/93 places, 107/153 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 G((F(p1)||X(X((!p0 U (G(!p0)||(!p0&&(!p1 U (p2||G(!p1))))))))))))'
Stuttering acceptance computed with spot in 331 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-13
Product exploration explored 100000 steps with 4 reset in 119 ms.
Product exploration explored 100000 steps with 2 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 29828 steps (6 resets) in 265 ms. (112 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Knowledge-based reduction took 691 ms.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Support contains 4 out of 83 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2026-05-22 15:02:53] [INFO ] Invariant cache hit.
[2026-05-22 15:02:53] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 15:02:53] [INFO ] Invariant cache hit.
[2026-05-22 15:02:53] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:02:53] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 83/83 places, 107/107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 36534 steps (7 resets) in 126 ms. (287 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Knowledge-based reduction took 559 ms.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 116 ms.
Product exploration explored 100000 steps with 0 reset in 139 ms.
Spot run failed in 77 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/ltsmin15239342541966677344
[2026-05-22 15:02:55] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15239342541966677344
Running compilation step : cd /tmp/ltsmin15239342541966677344;'/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 230 ms.
Running link step : cd /tmp/ltsmin15239342541966677344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin15239342541966677344;'/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/stateBased17546098978830368779.hoa' '--buchi-type=spotba'
LTSmin run took 122 ms.
FORMULA Anderson-PT-04-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-13 finished in 29364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 93 transition count 139
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 79 transition count 139
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 79 transition count 129
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 69 transition count 129
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 59 transition count 95
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 59 transition count 95
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 70 place count 58 transition count 94
Applied a total of 70 rules in 68 ms. Remains 58 /93 variables (removed 35) and now considering 94/153 (removed 59) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11167112968777704593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1770791107773449439.kers'
[2026-05-22 15:02:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11167112968777704593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1770791107773449439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 58 cols 336 entries
Finished phase 1 with 22 SingleSign rule and 26 generalized
[2026-05-22 15:02:55] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1770791107773449439.kers
Total runtime 1 ms.
[2026-05-22 15:02:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 15:02:55] [INFO ] Invariant cache hit.
[2026-05-22 15:02:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-22 15:02:55] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2026-05-22 15:02:55] [INFO ] Redundant transitions in 0 ms returned []
Running 90 sub problems to find dead transitions.
[2026-05-22 15:02:55] [INFO ] Invariant cache hit.
[2026-05-22 15:02:55] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 94/152 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 86 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3483 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 94/152 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 90/178 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 178 constraints, problems are : Problem set: 0 solved, 90 unsolved in 9672 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 58/58 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13233ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 13233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/93 places, 94/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13531 ms. Remains : 58/93 places, 94/153 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-14
Product exploration explored 100000 steps with 1 reset in 92 ms.
Stack based approach found an accepted trace after 194 steps with 2 reset with depth 185 and stack size 121 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-14 finished in 13799 ms.
All properties solved by simple procedures.
Total runtime 239445 ms.

BK_STOP 1779462189315

--------------------
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="Anderson-PT-04"
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 Anderson-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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