Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CO4-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 336K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CO4-PT-20-LTLFireability-00
FORMULA_NAME CO4-PT-20-LTLFireability-01
FORMULA_NAME CO4-PT-20-LTLFireability-02
FORMULA_NAME CO4-PT-20-LTLFireability-03
FORMULA_NAME CO4-PT-20-LTLFireability-04
FORMULA_NAME CO4-PT-20-LTLFireability-05
FORMULA_NAME CO4-PT-20-LTLFireability-06
FORMULA_NAME CO4-PT-20-LTLFireability-07
FORMULA_NAME CO4-PT-20-LTLFireability-08
FORMULA_NAME CO4-PT-20-LTLFireability-09
FORMULA_NAME CO4-PT-20-LTLFireability-10
FORMULA_NAME CO4-PT-20-LTLFireability-11
FORMULA_NAME CO4-PT-20-LTLFireability-12
FORMULA_NAME CO4-PT-20-LTLFireability-13
FORMULA_NAME CO4-PT-20-LTLFireability-14
FORMULA_NAME CO4-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779527082227

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 09:04:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 09:04:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:04:43] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2026-05-23 09:04:43] [INFO ] Transformed 1178 places.
[2026-05-23 09:04:43] [INFO ] Transformed 1463 transitions.
[2026-05-23 09:04:43] [INFO ] Found NUPN structural information;
[2026-05-23 09:04:43] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
FORMULA CO4-PT-20-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 195 place count 801 transition count 1037
Iterating global reduction 1 with 168 rules applied. Total rules applied 363 place count 801 transition count 1037
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 507 place count 657 transition count 889
Iterating global reduction 1 with 144 rules applied. Total rules applied 651 place count 657 transition count 889
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 659 place count 657 transition count 881
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 730 place count 586 transition count 802
Iterating global reduction 2 with 71 rules applied. Total rules applied 801 place count 586 transition count 802
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 804 place count 586 transition count 799
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 851 place count 539 transition count 750
Iterating global reduction 3 with 47 rules applied. Total rules applied 898 place count 539 transition count 750
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 906 place count 539 transition count 742
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 926 place count 519 transition count 722
Iterating global reduction 4 with 20 rules applied. Total rules applied 946 place count 519 transition count 722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 948 place count 519 transition count 720
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 954 place count 513 transition count 714
Iterating global reduction 5 with 6 rules applied. Total rules applied 960 place count 513 transition count 714
Applied a total of 960 rules in 279 ms. Remains 513 /991 variables (removed 478) and now considering 714/1212 (removed 498) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8927378016492868390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13756088478094327598.kers'
[2026-05-23 09:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8927378016492868390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13756088478094327598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 513 cols 1900 entries
Finished phase 1 with 506 SingleSign rule and 0 generalized
[2026-05-23 09:04:44] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13756088478094327598.kers
Total runtime 4 ms.
[2026-05-23 09:04:44] [INFO ] Implicit Places using invariants in 333 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 512/991 places, 714/1212 transitions.
Applied a total of 0 rules in 9 ms. Remains 512 /512 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 668 ms. Remains : 512/991 places, 714/1212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 714/714 transitions.
Applied a total of 0 rules in 16 ms. Remains 512 /512 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13929563317747137098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1778852731644916574.kers'
[2026-05-23 09:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13929563317747137098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1778852731644916574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 512 cols 1898 entries
Finished phase 1 with 506 SingleSign rule and 0 generalized
[2026-05-23 09:04:44] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1778852731644916574.kers
Total runtime 3 ms.
[2026-05-23 09:04:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 09:04:44] [INFO ] Invariant cache hit.
[2026-05-23 09:04:45] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2026-05-23 09:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD645 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 512/1226 variables, and 10 constraints, problems are : Problem set: 4 solved, 709 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/512 constraints, PredecessorRefiner: 713/713 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 709 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/512 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 4/10 constraints. Problems are: Problem set: 4 solved, 709 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 709 unsolved
At refinement iteration 4 (OVERLAPS) 714/1226 variables, 512/522 constraints. Problems are: Problem set: 4 solved, 709 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1226 variables, 709/1231 constraints. Problems are: Problem set: 4 solved, 709 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1226/1226 variables, and 1232 constraints, problems are : Problem set: 4 solved, 709 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 709/713 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60286ms problems are : Problem set: 4 solved, 709 unsolved
Search for dead transitions found 4 dead transitions in 60300ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 512/512 places, 710/714 transitions.
Applied a total of 0 rules in 8 ms. Remains 512 /512 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60889 ms. Remains : 512/512 places, 710/714 transitions.
Support contains 26 out of 512 places after structural reductions.
[2026-05-23 09:05:45] [INFO ] Flatten gal took : 111 ms
[2026-05-23 09:05:45] [INFO ] Flatten gal took : 37 ms
[2026-05-23 09:05:45] [INFO ] Input system was already deterministic with 710 transitions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (840 resets) in 1969 ms. (20 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40003 steps (146 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (141 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (141 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (137 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (141 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (143 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (143 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (121 resets) in 117 ms. (339 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (142 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (141 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3325069775328673384.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12288350041865563795.kers'
[2026-05-23 09:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3325069775328673384.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12288350041865563795.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 710 rows 512 cols 1874 entries
Finished phase 1 with 506 SingleSign rule and 0 generalized
[2026-05-23 09:05:47] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12288350041865563795.kers
Total runtime 6 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 23/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/57 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 161/218 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 362/580 variables, 117/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 394/974 variables, 192/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/974 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 192/1166 variables, 108/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1166 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 51/1217 variables, 34/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1217 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 15 (OVERLAPS) 5/1222 variables, 4/518 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1222 variables, 0/518 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1222 variables, 0/518 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 518 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3226 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 28/55 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 156/211 variables, 55/61 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 354/565 variables, 114/176 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 8/184 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 389/954 variables, 189/373 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/954 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 196/1150 variables, 109/482 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1150 variables, 0/482 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 56/1206 variables, 35/517 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1206 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 12/1218 variables, 7/524 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1218 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 4/1222 variables, 3/527 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1222 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/1222 variables, 0/527 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1222/1222 variables, and 527 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3096 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 512/512 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6374ms problems are : Problem set: 1 solved, 9 unsolved
Parikh walk visited 6 properties in 662 ms.
Support contains 3 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 710/710 transitions.
Graph (trivial) has 545 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1053 edges and 510 vertex of which 493 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 244 rules applied. Total rules applied 246 place count 493 transition count 449
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 221 rules applied. Total rules applied 467 place count 274 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 468 place count 273 transition count 447
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 468 place count 273 transition count 400
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 562 place count 226 transition count 400
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 565 place count 223 transition count 397
Iterating global reduction 3 with 3 rules applied. Total rules applied 568 place count 223 transition count 397
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 223 transition count 396
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 569 place count 223 transition count 395
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 571 place count 222 transition count 395
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 572 place count 221 transition count 394
Iterating global reduction 4 with 1 rules applied. Total rules applied 573 place count 221 transition count 394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 574 place count 221 transition count 393
Performed 80 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 5 with 160 rules applied. Total rules applied 734 place count 141 transition count 291
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 744 place count 141 transition count 281
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 751 place count 134 transition count 269
Iterating global reduction 6 with 7 rules applied. Total rules applied 758 place count 134 transition count 269
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 759 place count 133 transition count 268
Iterating global reduction 6 with 1 rules applied. Total rules applied 760 place count 133 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 761 place count 133 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 765 place count 131 transition count 265
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 766 place count 131 transition count 264
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 846 place count 91 transition count 305
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 8 with 59 rules applied. Total rules applied 905 place count 91 transition count 246
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 932 place count 64 transition count 165
Iterating global reduction 9 with 27 rules applied. Total rules applied 959 place count 64 transition count 165
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 978 place count 64 transition count 146
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 984 place count 58 transition count 119
Iterating global reduction 10 with 6 rules applied. Total rules applied 990 place count 58 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 995 place count 58 transition count 114
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 1003 place count 58 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1003 place count 58 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1005 place count 57 transition count 105
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1017 place count 57 transition count 93
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 1031 place count 45 transition count 91
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1032 place count 45 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1033 place count 44 transition count 90
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 22 edges and 41 vertex of which 5 / 41 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 4 rules applied. Total rules applied 1037 place count 38 transition count 90
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 24 edges and 37 vertex of which 6 / 37 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 13 with 10 rules applied. Total rules applied 1047 place count 32 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 14 with 17 rules applied. Total rules applied 1064 place count 32 transition count 65
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 1065 place count 31 transition count 62
Iterating global reduction 15 with 1 rules applied. Total rules applied 1066 place count 31 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1067 place count 31 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 16 with 5 rules applied. Total rules applied 1072 place count 31 transition count 56
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1073 place count 30 transition count 54
Iterating global reduction 16 with 1 rules applied. Total rules applied 1074 place count 30 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1075 place count 30 transition count 53
Free-agglomeration rule applied 3 times.
Iterating global reduction 17 with 3 rules applied. Total rules applied 1078 place count 30 transition count 50
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1082 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1084 place count 27 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1085 place count 27 transition count 46
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1088 place count 26 transition count 44
Applied a total of 1088 rules in 215 ms. Remains 26 /512 variables (removed 486) and now considering 44/710 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 26/512 places, 44/710 transitions.
RANDOM walk for 291 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/3 properties
FORMULA CO4-PT-20-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 22 stabilizing places and 38 stable transitions
Graph (complete) has 1056 edges and 512 vertex of which 507 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Graph (trivial) has 540 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1054 edges and 510 vertex of which 505 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 211 place count 504 transition count 492
Reduce places removed 209 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 213 rules applied. Total rules applied 424 place count 295 transition count 488
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 429 place count 293 transition count 485
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 431 place count 291 transition count 485
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 431 place count 291 transition count 437
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 527 place count 243 transition count 437
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 530 place count 240 transition count 434
Iterating global reduction 4 with 3 rules applied. Total rules applied 533 place count 240 transition count 434
Performed 85 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 703 place count 155 transition count 322
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 714 place count 155 transition count 311
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 722 place count 147 transition count 297
Iterating global reduction 5 with 8 rules applied. Total rules applied 730 place count 147 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 731 place count 147 transition count 296
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 813 place count 106 transition count 342
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 833 place count 106 transition count 322
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 860 place count 79 transition count 214
Iterating global reduction 7 with 27 rules applied. Total rules applied 887 place count 79 transition count 214
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 905 place count 79 transition count 196
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 912 place count 72 transition count 158
Iterating global reduction 8 with 7 rules applied. Total rules applied 919 place count 72 transition count 158
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 924 place count 72 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 932 place count 68 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 9 with 38 rules applied. Total rules applied 970 place count 68 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 972 place count 66 transition count 158
Applied a total of 972 rules in 95 ms. Remains 66 /512 variables (removed 446) and now considering 158/710 (removed 552) transitions.
[2026-05-23 09:05:54] [INFO ] Flow matrix only has 136 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15316317546912331329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11111715975105397652.kers'
[2026-05-23 09:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15316317546912331329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11111715975105397652.kers]
Normalized transition count is 135 out of 136 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 66 cols 477 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-23 09:05:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11111715975105397652.kers
Total runtime 5 ms.
[2026-05-23 09:05:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 09:05:54] [INFO ] Flow matrix only has 136 transitions (discarded 22 similar events)
[2026-05-23 09:05:54] [INFO ] Invariant cache hit.
[2026-05-23 09:05:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-23 09:05:54] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2026-05-23 09:05:54] [INFO ] Redundant transitions in 7 ms returned []
Running 144 sub problems to find dead transitions.
[2026-05-23 09:05:54] [INFO ] Flow matrix only has 136 transitions (discarded 22 similar events)
[2026-05-23 09:05:54] [INFO ] Invariant cache hit.
[2026-05-23 09:05:54] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 135/201 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/202 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 87 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 135/201 variables, 66/72 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 144/230 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/202 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 231 constraints, problems are : Problem set: 0 solved, 144 unsolved in 8029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 66/66 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13500ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/512 places, 158/710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13787 ms. Remains : 66/512 places, 158/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA CO4-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-00 finished in 14054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 506 transition count 704
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 506 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 506 transition count 703
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 502 transition count 699
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 499 transition count 696
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 499 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 499 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 498 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 498 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 497 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 496 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 496 transition count 692
Applied a total of 34 rules in 47 ms. Remains 496 /512 variables (removed 16) and now considering 692/710 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14578373032450152338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-356585135350867509.kers'
[2026-05-23 09:06:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14578373032450152338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-356585135350867509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 692 rows 496 cols 1830 entries
Finished phase 1 with 490 SingleSign rule and 0 generalized
[2026-05-23 09:06:08] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-356585135350867509.kers
Total runtime 8 ms.
[2026-05-23 09:06:08] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-23 09:06:08] [INFO ] Invariant cache hit.
[2026-05-23 09:06:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2026-05-23 09:06:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 691 unsolved
SMT process timed out in 30158ms, After SMT, problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 30159ms
Starting structural reductions in LTL mode, iteration 1 : 496/512 places, 692/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30711 ms. Remains : 496/512 places, 692/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-20-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-01 finished in 30834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Graph (trivial) has 550 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1054 edges and 510 vertex of which 505 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 504 transition count 486
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 219 rules applied. Total rules applied 436 place count 289 transition count 482
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 439 place count 287 transition count 481
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 439 place count 287 transition count 434
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 533 place count 240 transition count 434
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 536 place count 237 transition count 431
Iterating global reduction 3 with 3 rules applied. Total rules applied 539 place count 237 transition count 431
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 539 place count 237 transition count 430
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 541 place count 236 transition count 430
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 713 place count 150 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 724 place count 150 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 732 place count 142 transition count 292
Iterating global reduction 4 with 8 rules applied. Total rules applied 740 place count 142 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 741 place count 142 transition count 291
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 823 place count 101 transition count 336
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 844 place count 101 transition count 315
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 871 place count 74 transition count 207
Iterating global reduction 6 with 27 rules applied. Total rules applied 898 place count 74 transition count 207
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 916 place count 74 transition count 189
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 923 place count 67 transition count 151
Iterating global reduction 7 with 7 rules applied. Total rules applied 930 place count 67 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 935 place count 67 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 941 place count 64 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 981 place count 64 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 983 place count 62 transition count 129
Applied a total of 983 rules in 56 ms. Remains 62 /512 variables (removed 450) and now considering 129/710 (removed 581) transitions.
[2026-05-23 09:06:39] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5787021184652430924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14933604908234168639.kers'
[2026-05-23 09:06:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5787021184652430924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14933604908234168639.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 62 cols 347 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-23 09:06:39] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14933604908234168639.kers
Total runtime 1 ms.
[2026-05-23 09:06:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 09:06:39] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
[2026-05-23 09:06:39] [INFO ] Invariant cache hit.
[2026-05-23 09:06:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:06:39] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2026-05-23 09:06:39] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 09:06:39] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
[2026-05-23 09:06:39] [INFO ] Invariant cache hit.
[2026-05-23 09:06:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/173 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/174 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/174 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 70 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2828 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/173 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 106/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/174 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 176 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4456 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7316ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/512 places, 129/710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7522 ms. Remains : 62/512 places, 129/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 582 reset in 138 ms.
Product exploration explored 100000 steps with 109 reset in 67 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 5547 steps (443 resets) in 70 ms. (78 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Knowledge-based reduction took 310 ms.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2026-05-23 09:06:47] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
[2026-05-23 09:06:47] [INFO ] Invariant cache hit.
[2026-05-23 09:06:47] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-23 09:06:47] [INFO ] Flow matrix only has 112 transitions (discarded 17 similar events)
[2026-05-23 09:06:47] [INFO ] Invariant cache hit.
[2026-05-23 09:06:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:06:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-23 09:06:47] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 62/62 places, 129/129 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 5739 steps (469 resets) in 12 ms. (441 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Knowledge-based reduction took 155 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 1489 steps with 121 reset in 2 ms.
FORMULA CO4-PT-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-05 finished in 8625 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((X(p0)&&F(p1)))))'
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 505 transition count 703
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 505 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 505 transition count 702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 501 transition count 698
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 501 transition count 698
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 498 transition count 695
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 498 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 498 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 497 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 496 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 495 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 495 transition count 691
Applied a total of 36 rules in 69 ms. Remains 495 /512 variables (removed 17) and now considering 691/710 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8841746182699509633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18154896626873596394.kers'
[2026-05-23 09:06:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8841746182699509633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18154896626873596394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 691 rows 495 cols 1828 entries
Finished phase 1 with 489 SingleSign rule and 0 generalized
[2026-05-23 09:06:48] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18154896626873596394.kers
Total runtime 2 ms.
[2026-05-23 09:06:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 09:06:48] [INFO ] Invariant cache hit.
[2026-05-23 09:06:48] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2026-05-23 09:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/501 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 501 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/501 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1191 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1192 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 495/512 places, 691/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60744 ms. Remains : 495/512 places, 691/710 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((X(p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-07 finished in 60930 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 1 out of 512 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Graph (trivial) has 549 edges and 512 vertex of which 3 / 512 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1054 edges and 510 vertex of which 505 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 213 rules applied. Total rules applied 215 place count 504 transition count 488
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 217 rules applied. Total rules applied 432 place count 291 transition count 484
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 435 place count 289 transition count 483
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 435 place count 289 transition count 436
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 529 place count 242 transition count 436
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 532 place count 239 transition count 433
Iterating global reduction 3 with 3 rules applied. Total rules applied 535 place count 239 transition count 433
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 535 place count 239 transition count 432
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 537 place count 238 transition count 432
Performed 87 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 711 place count 151 transition count 318
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 722 place count 151 transition count 307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 730 place count 143 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 738 place count 143 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 739 place count 143 transition count 292
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 821 place count 102 transition count 338
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 841 place count 102 transition count 318
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 869 place count 74 transition count 206
Iterating global reduction 6 with 28 rules applied. Total rules applied 897 place count 74 transition count 206
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 915 place count 74 transition count 188
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 922 place count 67 transition count 150
Iterating global reduction 7 with 7 rules applied. Total rules applied 929 place count 67 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 934 place count 67 transition count 145
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 942 place count 63 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 8 with 46 rules applied. Total rules applied 988 place count 63 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 990 place count 61 transition count 138
Applied a total of 990 rules in 96 ms. Remains 61 /512 variables (removed 451) and now considering 138/710 (removed 572) transitions.
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13140417165238639788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3473091361184389918.kers'
[2026-05-23 09:07:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13140417165238639788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3473091361184389918.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 61 cols 340 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-23 09:07:49] [INFO ] Computed 6 invariants in 12 ms
Computed 6 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3473091361184389918.kers
Total runtime 13 ms.
[2026-05-23 09:07:49] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
[2026-05-23 09:07:49] [INFO ] Invariant cache hit.
[2026-05-23 09:07:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 09:07:49] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-23 09:07:49] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-23 09:07:49] [INFO ] Flow matrix only has 110 transitions (discarded 28 similar events)
[2026-05-23 09:07:49] [INFO ] Invariant cache hit.
[2026-05-23 09:07:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/170 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/171 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/171 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 70 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2928 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 109/170 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/171 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/171 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 185 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4797 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7740ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7741ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/512 places, 138/710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7999 ms. Remains : 61/512 places, 138/710 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 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-09 finished in 8096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 506 transition count 704
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 506 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 506 transition count 703
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 502 transition count 699
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 502 transition count 699
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 499 transition count 696
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 499 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 499 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 498 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 498 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 497 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 496 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 496 transition count 692
Applied a total of 34 rules in 68 ms. Remains 496 /512 variables (removed 16) and now considering 692/710 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11905541638829049331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11383170619564432882.kers'
[2026-05-23 09:07:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11905541638829049331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11383170619564432882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 692 rows 496 cols 1834 entries
Finished phase 1 with 490 SingleSign rule and 0 generalized
[2026-05-23 09:07:57] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11383170619564432882.kers
Total runtime 6 ms.
[2026-05-23 09:07:57] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-23 09:07:57] [INFO ] Invariant cache hit.
[2026-05-23 09:07:57] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2026-05-23 09:07:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/502 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 502 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/502 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1188 variables, 691/1193 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 1193 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 496/512 places, 692/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60790 ms. Remains : 496/512 places, 692/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-10
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-10 finished in 60946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||X((F(!p0) U X(p1)))) U X((p2 U p3)))))'
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 507 transition count 705
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 507 transition count 705
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 505 transition count 703
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 505 transition count 703
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 504 transition count 702
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 504 transition count 702
Applied a total of 16 rules in 27 ms. Remains 504 /512 variables (removed 8) and now considering 702/710 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11316955964427926785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1742674910317610007.kers'
[2026-05-23 09:08:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11316955964427926785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1742674910317610007.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 702 rows 504 cols 1850 entries
Finished phase 1 with 498 SingleSign rule and 0 generalized
[2026-05-23 09:08:58] [INFO ] Computed 6 invariants in 7 ms
Computed 6 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1742674910317610007.kers
Total runtime 8 ms.
[2026-05-23 09:08:58] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 09:08:58] [INFO ] Invariant cache hit.
[2026-05-23 09:08:58] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 701 sub problems to find dead transitions.
[2026-05-23 09:08:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/504 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (OVERLAPS) 702/1206 variables, 504/510 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 510 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 1 (OVERLAPS) 1/504 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 4 (OVERLAPS) 702/1206 variables, 504/513 constraints. Problems are: Problem set: 0 solved, 701 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 701/1214 constraints. Problems are: Problem set: 0 solved, 701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 1214 constraints, problems are : Problem set: 0 solved, 701 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 504/504 constraints, PredecessorRefiner: 701/701 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 701 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 504/512 places, 702/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 504/512 places, 702/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||X((F(!p0) U X(p1)))) U X((p2 U p3)))))'
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p3)), p0, (AND p0 (NOT p3))]
Running random walk in product with property : CO4-PT-20-LTLFireability-11
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-11 finished in 61013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 505 transition count 703
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 505 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 505 transition count 702
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 501 transition count 698
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 501 transition count 698
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 498 transition count 695
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 498 transition count 695
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 498 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 497 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 497 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 496 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 496 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 495 transition count 691
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 495 transition count 691
Applied a total of 36 rules in 62 ms. Remains 495 /512 variables (removed 17) and now considering 691/710 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12975584902516921835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13257600830106591740.kers'
[2026-05-23 09:09:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12975584902516921835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13257600830106591740.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 691 rows 495 cols 1828 entries
Finished phase 1 with 489 SingleSign rule and 0 generalized
[2026-05-23 09:09:59] [INFO ] Computed 6 invariants in 6 ms
Computed 6 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13257600830106591740.kers
Total runtime 7 ms.
[2026-05-23 09:09:59] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 09:09:59] [INFO ] Invariant cache hit.
[2026-05-23 09:09:59] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2026-05-23 09:09:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/501 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 501 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/501 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1186 variables, 690/1191 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1192 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 495/512 places, 691/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 495/512 places, 691/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-12 finished in 60732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(p0)) U (X(G(p1))&&F(p2))))&&F(p3))))'
Support contains 4 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 710/710 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 506 transition count 704
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 506 transition count 704
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 506 transition count 703
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 503 transition count 700
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 503 transition count 700
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 501 transition count 698
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 501 transition count 698
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 501 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 500 transition count 696
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 500 transition count 696
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 499 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 499 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 498 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 498 transition count 694
Applied a total of 30 rules in 59 ms. Remains 498 /512 variables (removed 14) and now considering 694/710 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5608073969341133459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13817338936424183065.kers'
[2026-05-23 09:10:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5608073969341133459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13817338936424183065.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 694 rows 498 cols 1838 entries
Finished phase 1 with 492 SingleSign rule and 0 generalized
[2026-05-23 09:10:59] [INFO ] Computed 6 invariants in 7 ms
Computed 6 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13817338936424183065.kers
Total runtime 10 ms.
[2026-05-23 09:11:00] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 09:11:00] [INFO ] Invariant cache hit.
[2026-05-23 09:11:00] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2026-05-23 09:11:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (OVERLAPS) 694/1192 variables, 498/504 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1192/1192 variables, and 504 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (OVERLAPS) 1/498 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/498 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 694/1192 variables, 498/507 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1192 variables, 693/1200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1192/1192 variables, and 1201 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 498/498 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Starting structural reductions in LTL mode, iteration 1 : 498/512 places, 694/710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60645 ms. Remains : 498/512 places, 694/710 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((X(X(p0)) U (X(G(p1))&&F(p2))))&&F(p3))))'
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (NOT p2), (AND p1 (NOT p2)), (NOT p3), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p3) (NOT p0)), false, (AND (NOT p3) (NOT p1) (NOT p0)), false, (AND (NOT p3) (NOT p1) p0)]
Running random walk in product with property : CO4-PT-20-LTLFireability-13
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLFireability-13 finished in 61236 ms.
All properties solved by simple procedures.
Total runtime 437692 ms.

BK_STOP 1779527521096

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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