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

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

=== Now, execution of the tool begins

BK_START 1779679112264

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202604301425
[2026-05-25 03:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 03:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:18:33] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2026-05-25 03:18:33] [INFO ] Transformed 306 places.
[2026-05-25 03:18:33] [INFO ] Transformed 840 transitions.
[2026-05-25 03:18:33] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b064-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 508
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 508
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 94 place count 187 transition count 474
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 108 place count 173 transition count 446
Iterating global reduction 2 with 14 rules applied. Total rules applied 122 place count 173 transition count 446
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 173 transition count 438
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 136 place count 167 transition count 426
Iterating global reduction 3 with 6 rules applied. Total rules applied 142 place count 167 transition count 426
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 148 place count 161 transition count 402
Iterating global reduction 3 with 6 rules applied. Total rules applied 154 place count 161 transition count 402
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 160 place count 155 transition count 390
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 155 transition count 390
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 171 place count 150 transition count 370
Iterating global reduction 3 with 5 rules applied. Total rules applied 176 place count 150 transition count 370
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 146 transition count 354
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 146 transition count 354
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 142 transition count 346
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 138 transition count 338
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 203 place count 135 transition count 332
Iterating global reduction 3 with 3 rules applied. Total rules applied 206 place count 135 transition count 332
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 209 place count 132 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 212 place count 132 transition count 326
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 215 place count 129 transition count 320
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 129 transition count 320
Applied a total of 218 rules in 111 ms. Remains 129 /222 variables (removed 93) and now considering 320/648 (removed 328) transitions.
[2026-05-25 03:18:33] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14742739623162230804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17122485406592964395.kers'
[2026-05-25 03:18:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14742739623162230804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17122485406592964395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 129 cols 606 entries
Finished phase 1 with 126 SingleSign rule and 1 generalized
[2026-05-25 03:18:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17122485406592964395.kers
Total runtime 1 ms.
[2026-05-25 03:18:34] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-25 03:18:34] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
[2026-05-25 03:18:34] [INFO ] Invariant cache hit.
[2026-05-25 03:18:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 03:18:34] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-25 03:18:34] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
[2026-05-25 03:18:34] [INFO ] Invariant cache hit.
[2026-05-25 03:18:34] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 219/348 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 180 constraints, problems are : Problem set: 0 solved, 318 unsolved in 9752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 219/348 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 49/180 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 318/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 318 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 499 constraints, problems are : Problem set: 0 solved, 318 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40045ms problems are : Problem set: 0 solved, 318 unsolved
Search for dead transitions found 0 dead transitions in 40064ms
Starting structural reductions in LTL mode, iteration 1 : 129/222 places, 320/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40911 ms. Remains : 129/222 places, 320/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2026-05-25 03:19:14] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
[2026-05-25 03:19:14] [INFO ] Invariant cache hit.
[2026-05-25 03:19:14] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 03:19:14] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
[2026-05-25 03:19:14] [INFO ] Invariant cache hit.
[2026-05-25 03:19:14] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 03:19:15] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 129/129 places, 320/320 transitions.
Support contains 16 out of 129 places after structural reductions.
[2026-05-25 03:19:15] [INFO ] Flatten gal took : 50 ms
[2026-05-25 03:19:15] [INFO ] Flatten gal took : 30 ms
[2026-05-25 03:19:15] [INFO ] Input system was already deterministic with 320 transitions.
RANDOM walk for 40029 steps (25 resets) in 572 ms. (69 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2026-05-25 03:19:15] [INFO ] Flow matrix only has 219 transitions (discarded 101 similar events)
[2026-05-25 03:19:15] [INFO ] Invariant cache hit.
[2026-05-25 03:19:15] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/307 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/313 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/348 variables, 29/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/348 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/307 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 49/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/313 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/348 variables, 29/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/348 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11148 steps, including 150 resets, run visited all 1 properties in 39 ms. (steps per millisecond=285 )
Parikh walk visited 1 properties in 44 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 304
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 115 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 109 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 109 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 107 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 107 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 105 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 105 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 103 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 100 transition count 242
Applied a total of 62 rules in 24 ms. Remains 100 /129 variables (removed 29) and now considering 242/320 (removed 78) transitions.
[2026-05-25 03:19:16] [INFO ] Flow matrix only has 165 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-699078609167157167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11635005057409701097.kers'
[2026-05-25 03:19:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-699078609167157167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11635005057409701097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 100 cols 458 entries
Finished phase 1 with 97 SingleSign rule and 1 generalized
[2026-05-25 03:19:16] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11635005057409701097.kers
Total runtime 0 ms.
[2026-05-25 03:19:16] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 03:19:16] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2026-05-25 03:19:16] [INFO ] Invariant cache hit.
[2026-05-25 03:19:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 03:19:17] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 03:19:17] [INFO ] Flow matrix only has 165 transitions (discarded 77 similar events)
[2026-05-25 03:19:17] [INFO ] Invariant cache hit.
[2026-05-25 03:19:17] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 141 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5884 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 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/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 165/265 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 240/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 381 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17506 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23473ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 23474ms
Starting structural reductions in LTL mode, iteration 1 : 100/129 places, 242/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23883 ms. Remains : 100/129 places, 242/320 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1553 steps with 17 reset in 22 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-02 finished in 24309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 123 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 119 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 119 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 115 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 115 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 107 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 105 transition count 252
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 105 transition count 252
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 103 transition count 248
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 103 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 101 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 98 transition count 238
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 68 place count 98 transition count 236
Applied a total of 68 rules in 60 ms. Remains 98 /129 variables (removed 31) and now considering 236/320 (removed 84) transitions.
[2026-05-25 03:19:40] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16701325090214765992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17689594615374293173.kers'
[2026-05-25 03:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16701325090214765992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17689594615374293173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 98 cols 446 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 03:19:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17689594615374293173.kers
Total runtime 1 ms.
[2026-05-25 03:19:41] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 03:19:41] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2026-05-25 03:19:41] [INFO ] Invariant cache hit.
[2026-05-25 03:19:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 03:19:41] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2026-05-25 03:19:41] [INFO ] Redundant transitions in 10 ms returned []
Running 234 sub problems to find dead transitions.
[2026-05-25 03:19:41] [INFO ] Flow matrix only has 161 transitions (discarded 75 similar events)
[2026-05-25 03:19:41] [INFO ] Invariant cache hit.
[2026-05-25 03:19:41] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 139 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 161/259 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 234/373 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/259 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 374 constraints, problems are : Problem set: 0 solved, 234 unsolved in 17270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 23024ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 23025ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/129 places, 236/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23455 ms. Remains : 98/129 places, 236/320 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 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-05
Stuttering criterion allowed to conclude after 202 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-05 finished in 23519 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)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 123 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 119 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 119 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 115 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 115 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 106 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 106 transition count 256
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 104 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 102 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 97 transition count 236
Applied a total of 68 rules in 15 ms. Remains 97 /129 variables (removed 32) and now considering 236/320 (removed 84) transitions.
[2026-05-25 03:20:04] [INFO ] Flow matrix only has 159 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-9097545245647911591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6018845852773263247.kers'
[2026-05-25 03:20:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9097545245647911591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6018845852773263247.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 97 cols 440 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 03:20:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-6018845852773263247.kers
Total runtime 13 ms.
[2026-05-25 03:20:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 03:20:04] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 03:20:04] [INFO ] Invariant cache hit.
[2026-05-25 03:20:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 03:20:04] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-25 03:20:04] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 03:20:04] [INFO ] Invariant cache hit.
[2026-05-25 03:20:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 15584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20620ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 20621ms
Starting structural reductions in LTL mode, iteration 1 : 97/129 places, 236/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20985 ms. Remains : 97/129 places, 236/320 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)))'
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-07
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-07 finished in 21077 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)&&F(G(p1)))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 126 transition count 310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 126 transition count 310
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 123 transition count 304
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 123 transition count 304
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 120 transition count 296
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 120 transition count 296
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 118 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 116 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 116 transition count 284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 114 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 114 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 112 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 110 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 108 transition count 264
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 107 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 106 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 106 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 105 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 105 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 105 transition count 254
Applied a total of 52 rules in 42 ms. Remains 105 /129 variables (removed 24) and now considering 254/320 (removed 66) transitions.
[2026-05-25 03:20:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-858855659935656802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2202239354447683227.kers'
[2026-05-25 03:20:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-858855659935656802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2202239354447683227.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 105 cols 476 entries
Finished phase 1 with 102 SingleSign rule and 1 generalized
[2026-05-25 03:20:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2202239354447683227.kers
Total runtime 0 ms.
[2026-05-25 03:20:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 03:20:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 03:20:25] [INFO ] Invariant cache hit.
[2026-05-25 03:20:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 03:20:25] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2026-05-25 03:20:25] [INFO ] Redundant transitions in 13 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 03:20:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 03:20:25] [INFO ] Invariant cache hit.
[2026-05-25 03:20:25] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/277 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 147 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/277 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 252/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/277 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 399 constraints, problems are : Problem set: 0 solved, 252 unsolved in 21882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27712ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 27713ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/129 places, 254/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28084 ms. Remains : 105/129 places, 254/320 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-08
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-08 finished in 28235 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 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 123 transition count 302
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 123 transition count 302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 123 transition count 298
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 119 transition count 290
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 119 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 115 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 115 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 106 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 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 1 with 4 rules applied. Total rules applied 60 place count 103 transition count 246
Applied a total of 60 rules in 40 ms. Remains 103 /129 variables (removed 26) and now considering 246/320 (removed 74) transitions.
[2026-05-25 03:20:53] [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-8199253811256517459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7556046232525479745.kers'
[2026-05-25 03:20:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8199253811256517459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7556046232525479745.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:20:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7556046232525479745.kers
Total runtime 1 ms.
[2026-05-25 03:20:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 03:20:53] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 03:20:53] [INFO ] Invariant cache hit.
[2026-05-25 03:20:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 03:20:54] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2026-05-25 03:20:54] [INFO ] Redundant transitions in 4 ms returned []
Running 244 sub problems to find dead transitions.
[2026-05-25 03:20:54] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 03:20:54] [INFO ] Invariant cache hit.
[2026-05-25 03:20:54] [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 5441 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, 1/390 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 390 constraints, problems are : Problem set: 0 solved, 244 unsolved in 15068 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: 1/1 constraints]
After SMT, in 20589ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 20590ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/129 places, 246/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20913 ms. Remains : 103/129 places, 246/320 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-09
Product exploration explored 100000 steps with 1084 reset in 300 ms.
Stack based approach found an accepted trace after 92796 steps with 1011 reset with depth 69 and stack size 69 in 318 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-09 finished in 21638 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) U X(p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 304
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 304
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 118 transition count 286
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 118 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 116 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 111 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 110 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 109 transition count 266
Applied a total of 44 rules in 9 ms. Remains 109 /129 variables (removed 20) and now considering 266/320 (removed 54) transitions.
[2026-05-25 03:21:15] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13778372990284093377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6281618289236373874.kers'
[2026-05-25 03:21:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13778372990284093377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6281618289236373874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 109 cols 504 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 03:21:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6281618289236373874.kers
Total runtime 1 ms.
[2026-05-25 03:21:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 03:21:15] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2026-05-25 03:21:15] [INFO ] Invariant cache hit.
[2026-05-25 03:21:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 03:21:15] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-25 03:21:15] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2026-05-25 03:21:15] [INFO ] Invariant cache hit.
[2026-05-25 03:21:15] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 152 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 264/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 416 constraints, problems are : Problem set: 0 solved, 264 unsolved in 15037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21629ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 21630ms
Starting structural reductions in LTL mode, iteration 1 : 109/129 places, 266/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21955 ms. Remains : 109/129 places, 266/320 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) U X(p1))))'
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-11
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-11 finished in 22129 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)&&F(G(p1))) U X(!p2)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 320/320 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 124 transition count 308
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 124 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 121 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 118 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 116 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 116 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 114 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 114 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 112 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 106 transition count 258
Applied a total of 54 rules in 19 ms. Remains 106 /129 variables (removed 23) and now considering 258/320 (removed 62) transitions.
[2026-05-25 03:21:37] [INFO ] Flow matrix only has 174 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-12799883916582472213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5575332842117741540.kers'
[2026-05-25 03:21:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12799883916582472213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5575332842117741540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 106 cols 480 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 03:21:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5575332842117741540.kers
Total runtime 1 ms.
[2026-05-25 03:21:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 03:21:37] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2026-05-25 03:21:37] [INFO ] Invariant cache hit.
[2026-05-25 03:21:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 03:21:37] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-25 03:21:37] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2026-05-25 03:21:37] [INFO ] Invariant cache hit.
[2026-05-25 03:21:37] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29397ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 29398ms
Starting structural reductions in LTL mode, iteration 1 : 106/129 places, 258/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29711 ms. Remains : 106/129 places, 258/320 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)&&F(G(p1))) U X(!p2)))'
Stuttering acceptance computed with spot in 196 ms :[p2, (AND (NOT p0) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 185 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 8 factoid took 14 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b064-LTLFireability-13 finished in 30311 ms.
All properties solved by simple procedures.
Total runtime 214389 ms.

BK_STOP 1779679327929

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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