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-177946967700420.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700420
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME CO4-PT-18-LTLFireability-01
FORMULA_NAME CO4-PT-18-LTLFireability-02
FORMULA_NAME CO4-PT-18-LTLFireability-03
FORMULA_NAME CO4-PT-18-LTLFireability-04
FORMULA_NAME CO4-PT-18-LTLFireability-05
FORMULA_NAME CO4-PT-18-LTLFireability-06
FORMULA_NAME CO4-PT-18-LTLFireability-07
FORMULA_NAME CO4-PT-18-LTLFireability-08
FORMULA_NAME CO4-PT-18-LTLFireability-09
FORMULA_NAME CO4-PT-18-LTLFireability-10
FORMULA_NAME CO4-PT-18-LTLFireability-11
FORMULA_NAME CO4-PT-18-LTLFireability-12
FORMULA_NAME CO4-PT-18-LTLFireability-13
FORMULA_NAME CO4-PT-18-LTLFireability-14
FORMULA_NAME CO4-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779525769130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202604301425
[2026-05-23 08:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:42:50] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-23 08:42:50] [INFO ] Transformed 979 places.
[2026-05-23 08:42:50] [INFO ] Transformed 1111 transitions.
[2026-05-23 08:42:50] [INFO ] Found NUPN structural information;
[2026-05-23 08:42:50] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.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 13 ms
Reduce places removed 157 places and 177 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 822/822 places, 934/934 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 808 transition count 931
Discarding 128 places :
Symmetric choice reduction at 1 with 128 rule applications. Total rules 145 place count 680 transition count 801
Iterating global reduction 1 with 128 rules applied. Total rules applied 273 place count 680 transition count 801
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 381 place count 572 transition count 693
Iterating global reduction 1 with 108 rules applied. Total rules applied 489 place count 572 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 492 place count 572 transition count 690
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 540 place count 524 transition count 642
Iterating global reduction 2 with 48 rules applied. Total rules applied 588 place count 524 transition count 642
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 589 place count 524 transition count 641
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 623 place count 490 transition count 607
Iterating global reduction 3 with 34 rules applied. Total rules applied 657 place count 490 transition count 607
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 660 place count 490 transition count 604
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 677 place count 473 transition count 587
Iterating global reduction 4 with 17 rules applied. Total rules applied 694 place count 473 transition count 587
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 696 place count 473 transition count 585
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 701 place count 468 transition count 580
Iterating global reduction 5 with 5 rules applied. Total rules applied 706 place count 468 transition count 580
Applied a total of 706 rules in 231 ms. Remains 468 /822 variables (removed 354) and now considering 580/934 (removed 354) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10186975888149716244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15670650263855926604.kers'
[2026-05-23 08:42:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10186975888149716244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15670650263855926604.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 580 rows 468 cols 1302 entries
Finished phase 1 with 463 SingleSign rule and 0 generalized
[2026-05-23 08:42:50] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15670650263855926604.kers
Total runtime 3 ms.
[2026-05-23 08:42:51] [INFO ] Implicit Places using invariants in 292 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 467/822 places, 580/934 transitions.
Applied a total of 0 rules in 19 ms. Remains 467 /467 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 589 ms. Remains : 467/822 places, 580/934 transitions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Applied a total of 0 rules in 16 ms. Remains 467 /467 variables (removed 0) and now considering 580/580 (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-7431611061028143241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4688660137252648767.kers'
[2026-05-23 08:42:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7431611061028143241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4688660137252648767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 580 rows 467 cols 1300 entries
Finished phase 1 with 463 SingleSign rule and 0 generalized
[2026-05-23 08:42:51] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4688660137252648767.kers
Total runtime 2 ms.
[2026-05-23 08:42:51] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 08:42:51] [INFO ] Invariant cache hit.
[2026-05-23 08:42:51] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 579 sub problems to find dead transitions.
[2026-05-23 08:42:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (OVERLAPS) 580/1047 variables, 467/471 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 473 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 580/1047 variables, 467/473 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1047 variables, 579/1052 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 1052 constraints, problems are : Problem set: 0 solved, 579 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 579/579 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 579 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 467/467 places, 580/580 transitions.
Support contains 29 out of 467 places after structural reductions.
[2026-05-23 08:43:52] [INFO ] Flatten gal took : 55 ms
[2026-05-23 08:43:52] [INFO ] Flatten gal took : 24 ms
[2026-05-23 08:43:52] [INFO ] Input system was already deterministic with 580 transitions.
RANDOM walk for 40000 steps (148 resets) in 1234 ms. (32 steps per ms) remains 17/26 properties
BEST_FIRST walk for 4002 steps (22 resets) in 58 ms. (67 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (21 resets) in 68 ms. (58 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4001 steps (21 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (24 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (24 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (22 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
[2026-05-23 08:43:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 10/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 130/177 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 340/517 variables, 138/189 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 348/865 variables, 169/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 142/1007 variables, 89/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1007 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 28/1035 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1035 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 11/1046 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1046 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 1/1047 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1047 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 0/1047 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 471 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 10/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 130/177 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 340/517 variables, 138/190 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 348/865 variables, 169/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/865 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 142/1007 variables, 89/461 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1007 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 28/1035 variables, 16/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1035 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 11/1046 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 1/1047 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 0/1047 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 485 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3780 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5873ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 13 properties in 1105 ms.
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 501 edges and 467 vertex of which 3 / 467 are part of one of the 1 SCC in 6 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 723 edges and 465 vertex of which 450 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 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 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 243 rules applied. Total rules applied 245 place count 450 transition count 323
Reduce places removed 225 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 227 rules applied. Total rules applied 472 place count 225 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 473 place count 224 transition count 321
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 473 place count 224 transition count 278
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 559 place count 181 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 563 place count 177 transition count 274
Iterating global reduction 3 with 4 rules applied. Total rules applied 567 place count 177 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 568 place count 177 transition count 273
Performed 69 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 706 place count 108 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 712 place count 108 transition count 182
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 719 place count 101 transition count 175
Iterating global reduction 5 with 7 rules applied. Total rules applied 726 place count 101 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 727 place count 101 transition count 174
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 733 place count 98 transition count 171
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 737 place count 98 transition count 167
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 741 place count 94 transition count 163
Iterating global reduction 7 with 4 rules applied. Total rules applied 745 place count 94 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 746 place count 94 transition count 162
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 752 place count 91 transition count 159
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 755 place count 91 transition count 156
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 758 place count 88 transition count 153
Iterating global reduction 9 with 3 rules applied. Total rules applied 761 place count 88 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 763 place count 88 transition count 151
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 764 place count 87 transition count 150
Iterating global reduction 10 with 1 rules applied. Total rules applied 765 place count 87 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 766 place count 87 transition count 149
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 822 place count 59 transition count 151
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 11 with 35 rules applied. Total rules applied 857 place count 59 transition count 116
Discarding 24 places :
Symmetric choice reduction at 12 with 24 rule applications. Total rules 881 place count 35 transition count 81
Iterating global reduction 12 with 24 rules applied. Total rules applied 905 place count 35 transition count 81
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 12 with 19 rules applied. Total rules applied 924 place count 35 transition count 62
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 928 place count 31 transition count 51
Iterating global reduction 13 with 4 rules applied. Total rules applied 932 place count 31 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 935 place count 31 transition count 48
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 14 with 2 rules applied. Total rules applied 937 place count 30 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 940 place count 30 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 948 place count 30 transition count 52
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 949 place count 29 transition count 51
Iterating global reduction 15 with 1 rules applied. Total rules applied 950 place count 29 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 951 place count 29 transition count 50
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 956 place count 29 transition count 45
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 963 place count 24 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 964 place count 24 transition count 43
Graph (complete) has 74 edges and 24 vertex of which 23 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 17 with 1 rules applied. Total rules applied 965 place count 23 transition count 43
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 966 place count 23 transition count 42
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 967 place count 23 transition count 42
Graph (complete) has 71 edges and 23 vertex of which 22 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 19 with 1 rules applied. Total rules applied 968 place count 22 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 969 place count 22 transition count 41
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 970 place count 22 transition count 41
Graph (complete) has 68 edges and 22 vertex of which 21 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 21 with 1 rules applied. Total rules applied 971 place count 21 transition count 41
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 972 place count 21 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 973 place count 20 transition count 39
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 t64.t68.t517.t552 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 14 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 976 place count 14 transition count 37
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 t61.t502.t164.t165.t44.t45.t46.t47.t48.t49.t50.t51.t60.t31.t552.t166.t562.t15.t169 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 10 edges and 12 vertex of which 3 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 8 rules applied. Total rules applied 984 place count 10 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 25 with 10 rules applied. Total rules applied 994 place count 10 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 995 place count 10 transition count 19
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 996 place count 9 transition count 17
Iterating global reduction 26 with 1 rules applied. Total rules applied 997 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 998 place count 9 transition count 16
Free-agglomeration rule applied 2 times.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1000 place count 9 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 1002 place count 7 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 28 with 2 rules applied. Total rules applied 1004 place count 7 transition count 12
Applied a total of 1004 rules in 105 ms. Remains 7 /467 variables (removed 460) and now considering 12/580 (removed 568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 7/467 places, 12/580 transitions.
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 726 edges and 467 vertex of which 462 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(G(p0)) U (p0 U p1))||F(p2)))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 452 transition count 565
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 452 transition count 565
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 443 transition count 556
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 443 transition count 556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 439 transition count 552
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 437 transition count 550
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 436 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 436 transition count 549
Applied a total of 62 rules in 41 ms. Remains 436 /467 variables (removed 31) and now considering 549/580 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14087381120045091874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14167522075057989709.kers'
[2026-05-23 08:44:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14087381120045091874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14167522075057989709.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 549 rows 436 cols 1234 entries
Finished phase 1 with 432 SingleSign rule and 0 generalized
[2026-05-23 08:44:00] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14167522075057989709.kers
Total runtime 7 ms.
[2026-05-23 08:44:00] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 08:44:00] [INFO ] Invariant cache hit.
[2026-05-23 08:44:00] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2026-05-23 08:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/985 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 436/467 places, 549/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60436 ms. Remains : 436/467 places, 549/580 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(((F(G(p0)) U (p0 U p1))||F(p2)))))'
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 2 ms.
FORMULA CO4-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-00 finished in 60833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 498 edges and 467 vertex of which 3 / 467 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 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 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 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 459 transition count 356
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 244 transition count 354
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 243 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 242 transition count 353
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 437 place count 242 transition count 309
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 525 place count 198 transition count 309
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 195 transition count 306
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 195 transition count 306
Performed 73 Post agglomeration using F-continuation condition with reduction of 19 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 677 place count 122 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 684 place count 122 transition count 207
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 690 place count 116 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 696 place count 116 transition count 201
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 700 place count 114 transition count 199
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 766 place count 81 transition count 201
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 786 place count 81 transition count 181
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 813 place count 54 transition count 127
Iterating global reduction 6 with 27 rules applied. Total rules applied 840 place count 54 transition count 127
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 858 place count 54 transition count 109
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 865 place count 47 transition count 89
Iterating global reduction 7 with 7 rules applied. Total rules applied 872 place count 47 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 877 place count 47 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
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 879 place count 46 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 895 place count 46 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 897 place count 44 transition count 77
Applied a total of 897 rules in 52 ms. Remains 44 /467 variables (removed 423) and now considering 77/580 (removed 503) transitions.
[2026-05-23 08:45:01] [INFO ] Flow matrix only has 71 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-17168482653252420884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4597433285347829248.kers'
[2026-05-23 08:45:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17168482653252420884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4597433285347829248.kers]
Normalized transition count is 70 out of 71 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 44 cols 199 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-23 08:45:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4597433285347829248.kers
Total runtime 0 ms.
[2026-05-23 08:45:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 08:45:01] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2026-05-23 08:45:01] [INFO ] Invariant cache hit.
[2026-05-23 08:45:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:45:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-23 08:45:01] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-23 08:45:01] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2026-05-23 08:45:01] [INFO ] Invariant cache hit.
[2026-05-23 08:45:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 70/114 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/115 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 50 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 70/114 variables, 44/48 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 64/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 114 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 44/44 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2969ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/467 places, 77/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3124 ms. Remains : 44/467 places, 77/580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
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 9 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 36628 steps (3857 resets) in 374 ms. (97 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 358 ms.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 44 /44 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-23 08:45:05] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2026-05-23 08:45:05] [INFO ] Invariant cache hit.
[2026-05-23 08:45:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 08:45:05] [INFO ] Flow matrix only has 71 transitions (discarded 6 similar events)
[2026-05-23 08:45:05] [INFO ] Invariant cache hit.
[2026-05-23 08:45:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:45:05] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-23 08:45:05] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 44/44 places, 77/77 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 9 factoid took 55 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (4211 resets) in 91 ms. (434 steps per ms) remains 1/4 properties
BEST_FIRST walk for 30881 steps (397 resets) in 54 ms. (561 steps per ms) remains 0/1 properties
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 290 ms.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 81 ms.
Product exploration explored 100000 steps with 8 reset in 78 ms.
Built C files in :
/tmp/ltsmin15350419685428550884
[2026-05-23 08:45:05] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2026-05-23 08:45:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:45:05] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2026-05-23 08:45:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:45:05] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2026-05-23 08:45:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:45:05] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15350419685428550884
Running compilation step : cd /tmp/ltsmin15350419685428550884;'/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 316 ms.
Running link step : cd /tmp/ltsmin15350419685428550884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15350419685428550884;'/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/stateBased11586470593612928975.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA CO4-PT-18-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLFireability-01 finished in 5172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F((!p0 U (p1||G(!p0)))))))&&F(((p2&&X(p0))||G(p0)))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 452 transition count 565
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 452 transition count 565
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 443 transition count 556
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 443 transition count 556
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 439 transition count 552
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 439 transition count 552
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 437 transition count 550
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 437 transition count 550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 436 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 436 transition count 549
Applied a total of 62 rules in 46 ms. Remains 436 /467 variables (removed 31) and now considering 549/580 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-294764199863232140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16886255737357765005.kers'
[2026-05-23 08:45:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-294764199863232140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16886255737357765005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 549 rows 436 cols 1234 entries
Finished phase 1 with 432 SingleSign rule and 0 generalized
[2026-05-23 08:45:06] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16886255737357765005.kers
Total runtime 5 ms.
[2026-05-23 08:45:06] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 08:45:06] [INFO ] Invariant cache hit.
[2026-05-23 08:45:06] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 548 sub problems to find dead transitions.
[2026-05-23 08:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 549/985 variables, 436/440 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 985/985 variables, and 442 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (OVERLAPS) 1/436 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 549/985 variables, 436/442 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/985 variables, 548/990 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 985/985 variables, and 990 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 436/436 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 436/467 places, 549/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60506 ms. Remains : 436/467 places, 549/580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F((!p0 U (p1||G(!p0)))))))&&F(((p2&&X(p0))||G(p0)))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CO4-PT-18-LTLFireability-02
Stuttering criterion allowed to conclude after 33 steps with 1 reset in 1 ms.
FORMULA CO4-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-02 finished in 60750 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) U p1)&&X((F(p2)&&F(p3))))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 454 transition count 567
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 454 transition count 567
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 447 transition count 560
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 447 transition count 560
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 445 transition count 558
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 445 transition count 558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 444 transition count 557
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 444 transition count 557
Applied a total of 46 rules in 31 ms. Remains 444 /467 variables (removed 23) and now considering 557/580 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-66570981216432355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9580462586805760484.kers'
[2026-05-23 08:46:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-66570981216432355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9580462586805760484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 557 rows 444 cols 1250 entries
Finished phase 1 with 440 SingleSign rule and 0 generalized
[2026-05-23 08:46:07] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9580462586805760484.kers
Total runtime 2 ms.
[2026-05-23 08:46:07] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-23 08:46:07] [INFO ] Invariant cache hit.
[2026-05-23 08:46:07] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 556 sub problems to find dead transitions.
[2026-05-23 08:46:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (OVERLAPS) 557/1001 variables, 444/448 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 2/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1001 variables, and 450 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 556 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 1 (OVERLAPS) 1/444 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 4 (OVERLAPS) 557/1001 variables, 444/450 constraints. Problems are: Problem set: 0 solved, 556 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1001 variables, 556/1006 constraints. Problems are: Problem set: 0 solved, 556 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1001 variables, and 1006 constraints, problems are : Problem set: 0 solved, 556 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 444/444 constraints, PredecessorRefiner: 556/556 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 556 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 444/467 places, 557/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 444/467 places, 557/580 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) U p1)&&X((F(p2)&&F(p3))))))'
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CO4-PT-18-LTLFireability-05
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-05 finished in 60887 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||X(X((p1&&X(p2)))))))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 453 transition count 566
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 453 transition count 566
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 444 transition count 557
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 444 transition count 557
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 440 transition count 553
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 440 transition count 553
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 438 transition count 551
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 438 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 437 transition count 550
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 437 transition count 550
Applied a total of 60 rules in 37 ms. Remains 437 /467 variables (removed 30) and now considering 550/580 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-566837312282683348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8376108964458742214.kers'
[2026-05-23 08:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-566837312282683348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8376108964458742214.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 550 rows 437 cols 1236 entries
Finished phase 1 with 433 SingleSign rule and 0 generalized
[2026-05-23 08:47:07] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8376108964458742214.kers
Total runtime 2 ms.
[2026-05-23 08:47:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 08:47:08] [INFO ] Invariant cache hit.
[2026-05-23 08:47:08] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2026-05-23 08:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 550/987 variables, 437/441 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/987 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/987 variables, and 443 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/437 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/987 variables, 437/443 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/987 variables, 549/992 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/987 variables, and 993 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 437/467 places, 550/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 437/467 places, 550/580 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||X(X((p1&&X(p2)))))))))'
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CO4-PT-18-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-06 finished in 60681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 498 edges and 467 vertex of which 3 / 467 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 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 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 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 459 transition count 356
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 244 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 435 place count 243 transition count 354
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 435 place count 243 transition count 310
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 523 place count 199 transition count 310
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 526 place count 196 transition count 307
Iterating global reduction 3 with 3 rules applied. Total rules applied 529 place count 196 transition count 307
Performed 74 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 677 place count 122 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 683 place count 122 transition count 208
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 690 place count 115 transition count 201
Iterating global reduction 4 with 7 rules applied. Total rules applied 697 place count 115 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 698 place count 115 transition count 200
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 702 place count 113 transition count 198
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 5 with 64 rules applied. Total rules applied 766 place count 81 transition count 200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 786 place count 81 transition count 180
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 813 place count 54 transition count 126
Iterating global reduction 6 with 27 rules applied. Total rules applied 840 place count 54 transition count 126
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 858 place count 54 transition count 108
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 865 place count 47 transition count 88
Iterating global reduction 7 with 7 rules applied. Total rules applied 872 place count 47 transition count 88
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 877 place count 47 transition count 83
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 8 with 4 rules applied. Total rules applied 881 place count 45 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 903 place count 45 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 905 place count 43 transition count 85
Applied a total of 905 rules in 55 ms. Remains 43 /467 variables (removed 424) and now considering 85/580 (removed 495) transitions.
[2026-05-23 08:48:08] [INFO ] Flow matrix only has 75 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-15237484740833504958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5928317928863961234.kers'
[2026-05-23 08:48:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15237484740833504958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5928317928863961234.kers]
Normalized transition count is 74 out of 75 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 43 cols 207 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-23 08:48:08] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5928317928863961234.kers
Total runtime 1 ms.
[2026-05-23 08:48:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 08:48:08] [INFO ] Flow matrix only has 75 transitions (discarded 10 similar events)
[2026-05-23 08:48:08] [INFO ] Invariant cache hit.
[2026-05-23 08:48:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:48:08] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-23 08:48:08] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2026-05-23 08:48:08] [INFO ] Flow matrix only has 75 transitions (discarded 10 similar events)
[2026-05-23 08:48:08] [INFO ] Invariant cache hit.
[2026-05-23 08:48:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 74/117 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 1/118 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 50 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 74/117 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 72/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 122 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2301 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3794ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/467 places, 85/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4071 ms. Remains : 43/467 places, 85/580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-08 finished in 4124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0))))||(X(p0)&&p1))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 493 edges and 467 vertex of which 3 / 467 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 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 459 transition count 356
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 244 transition count 354
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 437 place count 243 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 439 place count 241 transition count 352
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 439 place count 241 transition count 309
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 525 place count 198 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 527 place count 196 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 529 place count 196 transition count 307
Performed 71 Post agglomeration using F-continuation condition with reduction of 20 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 671 place count 125 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 676 place count 125 transition count 211
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 683 place count 118 transition count 204
Iterating global reduction 5 with 7 rules applied. Total rules applied 690 place count 118 transition count 204
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 694 place count 116 transition count 202
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 762 place count 82 transition count 204
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 782 place count 82 transition count 184
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 810 place count 54 transition count 128
Iterating global reduction 6 with 28 rules applied. Total rules applied 838 place count 54 transition count 128
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 855 place count 54 transition count 111
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 862 place count 47 transition count 91
Iterating global reduction 7 with 7 rules applied. Total rules applied 869 place count 47 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 873 place count 47 transition count 87
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 875 place count 46 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 885 place count 46 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 887 place count 45 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 894 place count 45 transition count 97
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 897 place count 45 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 43 transition count 95
Applied a total of 899 rules in 35 ms. Remains 43 /467 variables (removed 424) and now considering 95/580 (removed 485) transitions.
[2026-05-23 08:48:12] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18376044250459952038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18198924508100506643.kers'
[2026-05-23 08:48:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18376044250459952038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18198924508100506643.kers]
Normalized transition count is 85 out of 86 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 85 rows 43 cols 253 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-23 08:48:12] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-18198924508100506643.kers
Total runtime 15 ms.
[2026-05-23 08:48:13] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-23 08:48:13] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2026-05-23 08:48:13] [INFO ] Invariant cache hit.
[2026-05-23 08:48:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:48:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2026-05-23 08:48:13] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2026-05-23 08:48:13] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2026-05-23 08:48:13] [INFO ] Invariant cache hit.
[2026-05-23 08:48:13] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 85/127 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 51 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 85/127 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 24/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 62/136 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 137 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 43/43 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5465ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 5466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/467 places, 95/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5877 ms. Remains : 43/467 places, 95/580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0))))||(X(p0)&&p1))))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-09
Product exploration explored 100000 steps with 19966 reset in 219 ms.
Product exploration explored 100000 steps with 20056 reset in 146 ms.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2734 steps (261 resets) in 7 ms. (341 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 221 ms.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2026-05-23 08:48:19] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2026-05-23 08:48:19] [INFO ] Invariant cache hit.
[2026-05-23 08:48:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 08:48:19] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
[2026-05-23 08:48:19] [INFO ] Invariant cache hit.
[2026-05-23 08:48:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:48:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-23 08:48:19] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 43/43 places, 95/95 transitions.
Computed a total of 7 stabilizing places and 23 stable transitions
Computed a total of 7 stabilizing places and 23 stable transitions
Knowledge based reduction with 3 factoid took 42 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2071 steps (200 resets) in 7 ms. (258 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 171 ms.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 27 ms.
Product exploration explored 100000 steps with 13 reset in 27 ms.
Built C files in :
/tmp/ltsmin8590166612473870741
[2026-05-23 08:48:19] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2026-05-23 08:48:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:19] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2026-05-23 08:48:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:19] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2026-05-23 08:48:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8590166612473870741
Running compilation step : cd /tmp/ltsmin8590166612473870741;'/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 182 ms.
Running link step : cd /tmp/ltsmin8590166612473870741;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8590166612473870741;'/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/stateBased6557547069323548887.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA CO4-PT-18-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLFireability-09 finished in 7489 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) U p1) U p2) U p3))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 494 edges and 467 vertex of which 3 / 467 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 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 459 transition count 356
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 244 transition count 354
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 436 place count 243 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 242 transition count 353
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 437 place count 242 transition count 308
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 527 place count 197 transition count 308
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 529 place count 195 transition count 306
Iterating global reduction 4 with 2 rules applied. Total rules applied 531 place count 195 transition count 306
Performed 69 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 669 place count 126 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 674 place count 126 transition count 213
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 681 place count 119 transition count 206
Iterating global reduction 5 with 7 rules applied. Total rules applied 688 place count 119 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 689 place count 119 transition count 205
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 693 place count 117 transition count 203
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 759 place count 84 transition count 205
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 779 place count 84 transition count 185
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 807 place count 56 transition count 129
Iterating global reduction 7 with 28 rules applied. Total rules applied 835 place count 56 transition count 129
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 852 place count 56 transition count 112
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 859 place count 49 transition count 92
Iterating global reduction 8 with 7 rules applied. Total rules applied 866 place count 49 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 871 place count 49 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 873 place count 48 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 887 place count 48 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 889 place count 47 transition count 98
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 891 place count 45 transition count 96
Applied a total of 891 rules in 31 ms. Remains 45 /467 variables (removed 422) and now considering 96/580 (removed 484) transitions.
[2026-05-23 08:48:20] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16694689125307687664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10182127605806918008.kers'
[2026-05-23 08:48:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16694689125307687664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10182127605806918008.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 45 cols 254 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-23 08:48:20] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10182127605806918008.kers
Total runtime 1 ms.
[2026-05-23 08:48:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-23 08:48:20] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2026-05-23 08:48:20] [INFO ] Invariant cache hit.
[2026-05-23 08:48:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-23 08:48:20] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2026-05-23 08:48:20] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2026-05-23 08:48:20] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2026-05-23 08:48:20] [INFO ] Invariant cache hit.
[2026-05-23 08:48:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/131 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 57 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 86/131 variables, 45/49 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 85/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 142 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3098 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 45/45 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5243ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 5243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/467 places, 96/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5445 ms. Remains : 45/467 places, 96/580 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) U p1) U p2) U p3))'
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : CO4-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-11 finished in 5608 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 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 495 edges and 467 vertex of which 3 / 467 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 459 transition count 356
Reduce places removed 215 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 217 rules applied. Total rules applied 434 place count 244 transition count 354
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 437 place count 243 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 439 place count 241 transition count 352
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 439 place count 241 transition count 309
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 525 place count 198 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 527 place count 196 transition count 307
Iterating global reduction 4 with 2 rules applied. Total rules applied 529 place count 196 transition count 307
Performed 74 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 677 place count 122 transition count 214
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 683 place count 122 transition count 208
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 690 place count 115 transition count 201
Iterating global reduction 5 with 7 rules applied. Total rules applied 697 place count 115 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 698 place count 115 transition count 200
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 702 place count 113 transition count 198
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 768 place count 80 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 789 place count 80 transition count 179
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 817 place count 52 transition count 123
Iterating global reduction 7 with 28 rules applied. Total rules applied 845 place count 52 transition count 123
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 864 place count 52 transition count 104
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 871 place count 45 transition count 84
Iterating global reduction 8 with 7 rules applied. Total rules applied 878 place count 45 transition count 84
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 45 transition count 79
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 43 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 900 place count 43 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 902 place count 41 transition count 90
Applied a total of 902 rules in 42 ms. Remains 41 /467 variables (removed 426) and now considering 90/580 (removed 490) transitions.
[2026-05-23 08:48:25] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13657495288505173585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11764362976463396014.kers'
[2026-05-23 08:48:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13657495288505173585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11764362976463396014.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 41 cols 240 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-23 08:48:25] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11764362976463396014.kers
Total runtime 8 ms.
[2026-05-23 08:48:26] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-23 08:48:26] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-23 08:48:26] [INFO ] Invariant cache hit.
[2026-05-23 08:48:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:48:26] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2026-05-23 08:48:26] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2026-05-23 08:48:26] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2026-05-23 08:48:26] [INFO ] Invariant cache hit.
[2026-05-23 08:48:26] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 80/120 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 1/121 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 49 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 80/120 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 21/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 130 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2861 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4868ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4870ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/467 places, 90/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5381 ms. Remains : 41/467 places, 90/580 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 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-12
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-12 finished in 5467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Graph (trivial) has 500 edges and 467 vertex of which 3 / 467 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 724 edges and 465 vertex of which 460 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 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 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 459 transition count 354
Reduce places removed 217 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 219 rules applied. Total rules applied 438 place count 242 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 439 place count 241 transition count 352
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 439 place count 241 transition count 308
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 527 place count 197 transition count 308
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 530 place count 194 transition count 305
Iterating global reduction 3 with 3 rules applied. Total rules applied 533 place count 194 transition count 305
Performed 74 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 681 place count 120 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 687 place count 120 transition count 205
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 694 place count 113 transition count 198
Iterating global reduction 4 with 7 rules applied. Total rules applied 701 place count 113 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 702 place count 113 transition count 197
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 706 place count 111 transition count 195
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 5 with 64 rules applied. Total rules applied 770 place count 79 transition count 197
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 790 place count 79 transition count 177
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 817 place count 52 transition count 123
Iterating global reduction 6 with 27 rules applied. Total rules applied 844 place count 52 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 862 place count 52 transition count 105
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 869 place count 45 transition count 85
Iterating global reduction 7 with 7 rules applied. Total rules applied 876 place count 45 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 881 place count 45 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 883 place count 44 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 897 place count 44 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 899 place count 42 transition count 73
Applied a total of 899 rules in 30 ms. Remains 42 /467 variables (removed 425) and now considering 73/580 (removed 507) transitions.
[2026-05-23 08:48:31] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5869249816862403792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15524037311775265404.kers'
[2026-05-23 08:48:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5869249816862403792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15524037311775265404.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:48:31] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15524037311775265404.kers
Total runtime 1 ms.
[2026-05-23 08:48:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 08:48:31] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2026-05-23 08:48:31] [INFO ] Invariant cache hit.
[2026-05-23 08:48:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:48:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2026-05-23 08:48:31] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-23 08:48:31] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2026-05-23 08:48:31] [INFO ] Invariant cache hit.
[2026-05-23 08:48:31] [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, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 67/109 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 1/110 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 48 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 67/109 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 60/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 108 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 42/42 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2704ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2706ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/467 places, 73/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2851 ms. Remains : 42/467 places, 73/580 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 35 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-13
Product exploration explored 100000 steps with 7 reset in 26 ms.
Product exploration explored 100000 steps with 6 reset in 28 ms.
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 46 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 2687 steps (283 resets) in 7 ms. (335 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 45 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 35 ms :[(NOT p0)]
Knowledge-based reduction took 133 ms.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 73/73 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2026-05-23 08:48:34] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2026-05-23 08:48:34] [INFO ] Invariant cache hit.
[2026-05-23 08:48:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 08:48:34] [INFO ] Flow matrix only has 68 transitions (discarded 5 similar events)
[2026-05-23 08:48:34] [INFO ] Invariant cache hit.
[2026-05-23 08:48:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:48:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 08:48:34] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 42/42 places, 73/73 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 45 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 3286 steps (350 resets) in 7 ms. (410 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 44 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 37 ms :[(NOT p0)]
Knowledge-based reduction took 131 ms.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 30 ms.
Product exploration explored 100000 steps with 3 reset in 58 ms.
Built C files in :
/tmp/ltsmin8880694332944615033
[2026-05-23 08:48:34] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2026-05-23 08:48:34] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:34] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2026-05-23 08:48:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:34] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2026-05-23 08:48:34] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:48:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8880694332944615033
Running compilation step : cd /tmp/ltsmin8880694332944615033;'/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 142 ms.
Running link step : cd /tmp/ltsmin8880694332944615033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8880694332944615033;'/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/stateBased16698765415875444716.hoa' '--buchi-type=spotba'
LTSmin run took 44 ms.
FORMULA CO4-PT-18-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-18-LTLFireability-13 finished in 3743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||X(G(p0)))))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 580/580 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 453 transition count 566
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 453 transition count 566
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 444 transition count 557
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 444 transition count 557
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 441 transition count 554
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 441 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 439 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 439 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 438 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 438 transition count 551
Applied a total of 58 rules in 34 ms. Remains 438 /467 variables (removed 29) and now considering 551/580 (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-10850313434146952778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5569639467505808760.kers'
[2026-05-23 08:48:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10850313434146952778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5569639467505808760.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:48:35] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5569639467505808760.kers
Total runtime 2 ms.
[2026-05-23 08:48:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-23 08:48:35] [INFO ] Invariant cache hit.
[2026-05-23 08:48:35] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 550 sub problems to find dead transitions.
[2026-05-23 08:48:35] [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 30037 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 995 constraints, problems are : Problem set: 0 solved, 550 unsolved in 30017 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 60111ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 438/467 places, 551/580 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60541 ms. Remains : 438/467 places, 551/580 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||X(G(p0)))))))'
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-18-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CO4-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-18-LTLFireability-15 finished in 60736 ms.
All properties solved by simple procedures.
Total runtime 405526 ms.

BK_STOP 1779526175843

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700420"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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