fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074000099
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FunctionPointer-PT-b064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
646.880 310828.00 363773.00 1015.90 FFTTFFTFFFFFTFFT normal

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.r146-tall-177961074000099.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 FunctionPointer-PT-b064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.9K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b064-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b064-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779679015740

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 03:16:56] [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-25 03:16:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:16:57] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-25 03:16:57] [INFO ] Transformed 306 places.
[2026-05-25 03:16:57] [INFO ] Transformed 840 transitions.
[2026-05-25 03:16:57] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 31 place count 191 transition count 498
Iterating global reduction 1 with 23 rules applied. Total rules applied 54 place count 191 transition count 498
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 78 place count 191 transition count 474
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 182 transition count 456
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 182 transition count 456
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 180 transition count 452
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 180 transition count 452
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 179 transition count 448
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 179 transition count 448
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 178 transition count 446
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 178 transition count 446
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 177 transition count 442
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 177 transition count 442
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 176 transition count 438
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 176 transition count 438
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 175 transition count 436
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 175 transition count 436
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 174 transition count 434
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 174 transition count 434
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 173 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 173 transition count 432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 172 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 172 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 171 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 171 transition count 428
Applied a total of 118 rules in 105 ms. Remains 171 /222 variables (removed 51) and now considering 428/648 (removed 220) transitions.
[2026-05-25 03:16:57] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12740333244319391297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-122264749667002131.kers'
[2026-05-25 03:16:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12740333244319391297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-122264749667002131.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 292 rows 171 cols 818 entries
Finished phase 1 with 168 SingleSign rule and 1 generalized
[2026-05-25 03:16:57] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-122264749667002131.kers
Total runtime 2 ms.
[2026-05-25 03:16:57] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-25 03:16:57] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
[2026-05-25 03:16:57] [INFO ] Invariant cache hit.
[2026-05-25 03:16:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 03:16:58] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2026-05-25 03:16:58] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
[2026-05-25 03:16:58] [INFO ] Invariant cache hit.
[2026-05-25 03:16:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 292/461 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 60/231 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 426 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/463 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 233 constraints, problems are : Problem set: 0 solved, 426 unsolved in 16501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 171/171 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 292/461 variables, 169/171 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 60/231 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 32/263 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 426 unsolved
SMT process timed out in 46951ms, After SMT, problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 46967ms
Starting structural reductions in LTL mode, iteration 1 : 171/222 places, 428/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47861 ms. Remains : 171/222 places, 428/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2026-05-25 03:17:45] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
[2026-05-25 03:17:45] [INFO ] Invariant cache hit.
[2026-05-25 03:17:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 03:17:45] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
[2026-05-25 03:17:45] [INFO ] Invariant cache hit.
[2026-05-25 03:17:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-25 03:17:45] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 171/171 places, 428/428 transitions.
Support contains 26 out of 171 places after structural reductions.
[2026-05-25 03:17:45] [INFO ] Flatten gal took : 51 ms
[2026-05-25 03:17:45] [INFO ] Flatten gal took : 29 ms
[2026-05-25 03:17:46] [INFO ] Input system was already deterministic with 428 transitions.
RANDOM walk for 40075 steps (28 resets) in 944 ms. (42 steps per ms) remains 1/20 properties
BEST_FIRST walk for 40004 steps (28 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2026-05-25 03:17:46] [INFO ] Flow matrix only has 292 transitions (discarded 136 similar events)
[2026-05-25 03:17:46] [INFO ] Invariant cache hit.
[2026-05-25 03:17:46] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/84 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 13/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 150/234 variables, 24/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 419/463 variables, and 156 constraints, problems are : Problem set: 1 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/171 constraints, ReadFeed: 13/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA FunctionPointer-PT-b064-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-b064-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 912 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Graph (complete) has 912 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 159 transition count 406
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 159 transition count 406
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 29 place count 159 transition count 398
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 151 transition count 382
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 151 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 151 transition count 378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 145 transition count 358
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 145 transition count 358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 139 transition count 340
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 139 transition count 340
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 133 transition count 322
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 133 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 128 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 123 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 123 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 118 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 118 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 113 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 113 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 109 transition count 262
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 109 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 105 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 103 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 103 transition count 246
Applied a total of 149 rules in 82 ms. Remains 103 /171 variables (removed 68) and now considering 246/428 (removed 182) transitions.
[2026-05-25 03:17:46] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17474256886414911538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6673381166571061484.kers'
[2026-05-25 03:17:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17474256886414911538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6673381166571061484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 103 cols 468 entries
Finished phase 1 with 100 SingleSign rule and 1 generalized
[2026-05-25 03:17:46] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6673381166571061484.kers
Total runtime 1 ms.
[2026-05-25 03:17:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 03:17:47] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 03:17:47] [INFO ] Invariant cache hit.
[2026-05-25 03:17:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 03:17:47] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2026-05-25 03:17:47] [INFO ] Redundant transitions in 17 ms returned []
Running 244 sub problems to find dead transitions.
[2026-05-25 03:17:47] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 03:17:47] [INFO ] Invariant cache hit.
[2026-05-25 03:17:47] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 145 constraints, problems are : Problem set: 0 solved, 244 unsolved in 5838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 244/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 389 constraints, problems are : Problem set: 0 solved, 244 unsolved in 13857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19785ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 19787ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/171 places, 246/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20275 ms. Remains : 103/171 places, 246/428 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 146 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-01
Stuttering criterion allowed to conclude after 758 steps with 5 reset in 17 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-01 finished in 20514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 408
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 160 transition count 402
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 34 place count 152 transition count 386
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 152 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 152 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 52 place count 146 transition count 362
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 140 transition count 344
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 76 place count 134 transition count 326
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 88 place count 128 transition count 304
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 128 transition count 304
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 100 place count 122 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 112 place count 116 transition count 276
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 110 transition count 264
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 135 place count 105 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 105 transition count 254
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 145 place count 100 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 150 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 99 transition count 242
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 99 transition count 242
Applied a total of 152 rules in 36 ms. Remains 99 /171 variables (removed 72) and now considering 242/428 (removed 186) transitions.
[2026-05-25 03:18:07] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7055674793918216311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14042377964857386117.kers'
[2026-05-25 03:18:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7055674793918216311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14042377964857386117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 99 cols 452 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 03:18:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14042377964857386117.kers
Total runtime 1 ms.
[2026-05-25 03:18:07] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-25 03:18:07] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 03:18:07] [INFO ] Invariant cache hit.
[2026-05-25 03:18:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 03:18:07] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 03:18:07] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 03:18:07] [INFO ] Invariant cache hit.
[2026-05-25 03:18:07] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5974 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 381 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17640 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23671ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 23672ms
Starting structural reductions in LTL mode, iteration 1 : 99/171 places, 242/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24164 ms. Remains : 99/171 places, 242/428 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 69 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 77 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b064-LTLCardinality-02 finished in 24801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(p2)&&X(X(F(!p0))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 428
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 162 transition count 410
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 162 transition count 410
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 25 place count 162 transition count 402
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 156 transition count 390
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 156 transition count 390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 156 transition count 386
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 152 transition count 372
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 152 transition count 372
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 148 transition count 360
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 148 transition count 360
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 61 place count 144 transition count 348
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 144 transition count 348
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 69 place count 140 transition count 334
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 140 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 136 transition count 324
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 136 transition count 324
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 85 place count 132 transition count 316
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 132 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 128 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 128 transition count 308
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 125 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 125 transition count 302
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 106 place count 122 transition count 296
Iterating global reduction 3 with 3 rules applied. Total rules applied 109 place count 122 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 121 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 121 transition count 294
Applied a total of 111 rules in 24 ms. Remains 121 /171 variables (removed 50) and now considering 294/428 (removed 134) transitions.
[2026-05-25 03:18:32] [INFO ] Flow matrix only has 201 transitions (discarded 93 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8465373612269270124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4970822240423585311.kers'
[2026-05-25 03:18:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8465373612269270124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4970822240423585311.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 121 cols 564 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-25 03:18:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4970822240423585311.kers
Total runtime 1 ms.
[2026-05-25 03:18:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 03:18:32] [INFO ] Flow matrix only has 201 transitions (discarded 93 similar events)
[2026-05-25 03:18:32] [INFO ] Invariant cache hit.
[2026-05-25 03:18:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 03:18:32] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-25 03:18:32] [INFO ] Flow matrix only has 201 transitions (discarded 93 similar events)
[2026-05-25 03:18:32] [INFO ] Invariant cache hit.
[2026-05-25 03:18:32] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 201/321 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 45/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/322 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 168 constraints, problems are : Problem set: 0 solved, 292 unsolved in 8127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 201/321 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 45/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 32/199 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/322 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 260/465 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 465 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 38241ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 38242ms
Starting structural reductions in LTL mode, iteration 1 : 121/171 places, 294/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38647 ms. Remains : 121/171 places, 294/428 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(p2)&&X(X(F(!p0))))))'
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p0), (NOT p2), p0, p0]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-04
Stuttering criterion allowed to conclude after 167 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-04 finished in 38867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Graph (complete) has 912 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 160 transition count 408
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 160 transition count 408
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 27 place count 160 transition count 400
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 153 transition count 386
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 153 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 153 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 148 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 143 transition count 350
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 143 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 138 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 80 place count 133 transition count 318
Iterating global reduction 2 with 5 rules applied. Total rules applied 85 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 128 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 123 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 118 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 118 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 119 place count 114 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 114 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 110 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 108 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 108 transition count 260
Applied a total of 139 rules in 73 ms. Remains 108 /171 variables (removed 63) and now considering 260/428 (removed 168) transitions.
[2026-05-25 03:19:11] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5634144633028405965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3222775566075589242.kers'
[2026-05-25 03:19:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5634144633028405965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3222775566075589242.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 177 rows 108 cols 494 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 03:19:11] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3222775566075589242.kers
Total runtime 1 ms.
[2026-05-25 03:19:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 03:19:11] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2026-05-25 03:19:11] [INFO ] Invariant cache hit.
[2026-05-25 03:19:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 03:19:11] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2026-05-25 03:19:11] [INFO ] Redundant transitions in 5 ms returned []
Running 258 sub problems to find dead transitions.
[2026-05-25 03:19:11] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2026-05-25 03:19:11] [INFO ] Invariant cache hit.
[2026-05-25 03:19:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 177/285 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25060ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 25061ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/171 places, 260/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25501 ms. Remains : 108/171 places, 260/428 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-05
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-05 finished in 25561 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(G(p0))))'
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 408
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 160 transition count 402
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 34 place count 152 transition count 386
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 152 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 152 transition count 382
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 52 place count 146 transition count 362
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 140 transition count 344
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 76 place count 134 transition count 326
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 88 place count 128 transition count 304
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 128 transition count 304
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 100 place count 122 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 112 place count 116 transition count 276
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 110 transition count 264
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 135 place count 105 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 140 place count 105 transition count 254
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 145 place count 100 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 150 place count 100 transition count 244
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 98 transition count 240
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 98 transition count 240
Applied a total of 154 rules in 15 ms. Remains 98 /171 variables (removed 73) and now considering 240/428 (removed 188) transitions.
[2026-05-25 03:19:36] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12395658764770679471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12700558685892798229.kers'
[2026-05-25 03:19:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12395658764770679471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12700558685892798229.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 98 cols 444 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 03:19:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12700558685892798229.kers
Total runtime 0 ms.
[2026-05-25 03:19:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 03:19:36] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 03:19:36] [INFO ] Invariant cache hit.
[2026-05-25 03:19:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:19:36] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2026-05-25 03:19:36] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2026-05-25 03:19:36] [INFO ] Invariant cache hit.
[2026-05-25 03:19:36] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 238/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 375 constraints, problems are : Problem set: 0 solved, 238 unsolved in 16078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21399ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 21399ms
Starting structural reductions in LTL mode, iteration 1 : 98/171 places, 240/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21707 ms. Remains : 98/171 places, 240/428 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(G(p0))))'
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-09 finished in 21853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U X(X(G(p2)))))'
Support contains 5 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 408
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 26 place count 160 transition count 402
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 154 transition count 390
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 154 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 148 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 148 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 142 transition count 352
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 142 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 136 transition count 334
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 136 transition count 334
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 130 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 130 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 125 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 120 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 116 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 113 transition count 274
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 110 transition count 268
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 108 transition count 264
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 108 transition count 264
Applied a total of 130 rules in 13 ms. Remains 108 /171 variables (removed 63) and now considering 264/428 (removed 164) transitions.
[2026-05-25 03:19:58] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2106329898661976566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10429239777693498137.kers'
[2026-05-25 03:19:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2106329898661976566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10429239777693498137.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 108 cols 498 entries
Finished phase 1 with 105 SingleSign rule and 1 generalized
[2026-05-25 03:19:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10429239777693498137.kers
Total runtime 1 ms.
[2026-05-25 03:19:58] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 03:19:58] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:19:58] [INFO ] Invariant cache hit.
[2026-05-25 03:19:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 03:19:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-25 03:19:58] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:19:58] [INFO ] Invariant cache hit.
[2026-05-25 03:19:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 180/288 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 180/288 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 262/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 414 constraints, problems are : Problem set: 0 solved, 262 unsolved in 22482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28706ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 28708ms
Starting structural reductions in LTL mode, iteration 1 : 108/171 places, 264/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29051 ms. Remains : 108/171 places, 264/428 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(p1))) U X(X(G(p2)))))'
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-10
Product exploration explored 100000 steps with 33356 reset in 186 ms.
Product exploration explored 100000 steps with 33388 reset in 199 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 14 factoid took 79 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40032 steps (22 resets) in 155 ms. (256 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (22 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
[2026-05-25 03:20:28] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:20:28] [INFO ] Invariant cache hit.
[2026-05-25 03:20:28] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/165 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/223 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/279 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/288 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/165 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/223 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/279 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/288 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/288 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/288 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 264/264 transitions.
Graph (complete) has 440 edges and 108 vertex of which 87 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 87 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 87 transition count 219
Applied a total of 46 rules in 10 ms. Remains 87 /108 variables (removed 21) and now considering 219/264 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 87/108 places, 219/264 transitions.
RANDOM walk for 40000 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31486 steps (6 resets) in 47 ms. (655 steps per ms) remains 0/1 properties
Knowledge based reduction with 14 factoid took 139 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Knowledge-based reduction took 1168 ms.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 264/264 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2026-05-25 03:20:29] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:20:29] [INFO ] Invariant cache hit.
[2026-05-25 03:20:29] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 03:20:29] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:20:29] [INFO ] Invariant cache hit.
[2026-05-25 03:20:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 03:20:29] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 108/108 places, 264/264 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 14 factoid took 60 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40066 steps (27 resets) in 142 ms. (280 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
[2026-05-25 03:20:30] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 03:20:30] [INFO ] Invariant cache hit.
[2026-05-25 03:20:30] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/165 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/223 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 56/279 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/288 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/165 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/223 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 56/279 variables, 26/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 8/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/279 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/288 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/288 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/288 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 264/264 transitions.
Graph (complete) has 440 edges and 108 vertex of which 87 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.0 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 87 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 87 transition count 219
Applied a total of 46 rules in 8 ms. Remains 87 /108 variables (removed 21) and now considering 219/264 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 87/108 places, 219/264 transitions.
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36240 steps (7 resets) in 60 ms. (594 steps per ms) remains 0/1 properties
Knowledge based reduction with 14 factoid took 143 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Knowledge-based reduction took 1154 ms.
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Product exploration explored 100000 steps with 33315 reset in 187 ms.
Product exploration explored 100000 steps with 33381 reset in 181 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12584790470432520399
[2026-05-25 03:20:32] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12584790470432520399
Running compilation step : cd /tmp/ltsmin12584790470432520399;'/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 477 ms.
Running link step : cd /tmp/ltsmin12584790470432520399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12584790470432520399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7735428647755004649.hoa' '--buchi-type=spotba'
LTSmin run took 50 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b064-LTLCardinality-10 finished in 34402 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Graph (complete) has 912 edges and 171 vertex of which 169 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 160 transition count 408
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 160 transition count 408
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 25 place count 160 transition count 402
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 152 transition count 386
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 152 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 152 transition count 382
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 146 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 146 transition count 362
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 140 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 140 transition count 344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 134 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 134 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 128 transition count 304
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 128 transition count 304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 122 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 116 transition count 276
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 123 place count 110 transition count 264
Iterating global reduction 2 with 6 rules applied. Total rules applied 129 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 134 place count 105 transition count 254
Iterating global reduction 2 with 5 rules applied. Total rules applied 139 place count 105 transition count 254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 143 place count 101 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 99 transition count 242
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 99 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 99 transition count 240
Applied a total of 153 rules in 42 ms. Remains 99 /171 variables (removed 72) and now considering 240/428 (removed 188) transitions.
[2026-05-25 03:20:32] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13674701322514042452.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7486025841517386451.kers'
[2026-05-25 03:20:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13674701322514042452.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7486025841517386451.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 163 rows 99 cols 450 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 03:20:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7486025841517386451.kers
Total runtime 1 ms.
[2026-05-25 03:20:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 03:20:32] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2026-05-25 03:20:32] [INFO ] Invariant cache hit.
[2026-05-25 03:20:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 03:20:33] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2026-05-25 03:20:33] [INFO ] Redundant transitions in 3 ms returned []
Running 238 sub problems to find dead transitions.
[2026-05-25 03:20:33] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2026-05-25 03:20:33] [INFO ] Invariant cache hit.
[2026-05-25 03:20:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 238/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 381 constraints, problems are : Problem set: 0 solved, 238 unsolved in 21242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27234ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 27235ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/171 places, 240/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27593 ms. Remains : 99/171 places, 240/428 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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-11
Stuttering criterion allowed to conclude after 386 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-11 finished in 27713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 160 transition count 410
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 160 transition count 410
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 160 transition count 402
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 153 transition count 388
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 153 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 153 transition count 384
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 149 transition count 372
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 149 transition count 372
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 58 place count 145 transition count 360
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 145 transition count 360
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 141 transition count 348
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 141 transition count 348
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 137 transition count 332
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 137 transition count 332
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 82 place count 133 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 133 transition count 320
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 129 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 125 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 125 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 121 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 121 transition count 296
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 114 place count 117 transition count 288
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 117 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 115 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 115 transition count 284
Applied a total of 122 rules in 20 ms. Remains 115 /171 variables (removed 56) and now considering 284/428 (removed 144) transitions.
[2026-05-25 03:21:00] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3913151138433704097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3262084196221375817.kers'
[2026-05-25 03:21:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3913151138433704097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3262084196221375817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 115 cols 536 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 03:21:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3262084196221375817.kers
Total runtime 1 ms.
[2026-05-25 03:21:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 03:21:00] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 03:21:00] [INFO ] Invariant cache hit.
[2026-05-25 03:21:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 03:21:00] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 03:21:00] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 03:21:00] [INFO ] Invariant cache hit.
[2026-05-25 03:21:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/308 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 160 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/308 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 282/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 442 constraints, problems are : Problem set: 0 solved, 282 unsolved in 20231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27332ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 27333ms
Starting structural reductions in LTL mode, iteration 1 : 115/171 places, 284/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27770 ms. Remains : 115/171 places, 284/428 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) U (p1&&G(p0)))))'
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-13
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-13 finished in 27928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 428/428 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 161 transition count 408
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 161 transition count 408
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 27 place count 161 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 154 transition count 386
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 154 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 154 transition count 382
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 149 transition count 364
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 149 transition count 364
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 60 place count 144 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 144 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 70 place count 139 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 75 place count 139 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 135 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 135 transition count 320
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 131 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 131 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 127 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 127 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 123 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 120 transition count 290
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 120 transition count 290
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 116 place count 117 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 117 transition count 284
Applied a total of 119 rules in 20 ms. Remains 117 /171 variables (removed 54) and now considering 284/428 (removed 144) transitions.
[2026-05-25 03:21:28] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5763343776702452430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-377257382475884269.kers'
[2026-05-25 03:21:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5763343776702452430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-377257382475884269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 117 cols 542 entries
Finished phase 1 with 114 SingleSign rule and 1 generalized
[2026-05-25 03:21:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-377257382475884269.kers
Total runtime 1 ms.
[2026-05-25 03:21:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 03:21:28] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
[2026-05-25 03:21:28] [INFO ] Invariant cache hit.
[2026-05-25 03:21:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-25 03:21:28] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 03:21:28] [INFO ] Flow matrix only has 194 transitions (discarded 90 similar events)
[2026-05-25 03:21:28] [INFO ] Invariant cache hit.
[2026-05-25 03:21:28] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 194/310 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/311 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 163 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 194/310 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 32/194 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 250/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 451 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 37612ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 37613ms
Starting structural reductions in LTL mode, iteration 1 : 117/171 places, 284/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37952 ms. Remains : 117/171 places, 284/428 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLCardinality-14
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLCardinality-14 finished in 38098 ms.
All properties solved by simple procedures.
Total runtime 309620 ms.

BK_STOP 1779679326568

--------------------
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="FunctionPointer-PT-b064"
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 FunctionPointer-PT-b064, 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 r146-tall-177961074000099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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