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-177946967700403.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-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 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 260K 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-16-LTLCardinality-00
FORMULA_NAME CO4-PT-16-LTLCardinality-01
FORMULA_NAME CO4-PT-16-LTLCardinality-02
FORMULA_NAME CO4-PT-16-LTLCardinality-03
FORMULA_NAME CO4-PT-16-LTLCardinality-04
FORMULA_NAME CO4-PT-16-LTLCardinality-05
FORMULA_NAME CO4-PT-16-LTLCardinality-06
FORMULA_NAME CO4-PT-16-LTLCardinality-07
FORMULA_NAME CO4-PT-16-LTLCardinality-08
FORMULA_NAME CO4-PT-16-LTLCardinality-09
FORMULA_NAME CO4-PT-16-LTLCardinality-10
FORMULA_NAME CO4-PT-16-LTLCardinality-11
FORMULA_NAME CO4-PT-16-LTLCardinality-12
FORMULA_NAME CO4-PT-16-LTLCardinality-13
FORMULA_NAME CO4-PT-16-LTLCardinality-14
FORMULA_NAME CO4-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779523940058

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 08:12:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:12:21] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-23 08:12:21] [INFO ] Transformed 837 places.
[2026-05-23 08:12:21] [INFO ] Transformed 1122 transitions.
[2026-05-23 08:12:21] [INFO ] Found NUPN structural information;
[2026-05-23 08:12:21] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 116 places in 11 ms
Reduce places removed 116 places and 180 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 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 707 transition count 939
Discarding 159 places :
Symmetric choice reduction at 1 with 159 rule applications. Total rules 176 place count 548 transition count 779
Iterating global reduction 1 with 159 rules applied. Total rules applied 335 place count 548 transition count 779
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 341 place count 548 transition count 773
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 428 place count 461 transition count 667
Iterating global reduction 2 with 87 rules applied. Total rules applied 515 place count 461 transition count 667
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 532 place count 444 transition count 642
Iterating global reduction 2 with 17 rules applied. Total rules applied 549 place count 444 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 552 place count 444 transition count 639
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 560 place count 436 transition count 631
Iterating global reduction 3 with 8 rules applied. Total rules applied 568 place count 436 transition count 631
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 573 place count 431 transition count 626
Iterating global reduction 3 with 5 rules applied. Total rules applied 578 place count 431 transition count 626
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 583 place count 431 transition count 621
Applied a total of 583 rules in 155 ms. Remains 431 /721 variables (removed 290) and now considering 621/942 (removed 321) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5954896495492804600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9191887142144915386.kers'
[2026-05-23 08:12:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5954896495492804600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9191887142144915386.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 431 cols 1687 entries
Finished phase 1 with 424 SingleSign rule and 0 generalized
[2026-05-23 08:12:21] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9191887142144915386.kers
Total runtime 4 ms.
[2026-05-23 08:12:22] [INFO ] Implicit Places using invariants in 397 ms returned [5, 361]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 428 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 429/721 places, 621/942 transitions.
Applied a total of 0 rules in 11 ms. Remains 429 /429 variables (removed 0) and now considering 621/621 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 429/721 places, 621/942 transitions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Applied a total of 0 rules in 16 ms. Remains 429 /429 variables (removed 0) and now considering 621/621 (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-15825908280178143966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16336763535849691550.kers'
[2026-05-23 08:12:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15825908280178143966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16336763535849691550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 429 cols 1666 entries
Finished phase 1 with 424 SingleSign rule and 0 generalized
[2026-05-23 08:12:22] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16336763535849691550.kers
Total runtime 3 ms.
[2026-05-23 08:12:22] [INFO ] Implicit Places using invariants in 462 ms returned []
[2026-05-23 08:12:22] [INFO ] Invariant cache hit.
[2026-05-23 08:12:23] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-23 08:12:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1047 variables, 426/431 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1047/1050 variables, and 434 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 426/429 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/426 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (OVERLAPS) 621/1047 variables, 426/436 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1047 variables, 613/1049 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1050 variables, and 1049 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 426/429 constraints, PredecessorRefiner: 613/620 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Finished structural reductions in LTL mode , in 1 iterations and 61132 ms. Remains : 429/429 places, 621/621 transitions.
Support contains 18 out of 429 places after structural reductions.
[2026-05-23 08:13:23] [INFO ] Flatten gal took : 61 ms
[2026-05-23 08:13:23] [INFO ] Flatten gal took : 29 ms
[2026-05-23 08:13:23] [INFO ] Input system was already deterministic with 621 transitions.
RANDOM walk for 40000 steps (678 resets) in 1703 ms. (23 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (154 resets) in 128 ms. (310 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 128 ms. (310 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (124 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (159 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (155 resets) in 84 ms. (470 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (161 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (152 resets) in 62 ms. (634 steps per ms) remains 5/6 properties
[2026-05-23 08:13:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 134/178 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 316/494 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 399/893 variables, 188/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 137/1030 variables, 87/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1030 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 18/1048 variables, 13/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1048 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1050 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1050 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1050 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 434 constraints, problems are : Problem set: 0 solved, 5 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 134/178 variables, 44/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 316/494 variables, 96/145 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 5/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 399/893 variables, 188/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/893 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 137/1030 variables, 87/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1030 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 18/1048 variables, 13/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/1050 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1050 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1050 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 439 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1812ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Parikh walk visited 5 properties in 39 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 932 edges and 429 vertex of which 422 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.19 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((p0||X(p1))))))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 426 transition count 621
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 419 transition count 612
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 419 transition count 612
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 419 transition count 609
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 416 transition count 606
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 416 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 416 transition count 605
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 415 transition count 604
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 415 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 415 transition count 603
Applied a total of 30 rules in 25 ms. Remains 415 /429 variables (removed 14) and now considering 603/621 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7216073839716025713.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13128517739386589783.kers'
[2026-05-23 08:13:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7216073839716025713.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13128517739386589783.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 603 rows 415 cols 1617 entries
Finished phase 1 with 410 SingleSign rule and 0 generalized
[2026-05-23 08:13:26] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13128517739386589783.kers
Total runtime 3 ms.
[2026-05-23 08:13:26] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 08:13:26] [INFO ] Invariant cache hit.
[2026-05-23 08:13:26] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2026-05-23 08:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 603/1018 variables, 415/421 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1018/1018 variables, and 424 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 4 (OVERLAPS) 603/1018 variables, 415/424 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1018 variables, 602/1026 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/1018 variables, and 1026 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 415/429 places, 603/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60507 ms. Remains : 415/429 places, 603/621 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((p0||X(p1))))))'
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 904 edges and 415 vertex of which 412 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 1 factoid took 43 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (679 resets) in 296 ms. (134 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (157 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
[2026-05-23 08:14:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/155 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/164 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/187 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 429/616 variables, 170/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 317/933 variables, 175/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/933 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 71/1004 variables, 44/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1004 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/1018 variables, 9/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1018 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1018 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1018/1018 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/155 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/164 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/187 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 429/616 variables, 170/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/616 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 317/933 variables, 175/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/933 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 71/1004 variables, 44/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1004 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 14/1018 variables, 9/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1018 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1018 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1018/1018 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 67 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1112 ms.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 603/603 transitions.
Applied a total of 0 rules in 10 ms. Remains 415 /415 variables (removed 0) and now considering 603/603 (removed 0) transitions.
[2026-05-23 08:14:29] [INFO ] Invariant cache hit.
[2026-05-23 08:14:29] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 08:14:29] [INFO ] Invariant cache hit.
[2026-05-23 08:14:29] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 415/415 places, 603/603 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 904 edges and 415 vertex of which 412 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 37724 steps (702 resets) in 114 ms. (328 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 395 ms.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Spot run failed in 80 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4331457664960226746
[2026-05-23 08:14:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4331457664960226746
Running compilation step : cd /tmp/ltsmin4331457664960226746;'/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 935 ms.
Running link step : cd /tmp/ltsmin4331457664960226746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin4331457664960226746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16655480416242269248.hoa' '--buchi-type=spotba'
LTSmin run took 63 ms.
FORMULA CO4-PT-16-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-16-LTLCardinality-02 finished in 65285 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 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Graph (trivial) has 464 edges and 429 vertex of which 2 / 429 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 931 edges and 428 vertex of which 421 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 420 transition count 462
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 154 rules applied. Total rules applied 308 place count 268 transition count 460
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 308 place count 268 transition count 411
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 406 place count 219 transition count 411
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 411 place count 214 transition count 404
Iterating global reduction 2 with 5 rules applied. Total rules applied 416 place count 214 transition count 404
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 419 place count 214 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 419 place count 214 transition count 399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 423 place count 212 transition count 399
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 425 place count 210 transition count 396
Iterating global reduction 3 with 2 rules applied. Total rules applied 427 place count 210 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 428 place count 210 transition count 395
Performed 63 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 554 place count 147 transition count 315
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 15 rules applied. Total rules applied 569 place count 147 transition count 300
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 573 place count 145 transition count 298
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 577 place count 141 transition count 290
Iterating global reduction 6 with 4 rules applied. Total rules applied 581 place count 141 transition count 290
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 587 place count 138 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 588 place count 137 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 589 place count 137 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 590 place count 137 transition count 284
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 672 place count 96 transition count 330
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 693 place count 96 transition count 309
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 721 place count 68 transition count 197
Iterating global reduction 8 with 28 rules applied. Total rules applied 749 place count 68 transition count 197
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 768 place count 68 transition count 178
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 775 place count 61 transition count 140
Iterating global reduction 9 with 7 rules applied. Total rules applied 782 place count 61 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 787 place count 61 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 791 place count 59 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 813 place count 59 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 815 place count 57 transition count 136
Applied a total of 815 rules in 98 ms. Remains 57 /429 variables (removed 372) and now considering 136/621 (removed 485) transitions.
[2026-05-23 08:14:31] [INFO ] Flow matrix only has 106 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17900433865037233862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7546478160564185446.kers'
[2026-05-23 08:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17900433865037233862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7546478160564185446.kers]
Normalized transition count is 105 out of 106 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 57 cols 313 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-23 08:14:31] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7546478160564185446.kers
Total runtime 1 ms.
[2026-05-23 08:14:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 08:14:31] [INFO ] Flow matrix only has 106 transitions (discarded 30 similar events)
[2026-05-23 08:14:31] [INFO ] Invariant cache hit.
[2026-05-23 08:14:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:14:31] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-23 08:14:31] [INFO ] Redundant transitions in 5 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-23 08:14:31] [INFO ] Flow matrix only has 106 transitions (discarded 30 similar events)
[2026-05-23 08:14:31] [INFO ] Invariant cache hit.
[2026-05-23 08:14:31] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 105/162 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 66 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 105/162 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 113/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 179 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4790 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7365ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/429 places, 136/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7581 ms. Remains : 57/429 places, 136/621 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 40 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-04
Product exploration explored 100000 steps with 6 reset in 89 ms.
Product exploration explored 100000 steps with 325 reset in 70 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 43 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 2203 steps (178 resets) in 33 ms. (64 steps per ms) remains 0/1 properties
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).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Knowledge-based reduction took 132 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 136/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2026-05-23 08:14:39] [INFO ] Flow matrix only has 106 transitions (discarded 30 similar events)
[2026-05-23 08:14:39] [INFO ] Invariant cache hit.
[2026-05-23 08:14:39] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 08:14:39] [INFO ] Flow matrix only has 106 transitions (discarded 30 similar events)
[2026-05-23 08:14:39] [INFO ] Invariant cache hit.
[2026-05-23 08:14:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:14:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-23 08:14:39] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 57/57 places, 136/136 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 51 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 4013 steps (322 resets) in 20 ms. (191 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 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 41 ms :[(NOT p0)]
Knowledge-based reduction took 180 ms.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24 reset in 35 ms.
Product exploration explored 100000 steps with 6 reset in 104 ms.
Built C files in :
/tmp/ltsmin18030960064402622533
[2026-05-23 08:14:40] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2026-05-23 08:14:40] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:14:40] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2026-05-23 08:14:40] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:14:40] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2026-05-23 08:14:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:14:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18030960064402622533
Running compilation step : cd /tmp/ltsmin18030960064402622533;'/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 262 ms.
Running link step : cd /tmp/ltsmin18030960064402622533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18030960064402622533;'/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/stateBased11186871986406867528.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA CO4-PT-16-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-16-LTLCardinality-04 finished in 9069 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)&&X(X(X(F(p1)))))))))'
Support contains 4 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 427 transition count 621
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 418 transition count 610
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 418 transition count 610
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 418 transition count 607
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 413 transition count 601
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 413 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 413 transition count 600
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 412 transition count 599
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 412 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 412 transition count 598
Applied a total of 37 rules in 28 ms. Remains 412 /429 variables (removed 17) and now considering 598/621 (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-1447001624693650172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13841202663681390140.kers'
[2026-05-23 08:14:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1447001624693650172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13841202663681390140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 598 rows 412 cols 1600 entries
Finished phase 1 with 407 SingleSign rule and 0 generalized
[2026-05-23 08:14:40] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13841202663681390140.kers
Total runtime 7 ms.
[2026-05-23 08:14:40] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 08:14:40] [INFO ] Invariant cache hit.
[2026-05-23 08:14:41] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 597 sub problems to find dead transitions.
[2026-05-23 08:14:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/1009 variables, 411/417 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1010 variables, and 420 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/412 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/411 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/1009 variables, 411/420 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 595/1015 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1015 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 411/412 constraints, PredecessorRefiner: 595/597 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 412/429 places, 598/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 412/429 places, 598/621 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)&&X(X(X(F(p1)))))))))'
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-06
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-06 finished in 60876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Graph (trivial) has 462 edges and 429 vertex of which 2 / 429 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 931 edges and 428 vertex of which 421 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 420 transition count 460
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 312 place count 266 transition count 458
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 312 place count 266 transition count 409
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 410 place count 217 transition count 409
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 415 place count 212 transition count 402
Iterating global reduction 2 with 5 rules applied. Total rules applied 420 place count 212 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 423 place count 212 transition count 399
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 423 place count 212 transition count 397
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 427 place count 210 transition count 397
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 429 place count 208 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 431 place count 208 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 208 transition count 393
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 554 place count 147 transition count 318
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 571 place count 147 transition count 301
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 575 place count 145 transition count 299
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 579 place count 141 transition count 291
Iterating global reduction 6 with 4 rules applied. Total rules applied 583 place count 141 transition count 291
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 591 place count 137 transition count 287
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 592 place count 136 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 593 place count 136 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 594 place count 136 transition count 284
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 676 place count 95 transition count 330
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 696 place count 95 transition count 310
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 724 place count 67 transition count 198
Iterating global reduction 8 with 28 rules applied. Total rules applied 752 place count 67 transition count 198
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 769 place count 67 transition count 181
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 776 place count 60 transition count 143
Iterating global reduction 9 with 7 rules applied. Total rules applied 783 place count 60 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 788 place count 60 transition count 138
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 10 with 2 rules applied. Total rules applied 790 place count 59 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 10 with 21 rules applied. Total rules applied 811 place count 59 transition count 134
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 817 place count 59 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 819 place count 57 transition count 132
Applied a total of 819 rules in 67 ms. Remains 57 /429 variables (removed 372) and now considering 132/621 (removed 489) transitions.
[2026-05-23 08:15:41] [INFO ] Flow matrix only has 104 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13198244704391010212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6819406730750858355.kers'
[2026-05-23 08:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13198244704391010212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6819406730750858355.kers]
Normalized transition count is 103 out of 104 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 57 cols 302 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-23 08:15:41] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6819406730750858355.kers
Total runtime 1 ms.
[2026-05-23 08:15:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 08:15:41] [INFO ] Flow matrix only has 104 transitions (discarded 28 similar events)
[2026-05-23 08:15:41] [INFO ] Invariant cache hit.
[2026-05-23 08:15:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:15:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2026-05-23 08:15:41] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-23 08:15:41] [INFO ] Flow matrix only has 104 transitions (discarded 28 similar events)
[2026-05-23 08:15:41] [INFO ] Invariant cache hit.
[2026-05-23 08:15:41] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 103/160 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 65 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 103/160 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 109/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 174 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4221 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6922ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6922ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/429 places, 132/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7096 ms. Remains : 57/429 places, 132/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-10
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-16-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-10 finished in 7163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 429 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Graph (trivial) has 463 edges and 429 vertex of which 2 / 429 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 931 edges and 428 vertex of which 421 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 156 place count 420 transition count 460
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 156 rules applied. Total rules applied 312 place count 266 transition count 458
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 312 place count 266 transition count 409
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 410 place count 217 transition count 409
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 413 place count 214 transition count 405
Iterating global reduction 2 with 3 rules applied. Total rules applied 416 place count 214 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 417 place count 214 transition count 404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 417 place count 214 transition count 403
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 213 transition count 403
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 212 transition count 401
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 212 transition count 401
Performed 65 Post agglomeration using F-continuation condition with reduction of 19 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 551 place count 147 transition count 317
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 3 with 14 rules applied. Total rules applied 565 place count 147 transition count 303
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 567 place count 146 transition count 302
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 571 place count 142 transition count 294
Iterating global reduction 5 with 4 rules applied. Total rules applied 575 place count 142 transition count 294
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 583 place count 138 transition count 290
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 584 place count 137 transition count 288
Iterating global reduction 5 with 1 rules applied. Total rules applied 585 place count 137 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 586 place count 137 transition count 287
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 668 place count 96 transition count 333
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 689 place count 96 transition count 312
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 717 place count 68 transition count 200
Iterating global reduction 7 with 28 rules applied. Total rules applied 745 place count 68 transition count 200
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 764 place count 68 transition count 181
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 771 place count 61 transition count 143
Iterating global reduction 8 with 7 rules applied. Total rules applied 778 place count 61 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 783 place count 61 transition count 138
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 785 place count 60 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 805 place count 60 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 807 place count 58 transition count 133
Applied a total of 807 rules in 51 ms. Remains 58 /429 variables (removed 371) and now considering 133/621 (removed 488) transitions.
[2026-05-23 08:15:48] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12072224383242065503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10594631613926628913.kers'
[2026-05-23 08:15:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12072224383242065503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10594631613926628913.kers]
Normalized transition count is 104 out of 105 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 58 cols 312 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-23 08:15:48] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10594631613926628913.kers
Total runtime 0 ms.
[2026-05-23 08:15:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 08:15:48] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2026-05-23 08:15:48] [INFO ] Invariant cache hit.
[2026-05-23 08:15:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:15:48] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2026-05-23 08:15:49] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-23 08:15:49] [INFO ] Flow matrix only has 105 transitions (discarded 28 similar events)
[2026-05-23 08:15:49] [INFO ] Invariant cache hit.
[2026-05-23 08:15:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 1/163 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 66 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 104/162 variables, 58/63 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 110/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 176 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4544 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 58/58 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7008ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7009ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/429 places, 133/621 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7169 ms. Remains : 58/429 places, 133/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 249 steps with 20 reset in 3 ms.
FORMULA CO4-PT-16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-11 finished in 7328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p0||G(p1))))))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 621
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 420 transition count 611
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 420 transition count 611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 420 transition count 609
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 415 transition count 603
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 415 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 415 transition count 602
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 414 transition count 601
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 414 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 414 transition count 600
Applied a total of 33 rules in 26 ms. Remains 414 /429 variables (removed 15) and now considering 600/621 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16022539549196154304.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13798002942649528623.kers'
[2026-05-23 08:15:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16022539549196154304.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13798002942649528623.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 600 rows 414 cols 1604 entries
Finished phase 1 with 409 SingleSign rule and 0 generalized
[2026-05-23 08:15:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13798002942649528623.kers
Total runtime 2 ms.
[2026-05-23 08:15:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 08:15:56] [INFO ] Invariant cache hit.
[2026-05-23 08:15:56] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 599 sub problems to find dead transitions.
[2026-05-23 08:15:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/418 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1012/1014 variables, and 420 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/414 constraints, PredecessorRefiner: 599/599 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 4 (OVERLAPS) 600/1012 variables, 412/420 constraints. Problems are: Problem set: 0 solved, 599 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 596/1016 constraints. Problems are: Problem set: 0 solved, 599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1012/1014 variables, and 1016 constraints, problems are : Problem set: 0 solved, 599 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 412/414 constraints, PredecessorRefiner: 596/599 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 599 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 414/429 places, 600/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60511 ms. Remains : 414/429 places, 600/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p0||G(p1))))))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-16-LTLCardinality-14
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA CO4-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-16-LTLCardinality-14 finished in 60703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(!p0) U G(p1))||X(X(X(p0))))))'
Support contains 3 out of 429 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 429/429 places, 621/621 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 426 transition count 621
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 417 transition count 611
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 417 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 417 transition count 608
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 413 transition count 603
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 413 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 413 transition count 602
Applied a total of 33 rules in 21 ms. Remains 413 /429 variables (removed 16) and now considering 602/621 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6290318227148348736.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7265937361860270283.kers'
[2026-05-23 08:16:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6290318227148348736.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7265937361860270283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 413 cols 1607 entries
Finished phase 1 with 408 SingleSign rule and 0 generalized
[2026-05-23 08:16:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7265937361860270283.kers
Total runtime 3 ms.
[2026-05-23 08:16:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 08:16:56] [INFO ] Invariant cache hit.
[2026-05-23 08:16:57] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-23 08:16:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/1015 variables, 413/418 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 420 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/413 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 602/1015 variables, 413/421 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1015 variables, 601/1022 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 1022 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 413/429 places, 602/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60462 ms. Remains : 413/429 places, 602/621 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(!p0) U G(p1))||X(X(X(p0))))))'
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 898 edges and 413 vertex of which 410 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (610 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (133 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (157 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (161 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 862762 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :0 out of 4
Probabilistic random walk after 862762 steps, saw 136425 distinct states, run finished after 3006 ms. (steps per millisecond=287 ) properties seen :0
[2026-05-23 08:18:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 126/137 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/146 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/169 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 299/468 variables, 125/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 339/807 variables, 149/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 164/971 variables, 93/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/971 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 35/1006 variables, 23/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 9/1015 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1015 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1015 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 418 constraints, problems are : Problem set: 0 solved, 4 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 126/137 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/146 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/169 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 299/468 variables, 125/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 339/807 variables, 149/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/807 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 164/971 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/971 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 35/1006 variables, 23/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 9/1015 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1015 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1015 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 422 constraints, problems are : Problem set: 0 solved, 4 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1408ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 79 ms.
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 602/602 transitions.
Graph (trivial) has 445 edges and 413 vertex of which 2 / 413 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 896 edges and 412 vertex of which 390 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 390 transition count 420
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 307 place count 248 transition count 417
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 307 place count 248 transition count 365
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 411 place count 196 transition count 365
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 193 transition count 362
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 193 transition count 362
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 420 place count 193 transition count 359
Performed 59 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 538 place count 134 transition count 287
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 556 place count 134 transition count 269
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 562 place count 131 transition count 266
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 566 place count 127 transition count 258
Iterating global reduction 5 with 4 rules applied. Total rules applied 570 place count 127 transition count 258
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 5 with 6 rules applied. Total rules applied 576 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 577 place count 123 transition count 253
Iterating global reduction 5 with 1 rules applied. Total rules applied 578 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 579 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 655 place count 85 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 6 with 61 rules applied. Total rules applied 716 place count 85 transition count 231
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 743 place count 58 transition count 155
Iterating global reduction 7 with 27 rules applied. Total rules applied 770 place count 58 transition count 155
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 790 place count 58 transition count 135
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 796 place count 52 transition count 105
Iterating global reduction 8 with 6 rules applied. Total rules applied 802 place count 52 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 806 place count 52 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 810 place count 50 transition count 115
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 816 place count 50 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 827 place count 50 transition count 98
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 828 place count 49 transition count 96
Iterating global reduction 10 with 1 rules applied. Total rules applied 829 place count 49 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 830 place count 49 transition count 95
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 841 place count 49 transition count 84
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 853 place count 38 transition count 83
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 856 place count 38 transition count 83
Graph (complete) has 150 edges and 38 vertex of which 37 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 12 with 1 rules applied. Total rules applied 857 place count 37 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 860 place count 37 transition count 80
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 863 place count 37 transition count 80
Graph (complete) has 142 edges and 37 vertex of which 36 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 14 with 1 rules applied. Total rules applied 864 place count 36 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 77
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 870 place count 36 transition count 77
Graph (complete) has 134 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 871 place count 35 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 874 place count 35 transition count 74
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 877 place count 35 transition count 74
Graph (complete) has 126 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 878 place count 34 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 881 place count 34 transition count 71
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 884 place count 34 transition count 71
Graph (complete) has 118 edges and 34 vertex of which 33 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 20 with 1 rules applied. Total rules applied 885 place count 33 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 888 place count 33 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 889 place count 32 transition count 67
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 t328.t491 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 20 edges and 28 vertex of which 5 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 22 with 5 rules applied. Total rules applied 894 place count 24 transition count 63
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 16 edges and 19 vertex of which 5 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 23 with 25 rules applied. Total rules applied 919 place count 15 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 24 with 15 rules applied. Total rules applied 934 place count 14 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 936 place count 14 transition count 28
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 937 place count 13 transition count 25
Iterating global reduction 25 with 1 rules applied. Total rules applied 938 place count 13 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 939 place count 13 transition count 24
Free-agglomeration rule applied 3 times.
Iterating global reduction 26 with 3 rules applied. Total rules applied 942 place count 13 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 26 with 3 rules applied. Total rules applied 945 place count 10 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 27 with 4 rules applied. Total rules applied 949 place count 10 transition count 17
Applied a total of 949 rules in 51 ms. Remains 10 /413 variables (removed 403) and now considering 17/602 (removed 585) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 10/413 places, 17/602 transitions.
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 5029 ms.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 602/602 transitions.
Applied a total of 0 rules in 9 ms. Remains 413 /413 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2026-05-23 08:18:02] [INFO ] Invariant cache hit.
[2026-05-23 08:18:03] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 08:18:03] [INFO ] Invariant cache hit.
[2026-05-23 08:18:03] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 413/413 places, 602/602 transitions.
Computed a total of 18 stabilizing places and 33 stable transitions
Graph (complete) has 898 edges and 413 vertex of which 410 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 33 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (877 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (156 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (152 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (123 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (158 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 807820 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 4
Probabilistic random walk after 807820 steps, saw 127055 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2026-05-23 08:18:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 126/137 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/146 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 23/169 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 299/468 variables, 125/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 339/807 variables, 149/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/807 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 164/971 variables, 93/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/971 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 35/1006 variables, 23/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 9/1015 variables, 5/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1015 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1015 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 418 constraints, problems are : Problem set: 0 solved, 4 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 126/137 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 9/146 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 23/169 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 299/468 variables, 125/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 339/807 variables, 149/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/807 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 164/971 variables, 93/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/971 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 35/1006 variables, 23/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 9/1015 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1015 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1015 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 422 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1475ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 89 ms.
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 602/602 transitions.
Graph (trivial) has 445 edges and 413 vertex of which 2 / 413 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 896 edges and 412 vertex of which 390 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.13 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 390 transition count 420
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 307 place count 248 transition count 417
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 307 place count 248 transition count 365
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 411 place count 196 transition count 365
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 414 place count 193 transition count 362
Iterating global reduction 2 with 3 rules applied. Total rules applied 417 place count 193 transition count 362
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 420 place count 193 transition count 359
Performed 59 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 538 place count 134 transition count 287
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 18 rules applied. Total rules applied 556 place count 134 transition count 269
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 562 place count 131 transition count 266
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 566 place count 127 transition count 258
Iterating global reduction 5 with 4 rules applied. Total rules applied 570 place count 127 transition count 258
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 5 with 6 rules applied. Total rules applied 576 place count 124 transition count 255
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 577 place count 123 transition count 253
Iterating global reduction 5 with 1 rules applied. Total rules applied 578 place count 123 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 579 place count 123 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 655 place count 85 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 6 with 61 rules applied. Total rules applied 716 place count 85 transition count 231
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 743 place count 58 transition count 155
Iterating global reduction 7 with 27 rules applied. Total rules applied 770 place count 58 transition count 155
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 790 place count 58 transition count 135
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 796 place count 52 transition count 105
Iterating global reduction 8 with 6 rules applied. Total rules applied 802 place count 52 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 806 place count 52 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 810 place count 50 transition count 115
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 816 place count 50 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 827 place count 50 transition count 98
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 828 place count 49 transition count 96
Iterating global reduction 10 with 1 rules applied. Total rules applied 829 place count 49 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 830 place count 49 transition count 95
Free-agglomeration rule applied 11 times.
Iterating global reduction 11 with 11 rules applied. Total rules applied 841 place count 49 transition count 84
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 853 place count 38 transition count 83
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 856 place count 38 transition count 83
Graph (complete) has 150 edges and 38 vertex of which 37 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 12 with 1 rules applied. Total rules applied 857 place count 37 transition count 83
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 860 place count 37 transition count 80
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 863 place count 37 transition count 80
Graph (complete) has 142 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 864 place count 36 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 867 place count 36 transition count 77
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 870 place count 36 transition count 77
Graph (complete) has 134 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 871 place count 35 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 874 place count 35 transition count 74
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 877 place count 35 transition count 74
Graph (complete) has 126 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 18 with 1 rules applied. Total rules applied 878 place count 34 transition count 74
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 881 place count 34 transition count 71
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 884 place count 34 transition count 71
Graph (complete) has 118 edges and 34 vertex of which 33 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 20 with 1 rules applied. Total rules applied 885 place count 33 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 21 with 3 rules applied. Total rules applied 888 place count 33 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 889 place count 32 transition count 67
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 t328.t491 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 20 edges and 28 vertex of which 5 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 22 with 5 rules applied. Total rules applied 894 place count 24 transition count 63
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 16 edges and 19 vertex of which 5 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 23 with 25 rules applied. Total rules applied 919 place count 15 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 24 with 15 rules applied. Total rules applied 934 place count 14 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 25 with 2 rules applied. Total rules applied 936 place count 14 transition count 28
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 937 place count 13 transition count 25
Iterating global reduction 25 with 1 rules applied. Total rules applied 938 place count 13 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 939 place count 13 transition count 24
Free-agglomeration rule applied 3 times.
Iterating global reduction 26 with 3 rules applied. Total rules applied 942 place count 13 transition count 21
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 26 with 3 rules applied. Total rules applied 945 place count 10 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 27 with 4 rules applied. Total rules applied 949 place count 10 transition count 17
Applied a total of 949 rules in 94 ms. Remains 10 /413 variables (removed 403) and now considering 17/602 (removed 585) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 10/413 places, 17/602 transitions.
RANDOM walk for 63 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 5137 ms.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Product exploration explored 100000 steps with 25000 reset in 142 ms.
Spot run failed in 42 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17528952062791024228
[2026-05-23 08:18:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17528952062791024228
Running compilation step : cd /tmp/ltsmin17528952062791024228;'/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 836 ms.
Running link step : cd /tmp/ltsmin17528952062791024228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17528952062791024228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13208752697228629300.hoa' '--buchi-type=spotba'
LTSmin run took 44 ms.
FORMULA CO4-PT-16-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-16-LTLCardinality-15 finished in 73234 ms.
All properties solved by simple procedures.
Total runtime 348867 ms.

BK_STOP 1779524290147

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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