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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 332K 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-19-LTLCardinality-00
FORMULA_NAME CO4-PT-19-LTLCardinality-01
FORMULA_NAME CO4-PT-19-LTLCardinality-02
FORMULA_NAME CO4-PT-19-LTLCardinality-03
FORMULA_NAME CO4-PT-19-LTLCardinality-04
FORMULA_NAME CO4-PT-19-LTLCardinality-05
FORMULA_NAME CO4-PT-19-LTLCardinality-06
FORMULA_NAME CO4-PT-19-LTLCardinality-07
FORMULA_NAME CO4-PT-19-LTLCardinality-08
FORMULA_NAME CO4-PT-19-LTLCardinality-09
FORMULA_NAME CO4-PT-19-LTLCardinality-10
FORMULA_NAME CO4-PT-19-LTLCardinality-11
FORMULA_NAME CO4-PT-19-LTLCardinality-12
FORMULA_NAME CO4-PT-19-LTLCardinality-13
FORMULA_NAME CO4-PT-19-LTLCardinality-14
FORMULA_NAME CO4-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779526303825

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 08:51:44] [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:51:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:51:45] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2026-05-23 08:51:45] [INFO ] Transformed 1174 places.
[2026-05-23 08:51:45] [INFO ] Transformed 1447 transitions.
[2026-05-23 08:51:45] [INFO ] Found NUPN structural information;
[2026-05-23 08:51:45] [INFO ] Parsed PT model containing 1174 places and 1447 transitions and 3662 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 201 places in 15 ms
Reduce places removed 201 places and 274 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-19-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-19-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 973 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 973/973 places, 1173/1173 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 948 transition count 1165
Discarding 163 places :
Symmetric choice reduction at 1 with 163 rule applications. Total rules 196 place count 785 transition count 1000
Iterating global reduction 1 with 163 rules applied. Total rules applied 359 place count 785 transition count 1000
Discarding 138 places :
Symmetric choice reduction at 1 with 138 rule applications. Total rules 497 place count 647 transition count 859
Iterating global reduction 1 with 138 rules applied. Total rules applied 635 place count 647 transition count 859
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 644 place count 647 transition count 850
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 711 place count 580 transition count 777
Iterating global reduction 2 with 67 rules applied. Total rules applied 778 place count 580 transition count 777
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 780 place count 580 transition count 775
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 823 place count 537 transition count 732
Iterating global reduction 3 with 43 rules applied. Total rules applied 866 place count 537 transition count 732
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 875 place count 537 transition count 723
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 892 place count 520 transition count 706
Iterating global reduction 4 with 17 rules applied. Total rules applied 909 place count 520 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 911 place count 520 transition count 704
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 917 place count 514 transition count 698
Iterating global reduction 5 with 6 rules applied. Total rules applied 923 place count 514 transition count 698
Applied a total of 923 rules in 271 ms. Remains 514 /973 variables (removed 459) and now considering 698/1173 (removed 475) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11726978250190335355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10894125337228623850.kers'
[2026-05-23 08:51:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11726978250190335355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10894125337228623850.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 698 rows 514 cols 1803 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-23 08:51:45] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10894125337228623850.kers
Total runtime 3 ms.
[2026-05-23 08:51:46] [INFO ] Implicit Places using invariants in 355 ms returned [6, 454]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 388 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 512/973 places, 698/1173 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 680 ms. Remains : 512/973 places, 698/1173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Applied a total of 0 rules in 8 ms. Remains 512 /512 variables (removed 0) and now considering 698/698 (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-1500084869093202900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17449346323309474659.kers'
[2026-05-23 08:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1500084869093202900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17449346323309474659.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 698 rows 512 cols 1791 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-23 08:51:46] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17449346323309474659.kers
Total runtime 4 ms.
[2026-05-23 08:51:46] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-23 08:51:46] [INFO ] Invariant cache hit.
[2026-05-23 08:51:46] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 697 sub problems to find dead transitions.
[2026-05-23 08:51:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 697 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/1210 variables, and 7 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/512 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (OVERLAPS) 698/1210 variables, 512/519 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1210 variables, 697/1216 constraints. Problems are: Problem set: 0 solved, 697 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 1217 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 60481ms
Finished structural reductions in LTL mode , in 1 iterations and 61324 ms. Remains : 512/512 places, 698/698 transitions.
Support contains 17 out of 512 places after structural reductions.
[2026-05-23 08:52:47] [INFO ] Flatten gal took : 65 ms
[2026-05-23 08:52:47] [INFO ] Flatten gal took : 34 ms
[2026-05-23 08:52:47] [INFO ] Input system was already deterministic with 698 transitions.
RANDOM walk for 40000 steps (793 resets) in 1346 ms. (29 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (142 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (140 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
[2026-05-23 08:52:48] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/32 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/198 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/209 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/233 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 423/656 variables, 184/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/656 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 343/999 variables, 171/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 154/1153 variables, 88/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1153 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 44/1197 variables, 26/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1197 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/1210 variables, 9/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1210 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1210 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 517 constraints, problems are : Problem set: 0 solved, 2 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/32 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 166/198 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 11/209 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/233 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 423/656 variables, 184/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/656 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 343/999 variables, 171/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 154/1153 variables, 88/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1153 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 44/1197 variables, 26/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1197 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/1210 variables, 9/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1210 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1210 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1210/1210 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1204ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 93 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 7 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 990 edges and 512 vertex of which 505 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X(p0)))) U p1))'
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 502 transition count 687
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 502 transition count 687
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 494 transition count 679
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 494 transition count 679
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 494 transition count 678
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 492 transition count 676
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 492 transition count 676
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 491 transition count 675
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 491 transition count 675
Applied a total of 43 rules in 41 ms. Remains 491 /512 variables (removed 21) and now considering 675/698 (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-2361405369421389296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13580823129566249290.kers'
[2026-05-23 08:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2361405369421389296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13580823129566249290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 675 rows 491 cols 1738 entries
Finished phase 1 with 486 SingleSign rule and 0 generalized
[2026-05-23 08:52:49] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13580823129566249290.kers
Total runtime 5 ms.
[2026-05-23 08:52:49] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 08:52:49] [INFO ] Invariant cache hit.
[2026-05-23 08:52:50] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 674 sub problems to find dead transitions.
[2026-05-23 08:52:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/491 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/491 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 674 unsolved
SMT process timed out in 30139ms, After SMT, problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 30142ms
Starting structural reductions in LTL mode, iteration 1 : 491/512 places, 675/698 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30610 ms. Remains : 491/512 places, 675/698 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(X(p0)))) U p1))'
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-03
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 3 ms.
FORMULA CO4-PT-19-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-03 finished in 30967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Graph (trivial) has 546 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 510 vertex of which 503 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 502 transition count 467
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 222 rules applied. Total rules applied 444 place count 282 transition count 465
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 445 place count 281 transition count 465
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 445 place count 281 transition count 418
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 539 place count 234 transition count 418
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 541 place count 232 transition count 415
Iterating global reduction 3 with 2 rules applied. Total rules applied 543 place count 232 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 544 place count 231 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 545 place count 231 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 546 place count 231 transition count 413
Performed 87 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 720 place count 144 transition count 299
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 731 place count 144 transition count 288
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 739 place count 136 transition count 275
Iterating global reduction 5 with 8 rules applied. Total rules applied 747 place count 136 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 749 place count 135 transition count 274
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 750 place count 134 transition count 272
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 134 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 752 place count 134 transition count 271
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
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 834 place count 93 transition count 316
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 855 place count 93 transition count 295
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 882 place count 66 transition count 187
Iterating global reduction 7 with 27 rules applied. Total rules applied 909 place count 66 transition count 187
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 928 place count 66 transition count 168
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 934 place count 60 transition count 132
Iterating global reduction 8 with 6 rules applied. Total rules applied 940 place count 60 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 944 place count 60 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 952 place count 56 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 9 with 48 rules applied. Total rules applied 1000 place count 56 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1002 place count 54 transition count 121
Applied a total of 1002 rules in 160 ms. Remains 54 /512 variables (removed 458) and now considering 121/698 (removed 577) transitions.
[2026-05-23 08:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-792023213931577433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15435208712964363603.kers'
[2026-05-23 08:53:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-792023213931577433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15435208712964363603.kers]
Normalized transition count is 91 out of 92 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 54 cols 250 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-23 08:53:20] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15435208712964363603.kers
Total runtime 0 ms.
[2026-05-23 08:53:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 08:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 29 similar events)
[2026-05-23 08:53:20] [INFO ] Invariant cache hit.
[2026-05-23 08:53:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:53:20] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2026-05-23 08:53:20] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 08:53:20] [INFO ] Flow matrix only has 92 transitions (discarded 29 similar events)
[2026-05-23 08:53:20] [INFO ] Invariant cache hit.
[2026-05-23 08:53:20] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 91/145 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/146 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 62 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 91/145 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 101/162 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 1/146 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 163 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 54/54 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5996ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/512 places, 121/698 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6276 ms. Remains : 54/512 places, 121/698 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-06
Product exploration explored 100000 steps with 93 reset in 134 ms.
Product exploration explored 100000 steps with 122 reset in 71 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4010 steps (327 resets) in 38 ms. (102 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 212 ms.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2026-05-23 08:53:27] [INFO ] Flow matrix only has 92 transitions (discarded 29 similar events)
[2026-05-23 08:53:27] [INFO ] Invariant cache hit.
[2026-05-23 08:53:27] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 08:53:27] [INFO ] Flow matrix only has 92 transitions (discarded 29 similar events)
[2026-05-23 08:53:27] [INFO ] Invariant cache hit.
[2026-05-23 08:53:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 08:53:27] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-23 08:53:27] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 54/54 places, 121/121 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 9502 steps (780 resets) in 43 ms. (215 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 229 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 401 reset in 39 ms.
Product exploration explored 100000 steps with 50 reset in 35 ms.
Built C files in :
/tmp/ltsmin11978873289073497836
[2026-05-23 08:53:28] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2026-05-23 08:53:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:53:28] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2026-05-23 08:53:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:53:28] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2026-05-23 08:53:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:53:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11978873289073497836
Running compilation step : cd /tmp/ltsmin11978873289073497836;'/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 370 ms.
Running link step : cd /tmp/ltsmin11978873289073497836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11978873289073497836;'/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/stateBased7904835258791299981.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA CO4-PT-19-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLCardinality-06 finished in 8203 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 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Graph (trivial) has 545 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 510 vertex of which 503 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 502 transition count 466
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 281 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 448 place count 280 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 279 transition count 463
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 449 place count 279 transition count 416
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 543 place count 232 transition count 416
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 546 place count 229 transition count 412
Iterating global reduction 4 with 3 rules applied. Total rules applied 549 place count 229 transition count 412
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 549 place count 229 transition count 411
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 551 place count 228 transition count 411
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 552 place count 227 transition count 410
Iterating global reduction 4 with 1 rules applied. Total rules applied 553 place count 227 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 554 place count 227 transition count 409
Performed 83 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 5 with 166 rules applied. Total rules applied 720 place count 144 transition count 305
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 735 place count 144 transition count 290
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 743 place count 136 transition count 277
Iterating global reduction 6 with 8 rules applied. Total rules applied 751 place count 136 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 753 place count 135 transition count 276
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 754 place count 134 transition count 274
Iterating global reduction 6 with 1 rules applied. Total rules applied 755 place count 134 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 756 place count 134 transition count 273
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 838 place count 93 transition count 319
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 858 place count 93 transition count 299
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 886 place count 65 transition count 187
Iterating global reduction 8 with 28 rules applied. Total rules applied 914 place count 65 transition count 187
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 932 place count 65 transition count 169
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 939 place count 58 transition count 131
Iterating global reduction 9 with 7 rules applied. Total rules applied 946 place count 58 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 951 place count 58 transition count 126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 959 place count 54 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 1005 place count 54 transition count 121
Partial Post-agglomeration rule applied 9 times.
Drop transitions (Partial Post agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 1014 place count 54 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1016 place count 52 transition count 119
Applied a total of 1016 rules in 76 ms. Remains 52 /512 variables (removed 460) and now considering 119/698 (removed 579) transitions.
[2026-05-23 08:53:28] [INFO ] Flow matrix only has 98 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6398968828640309674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13373712522550828640.kers'
[2026-05-23 08:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6398968828640309674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13373712522550828640.kers]
Normalized transition count is 97 out of 98 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 52 cols 272 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-23 08:53:28] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13373712522550828640.kers
Total runtime 2 ms.
[2026-05-23 08:53:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 08:53:28] [INFO ] Flow matrix only has 98 transitions (discarded 21 similar events)
[2026-05-23 08:53:28] [INFO ] Invariant cache hit.
[2026-05-23 08:53:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 08:53:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-23 08:53:29] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2026-05-23 08:53:29] [INFO ] Flow matrix only has 98 transitions (discarded 21 similar events)
[2026-05-23 08:53:29] [INFO ] Invariant cache hit.
[2026-05-23 08:53:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 97/149 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 1/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 61 constraints, problems are : Problem set: 0 solved, 99 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (OVERLAPS) 97/149 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 99/159 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 160 constraints, problems are : Problem set: 0 solved, 99 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 52/52 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5617ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 5618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/512 places, 119/698 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5792 ms. Remains : 52/512 places, 119/698 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 39 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-09
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-09 finished in 5857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||G(p1)))&&F(p2))))'
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Graph (trivial) has 543 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 510 vertex of which 505 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 504 transition count 471
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 220 rules applied. Total rules applied 440 place count 286 transition count 469
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 442 place count 285 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 443 place count 284 transition count 468
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 443 place count 284 transition count 421
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 537 place count 237 transition count 421
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 539 place count 235 transition count 419
Iterating global reduction 4 with 2 rules applied. Total rules applied 541 place count 235 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 541 place count 235 transition count 418
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 543 place count 234 transition count 418
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 544 place count 233 transition count 417
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 233 transition count 417
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 546 place count 233 transition count 416
Performed 86 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 718 place count 147 transition count 305
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 729 place count 147 transition count 294
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 737 place count 139 transition count 281
Iterating global reduction 6 with 8 rules applied. Total rules applied 745 place count 139 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 747 place count 138 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 748 place count 137 transition count 278
Iterating global reduction 6 with 1 rules applied. Total rules applied 749 place count 137 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 750 place count 137 transition count 277
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 830 place count 97 transition count 321
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 850 place count 97 transition count 301
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 877 place count 70 transition count 193
Iterating global reduction 8 with 27 rules applied. Total rules applied 904 place count 70 transition count 193
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 922 place count 70 transition count 175
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 928 place count 64 transition count 143
Iterating global reduction 9 with 6 rules applied. Total rules applied 934 place count 64 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 938 place count 64 transition count 139
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 944 place count 61 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 10 with 45 rules applied. Total rules applied 989 place count 61 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 991 place count 59 transition count 122
Applied a total of 991 rules in 53 ms. Remains 59 /512 variables (removed 453) and now considering 122/698 (removed 576) transitions.
[2026-05-23 08:53:34] [INFO ] Flow matrix only has 102 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7979953215368244379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4147518764766222173.kers'
[2026-05-23 08:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7979953215368244379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4147518764766222173.kers]
Normalized transition count is 101 out of 102 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 59 cols 278 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-23 08:53:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4147518764766222173.kers
Total runtime 3 ms.
[2026-05-23 08:53:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 08:53:34] [INFO ] Flow matrix only has 102 transitions (discarded 20 similar events)
[2026-05-23 08:53:34] [INFO ] Invariant cache hit.
[2026-05-23 08:53:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:53:34] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-23 08:53:34] [INFO ] Redundant transitions in 2 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-23 08:53:34] [INFO ] Flow matrix only has 102 transitions (discarded 20 similar events)
[2026-05-23 08:53:34] [INFO ] Invariant cache hit.
[2026-05-23 08:53:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 101/160 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 66 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 101/160 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 102/167 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 168 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3722 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 59/59 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6209ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6210ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/512 places, 122/698 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6420 ms. Remains : 59/512 places, 122/698 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)||G(p1)))&&F(p2))))'
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-12
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA CO4-PT-19-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-12 finished in 6589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 504 transition count 689
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 504 transition count 689
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 498 transition count 683
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 498 transition count 683
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 496 transition count 681
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 496 transition count 681
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 494 transition count 679
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 494 transition count 679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 493 transition count 678
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 493 transition count 678
Applied a total of 38 rules in 47 ms. Remains 493 /512 variables (removed 19) and now considering 678/698 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11984056787741320664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9669852296630718863.kers'
[2026-05-23 08:53:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11984056787741320664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9669852296630718863.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 678 rows 493 cols 1748 entries
Finished phase 1 with 488 SingleSign rule and 0 generalized
[2026-05-23 08:53:41] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9669852296630718863.kers
Total runtime 7 ms.
[2026-05-23 08:53:41] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-23 08:53:41] [INFO ] Invariant cache hit.
[2026-05-23 08:53:41] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 677 sub problems to find dead transitions.
[2026-05-23 08:53:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 678/1171 variables, 493/498 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1171/1171 variables, and 498 constraints, problems are : Problem set: 0 solved, 677 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 677 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 4 (OVERLAPS) 678/1171 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 677 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1171 variables, 677/1177 constraints. Problems are: Problem set: 0 solved, 677 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1171/1171 variables, and 1178 constraints, problems are : Problem set: 0 solved, 677 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 677/677 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 677 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 493/512 places, 678/698 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60630 ms. Remains : 493/512 places, 678/698 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-19-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-19-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-19-LTLCardinality-13 finished in 60793 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 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 698/698 transitions.
Graph (trivial) has 546 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 988 edges and 510 vertex of which 503 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 502 transition count 466
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 223 rules applied. Total rules applied 446 place count 281 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 447 place count 280 transition count 464
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 447 place count 280 transition count 417
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 541 place count 233 transition count 417
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 544 place count 230 transition count 413
Iterating global reduction 3 with 3 rules applied. Total rules applied 547 place count 230 transition count 413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 547 place count 230 transition count 412
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 549 place count 229 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 550 place count 228 transition count 411
Iterating global reduction 3 with 1 rules applied. Total rules applied 551 place count 228 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 552 place count 228 transition count 410
Performed 85 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 722 place count 143 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 733 place count 143 transition count 287
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 741 place count 135 transition count 274
Iterating global reduction 5 with 8 rules applied. Total rules applied 749 place count 135 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 751 place count 134 transition count 273
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 133 transition count 271
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 133 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 754 place count 133 transition count 270
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 834 place count 93 transition count 314
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 854 place count 93 transition count 294
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 880 place count 67 transition count 190
Iterating global reduction 7 with 26 rules applied. Total rules applied 906 place count 67 transition count 190
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 923 place count 67 transition count 173
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 930 place count 60 transition count 135
Iterating global reduction 8 with 7 rules applied. Total rules applied 937 place count 60 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 942 place count 60 transition count 130
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 948 place count 57 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 9 with 42 rules applied. Total rules applied 990 place count 57 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 992 place count 55 transition count 113
Applied a total of 992 rules in 56 ms. Remains 55 /512 variables (removed 457) and now considering 113/698 (removed 585) transitions.
[2026-05-23 08:54:42] [INFO ] Flow matrix only has 95 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-805930223369188319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3888122999673278670.kers'
[2026-05-23 08:54:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-805930223369188319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3888122999673278670.kers]
Normalized transition count is 94 out of 95 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 55 cols 257 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 08:54:42] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3888122999673278670.kers
Total runtime 5 ms.
[2026-05-23 08:54:42] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 08:54:42] [INFO ] Flow matrix only has 95 transitions (discarded 18 similar events)
[2026-05-23 08:54:42] [INFO ] Invariant cache hit.
[2026-05-23 08:54:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:54:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2026-05-23 08:54:42] [INFO ] Redundant transitions in 2 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-23 08:54:42] [INFO ] Flow matrix only has 95 transitions (discarded 18 similar events)
[2026-05-23 08:54:42] [INFO ] Invariant cache hit.
[2026-05-23 08:54:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/149 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/150 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 62 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/149 variables, 55/60 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 93/154 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 155 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5170ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 5171ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/512 places, 113/698 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5462 ms. Remains : 55/512 places, 113/698 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 39 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-19-LTLCardinality-14
Product exploration explored 100000 steps with 407 reset in 53 ms.
Product exploration explored 100000 steps with 26 reset in 69 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 59 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 1301 steps (100 resets) in 13 ms. (92 steps per ms) remains 0/1 properties
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).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Knowledge-based reduction took 149 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 113/113 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2026-05-23 08:54:47] [INFO ] Flow matrix only has 95 transitions (discarded 18 similar events)
[2026-05-23 08:54:47] [INFO ] Invariant cache hit.
[2026-05-23 08:54:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-23 08:54:47] [INFO ] Flow matrix only has 95 transitions (discarded 18 similar events)
[2026-05-23 08:54:47] [INFO ] Invariant cache hit.
[2026-05-23 08:54:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 08:54:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-23 08:54:48] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 55/55 places, 113/113 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 3 factoid took 45 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 2275 steps (182 resets) in 14 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 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 51 ms :[(NOT p0)]
Knowledge-based reduction took 167 ms.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17 reset in 38 ms.
Product exploration explored 100000 steps with 360 reset in 38 ms.
Built C files in :
/tmp/ltsmin14924948906355068022
[2026-05-23 08:54:48] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2026-05-23 08:54:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:54:48] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2026-05-23 08:54:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:54:48] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2026-05-23 08:54:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 08:54:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14924948906355068022
Running compilation step : cd /tmp/ltsmin14924948906355068022;'/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 236 ms.
Running link step : cd /tmp/ltsmin14924948906355068022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14924948906355068022;'/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/stateBased14833532264589682229.hoa' '--buchi-type=spotba'
LTSmin run took 143 ms.
FORMULA CO4-PT-19-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-19-LTLCardinality-14 finished in 6759 ms.
All properties solved by simple procedures.
Total runtime 183876 ms.

BK_STOP 1779526488887

--------------------
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-19"
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-19, 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-177946967700427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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