Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700419.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CO4-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 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 239K 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 CO4-PT-18-LTLCardinality-00
FORMULA_NAME CO4-PT-18-LTLCardinality-01
FORMULA_NAME CO4-PT-18-LTLCardinality-02
FORMULA_NAME CO4-PT-18-LTLCardinality-03
FORMULA_NAME CO4-PT-18-LTLCardinality-04
FORMULA_NAME CO4-PT-18-LTLCardinality-05
FORMULA_NAME CO4-PT-18-LTLCardinality-06
FORMULA_NAME CO4-PT-18-LTLCardinality-07
FORMULA_NAME CO4-PT-18-LTLCardinality-08
FORMULA_NAME CO4-PT-18-LTLCardinality-09
FORMULA_NAME CO4-PT-18-LTLCardinality-10
FORMULA_NAME CO4-PT-18-LTLCardinality-11
FORMULA_NAME CO4-PT-18-LTLCardinality-12
FORMULA_NAME CO4-PT-18-LTLCardinality-13
FORMULA_NAME CO4-PT-18-LTLCardinality-14
FORMULA_NAME CO4-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779525550117

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 08:39:11] [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-23 08:39:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:39:11] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-23 08:39:11] [INFO ] Transformed 979 places.
[2026-05-23 08:39:11] [INFO ] Transformed 1111 transitions.
[2026-05-23 08:39:11] [INFO ] Found NUPN structural information;
[2026-05-23 08:39:11] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 199 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 3 formulas.
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 809 transition count 931
Discarding 129 places :
Symmetric choice reduction at 1 with 129 rule applications. Total rules 145 place count 680 transition count 800
Iterating global reduction 1 with 129 rules applied. Total rules applied 274 place count 680 transition count 800
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 381 place count 573 transition count 693
Iterating global reduction 1 with 107 rules applied. Total rules applied 488 place count 573 transition count 693
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 491 place count 573 transition count 690
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 539 place count 525 transition count 642
Iterating global reduction 2 with 48 rules applied. Total rules applied 587 place count 525 transition count 642
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 618 place count 494 transition count 611
Iterating global reduction 2 with 31 rules applied. Total rules applied 649 place count 494 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 652 place count 494 transition count 608
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 668 place count 478 transition count 592
Iterating global reduction 3 with 16 rules applied. Total rules applied 684 place count 478 transition count 592
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 478 transition count 591
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 691 place count 472 transition count 585
Iterating global reduction 4 with 6 rules applied. Total rules applied 697 place count 472 transition count 585
Applied a total of 697 rules in 250 ms. Remains 472 /822 variables (removed 350) and now considering 585/934 (removed 349) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17236136646890948044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15875264937158820219.kers'
[2026-05-23 08:39:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17236136646890948044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15875264937158820219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 472 cols 1318 entries
Finished phase 1 with 467 SingleSign rule and 0 generalized
[2026-05-23 08:39:11] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15875264937158820219.kers
Total runtime 3 ms.
[2026-05-23 08:39:12] [INFO ] Implicit Places using invariants in 354 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 471/822 places, 585/934 transitions.
Applied a total of 0 rules in 24 ms. Remains 471 /471 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 471/822 places, 585/934 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Applied a total of 0 rules in 18 ms. Remains 471 /471 variables (removed 0) and now considering 585/585 (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-14887226337324645724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11582778315664216018.kers'
[2026-05-23 08:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14887226337324645724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11582778315664216018.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 585 rows 471 cols 1316 entries
Finished phase 1 with 467 SingleSign rule and 0 generalized
[2026-05-23 08:39:12] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11582778315664216018.kers
Total runtime 3 ms.
[2026-05-23 08:39:12] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 08:39:12] [INFO ] Invariant cache hit.
[2026-05-23 08:39:12] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2026-05-23 08:39:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/470 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/1055 variables, 470/474 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1055/1056 variables, and 476 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 470/471 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/470 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (OVERLAPS) 585/1055 variables, 470/476 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 583/1059 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1055/1056 variables, and 1059 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 470/471 constraints, PredecessorRefiner: 583/584 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 471/471 places, 585/585 transitions.
Support contains 26 out of 471 places after structural reductions.
[2026-05-23 08:40:13] [INFO ] Flatten gal took : 71 ms
[2026-05-23 08:40:13] [INFO ] Flatten gal took : 29 ms
[2026-05-23 08:40:13] [INFO ] Input system was already deterministic with 585 transitions.
Support contains 23 out of 471 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (109 resets) in 1328 ms. (30 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40000 steps (31 resets) in 380 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (69 resets) in 273 ms. (145 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40000 steps (61 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (36 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (94 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (60 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (86 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (91 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (70 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (102 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (108 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (68 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
[2026-05-23 08:40:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 223/348 variables, 58/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 387/735 variables, 171/281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 250/985 variables, 146/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/985 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 57/1042 variables, 39/466 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1042 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 13/1055 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1055 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1/1056 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1056 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1056/1056 variables, and 475 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 20/48 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 223/348 variables, 58/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 387/735 variables, 171/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 250/985 variables, 146/438 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/985 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 57/1042 variables, 39/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1042 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 13/1055 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1055 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 1/1056 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1056 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/1056 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1056/1056 variables, and 486 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3991ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 10 properties in 1026 ms.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 585/585 transitions.
Graph (trivial) has 500 edges and 471 vertex of which 3 / 471 are part of one of the 1 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 733 edges and 469 vertex of which 451 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 451 transition count 333
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 219 rules applied. Total rules applied 457 place count 233 transition count 332
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 457 place count 233 transition count 287
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 547 place count 188 transition count 287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 553 place count 182 transition count 281
Iterating global reduction 2 with 6 rules applied. Total rules applied 559 place count 182 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 182 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 560 place count 182 transition count 278
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 564 place count 180 transition count 278
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 567 place count 177 transition count 275
Iterating global reduction 3 with 3 rules applied. Total rules applied 570 place count 177 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 177 transition count 274
Performed 68 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 707 place count 109 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 713 place count 109 transition count 185
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 719 place count 103 transition count 179
Iterating global reduction 5 with 6 rules applied. Total rules applied 725 place count 103 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 726 place count 103 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 730 place count 101 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 734 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 738 place count 97 transition count 168
Iterating global reduction 7 with 4 rules applied. Total rules applied 742 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 743 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 749 place count 94 transition count 164
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 752 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 755 place count 91 transition count 158
Iterating global reduction 9 with 3 rules applied. Total rules applied 758 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 760 place count 91 transition count 156
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 761 place count 90 transition count 155
Iterating global reduction 10 with 1 rules applied. Total rules applied 762 place count 90 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 763 place count 90 transition count 154
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 11 with 54 rules applied. Total rules applied 817 place count 63 transition count 156
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 853 place count 63 transition count 120
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 877 place count 39 transition count 86
Iterating global reduction 12 with 24 rules applied. Total rules applied 901 place count 39 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 921 place count 39 transition count 66
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 924 place count 36 transition count 58
Iterating global reduction 13 with 3 rules applied. Total rules applied 927 place count 36 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 930 place count 36 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 932 place count 36 transition count 53
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 933 place count 35 transition count 52
Iterating global reduction 14 with 1 rules applied. Total rules applied 934 place count 35 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 935 place count 35 transition count 51
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 941 place count 35 transition count 45
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 949 place count 29 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 951 place count 29 transition count 43
Graph (complete) has 80 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 952 place count 28 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 953 place count 28 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 954 place count 28 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 955 place count 28 transition count 41
Graph (complete) has 77 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 956 place count 27 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 957 place count 27 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 958 place count 27 transition count 40
Graph (complete) has 74 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 959 place count 26 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 960 place count 26 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 961 place count 25 transition count 38
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t63.t67.t520.t556 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 21 vertex of which 3 / 21 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 3 rules applied. Total rules applied 964 place count 19 transition count 36
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t60.t505.t43.t44.t45.t46.t47.t48.t49.t50.t59.t30.t556.t163.t164.t165.t566.t15.t172 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 13 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 8 rules applied. Total rules applied 972 place count 15 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 976 place count 15 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 978 place count 14 transition count 35
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 982 place count 14 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 26 with 4 rules applied. Total rules applied 986 place count 14 transition count 27
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 987 place count 13 transition count 25
Iterating global reduction 26 with 1 rules applied. Total rules applied 988 place count 13 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 989 place count 13 transition count 24
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 991 place count 13 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 993 place count 11 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 28 with 1 rules applied. Total rules applied 994 place count 11 transition count 21
Applied a total of 994 rules in 113 ms. Remains 11 /471 variables (removed 460) and now considering 21/585 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 11/471 places, 21/585 transitions.
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 736 edges and 471 vertex of which 463 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 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(p0)||(X(p2)&&p1))) U X(X(X(G(!p3))))))'
Support contains 6 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 456 transition count 570
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 456 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 456 transition count 569
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 448 transition count 561
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 448 transition count 561
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 443 transition count 556
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 443 transition count 556
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 440 transition count 553
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 440 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 440 transition count 552
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 439 transition count 551
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 439 transition count 551
Applied a total of 66 rules in 72 ms. Remains 439 /471 variables (removed 32) and now considering 551/585 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13545211682392100775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17652227680766210742.kers'
[2026-05-23 08:40:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13545211682392100775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17652227680766210742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 551 rows 439 cols 1238 entries
Finished phase 1 with 435 SingleSign rule and 0 generalized
[2026-05-23 08:40:20] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17652227680766210742.kers
Total runtime 2 ms.
[2026-05-23 08:40:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 08:40:20] [INFO ] Invariant cache hit.
[2026-05-23 08:40:20] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2026-05-23 08:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/989 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/990 variables, and 444 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/439 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 551/989 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 549/993 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/990 variables, and 993 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/439 constraints, PredecessorRefiner: 549/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 439/471 places, 551/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60496 ms. Remains : 439/471 places, 551/585 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(p0)||(X(p2)&&p1))) U X(X(X(G(!p3))))))'
Stuttering acceptance computed with spot in 890 ms :[p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), p3, p3, true, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1) p3)), (AND p3 (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p2) p3 (NOT p1) (NOT p0)), p3, (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-00
Product exploration explored 100000 steps with 33504 reset in 308 ms.
Product exploration explored 100000 steps with 33310 reset in 246 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge based reduction with 29 factoid took 197 ms. Reduced automaton from 17 states, 47 edges and 4 AP (stutter sensitive) to 17 states, 47 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (92 resets) in 693 ms. (57 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (21 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (20 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (23 resets) in 43 ms. (91 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (24 resets) in 35 ms. (111 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 58 ms. (67 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (23 resets) in 55 ms. (71 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (18 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (21 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (20 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (25 resets) in 63 ms. (62 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (22 resets) in 47 ms. (83 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (16 resets) in 35 ms. (111 steps per ms) remains 25/32 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (18 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (18 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (20 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (18 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (21 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (15 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (20 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (19 resets) in 15 ms. (250 steps per ms) remains 21/25 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (17 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
[2026-05-23 08:41:22] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf22 is UNSAT
Problem apf23 is UNSAT
Problem apf24 is UNSAT
Problem apf27 is UNSAT
Problem apf28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 68/87 variables, 15/21 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 213/300 variables, 69/90 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/90 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 11/311 variables, 1/91 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/91 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 18/329 variables, 3/94 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/94 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 338/667 variables, 172/266 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/667 variables, 0/266 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 228/895 variables, 114/380 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/895 variables, 0/380 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 78/973 variables, 52/432 constraints. Problems are: Problem set: 6 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/973 variables, 0/432 constraints. Problems are: Problem set: 6 solved, 15 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf19 is UNSAT
Problem apf21 is UNSAT
Problem apf25 is UNSAT
Problem apf26 is UNSAT
At refinement iteration 17 (OVERLAPS) 13/986 variables, 8/440 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/986 variables, 0/440 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/990 variables, 3/443 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/990 variables, 0/443 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/990 variables, 0/443 constraints. Problems are: Problem set: 15 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 990/990 variables, and 443 constraints, problems are : Problem set: 15 solved, 6 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 11/16 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 6/22 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 124/170 variables, 21/43 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/43 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 347/517 variables, 144/187 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/187 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 16/533 variables, 2/189 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 0/189 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 10/543 variables, 2/191 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/191 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 312/855 variables, 173/364 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/855 variables, 0/364 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 107/962 variables, 67/431 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/431 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 22/984 variables, 13/444 constraints. Problems are: Problem set: 15 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/444 constraints. Problems are: Problem set: 15 solved, 6 unsolved
Problem apf18 is UNSAT
At refinement iteration 20 (OVERLAPS) 6/990 variables, 5/449 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/990 variables, 0/449 constraints. Problems are: Problem set: 16 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/990 variables, 0/449 constraints. Problems are: Problem set: 16 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 990/990 variables, and 449 constraints, problems are : Problem set: 16 solved, 5 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 6/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2598ms problems are : Problem set: 16 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=49 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 42 ms.
Found 16 invariant AP formulas.
Knowledge based reduction with 45 factoid took 392 ms. Reduced automaton from 17 states, 47 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[p3, (AND (NOT p0) p3), p3, p3, true, (AND (NOT p0) p3), (NOT p0), p3]
[2026-05-23 08:41:26] [INFO ] Invariant cache hit.
[2026-05-23 08:41:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:41:26] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 08:41:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:41:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2026-05-23 08:41:26] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-23 08:41:26] [INFO ] Computed and/alt/rep : 541/743/541 causal constraints (skipped 9 transitions) in 26 ms.
[2026-05-23 08:41:30] [INFO ] Added : 505 causal constraints over 102 iterations in 3625 ms. Result :sat
Could not prove EG p3
Knowledge-based reduction took 8259 ms.
Stuttering acceptance computed with spot in 286 ms :[p3, (AND (NOT p0) p3), p3, p3, true, (AND (NOT p0) p3), (NOT p0), p3]
Support contains 5 out of 439 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 551/551 transitions.
Applied a total of 0 rules in 13 ms. Remains 439 /439 variables (removed 0) and now considering 551/551 (removed 0) transitions.
[2026-05-23 08:41:30] [INFO ] Invariant cache hit.
[2026-05-23 08:41:30] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 08:41:30] [INFO ] Invariant cache hit.
[2026-05-23 08:41:30] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 439/439 places, 551/551 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge based reduction with 11 factoid took 78 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (147 resets) in 139 ms. (285 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (90 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (146 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (164 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (15 resets) in 127 ms. (312 steps per ms) remains 2/5 properties
[2026-05-23 08:41:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 124/170 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 347/517 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/533 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/543 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/543 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 312/855 variables, 173/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/855 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 107/962 variables, 67/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/962 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 22/984 variables, 13/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/990 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/990 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/990 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 990/990 variables, and 443 constraints, problems are : Problem set: 0 solved, 2 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 124/170 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 347/517 variables, 144/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/533 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/533 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/543 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 312/855 variables, 173/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/855 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 107/962 variables, 67/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/962 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 22/984 variables, 13/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/984 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 6/990 variables, 5/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/990 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/990 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 990/990 variables, and 445 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Parikh walk visited 2 properties in 9 ms.
Knowledge based reduction with 11 factoid took 124 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p3, (AND (NOT p0) p3), p3, p3, true, (AND (NOT p0) p3), (NOT p0), p3]
[2026-05-23 08:41:32] [INFO ] Invariant cache hit.
[2026-05-23 08:41:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:41:32] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-23 08:41:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 08:41:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 08:41:33] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-23 08:41:33] [INFO ] Computed and/alt/rep : 541/743/541 causal constraints (skipped 9 transitions) in 25 ms.
[2026-05-23 08:41:36] [INFO ] Added : 505 causal constraints over 102 iterations in 3670 ms. Result :sat
Could not prove EG p3
Knowledge-based reduction took 5906 ms.
Stuttering acceptance computed with spot in 283 ms :[p3, (AND (NOT p0) p3), p3, p3, true, (AND (NOT p0) p3), (NOT p0), p3]
Stuttering acceptance computed with spot in 274 ms :[p3, (AND (NOT p0) p3), p3, p3, true, (AND (NOT p0) p3), (NOT p0), p3]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA CO4-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-00 finished in 77393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&X(p0)))))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Graph (trivial) has 500 edges and 471 vertex of which 3 / 471 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 734 edges and 469 vertex of which 461 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 460 transition count 363
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 426 place count 249 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 248 transition count 361
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 427 place count 248 transition count 315
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 519 place count 202 transition count 315
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 524 place count 197 transition count 310
Iterating global reduction 3 with 5 rules applied. Total rules applied 529 place count 197 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 530 place count 197 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 530 place count 197 transition count 307
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 534 place count 195 transition count 307
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 536 place count 193 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 538 place count 193 transition count 305
Performed 71 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 680 place count 122 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 687 place count 122 transition count 211
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 694 place count 115 transition count 204
Iterating global reduction 5 with 7 rules applied. Total rules applied 701 place count 115 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 703 place count 115 transition count 202
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 6 with 2 rules applied. Total rules applied 705 place count 114 transition count 201
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 771 place count 81 transition count 203
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 791 place count 81 transition count 183
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 819 place count 53 transition count 127
Iterating global reduction 7 with 28 rules applied. Total rules applied 847 place count 53 transition count 127
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 864 place count 53 transition count 110
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 871 place count 46 transition count 90
Iterating global reduction 8 with 7 rules applied. Total rules applied 878 place count 46 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 883 place count 46 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 887 place count 44 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 910 place count 44 transition count 88
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 912 place count 44 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 914 place count 42 transition count 86
Applied a total of 914 rules in 59 ms. Remains 42 /471 variables (removed 429) and now considering 86/585 (removed 499) transitions.
[2026-05-23 08:41:37] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11158522738524194241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-424101627141828053.kers'
[2026-05-23 08:41:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11158522738524194241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-424101627141828053.kers]
Normalized transition count is 75 out of 76 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 42 cols 198 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-23 08:41:37] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-424101627141828053.kers
Total runtime 0 ms.
[2026-05-23 08:41:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 08:41:37] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2026-05-23 08:41:37] [INFO ] Invariant cache hit.
[2026-05-23 08:41:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:41:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2026-05-23 08:41:37] [INFO ] Redundant transitions in 3 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-23 08:41:37] [INFO ] Flow matrix only has 76 transitions (discarded 10 similar events)
[2026-05-23 08:41:37] [INFO ] Invariant cache hit.
[2026-05-23 08:41:37] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/117 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/118 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 49 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 75/117 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 73/121 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 122 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3375ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3375ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/471 places, 86/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3516 ms. Remains : 42/471 places, 86/585 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(!p0)))))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-02
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-02 finished in 3592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Graph (trivial) has 499 edges and 471 vertex of which 3 / 471 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 734 edges and 469 vertex of which 461 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 213 place count 460 transition count 363
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 426 place count 249 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 248 transition count 361
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 427 place count 248 transition count 316
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 517 place count 203 transition count 316
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 523 place count 197 transition count 310
Iterating global reduction 3 with 6 rules applied. Total rules applied 529 place count 197 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 530 place count 197 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 530 place count 197 transition count 307
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 534 place count 195 transition count 307
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 536 place count 193 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 538 place count 193 transition count 305
Performed 72 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 682 place count 121 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 688 place count 121 transition count 207
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 695 place count 114 transition count 200
Iterating global reduction 5 with 7 rules applied. Total rules applied 702 place count 114 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 704 place count 114 transition count 198
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 6 with 2 rules applied. Total rules applied 706 place count 113 transition count 197
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 770 place count 81 transition count 199
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 790 place count 81 transition count 179
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 817 place count 54 transition count 125
Iterating global reduction 7 with 27 rules applied. Total rules applied 844 place count 54 transition count 125
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 862 place count 54 transition count 107
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 868 place count 48 transition count 90
Iterating global reduction 8 with 6 rules applied. Total rules applied 874 place count 48 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 878 place count 48 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 882 place count 46 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 904 place count 46 transition count 91
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 906 place count 46 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 907 place count 46 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 909 place count 44 transition count 88
Applied a total of 909 rules in 48 ms. Remains 44 /471 variables (removed 427) and now considering 88/585 (removed 497) transitions.
[2026-05-23 08:41:41] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11971199102445648619.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1784628257814506243.kers'
[2026-05-23 08:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11971199102445648619.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1784628257814506243.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 44 cols 213 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-23 08:41:41] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1784628257814506243.kers
Total runtime 1 ms.
[2026-05-23 08:41:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 08:41:41] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2026-05-23 08:41:41] [INFO ] Invariant cache hit.
[2026-05-23 08:41:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:41:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-05-23 08:41:41] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2026-05-23 08:41:41] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2026-05-23 08:41:41] [INFO ] Invariant cache hit.
[2026-05-23 08:41:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 77/121 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 51 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 77/121 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 75/125 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 126 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3540ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3540ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/471 places, 88/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3668 ms. Remains : 44/471 places, 88/585 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-03
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-03 finished in 3786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 585
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 456 transition count 571
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 456 transition count 571
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 456 transition count 570
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 38 place count 448 transition count 562
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 448 transition count 562
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 52 place count 442 transition count 556
Iterating global reduction 2 with 6 rules applied. Total rules applied 58 place count 442 transition count 556
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 439 transition count 553
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 439 transition count 552
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 438 transition count 551
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 438 transition count 551
Applied a total of 67 rules in 47 ms. Remains 438 /471 variables (removed 33) and now considering 551/585 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10256196823109949957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16338811105320610940.kers'
[2026-05-23 08:41:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10256196823109949957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16338811105320610940.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 551 rows 438 cols 1238 entries
Finished phase 1 with 434 SingleSign rule and 0 generalized
[2026-05-23 08:41:44] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16338811105320610940.kers
Total runtime 3 ms.
[2026-05-23 08:41:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-23 08:41:44] [INFO ] Invariant cache hit.
[2026-05-23 08:41:45] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2026-05-23 08:41:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/989 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 444 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 551/989 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 550/994 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/989 variables, and 994 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 438/471 places, 551/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60444 ms. Remains : 438/471 places, 551/585 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-18-LTLCardinality-05
Product exploration explored 100000 steps with 39 reset in 166 ms.
Product exploration explored 100000 steps with 9 reset in 110 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 695 edges and 438 vertex of which 433 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge based reduction with 6 factoid took 47 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (74 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (82 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 106848 steps, run visited all 1 properties in 304 ms. (steps per millisecond=351 )
Probabilistic random walk after 106848 steps, saw 26524 distinct states, run finished after 307 ms. (steps per millisecond=348 ) properties seen :1
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 6 factoid took 32 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 435 ms.
FORMULA CO4-PT-18-LTLCardinality-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-05 finished in 61300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 585
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 456 transition count 571
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 456 transition count 571
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 449 transition count 564
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 449 transition count 564
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 445 transition count 560
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 445 transition count 560
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 443 transition count 558
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 443 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 443 transition count 557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 442 transition count 556
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 442 transition count 556
Applied a total of 58 rules in 39 ms. Remains 442 /471 variables (removed 29) and now considering 556/585 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15283672644732298139.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4901904225572902503.kers'
[2026-05-23 08:42:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15283672644732298139.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4901904225572902503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 556 rows 442 cols 1254 entries
Finished phase 1 with 438 SingleSign rule and 0 generalized
[2026-05-23 08:42:46] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4901904225572902503.kers
Total runtime 5 ms.
[2026-05-23 08:42:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 08:42:46] [INFO ] Invariant cache hit.
[2026-05-23 08:42:46] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2026-05-23 08:42:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/998 variables, 442/446 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/998 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 998/998 variables, and 448 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/442 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (OVERLAPS) 556/998 variables, 442/448 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/998 variables, 555/1003 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/998 variables, and 1003 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 442/442 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 442/471 places, 556/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 442/471 places, 556/585 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 704 edges and 442 vertex of which 437 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 16 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA CO4-PT-18-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-18-LTLCardinality-06 finished in 60950 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(G(p0)) U !p0)))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 585
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 454 transition count 569
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 454 transition count 569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 454 transition count 568
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 446 transition count 560
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 446 transition count 560
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 441 transition count 555
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 441 transition count 555
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 439 transition count 553
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 439 transition count 552
Applied a total of 65 rules in 38 ms. Remains 439 /471 variables (removed 32) and now considering 552/585 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-410477265754400856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9364390379500854922.kers'
[2026-05-23 08:43:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-410477265754400856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9364390379500854922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 552 rows 439 cols 1240 entries
Finished phase 1 with 435 SingleSign rule and 0 generalized
[2026-05-23 08:43:47] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9364390379500854922.kers
Total runtime 3 ms.
[2026-05-23 08:43:47] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 08:43:47] [INFO ] Invariant cache hit.
[2026-05-23 08:43:47] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2026-05-23 08:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (OVERLAPS) 552/991 variables, 439/443 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/991 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 991/991 variables, and 445 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 551 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (OVERLAPS) 1/439 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 4 (OVERLAPS) 552/991 variables, 439/445 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/991 variables, 551/996 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 991/991 variables, and 997 constraints, problems are : Problem set: 0 solved, 551 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 551 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 439/471 places, 552/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60481 ms. Remains : 439/471 places, 552/585 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(G(p0)) U !p0)))'
Stuttering acceptance computed with spot in 114 ms :[p0, p0, (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-07
Product exploration explored 100000 steps with 46 reset in 77 ms.
Product exploration explored 100000 steps with 36 reset in 99 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 696 edges and 439 vertex of which 434 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 9 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (123 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (96 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1555724 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :0 out of 1
Probabilistic random walk after 1555724 steps, saw 294381 distinct states, run finished after 3003 ms. (steps per millisecond=518 ) properties seen :0
[2026-05-23 08:44:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/75 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/180 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 259/439 variables, 90/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 347/786 variables, 166/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 154/940 variables, 94/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/940 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 40/980 variables, 24/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/980 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/991 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/991 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/991 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 991/991 variables, and 443 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/32 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 43/75 variables, 32/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/180 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 259/439 variables, 90/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 347/786 variables, 166/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/786 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 154/940 variables, 94/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/940 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/980 variables, 24/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/980 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/991 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/991 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/991 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 991/991 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 439/439 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 552/552 transitions.
Graph (trivial) has 473 edges and 439 vertex of which 3 / 439 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 693 edges and 437 vertex of which 422 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 422 transition count 324
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 415 place count 225 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 224 transition count 322
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 416 place count 224 transition count 275
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 510 place count 177 transition count 275
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 511 place count 176 transition count 274
Iterating global reduction 3 with 1 rules applied. Total rules applied 512 place count 176 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 513 place count 176 transition count 273
Performed 67 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 647 place count 109 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 653 place count 109 transition count 185
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 660 place count 102 transition count 178
Iterating global reduction 5 with 7 rules applied. Total rules applied 667 place count 102 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 668 place count 102 transition count 177
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 674 place count 99 transition count 174
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 678 place count 99 transition count 170
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 682 place count 95 transition count 166
Iterating global reduction 7 with 4 rules applied. Total rules applied 686 place count 95 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 687 place count 95 transition count 165
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 693 place count 92 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 696 place count 92 transition count 159
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 699 place count 89 transition count 156
Iterating global reduction 9 with 3 rules applied. Total rules applied 702 place count 89 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 704 place count 89 transition count 154
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 705 place count 88 transition count 153
Iterating global reduction 10 with 1 rules applied. Total rules applied 706 place count 88 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 707 place count 88 transition count 152
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 11 with 56 rules applied. Total rules applied 763 place count 60 transition count 154
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 799 place count 60 transition count 118
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 823 place count 36 transition count 83
Iterating global reduction 12 with 24 rules applied. Total rules applied 847 place count 36 transition count 83
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 866 place count 36 transition count 64
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 870 place count 32 transition count 53
Iterating global reduction 13 with 4 rules applied. Total rules applied 874 place count 32 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 877 place count 32 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 878 place count 32 transition count 49
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 879 place count 31 transition count 48
Iterating global reduction 14 with 1 rules applied. Total rules applied 880 place count 31 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 881 place count 31 transition count 47
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 887 place count 31 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 895 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 896 place count 25 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 898 place count 24 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 901 place count 24 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 17 with 7 rules applied. Total rules applied 908 place count 24 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 909 place count 23 transition count 42
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 16 edges and 20 vertex of which 5 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 4 rules applied. Total rules applied 913 place count 17 transition count 42
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t60.t505.t43.t44.t45.t46.t47.t48.t49.t50.t59.t30.t556.t163.t164.t165.t566.t15.t172 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 18 with 11 rules applied. Total rules applied 924 place count 13 transition count 32
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 934 place count 13 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 934 place count 13 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 936 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 937 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 938 place count 11 transition count 18
Iterating global reduction 20 with 1 rules applied. Total rules applied 939 place count 11 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 940 place count 11 transition count 17
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 942 place count 11 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 944 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 946 place count 9 transition count 13
Applied a total of 946 rules in 37 ms. Remains 9 /439 variables (removed 430) and now considering 13/552 (removed 539) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 9/439 places, 13/552 transitions.
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 4 states, 9 edges and 1 AP (stutter insensitive) to 4 states, 9 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p0, (NOT p0), false]
[2026-05-23 08:44:51] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 4061 ms.
Stuttering acceptance computed with spot in 130 ms :[true, p0, (NOT p0), false]
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 552/552 transitions.
Graph (trivial) has 473 edges and 439 vertex of which 3 / 439 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 694 edges and 437 vertex of which 432 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 192 place count 431 transition count 353
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 241 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 385 place count 240 transition count 351
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 385 place count 240 transition count 303
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 481 place count 192 transition count 303
Performed 71 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 623 place count 121 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 629 place count 121 transition count 207
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 636 place count 114 transition count 200
Iterating global reduction 4 with 7 rules applied. Total rules applied 643 place count 114 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 644 place count 114 transition count 199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 648 place count 112 transition count 197
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 714 place count 79 transition count 199
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 735 place count 79 transition count 178
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 762 place count 52 transition count 124
Iterating global reduction 6 with 27 rules applied. Total rules applied 789 place count 52 transition count 124
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 807 place count 52 transition count 106
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 814 place count 45 transition count 86
Iterating global reduction 7 with 7 rules applied. Total rules applied 821 place count 45 transition count 86
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 826 place count 45 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 828 place count 44 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 843 place count 44 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 845 place count 42 transition count 74
Applied a total of 845 rules in 32 ms. Remains 42 /439 variables (removed 397) and now considering 74/552 (removed 478) transitions.
[2026-05-23 08:44:52] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2238330748609019168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9262518747377061722.kers'
[2026-05-23 08:44:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2238330748609019168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9262518747377061722.kers]
Normalized transition count is 67 out of 68 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 42 cols 189 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-23 08:44:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9262518747377061722.kers
Total runtime 0 ms.
[2026-05-23 08:44:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 08:44:52] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2026-05-23 08:44:52] [INFO ] Invariant cache hit.
[2026-05-23 08:44:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:44:52] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2026-05-23 08:44:52] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2026-05-23 08:44:52] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2026-05-23 08:44:52] [INFO ] Invariant cache hit.
[2026-05-23 08:44:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 67/109 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 48 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 67/109 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 61/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 109 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1607 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2719ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2719ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/439 places, 74/552 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2958 ms. Remains : 42/439 places, 74/552 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 4 states, 9 edges and 1 AP (stutter insensitive) to 4 states, 9 edges and 1 AP (stutter insensitive).
RANDOM walk for 1549 steps (159 resets) in 16 ms. (91 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 4 states, 9 edges and 1 AP (stutter insensitive) to 4 states, 9 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[true, p0, (NOT p0), false]
[2026-05-23 08:44:55] [INFO ] Flow matrix only has 68 transitions (discarded 6 similar events)
[2026-05-23 08:44:55] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 272 ms.
Stuttering acceptance computed with spot in 138 ms :[true, p0, (NOT p0), false]
Stuttering acceptance computed with spot in 146 ms :[true, p0, (NOT p0), false]
Product exploration explored 100000 steps with 7 reset in 79 ms.
Stuttering criterion allowed to conclude after 172 steps with 17 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-07 finished in 68612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 3 out of 471 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 585
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 455 transition count 570
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 455 transition count 569
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 40 place count 447 transition count 561
Iterating global reduction 2 with 8 rules applied. Total rules applied 48 place count 447 transition count 561
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 442 transition count 556
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 442 transition count 556
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 439 transition count 553
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 439 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 439 transition count 552
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 438 transition count 551
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 438 transition count 551
Applied a total of 67 rules in 44 ms. Remains 438 /471 variables (removed 33) and now considering 551/585 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5857661554600910879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6355100622873467005.kers'
[2026-05-23 08:44:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5857661554600910879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6355100622873467005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 551 rows 438 cols 1238 entries
Finished phase 1 with 434 SingleSign rule and 0 generalized
[2026-05-23 08:44:55] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6355100622873467005.kers
Total runtime 3 ms.
[2026-05-23 08:44:55] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 08:44:55] [INFO ] Invariant cache hit.
[2026-05-23 08:44:56] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2026-05-23 08:44:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (OVERLAPS) 551/989 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/989 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 444 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (OVERLAPS) 1/438 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 551/989 variables, 438/444 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/989 variables, 550/994 constraints. Problems are: Problem set: 0 solved, 550 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 989/989 variables, and 995 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 438/471 places, 551/585 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60437 ms. Remains : 438/471 places, 551/585 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)))'
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : CO4-PT-18-LTLCardinality-08
Stuttering criterion allowed to conclude after 42 steps with 2 reset in 0 ms.
FORMULA CO4-PT-18-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLCardinality-08 finished in 60600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 585/585 transitions.
Graph (trivial) has 499 edges and 471 vertex of which 3 / 471 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 734 edges and 469 vertex of which 461 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 460 transition count 365
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 251 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 423 place count 250 transition count 363
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 423 place count 250 transition count 317
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 515 place count 204 transition count 317
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 521 place count 198 transition count 311
Iterating global reduction 3 with 6 rules applied. Total rules applied 527 place count 198 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 528 place count 198 transition count 310
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 528 place count 198 transition count 308
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 532 place count 196 transition count 308
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 534 place count 194 transition count 306
Iterating global reduction 4 with 2 rules applied. Total rules applied 536 place count 194 transition count 306
Performed 73 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 682 place count 121 transition count 213
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 688 place count 121 transition count 207
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 695 place count 114 transition count 200
Iterating global reduction 5 with 7 rules applied. Total rules applied 702 place count 114 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 704 place count 114 transition count 198
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 6 with 2 rules applied. Total rules applied 706 place count 113 transition count 197
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 770 place count 81 transition count 199
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 791 place count 81 transition count 178
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 817 place count 55 transition count 126
Iterating global reduction 7 with 26 rules applied. Total rules applied 843 place count 55 transition count 126
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 862 place count 55 transition count 107
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 868 place count 49 transition count 89
Iterating global reduction 8 with 6 rules applied. Total rules applied 874 place count 49 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 878 place count 49 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 882 place count 47 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 9 with 23 rules applied. Total rules applied 905 place count 47 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 907 place count 45 transition count 88
Applied a total of 907 rules in 42 ms. Remains 45 /471 variables (removed 426) and now considering 88/585 (removed 497) transitions.
[2026-05-23 08:45:56] [INFO ] Flow matrix only has 77 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4026053780221860462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16767279265016588129.kers'
[2026-05-23 08:45:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4026053780221860462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16767279265016588129.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 45 cols 209 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-23 08:45:56] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16767279265016588129.kers
Total runtime 0 ms.
[2026-05-23 08:45:56] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 08:45:56] [INFO ] Flow matrix only has 77 transitions (discarded 11 similar events)
[2026-05-23 08:45:56] [INFO ] Invariant cache hit.
[2026-05-23 08:45:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:45:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2026-05-23 08:45:56] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2026-05-23 08:45:56] [INFO ] Flow matrix only has 77 transitions (discarded 11 similar events)
[2026-05-23 08:45:56] [INFO ] Invariant cache hit.
[2026-05-23 08:45:56] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 76/121 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/122 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 52 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 76/121 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 75/126 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 127 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3633ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/471 places, 88/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3775 ms. Remains : 45/471 places, 88/585 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLCardinality-12
Product exploration explored 100000 steps with 24 reset in 42 ms.
Product exploration explored 100000 steps with 6 reset in 148 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 37 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4999 steps (525 resets) in 29 ms. (166 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Knowledge-based reduction took 141 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 88/88 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-23 08:46:00] [INFO ] Flow matrix only has 77 transitions (discarded 11 similar events)
[2026-05-23 08:46:00] [INFO ] Invariant cache hit.
[2026-05-23 08:46:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 08:46:00] [INFO ] Flow matrix only has 77 transitions (discarded 11 similar events)
[2026-05-23 08:46:00] [INFO ] Invariant cache hit.
[2026-05-23 08:46:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:46:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2026-05-23 08:46:00] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 45/45 places, 88/88 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 35 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 8105 steps (859 resets) in 43 ms. (184 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Knowledge-based reduction took 168 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 29 reset in 40 ms.
Product exploration explored 100000 steps with 15 reset in 37 ms.
Built C files in :
/tmp/ltsmin8616572426115559195
[2026-05-23 08:46:00] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2026-05-23 08:46:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:46:00] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2026-05-23 08:46:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:46:00] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2026-05-23 08:46:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:46:00] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8616572426115559195
Running compilation step : cd /tmp/ltsmin8616572426115559195;'/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 267 ms.
Running link step : cd /tmp/ltsmin8616572426115559195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8616572426115559195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13306605067196116733.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA CO4-PT-18-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLCardinality-12 finished in 5107 ms.
All properties solved by simple procedures.
Total runtime 410089 ms.

BK_STOP 1779525961416

--------------------
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="CO4-PT-18"
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 CO4-PT-18, 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 r066-tall-177946967700419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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